/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 09:55:10,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 09:55:10,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 09:55:10,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 09:55:10,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 09:55:10,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 09:55:10,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 09:55:10,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 09:55:10,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 09:55:10,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 09:55:10,497 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 09:55:10,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 09:55:10,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 09:55:10,498 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 09:55:10,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 09:55:10,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 09:55:10,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 09:55:10,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 09:55:10,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 09:55:10,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 09:55:10,504 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 09:55:10,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 09:55:10,505 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 09:55:10,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 09:55:10,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 09:55:10,509 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 09:55:10,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 09:55:10,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:55:10,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 09:55:10,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 09:55:10,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 09:55:10,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 09:55:10,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 09:55:10,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 09:55:10,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 09:55:10,514 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 09:55:10,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 09:55:10,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 09:55:10,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 09:55:10,888 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 09:55:10,892 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 09:55:10,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2023-08-24 09:55:12,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 09:55:12,181 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 09:55:12,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2023-08-24 09:55:12,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64263cde4/15f4f5792975463e98a94d8c345c65c7/FLAG9a986cc7a [2023-08-24 09:55:12,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64263cde4/15f4f5792975463e98a94d8c345c65c7 [2023-08-24 09:55:12,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 09:55:12,215 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 09:55:12,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 09:55:12,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 09:55:12,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 09:55:12,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335ce31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12, skipping insertion in model container [2023-08-24 09:55:12,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,253 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 09:55:12,435 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2023-08-24 09:55:12,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:55:12,454 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 09:55:12,489 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2023-08-24 09:55:12,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:55:12,501 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:55:12,505 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:55:12,511 INFO L206 MainTranslator]: Completed translation [2023-08-24 09:55:12,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12 WrapperNode [2023-08-24 09:55:12,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 09:55:12,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 09:55:12,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 09:55:12,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 09:55:12,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,568 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 172 [2023-08-24 09:55:12,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 09:55:12,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 09:55:12,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 09:55:12,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 09:55:12,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 09:55:12,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 09:55:12,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 09:55:12,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 09:55:12,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (1/1) ... [2023-08-24 09:55:12,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:55:12,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:55:12,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 09:55:12,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 09:55:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 09:55:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 09:55:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 09:55:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 09:55:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 09:55:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 09:55:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 09:55:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 09:55:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 09:55:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 09:55:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 09:55:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 09:55:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 09:55:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 09:55:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 09:55:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 09:55:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 09:55:12,687 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 09:55:12,794 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 09:55:12,796 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 09:55:13,134 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 09:55:13,214 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 09:55:13,215 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-24 09:55:13,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:55:13 BoogieIcfgContainer [2023-08-24 09:55:13,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 09:55:13,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 09:55:13,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 09:55:13,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 09:55:13,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 09:55:12" (1/3) ... [2023-08-24 09:55:13,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c3eb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:55:13, skipping insertion in model container [2023-08-24 09:55:13,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:55:12" (2/3) ... [2023-08-24 09:55:13,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c3eb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:55:13, skipping insertion in model container [2023-08-24 09:55:13,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:55:13" (3/3) ... [2023-08-24 09:55:13,226 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2023-08-24 09:55:13,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 09:55:13,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 09:55:13,243 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 09:55:13,315 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 09:55:13,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 150 transitions, 324 flow [2023-08-24 09:55:13,448 INFO L124 PetriNetUnfolderBase]: 11/147 cut-off events. [2023-08-24 09:55:13,448 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:55:13,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 11/147 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-24 09:55:13,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 150 transitions, 324 flow [2023-08-24 09:55:13,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 292 flow [2023-08-24 09:55:13,465 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 09:55:13,477 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 137 transitions, 292 flow [2023-08-24 09:55:13,481 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 137 transitions, 292 flow [2023-08-24 09:55:13,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 292 flow [2023-08-24 09:55:13,535 INFO L124 PetriNetUnfolderBase]: 11/137 cut-off events. [2023-08-24 09:55:13,535 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:55:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 11/137 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-24 09:55:13,539 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-08-24 09:55:18,218 INFO L134 LiptonReduction]: Checked pairs total: 2222 [2023-08-24 09:55:18,219 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-24 09:55:18,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 09:55:18,237 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2ba90bb5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 09:55:18,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 09:55:18,243 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 09:55:18,243 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2023-08-24 09:55:18,243 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:55:18,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:18,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:55:18,245 INFO L420 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)] === [2023-08-24 09:55:18,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash -306287357, now seen corresponding path program 1 times [2023-08-24 09:55:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518200986] [2023-08-24 09:55:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518200986] [2023-08-24 09:55:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518200986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:55:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:55:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 09:55:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694701920] [2023-08-24 09:55:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:55:18,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:55:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:18,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:55:18,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 09:55:18,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-24 09:55:18,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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) [2023-08-24 09:55:18,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:18,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-24 09:55:18,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:55:18,805 INFO L124 PetriNetUnfolderBase]: 238/394 cut-off events. [2023-08-24 09:55:18,806 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-24 09:55:18,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 394 events. 238/394 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1530 event pairs, 14 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 687. Up to 129 conditions per place. [2023-08-24 09:55:18,810 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-24 09:55:18,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 230 flow [2023-08-24 09:55:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:55:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:55:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2023-08-24 09:55:18,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811387900355872 [2023-08-24 09:55:18,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2023-08-24 09:55:18,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2023-08-24 09:55:18,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:55:18,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2023-08-24 09:55:18,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 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) [2023-08-24 09:55:18,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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) [2023-08-24 09:55:18,844 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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) [2023-08-24 09:55:18,846 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 5 states and 676 transitions. [2023-08-24 09:55:18,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 230 flow [2023-08-24 09:55:18,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-24 09:55:18,851 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 84 flow [2023-08-24 09:55:18,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-24 09:55:18,855 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-24 09:55:18,855 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 84 flow [2023-08-24 09:55:18,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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) [2023-08-24 09:55:18,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:18,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:55:18,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 09:55:18,857 INFO L420 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)] === [2023-08-24 09:55:18,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2076465825, now seen corresponding path program 2 times [2023-08-24 09:55:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:18,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345612924] [2023-08-24 09:55:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345612924] [2023-08-24 09:55:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345612924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:55:19,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:55:19,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 09:55:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597803783] [2023-08-24 09:55:19,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:55:19,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 09:55:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 09:55:19,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 09:55:19,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-24 09:55:19,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 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) [2023-08-24 09:55:19,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:19,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-24 09:55:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:55:19,579 INFO L124 PetriNetUnfolderBase]: 474/756 cut-off events. [2023-08-24 09:55:19,579 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2023-08-24 09:55:19,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 756 events. 474/756 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2827 event pairs, 37 based on Foata normal form. 20/717 useless extension candidates. Maximal degree in co-relation 658. Up to 278 conditions per place. [2023-08-24 09:55:19,584 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 59 selfloop transitions, 6 changer transitions 4/69 dead transitions. [2023-08-24 09:55:19,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 69 transitions, 318 flow [2023-08-24 09:55:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 09:55:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 09:55:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-24 09:55:19,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45856634468734114 [2023-08-24 09:55:19,588 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-24 09:55:19,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-24 09:55:19,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:55:19,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-24 09:55:19,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 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) [2023-08-24 09:55:19,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 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) [2023-08-24 09:55:19,596 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 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) [2023-08-24 09:55:19,596 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 84 flow. Second operand 7 states and 902 transitions. [2023-08-24 09:55:19,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 69 transitions, 318 flow [2023-08-24 09:55:19,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 09:55:19,598 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 98 flow [2023-08-24 09:55:19,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-24 09:55:19,599 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-08-24 09:55:19,600 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 98 flow [2023-08-24 09:55:19,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 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) [2023-08-24 09:55:19,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:19,600 INFO L208 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] [2023-08-24 09:55:19,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 09:55:19,601 INFO L420 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)] === [2023-08-24 09:55:19,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 756791677, now seen corresponding path program 1 times [2023-08-24 09:55:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466880277] [2023-08-24 09:55:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466880277] [2023-08-24 09:55:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466880277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:55:19,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:55:19,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 09:55:19,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636258746] [2023-08-24 09:55:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:55:19,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 09:55:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:19,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 09:55:19,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 09:55:19,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-24 09:55:19,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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) [2023-08-24 09:55:19,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:19,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-24 09:55:19,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:55:19,820 INFO L124 PetriNetUnfolderBase]: 205/384 cut-off events. [2023-08-24 09:55:19,821 INFO L125 PetriNetUnfolderBase]: For 480/480 co-relation queries the response was YES. [2023-08-24 09:55:19,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 384 events. 205/384 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1442 event pairs, 87 based on Foata normal form. 14/354 useless extension candidates. Maximal degree in co-relation 662. Up to 264 conditions per place. [2023-08-24 09:55:19,823 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 28 selfloop transitions, 2 changer transitions 3/38 dead transitions. [2023-08-24 09:55:19,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 196 flow [2023-08-24 09:55:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 09:55:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 09:55:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-24 09:55:19,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49228944246737844 [2023-08-24 09:55:19,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-24 09:55:19,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-24 09:55:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:55:19,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-24 09:55:19,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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) [2023-08-24 09:55:19,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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) [2023-08-24 09:55:19,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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) [2023-08-24 09:55:19,830 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 98 flow. Second operand 3 states and 415 transitions. [2023-08-24 09:55:19,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 196 flow [2023-08-24 09:55:19,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 174 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-24 09:55:19,832 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 92 flow [2023-08-24 09:55:19,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-08-24 09:55:19,833 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-24 09:55:19,833 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 92 flow [2023-08-24 09:55:19,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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) [2023-08-24 09:55:19,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:19,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:55:19,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 09:55:19,834 INFO L420 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)] === [2023-08-24 09:55:19,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash -794514887, now seen corresponding path program 1 times [2023-08-24 09:55:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325130730] [2023-08-24 09:55:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:55:19,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:19,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325130730] [2023-08-24 09:55:19,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325130730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:55:19,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:55:19,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 09:55:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874608039] [2023-08-24 09:55:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:55:19,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:55:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:55:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 09:55:19,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-24 09:55:19,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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) [2023-08-24 09:55:19,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:19,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-24 09:55:19,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:55:20,036 INFO L124 PetriNetUnfolderBase]: 234/450 cut-off events. [2023-08-24 09:55:20,036 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2023-08-24 09:55:20,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 450 events. 234/450 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1782 event pairs, 187 based on Foata normal form. 10/404 useless extension candidates. Maximal degree in co-relation 746. Up to 330 conditions per place. [2023-08-24 09:55:20,040 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 22 selfloop transitions, 2 changer transitions 12/41 dead transitions. [2023-08-24 09:55:20,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 197 flow [2023-08-24 09:55:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 09:55:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 09:55:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-24 09:55:20,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555160142348754 [2023-08-24 09:55:20,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-24 09:55:20,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-24 09:55:20,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:55:20,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-24 09:55:20,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-08-24 09:55:20,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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) [2023-08-24 09:55:20,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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) [2023-08-24 09:55:20,048 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 92 flow. Second operand 4 states and 512 transitions. [2023-08-24 09:55:20,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 197 flow [2023-08-24 09:55:20,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 09:55:20,053 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 104 flow [2023-08-24 09:55:20,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-24 09:55:20,055 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-08-24 09:55:20,055 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 104 flow [2023-08-24 09:55:20,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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) [2023-08-24 09:55:20,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:20,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:55:20,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 09:55:20,056 INFO L420 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)] === [2023-08-24 09:55:20,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1521864676, now seen corresponding path program 1 times [2023-08-24 09:55:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830691491] [2023-08-24 09:55:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830691491] [2023-08-24 09:55:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830691491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:55:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70624369] [2023-08-24 09:55:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:21,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:55:21,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:55:21,170 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) [2023-08-24 09:55:21,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 09:55:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:21,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-24 09:55:21,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:55:21,454 INFO L351 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 11 treesize of output 7 [2023-08-24 09:55:21,540 INFO L351 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 6 treesize of output 5 [2023-08-24 09:55:21,700 INFO L351 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 6 treesize of output 5 [2023-08-24 09:55:21,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:55:21,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 09:55:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:22,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:55:22,555 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:22,556 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-08-24 09:55:22,570 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:22,570 INFO L351 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 484 treesize of output 460 [2023-08-24 09:55:22,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2023-08-24 09:55:22,604 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:22,605 INFO L351 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 126 treesize of output 122 [2023-08-24 09:55:22,622 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:22,622 INFO L351 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 125 treesize of output 109 [2023-08-24 09:55:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70624369] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:55:23,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:55:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2023-08-24 09:55:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244525585] [2023-08-24 09:55:23,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:55:23,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 09:55:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 09:55:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1031, Unknown=8, NotChecked=0, Total=1190 [2023-08-24 09:55:23,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 281 [2023-08-24 09:55:23,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 104 flow. Second operand has 35 states, 35 states have (on average 73.8) internal successors, (2583), 35 states have internal predecessors, (2583), 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) [2023-08-24 09:55:23,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:23,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 281 [2023-08-24 09:55:23,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:55:25,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:55:27,326 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1)))) is different from false [2023-08-24 09:55:28,298 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1)))) is different from false [2023-08-24 09:55:30,600 INFO L124 PetriNetUnfolderBase]: 2082/3369 cut-off events. [2023-08-24 09:55:30,600 INFO L125 PetriNetUnfolderBase]: For 1555/1555 co-relation queries the response was YES. [2023-08-24 09:55:30,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8878 conditions, 3369 events. 2082/3369 cut-off events. For 1555/1555 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17730 event pairs, 80 based on Foata normal form. 33/3044 useless extension candidates. Maximal degree in co-relation 8861. Up to 725 conditions per place. [2023-08-24 09:55:30,617 INFO L140 encePairwiseOnDemand]: 264/281 looper letters, 332 selfloop transitions, 134 changer transitions 68/534 dead transitions. [2023-08-24 09:55:30,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 534 transitions, 2655 flow [2023-08-24 09:55:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-08-24 09:55:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2023-08-24 09:55:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 5713 transitions. [2023-08-24 09:55:30,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28237445630684066 [2023-08-24 09:55:30,636 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 5713 transitions. [2023-08-24 09:55:30,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 5713 transitions. [2023-08-24 09:55:30,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:55:30,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 5713 transitions. [2023-08-24 09:55:30,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 79.34722222222223) internal successors, (5713), 72 states have internal predecessors, (5713), 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) [2023-08-24 09:55:30,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 281.0) internal successors, (20513), 73 states have internal predecessors, (20513), 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) [2023-08-24 09:55:30,687 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 281.0) internal successors, (20513), 73 states have internal predecessors, (20513), 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) [2023-08-24 09:55:30,688 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 104 flow. Second operand 72 states and 5713 transitions. [2023-08-24 09:55:30,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 534 transitions, 2655 flow [2023-08-24 09:55:30,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 534 transitions, 2627 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-24 09:55:30,700 INFO L231 Difference]: Finished difference. Result has 146 places, 176 transitions, 1243 flow [2023-08-24 09:55:30,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=1243, PETRI_PLACES=146, PETRI_TRANSITIONS=176} [2023-08-24 09:55:30,701 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2023-08-24 09:55:30,701 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 1243 flow [2023-08-24 09:55:30,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 73.8) internal successors, (2583), 35 states have internal predecessors, (2583), 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) [2023-08-24 09:55:30,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:30,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:55:30,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 09:55:30,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:55:30,909 INFO L420 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)] === [2023-08-24 09:55:30,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash -317432546, now seen corresponding path program 2 times [2023-08-24 09:55:30,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:30,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005947248] [2023-08-24 09:55:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005947248] [2023-08-24 09:55:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005947248] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:55:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758626571] [2023-08-24 09:55:31,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:55:31,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:55:31,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:55:31,925 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) [2023-08-24 09:55:31,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 09:55:32,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:55:32,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:55:32,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-24 09:55:32,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:55:32,116 INFO L351 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 11 treesize of output 7 [2023-08-24 09:55:32,173 INFO L351 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 6 treesize of output 5 [2023-08-24 09:55:32,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:55:32,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 09:55:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:55:32,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 09:55:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:32,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:55:33,349 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:33,349 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2023-08-24 09:55:33,362 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:33,362 INFO L351 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 192 treesize of output 184 [2023-08-24 09:55:33,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2023-08-24 09:55:33,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2023-08-24 09:55:33,395 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:33,395 INFO L351 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 85 treesize of output 81 [2023-08-24 09:55:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:33,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758626571] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:55:33,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:55:33,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2023-08-24 09:55:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291229320] [2023-08-24 09:55:33,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:55:33,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 09:55:33,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:33,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 09:55:33,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1025, Unknown=7, NotChecked=0, Total=1190 [2023-08-24 09:55:33,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 281 [2023-08-24 09:55:33,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 176 transitions, 1243 flow. Second operand has 35 states, 35 states have (on average 74.02857142857142) internal successors, (2591), 35 states have internal predecessors, (2591), 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) [2023-08-24 09:55:33,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:33,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 281 [2023-08-24 09:55:33,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:55:40,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:55:42,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:55:44,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:55:46,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:55:52,878 INFO L124 PetriNetUnfolderBase]: 2299/3770 cut-off events. [2023-08-24 09:55:52,879 INFO L125 PetriNetUnfolderBase]: For 87597/87597 co-relation queries the response was YES. [2023-08-24 09:55:52,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26606 conditions, 3770 events. 2299/3770 cut-off events. For 87597/87597 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 20431 event pairs, 188 based on Foata normal form. 48/3817 useless extension candidates. Maximal degree in co-relation 23951. Up to 1525 conditions per place. [2023-08-24 09:55:52,928 INFO L140 encePairwiseOnDemand]: 265/281 looper letters, 258 selfloop transitions, 113 changer transitions 48/419 dead transitions. [2023-08-24 09:55:52,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 419 transitions, 4812 flow [2023-08-24 09:55:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-24 09:55:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-24 09:55:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3227 transitions. [2023-08-24 09:55:52,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28009721378352576 [2023-08-24 09:55:52,940 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3227 transitions. [2023-08-24 09:55:52,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3227 transitions. [2023-08-24 09:55:52,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:55:52,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3227 transitions. [2023-08-24 09:55:52,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 78.70731707317073) internal successors, (3227), 41 states have internal predecessors, (3227), 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) [2023-08-24 09:55:52,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 281.0) internal successors, (11802), 42 states have internal predecessors, (11802), 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) [2023-08-24 09:55:52,968 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 281.0) internal successors, (11802), 42 states have internal predecessors, (11802), 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) [2023-08-24 09:55:52,968 INFO L175 Difference]: Start difference. First operand has 146 places, 176 transitions, 1243 flow. Second operand 41 states and 3227 transitions. [2023-08-24 09:55:52,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 419 transitions, 4812 flow [2023-08-24 09:55:53,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 419 transitions, 4688 flow, removed 52 selfloop flow, removed 5 redundant places. [2023-08-24 09:55:53,088 INFO L231 Difference]: Finished difference. Result has 190 places, 207 transitions, 1862 flow [2023-08-24 09:55:53,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1862, PETRI_PLACES=190, PETRI_TRANSITIONS=207} [2023-08-24 09:55:53,094 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2023-08-24 09:55:53,095 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 207 transitions, 1862 flow [2023-08-24 09:55:53,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 74.02857142857142) internal successors, (2591), 35 states have internal predecessors, (2591), 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) [2023-08-24 09:55:53,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:53,096 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:55:53,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 09:55:53,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 09:55:53,302 INFO L420 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)] === [2023-08-24 09:55:53,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash 919304149, now seen corresponding path program 3 times [2023-08-24 09:55:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:53,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938687547] [2023-08-24 09:55:53,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:53,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938687547] [2023-08-24 09:55:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938687547] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:55:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659403750] [2023-08-24 09:55:54,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:55:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:55:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:55:54,261 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) [2023-08-24 09:55:54,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 09:55:54,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:55:54,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:55:54,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-24 09:55:54,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:55:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:55:54,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:55:54,749 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:54,750 INFO L351 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 28 treesize of output 20 [2023-08-24 09:55:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:55:54,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659403750] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:55:54,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:55:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 27 [2023-08-24 09:55:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173897692] [2023-08-24 09:55:54,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:55:54,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 09:55:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:54,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 09:55:54,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2023-08-24 09:55:54,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 281 [2023-08-24 09:55:54,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 207 transitions, 1862 flow. Second operand has 28 states, 28 states have (on average 84.53571428571429) internal successors, (2367), 28 states have internal predecessors, (2367), 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) [2023-08-24 09:55:54,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:54,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 281 [2023-08-24 09:55:54,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:55:57,161 INFO L124 PetriNetUnfolderBase]: 3097/5038 cut-off events. [2023-08-24 09:55:57,161 INFO L125 PetriNetUnfolderBase]: For 151367/151367 co-relation queries the response was YES. [2023-08-24 09:55:57,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40031 conditions, 5038 events. 3097/5038 cut-off events. For 151367/151367 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29480 event pairs, 270 based on Foata normal form. 16/5053 useless extension candidates. Maximal degree in co-relation 37016. Up to 2037 conditions per place. [2023-08-24 09:55:57,223 INFO L140 encePairwiseOnDemand]: 265/281 looper letters, 273 selfloop transitions, 199 changer transitions 26/498 dead transitions. [2023-08-24 09:55:57,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 498 transitions, 6093 flow [2023-08-24 09:55:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 09:55:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 09:55:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2668 transitions. [2023-08-24 09:55:57,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31648873072360617 [2023-08-24 09:55:57,228 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2668 transitions. [2023-08-24 09:55:57,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2668 transitions. [2023-08-24 09:55:57,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:55:57,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2668 transitions. [2023-08-24 09:55:57,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 88.93333333333334) internal successors, (2668), 30 states have internal predecessors, (2668), 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) [2023-08-24 09:55:57,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 281.0) internal successors, (8711), 31 states have internal predecessors, (8711), 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) [2023-08-24 09:55:57,242 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 281.0) internal successors, (8711), 31 states have internal predecessors, (8711), 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) [2023-08-24 09:55:57,242 INFO L175 Difference]: Start difference. First operand has 190 places, 207 transitions, 1862 flow. Second operand 30 states and 2668 transitions. [2023-08-24 09:55:57,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 498 transitions, 6093 flow [2023-08-24 09:55:57,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 498 transitions, 5862 flow, removed 46 selfloop flow, removed 20 redundant places. [2023-08-24 09:55:57,462 INFO L231 Difference]: Finished difference. Result has 207 places, 298 transitions, 3325 flow [2023-08-24 09:55:57,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3325, PETRI_PLACES=207, PETRI_TRANSITIONS=298} [2023-08-24 09:55:57,463 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2023-08-24 09:55:57,463 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 298 transitions, 3325 flow [2023-08-24 09:55:57,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 84.53571428571429) internal successors, (2367), 28 states have internal predecessors, (2367), 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) [2023-08-24 09:55:57,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:55:57,464 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:55:57,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 09:55:57,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:55:57,669 INFO L420 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)] === [2023-08-24 09:55:57,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:55:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash -100704799, now seen corresponding path program 4 times [2023-08-24 09:55:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:55:57,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786456022] [2023-08-24 09:55:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:55:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:55:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:55:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:55:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:55:58,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786456022] [2023-08-24 09:55:58,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786456022] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:55:58,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200578433] [2023-08-24 09:55:58,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:55:58,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:55:58,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:55:58,640 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) [2023-08-24 09:55:58,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 09:55:58,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:55:58,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:55:58,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-24 09:55:58,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:55:59,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:55:59,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 09:55:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:55:59,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:55:59,390 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_275 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_275) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) (+ c_~W~0 1)))) is different from false [2023-08-24 09:55:59,413 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:55:59,413 INFO L351 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 50 treesize of output 42 [2023-08-24 09:55:59,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-24 09:55:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-08-24 09:55:59,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200578433] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:55:59,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:55:59,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2023-08-24 09:55:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143796189] [2023-08-24 09:55:59,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:55:59,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 09:55:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:55:59,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 09:55:59,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=862, Unknown=1, NotChecked=60, Total=1056 [2023-08-24 09:55:59,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 281 [2023-08-24 09:55:59,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 298 transitions, 3325 flow. Second operand has 33 states, 33 states have (on average 80.33333333333333) internal successors, (2651), 33 states have internal predecessors, (2651), 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) [2023-08-24 09:55:59,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:55:59,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 281 [2023-08-24 09:55:59,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:56:02,515 INFO L124 PetriNetUnfolderBase]: 3966/6457 cut-off events. [2023-08-24 09:56:02,515 INFO L125 PetriNetUnfolderBase]: For 281591/281591 co-relation queries the response was YES. [2023-08-24 09:56:02,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58387 conditions, 6457 events. 3966/6457 cut-off events. For 281591/281591 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 39622 event pairs, 354 based on Foata normal form. 16/6473 useless extension candidates. Maximal degree in co-relation 54471. Up to 2232 conditions per place. [2023-08-24 09:56:02,604 INFO L140 encePairwiseOnDemand]: 267/281 looper letters, 306 selfloop transitions, 233 changer transitions 14/553 dead transitions. [2023-08-24 09:56:02,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 553 transitions, 7769 flow [2023-08-24 09:56:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-24 09:56:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-24 09:56:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2710 transitions. [2023-08-24 09:56:02,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3013790035587189 [2023-08-24 09:56:02,608 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2710 transitions. [2023-08-24 09:56:02,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2710 transitions. [2023-08-24 09:56:02,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:56:02,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2710 transitions. [2023-08-24 09:56:02,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 84.6875) internal successors, (2710), 32 states have internal predecessors, (2710), 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) [2023-08-24 09:56:02,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 281.0) internal successors, (9273), 33 states have internal predecessors, (9273), 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) [2023-08-24 09:56:02,627 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 281.0) internal successors, (9273), 33 states have internal predecessors, (9273), 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) [2023-08-24 09:56:02,627 INFO L175 Difference]: Start difference. First operand has 207 places, 298 transitions, 3325 flow. Second operand 32 states and 2710 transitions. [2023-08-24 09:56:02,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 553 transitions, 7769 flow [2023-08-24 09:56:03,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 553 transitions, 7400 flow, removed 107 selfloop flow, removed 8 redundant places. [2023-08-24 09:56:03,036 INFO L231 Difference]: Finished difference. Result has 233 places, 356 transitions, 4299 flow [2023-08-24 09:56:03,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=3035, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4299, PETRI_PLACES=233, PETRI_TRANSITIONS=356} [2023-08-24 09:56:03,037 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 201 predicate places. [2023-08-24 09:56:03,037 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 356 transitions, 4299 flow [2023-08-24 09:56:03,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 80.33333333333333) internal successors, (2651), 33 states have internal predecessors, (2651), 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) [2023-08-24 09:56:03,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:56:03,038 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:56:03,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 09:56:03,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:56:03,241 INFO L420 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)] === [2023-08-24 09:56:03,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:56:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash -346914239, now seen corresponding path program 5 times [2023-08-24 09:56:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:56:03,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688624294] [2023-08-24 09:56:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:56:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:56:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:56:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:56:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:56:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688624294] [2023-08-24 09:56:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688624294] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:56:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622791064] [2023-08-24 09:56:05,019 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:56:05,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:56:05,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:56:05,021 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) [2023-08-24 09:56:05,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 09:56:05,247 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-24 09:56:05,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:56:05,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 09:56:05,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:56:05,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:56:05,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 09:56:05,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:56:05,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 09:56:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:56:05,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:56:06,175 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_333 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) (= (mod c_~v_assert~0 256) 0)) is different from false [2023-08-24 09:56:06,282 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:56:06,282 INFO L351 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 190 treesize of output 174 [2023-08-24 09:56:06,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-08-24 09:56:06,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-08-24 09:56:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 09:56:06,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622791064] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:56:06,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:56:06,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 40 [2023-08-24 09:56:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126689334] [2023-08-24 09:56:06,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:56:06,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-24 09:56:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:56:06,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-24 09:56:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1380, Unknown=8, NotChecked=76, Total=1640 [2023-08-24 09:56:06,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 281 [2023-08-24 09:56:06,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 356 transitions, 4299 flow. Second operand has 41 states, 41 states have (on average 76.78048780487805) internal successors, (3148), 41 states have internal predecessors, (3148), 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) [2023-08-24 09:56:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:56:06,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 281 [2023-08-24 09:56:06,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:56:18,074 WARN L234 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 55 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:56:18,079 INFO L124 PetriNetUnfolderBase]: 4209/6885 cut-off events. [2023-08-24 09:56:18,079 INFO L125 PetriNetUnfolderBase]: For 309241/309241 co-relation queries the response was YES. [2023-08-24 09:56:18,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63960 conditions, 6885 events. 4209/6885 cut-off events. For 309241/309241 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 42891 event pairs, 247 based on Foata normal form. 16/6901 useless extension candidates. Maximal degree in co-relation 63795. Up to 2219 conditions per place. [2023-08-24 09:56:18,153 INFO L140 encePairwiseOnDemand]: 268/281 looper letters, 257 selfloop transitions, 265 changer transitions 7/529 dead transitions. [2023-08-24 09:56:18,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 529 transitions, 7838 flow [2023-08-24 09:56:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-24 09:56:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-24 09:56:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2595 transitions. [2023-08-24 09:56:18,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28858985765124556 [2023-08-24 09:56:18,158 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2595 transitions. [2023-08-24 09:56:18,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2595 transitions. [2023-08-24 09:56:18,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:56:18,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2595 transitions. [2023-08-24 09:56:18,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 81.09375) internal successors, (2595), 32 states have internal predecessors, (2595), 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) [2023-08-24 09:56:18,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 281.0) internal successors, (9273), 33 states have internal predecessors, (9273), 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) [2023-08-24 09:56:18,171 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 281.0) internal successors, (9273), 33 states have internal predecessors, (9273), 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) [2023-08-24 09:56:18,172 INFO L175 Difference]: Start difference. First operand has 233 places, 356 transitions, 4299 flow. Second operand 32 states and 2595 transitions. [2023-08-24 09:56:18,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 529 transitions, 7838 flow [2023-08-24 09:56:18,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 529 transitions, 7534 flow, removed 43 selfloop flow, removed 20 redundant places. [2023-08-24 09:56:18,653 INFO L231 Difference]: Finished difference. Result has 246 places, 380 transitions, 4923 flow [2023-08-24 09:56:18,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=4048, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4923, PETRI_PLACES=246, PETRI_TRANSITIONS=380} [2023-08-24 09:56:18,654 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2023-08-24 09:56:18,654 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 380 transitions, 4923 flow [2023-08-24 09:56:18,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 76.78048780487805) internal successors, (3148), 41 states have internal predecessors, (3148), 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) [2023-08-24 09:56:18,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:56:18,656 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:56:18,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 09:56:18,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:56:18,861 INFO L420 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)] === [2023-08-24 09:56:18,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:56:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1771414172, now seen corresponding path program 6 times [2023-08-24 09:56:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:56:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067719585] [2023-08-24 09:56:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:56:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:56:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:56:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:56:18,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:56:18,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067719585] [2023-08-24 09:56:18,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067719585] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:56:18,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252384828] [2023-08-24 09:56:18,974 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:56:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:56:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:56:18,976 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) [2023-08-24 09:56:18,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 09:56:19,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 09:56:19,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:56:19,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 09:56:19,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:56:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:56:19,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:56:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:56:19,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252384828] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:56:19,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:56:19,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 13 [2023-08-24 09:56:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427116579] [2023-08-24 09:56:19,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:56:19,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 09:56:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:56:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 09:56:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-24 09:56:19,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 281 [2023-08-24 09:56:19,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 380 transitions, 4923 flow. Second operand has 14 states, 14 states have (on average 119.07142857142857) internal successors, (1667), 14 states have internal predecessors, (1667), 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) [2023-08-24 09:56:19,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:56:19,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 281 [2023-08-24 09:56:19,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:56:21,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), 90#L110-3true, Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 1537#true, Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 12#L48-4true, 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,124 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 09:56:21,124 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 09:56:21,124 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 09:56:21,124 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 09:56:21,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), 90#L110-3true, Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 1537#true, Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), 92#thread1EXITtrue, Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,252 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 09:56:21,252 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 09:56:21,252 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 09:56:21,252 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 09:56:21,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), 30#L110-4true, Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), 1537#true, Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 12#L48-4true, 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), 70#$Ultimate##0true, Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,256 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 09:56:21,256 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 09:56:21,256 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 09:56:21,256 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 09:56:21,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), 30#L110-4true, Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), 1537#true, Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), 92#thread1EXITtrue, Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), 70#$Ultimate##0true, Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,345 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 09:56:21,345 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 09:56:21,345 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 09:56:21,345 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 09:56:21,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), 124#L111-1true, Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 1537#true, Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 12#L48-4true, 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), 70#$Ultimate##0true, Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,349 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 09:56:21,349 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 09:56:21,349 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 09:56:21,350 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 09:56:21,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 124#L111-1true, Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 1537#true, Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), 92#thread1EXITtrue, Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), 70#$Ultimate##0true, Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,500 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-24 09:56:21,500 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 09:56:21,500 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 09:56:21,500 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 09:56:21,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 1537#true, Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), 110#L111-2true, 70#$Ultimate##0true, Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,549 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-24 09:56:21,549 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-24 09:56:21,549 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 09:56:21,549 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-24 09:56:21,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L81-->L75: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_13| 256) 0)) (= |v_thread2Thread1of1ForFork0_~temp~0#1_11| (select (select |v_#memory_int_48| v_~queue~0.base_27) (+ (* v_~front~0_35 4) v_~queue~0.offset_27))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_35 v_~n~0_28) (<= 0 v_~front~0_35) (< v_~front~0_35 v_~back~0_44)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_34 (+ v_~front~0_35 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0))) InVars {~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_35} OutVars{thread2Thread1of1ForFork0_~temp~0#1=|v_thread2Thread1of1ForFork0_~temp~0#1_11|, ~queue~0.offset=v_~queue~0.offset_27, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_5|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_5|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_48|, ~back~0=v_~back~0_44, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_28, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~temp~0#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~front~0][446], [Black: 375#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 988#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 439#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 984#(and (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 1016#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0)), Black: 399#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 191#true, Black: 996#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (or (<= ~n~0 2) (<= ~back~0 1))), Black: 443#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1008#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 383#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= ~n~0 1)), Black: 343#(or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)), Black: 990#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (and (= (select (select |#memory_int| ~queue~0.base) 0) 1) (< 0 (+ ~front~0 1))) (< 0 ~front~0)) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (and (= (select (select |#memory_int| ~queue~0.base) 4) 1) (<= ~front~0 1)) (<= ~front~0 0))), Black: 435#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 417#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 268#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 427#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), 118#L75true, Black: 749#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 475#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 391#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 0 ~W~0) (= ~queue~0.offset 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~n~0 1)), Black: 533#true, Black: 449#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 767#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 763#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 389#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 431#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 733#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 755#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (< ~front~0 ~n~0) (<= ~n~0 1)), Black: 401#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (= ~back~0 0)) (and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~front~0 0))) (or (= ~front~0 0) (and (< 0 (+ ~front~0 1)) (<= (+ ~front~0 ~n~0) 1))))) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (= ~queue~0.offset 0) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0)), Black: 769#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 441#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 775#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 453#(and (< 0 (mod ~v_assert~0 256)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))), Black: 645#(or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 759#(and (or (not (= ~front~0 0)) (<= ~n~0 1) (<= ~back~0 0)) (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= ~front~0 0)) (or (not (= ~front~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (not (= ~back~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< 0 (+ ~front~0 1)) (<= ~back~0 ~front~0)) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n~0 ~back~0)) (<= 1 ~W~0) (= |thread2Thread1of1ForFork0_~temp~0#1| 1)), Black: 545#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 1537#true, Black: 771#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), 1010#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= 1 ~W~0)), Black: 753#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (forall ((v_ArrVal_178 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 155#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 477#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 173#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 ~W~0)), Black: 181#(or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 616#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 1256#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 1) (<= (div |thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 ~W~0)), 1523#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 1) (<= 1 ~W~0)), 75#L112-1true, 70#$Ultimate##0true, Black: 201#(<= ~d~0 ~W~0), Black: 308#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 397#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| 0) (<= ~n~0 ~back~0) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))))) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 323#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 319#(< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1)), Black: 407#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 385#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 479#(and (< 0 (mod ~v_assert~0 256)) (<= ~d~0 ~W~0)), Black: 467#(and (<= ~d~0 ~W~0) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 459#(and (< 0 (mod ~v_assert~0 256)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 455#(and (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (< (+ ~d~0 |thread2Thread1of1ForFork0_~temp~0#1|) (+ ~W~0 1))), Black: 1252#(and (= ~d~0 0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 421#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~back~0))), Black: 1263#(and (= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (<= ~d~0 0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~W~0)), Black: 423#(and (<= 1 |thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 379#(and (or (< ~back~0 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~back~0 ~front~0) (< ~d~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (< ~back~0 0) (<= ~n~0 ~back~0) (< ~W~0 1) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ ~d~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)))))), Black: 393#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (< ~back~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0)) (< 0 (+ ~front~0 1)) (= ~queue~0.offset 0) (= (select (select |#memory_int| ~queue~0.base) (* ~front~0 4)) 1) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n~0 1) (<= ~back~0 0)) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0) (<= 1 ~W~0) (<= ~front~0 0)), Black: 1006#(and (= |thread2Thread1of1ForFork0_~cond~1#1| ~v_assert~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= |thread1Thread1of1ForFork2_~w~0#1| ~W~0)), Black: 1491#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= ~back~0 2) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ ~back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~queue~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 333#(forall ((v_ArrVal_129 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))), Black: 1002#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~d~0 0) (<= 1 ~W~0))]) [2023-08-24 09:56:21,584 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-24 09:56:21,585 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-24 09:56:21,585 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-24 09:56:21,585 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 09:56:21,683 INFO L124 PetriNetUnfolderBase]: 5021/9110 cut-off events. [2023-08-24 09:56:21,684 INFO L125 PetriNetUnfolderBase]: For 420930/422175 co-relation queries the response was YES. [2023-08-24 09:56:21,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87192 conditions, 9110 events. 5021/9110 cut-off events. For 420930/422175 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 69511 event pairs, 1011 based on Foata normal form. 522/9473 useless extension candidates. Maximal degree in co-relation 87060. Up to 3387 conditions per place. [2023-08-24 09:56:21,791 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 256 selfloop transitions, 81 changer transitions 124/512 dead transitions. [2023-08-24 09:56:21,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 512 transitions, 7637 flow [2023-08-24 09:56:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 09:56:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 09:56:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1126 transitions. [2023-08-24 09:56:21,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44523527085804665 [2023-08-24 09:56:21,794 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1126 transitions. [2023-08-24 09:56:21,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1126 transitions. [2023-08-24 09:56:21,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:56:21,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1126 transitions. [2023-08-24 09:56:21,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.11111111111111) internal successors, (1126), 9 states have internal predecessors, (1126), 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) [2023-08-24 09:56:21,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 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) [2023-08-24 09:56:21,798 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 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) [2023-08-24 09:56:21,798 INFO L175 Difference]: Start difference. First operand has 246 places, 380 transitions, 4923 flow. Second operand 9 states and 1126 transitions. [2023-08-24 09:56:21,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 512 transitions, 7637 flow [2023-08-24 09:56:22,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 512 transitions, 7267 flow, removed 46 selfloop flow, removed 13 redundant places. [2023-08-24 09:56:22,412 INFO L231 Difference]: Finished difference. Result has 244 places, 322 transitions, 4286 flow [2023-08-24 09:56:22,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=4546, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4286, PETRI_PLACES=244, PETRI_TRANSITIONS=322} [2023-08-24 09:56:22,413 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 212 predicate places. [2023-08-24 09:56:22,413 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 322 transitions, 4286 flow [2023-08-24 09:56:22,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 119.07142857142857) internal successors, (1667), 14 states have internal predecessors, (1667), 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) [2023-08-24 09:56:22,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:56:22,413 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:56:22,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 09:56:22,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:56:22,620 INFO L420 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)] === [2023-08-24 09:56:22,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:56:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1183762863, now seen corresponding path program 7 times [2023-08-24 09:56:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:56:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383973311] [2023-08-24 09:56:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:56:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:56:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:56:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:56:23,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:56:23,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383973311] [2023-08-24 09:56:23,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383973311] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:56:23,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700710060] [2023-08-24 09:56:23,990 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:56:23,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:56:23,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:56:23,997 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) [2023-08-24 09:56:24,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 09:56:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:56:24,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-24 09:56:24,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:56:24,263 INFO L351 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 11 [2023-08-24 09:56:24,360 INFO L351 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 6 treesize of output 5 [2023-08-24 09:56:24,532 INFO L351 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 6 treesize of output 5 [2023-08-24 09:56:24,642 INFO L351 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 6 treesize of output 5 [2023-08-24 09:56:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:56:25,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:56:26,377 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:56:26,377 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 97 [2023-08-24 09:56:26,428 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:56:26,429 INFO L351 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 2242 treesize of output 2142 [2023-08-24 09:56:26,490 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:56:26,491 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 378 [2023-08-24 09:56:26,533 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:56:26,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 342 treesize of output 352 [2023-08-24 09:56:26,574 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:56:26,574 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 367 treesize of output 299 [2023-08-24 09:56:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:56:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700710060] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:56:30,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:56:30,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 47 [2023-08-24 09:56:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304788221] [2023-08-24 09:56:30,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:56:30,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-08-24 09:56:30,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:56:30,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-08-24 09:56:30,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1952, Unknown=6, NotChecked=0, Total=2256 [2023-08-24 09:56:30,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 281 [2023-08-24 09:56:30,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 322 transitions, 4286 flow. Second operand has 48 states, 48 states have (on average 73.77083333333333) internal successors, (3541), 48 states have internal predecessors, (3541), 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) [2023-08-24 09:56:30,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:56:30,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 281 [2023-08-24 09:56:30,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:56:35,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:56:38,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:56:40,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:56:44,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:57:27,812 INFO L124 PetriNetUnfolderBase]: 31955/53056 cut-off events. [2023-08-24 09:57:27,813 INFO L125 PetriNetUnfolderBase]: For 2401939/2401939 co-relation queries the response was YES. [2023-08-24 09:57:28,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496479 conditions, 53056 events. 31955/53056 cut-off events. For 2401939/2401939 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 442392 event pairs, 2882 based on Foata normal form. 920/53976 useless extension candidates. Maximal degree in co-relation 496388. Up to 13119 conditions per place. [2023-08-24 09:57:28,567 INFO L140 encePairwiseOnDemand]: 262/281 looper letters, 1421 selfloop transitions, 1538 changer transitions 439/3398 dead transitions. [2023-08-24 09:57:28,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 3398 transitions, 53254 flow [2023-08-24 09:57:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2023-08-24 09:57:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2023-08-24 09:57:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 20491 transitions. [2023-08-24 09:57:28,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28155099685348794 [2023-08-24 09:57:28,601 INFO L72 ComplementDD]: Start complementDD. Operand 259 states and 20491 transitions. [2023-08-24 09:57:28,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 259 states and 20491 transitions. [2023-08-24 09:57:28,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:57:28,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 259 states and 20491 transitions. [2023-08-24 09:57:28,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 260 states, 259 states have (on average 79.11583011583012) internal successors, (20491), 259 states have internal predecessors, (20491), 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) [2023-08-24 09:57:28,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 260 states, 260 states have (on average 281.0) internal successors, (73060), 260 states have internal predecessors, (73060), 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) [2023-08-24 09:57:28,801 INFO L81 ComplementDD]: Finished complementDD. Result has 260 states, 260 states have (on average 281.0) internal successors, (73060), 260 states have internal predecessors, (73060), 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) [2023-08-24 09:57:28,802 INFO L175 Difference]: Start difference. First operand has 244 places, 322 transitions, 4286 flow. Second operand 259 states and 20491 transitions. [2023-08-24 09:57:28,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 3398 transitions, 53254 flow [2023-08-24 09:57:37,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 3398 transitions, 45642 flow, removed 3804 selfloop flow, removed 16 redundant places. [2023-08-24 09:57:37,440 INFO L231 Difference]: Finished difference. Result has 555 places, 1827 transitions, 32282 flow [2023-08-24 09:57:37,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=4096, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=259, PETRI_FLOW=32282, PETRI_PLACES=555, PETRI_TRANSITIONS=1827} [2023-08-24 09:57:37,441 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 523 predicate places. [2023-08-24 09:57:37,441 INFO L495 AbstractCegarLoop]: Abstraction has has 555 places, 1827 transitions, 32282 flow [2023-08-24 09:57:37,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 73.77083333333333) internal successors, (3541), 48 states have internal predecessors, (3541), 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) [2023-08-24 09:57:37,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:57:37,442 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:57:37,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 09:57:37,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:57:37,643 INFO L420 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)] === [2023-08-24 09:57:37,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:57:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash 942319105, now seen corresponding path program 8 times [2023-08-24 09:57:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:57:37,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986178226] [2023-08-24 09:57:37,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:57:37,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:57:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:57:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:57:38,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:57:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986178226] [2023-08-24 09:57:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986178226] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:57:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661587743] [2023-08-24 09:57:38,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:57:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:57:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:57:38,765 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) [2023-08-24 09:57:38,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 09:57:38,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:57:38,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:57:38,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-24 09:57:38,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:57:39,787 INFO L322 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-08-24 09:57:39,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 13 [2023-08-24 09:57:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:57:39,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:57:40,471 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 09:57:40,471 INFO L351 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 50 treesize of output 53 [2023-08-24 09:57:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:57:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661587743] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:57:41,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:57:41,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2023-08-24 09:57:41,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102516910] [2023-08-24 09:57:41,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:57:41,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-24 09:57:41,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:57:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-24 09:57:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1497, Unknown=0, NotChecked=0, Total=1722 [2023-08-24 09:57:41,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 281 [2023-08-24 09:57:41,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 1827 transitions, 32282 flow. Second operand has 42 states, 42 states have (on average 84.11904761904762) internal successors, (3533), 42 states have internal predecessors, (3533), 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) [2023-08-24 09:57:41,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:57:41,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 281 [2023-08-24 09:57:41,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:58:20,814 INFO L124 PetriNetUnfolderBase]: 38791/65060 cut-off events. [2023-08-24 09:58:20,814 INFO L125 PetriNetUnfolderBase]: For 13682639/13682639 co-relation queries the response was YES. [2023-08-24 09:58:23,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935089 conditions, 65060 events. 38791/65060 cut-off events. For 13682639/13682639 co-relation queries the response was YES. Maximal size of possible extension queue 2358. Compared 563117 event pairs, 11069 based on Foata normal form. 60/65120 useless extension candidates. Maximal degree in co-relation 927091. Up to 35697 conditions per place. [2023-08-24 09:58:23,624 INFO L140 encePairwiseOnDemand]: 265/281 looper letters, 1922 selfloop transitions, 1343 changer transitions 92/3357 dead transitions. [2023-08-24 09:58:23,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 3357 transitions, 70521 flow [2023-08-24 09:58:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-08-24 09:58:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2023-08-24 09:58:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 5466 transitions. [2023-08-24 09:58:23,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3188845458257978 [2023-08-24 09:58:23,631 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 5466 transitions. [2023-08-24 09:58:23,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 5466 transitions. [2023-08-24 09:58:23,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:58:23,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 5466 transitions. [2023-08-24 09:58:23,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 89.60655737704919) internal successors, (5466), 61 states have internal predecessors, (5466), 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) [2023-08-24 09:58:23,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 281.0) internal successors, (17422), 62 states have internal predecessors, (17422), 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) [2023-08-24 09:58:23,653 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 281.0) internal successors, (17422), 62 states have internal predecessors, (17422), 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) [2023-08-24 09:58:23,653 INFO L175 Difference]: Start difference. First operand has 555 places, 1827 transitions, 32282 flow. Second operand 61 states and 5466 transitions. [2023-08-24 09:58:23,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 3357 transitions, 70521 flow [2023-08-24 10:01:53,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 3357 transitions, 51888 flow, removed 8778 selfloop flow, removed 32 redundant places. [2023-08-24 10:01:54,022 INFO L231 Difference]: Finished difference. Result has 599 places, 2520 transitions, 39252 flow [2023-08-24 10:01:54,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=23655, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=786, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=39252, PETRI_PLACES=599, PETRI_TRANSITIONS=2520} [2023-08-24 10:01:54,024 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 567 predicate places. [2023-08-24 10:01:54,024 INFO L495 AbstractCegarLoop]: Abstraction has has 599 places, 2520 transitions, 39252 flow [2023-08-24 10:01:54,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 84.11904761904762) internal successors, (3533), 42 states have internal predecessors, (3533), 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) [2023-08-24 10:01:54,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:01:54,026 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:01:54,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 10:01:54,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-24 10:01:54,227 INFO L420 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)] === [2023-08-24 10:01:54,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:01:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1009906323, now seen corresponding path program 9 times [2023-08-24 10:01:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:01:54,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472389045] [2023-08-24 10:01:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:01:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:01:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:01:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:01:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:01:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472389045] [2023-08-24 10:01:55,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472389045] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:01:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809380647] [2023-08-24 10:01:55,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 10:01:55,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:01:55,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:01:55,389 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) [2023-08-24 10:01:55,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 10:01:55,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 10:01:55,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:01:55,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-24 10:01:55,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:01:55,760 INFO L351 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 11 [2023-08-24 10:01:55,849 INFO L351 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 11 [2023-08-24 10:01:55,911 INFO L351 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 6 treesize of output 5 [2023-08-24 10:01:56,012 INFO L351 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 6 treesize of output 5 [2023-08-24 10:01:56,078 INFO L351 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 6 treesize of output 5 [2023-08-24 10:01:56,642 INFO L322 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-08-24 10:01:56,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 13 [2023-08-24 10:01:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:01:56,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:01:58,211 INFO L322 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2023-08-24 10:01:58,212 INFO L351 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 113 [2023-08-24 10:01:58,296 INFO L322 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2023-08-24 10:01:58,296 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 547 treesize of output 576 [2023-08-24 10:01:58,386 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:01:58,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 497 treesize of output 433 [2023-08-24 10:01:58,453 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:01:58,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 397 treesize of output 383 [2023-08-24 10:01:58,527 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:01:58,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 288 treesize of output 299 [2023-08-24 10:02:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:02:08,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809380647] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:02:08,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:02:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 48 [2023-08-24 10:02:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898870531] [2023-08-24 10:02:08,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:02:08,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-08-24 10:02:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:02:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-08-24 10:02:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2035, Unknown=6, NotChecked=0, Total=2352 [2023-08-24 10:02:08,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 281 [2023-08-24 10:02:08,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 2520 transitions, 39252 flow. Second operand has 49 states, 49 states have (on average 73.81632653061224) internal successors, (3617), 49 states have internal predecessors, (3617), 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) [2023-08-24 10:02:08,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:02:08,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 281 [2023-08-24 10:02:08,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:02:43,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:03:19,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:03:40,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:03:44,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:04:02,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:04:33,565 INFO L124 PetriNetUnfolderBase]: 61026/104229 cut-off events. [2023-08-24 10:04:33,565 INFO L125 PetriNetUnfolderBase]: For 29068226/29068226 co-relation queries the response was YES. [2023-08-24 10:04:37,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583929 conditions, 104229 events. 61026/104229 cut-off events. For 29068226/29068226 co-relation queries the response was YES. Maximal size of possible extension queue 4111. Compared 999436 event pairs, 5199 based on Foata normal form. 2861/106988 useless extension candidates. Maximal degree in co-relation 1583762. Up to 33032 conditions per place. [2023-08-24 10:04:37,917 INFO L140 encePairwiseOnDemand]: 261/281 looper letters, 2059 selfloop transitions, 3521 changer transitions 826/6406 dead transitions. [2023-08-24 10:04:37,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 6406 transitions, 132426 flow [2023-08-24 10:04:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2023-08-24 10:04:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2023-08-24 10:04:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 24461 transitions. [2023-08-24 10:04:37,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28171463451151113 [2023-08-24 10:04:37,943 INFO L72 ComplementDD]: Start complementDD. Operand 309 states and 24461 transitions. [2023-08-24 10:04:37,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 24461 transitions. [2023-08-24 10:04:37,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:04:37,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 309 states and 24461 transitions. [2023-08-24 10:04:37,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 310 states, 309 states have (on average 79.16181229773463) internal successors, (24461), 309 states have internal predecessors, (24461), 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) [2023-08-24 10:04:38,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 310 states, 310 states have (on average 281.0) internal successors, (87110), 310 states have internal predecessors, (87110), 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) [2023-08-24 10:04:38,052 INFO L81 ComplementDD]: Finished complementDD. Result has 310 states, 310 states have (on average 281.0) internal successors, (87110), 310 states have internal predecessors, (87110), 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) [2023-08-24 10:04:38,052 INFO L175 Difference]: Start difference. First operand has 599 places, 2520 transitions, 39252 flow. Second operand 309 states and 24461 transitions. [2023-08-24 10:04:38,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 6406 transitions, 132426 flow Received shutdown request... [2023-08-24 10:08:30,905 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 10:08:30,905 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 10:08:31,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 10:08:32,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-08-24 10:08:32,871 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 10:08:32,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 10:08:32,871 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-24 10:08:32,872 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 10:08:32,872 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 10:08:32,873 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 10:08:32,873 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1] [2023-08-24 10:08:32,875 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 10:08:32,875 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 10:08:32,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 10:08:32 BasicIcfg [2023-08-24 10:08:32,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 10:08:32,878 INFO L158 Benchmark]: Toolchain (without parser) took 800663.03ms. Allocated memory was 354.4MB in the beginning and 12.3GB in the end (delta: 12.0GB). Free memory was 312.6MB in the beginning and 8.2GB in the end (delta: -7.8GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-08-24 10:08:32,878 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 354.4MB. Free memory was 332.4MB in the beginning and 332.3MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 10:08:32,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.56ms. Allocated memory is still 354.4MB. Free memory was 312.6MB in the beginning and 301.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-24 10:08:32,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.03ms. Allocated memory is still 354.4MB. Free memory was 301.1MB in the beginning and 299.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 10:08:32,879 INFO L158 Benchmark]: Boogie Preprocessor took 39.05ms. Allocated memory is still 354.4MB. Free memory was 299.0MB in the beginning and 297.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 10:08:32,879 INFO L158 Benchmark]: RCFGBuilder took 599.55ms. Allocated memory is still 354.4MB. Free memory was 297.9MB in the beginning and 274.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 10:08:32,879 INFO L158 Benchmark]: TraceAbstraction took 799657.82ms. Allocated memory was 354.4MB in the beginning and 12.3GB in the end (delta: 12.0GB). Free memory was 273.8MB in the beginning and 8.2GB in the end (delta: -7.9GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-08-24 10:08:32,880 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.12ms. Allocated memory is still 354.4MB. Free memory was 332.4MB in the beginning and 332.3MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 294.56ms. Allocated memory is still 354.4MB. Free memory was 312.6MB in the beginning and 301.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.03ms. Allocated memory is still 354.4MB. Free memory was 301.1MB in the beginning and 299.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.05ms. Allocated memory is still 354.4MB. Free memory was 299.0MB in the beginning and 297.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 599.55ms. Allocated memory is still 354.4MB. Free memory was 297.9MB in the beginning and 274.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 799657.82ms. Allocated memory was 354.4MB in the beginning and 12.3GB in the end (delta: 12.0GB). Free memory was 273.8MB in the beginning and 8.2GB in the end (delta: -7.9GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 136 PlacesBefore, 32 PlacesAfterwards, 137 TransitionsBefore, 25 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 8 FixpointIterations, 76 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 131 TotalNumberOfCompositions, 2222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1552, independent: 1467, independent conditional: 0, independent unconditional: 1467, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 662, independent: 642, independent conditional: 0, independent unconditional: 642, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1552, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 662, unknown conditional: 0, unknown unconditional: 662] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 168 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 799.5s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 752.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 824 mSolverCounterUnknown, 7320 SdHoareTripleChecker+Valid, 53.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7320 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 50.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 692 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 1285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21206 IncrementalHoareTripleChecker+Invalid, 24007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1285 mSolverCounterUnsat, 0 mSDtfsCounter, 21206 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 824 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1396 GetRequests, 289 SyntacticMatches, 14 SemanticMatches, 1093 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 95806 ImplicationChecksByTransitivity, 129.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39252occurred in iteration=12, InterpolantAutomatonStates: 555, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 38.4s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 806 ConstructedInterpolants, 53 QuantifiedInterpolants, 15724 SizeOfPredicates, 213 NumberOfNonLiveVariables, 2312 ConjunctsInSsa, 421 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 39/216 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown