/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 02:52:46,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 02:52:46,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-08 02:52:46,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 02:52:46,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 02:52:46,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 02:52:46,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 02:52:46,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 02:52:46,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 02:52:46,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 02:52:46,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 02:52:46,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 02:52:46,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 02:52:46,097 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 02:52:46,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 02:52:46,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 02:52:46,097 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 02:52:46,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 02:52:46,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 02:52:46,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 02:52:46,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 02:52:46,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 02:52:46,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 02:52:46,099 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 02:52:46,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 02:52:46,099 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 02:52:46,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 02:52:46,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 02:52:46,100 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 02:52:46,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 02:52:46,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 02:52:46,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 02:52:46,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 02:52:46,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 02:52:46,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 02:52:46,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 02:52:46,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 02:52:46,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 02:52:46,102 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 02:52:46,102 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-08 02:52:46,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR [2023-09-08 02:52:46,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 02:52:46,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 02:52:46,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 02:52:46,311 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 02:52:46,311 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 02:52:46,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-09-08 02:52:47,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 02:52:47,471 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 02:52:47,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-09-08 02:52:47,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653e242a0/5189630ff01d4046b0377b7a8147c19f/FLAG57d977a9b [2023-09-08 02:52:47,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653e242a0/5189630ff01d4046b0377b7a8147c19f [2023-09-08 02:52:47,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 02:52:47,499 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 02:52:47,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 02:52:47,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 02:52:47,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 02:52:47,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:47,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c2fb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47, skipping insertion in model container [2023-09-08 02:52:47,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:47,554 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 02:52:47,870 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-09-08 02:52:47,877 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-09-08 02:52:47,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 02:52:47,897 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 02:52:47,916 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 02:52:47,917 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 02:52:47,923 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-08 02:52:47,931 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-09-08 02:52:47,936 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-09-08 02:52:47,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 02:52:47,978 INFO L206 MainTranslator]: Completed translation [2023-09-08 02:52:47,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47 WrapperNode [2023-09-08 02:52:47,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 02:52:47,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 02:52:47,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 02:52:47,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 02:52:47,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,028 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-09-08 02:52:48,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 02:52:48,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 02:52:48,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 02:52:48,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 02:52:48,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 02:52:48,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 02:52:48,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 02:52:48,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 02:52:48,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (1/1) ... [2023-09-08 02:52:48,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 02:52:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:52:48,123 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-09-08 02:52:48,127 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-09-08 02:52:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-08 02:52:48,150 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-08 02:52:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-08 02:52:48,152 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-08 02:52:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 02:52:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 02:52:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 02:52:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 02:52:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-08 02:52:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 02:52:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 02:52:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 02:52:48,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 02:52:48,154 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 02:52:48,288 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 02:52:48,289 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 02:52:48,519 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 02:52:48,529 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 02:52:48,530 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-08 02:52:48,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:52:48 BoogieIcfgContainer [2023-09-08 02:52:48,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 02:52:48,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 02:52:48,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 02:52:48,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 02:52:48,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:52:47" (1/3) ... [2023-09-08 02:52:48,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:52:48, skipping insertion in model container [2023-09-08 02:52:48,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:47" (2/3) ... [2023-09-08 02:52:48,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:52:48, skipping insertion in model container [2023-09-08 02:52:48,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:52:48" (3/3) ... [2023-09-08 02:52:48,537 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-09-08 02:52:48,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 02:52:48,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 02:52:48,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-08 02:52:48,548 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 02:52:48,638 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 02:52:48,676 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 02:52:48,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 02:52:48,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:52:48,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-08 02:52:48,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-08 02:52:48,701 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-08 02:52:48,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 02:52:48,709 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@14fef6c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 02:52:48,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-08 02:52:48,729 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 2 more)] === [2023-09-08 02:52:48,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash -783037911, now seen corresponding path program 1 times [2023-09-08 02:52:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:48,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031884361] [2023-09-08 02:52:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031884361] [2023-09-08 02:52:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031884361] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:52:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:52:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 02:52:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47986985] [2023-09-08 02:52:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:52:48,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 02:52:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 02:52:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 02:52:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:48,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:48,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-09-08 02:52:48,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:48,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 02:52:48,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:48,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:48,987 INFO L85 PathProgramCache]: Analyzing trace with hash -446658237, now seen corresponding path program 1 times [2023-09-08 02:52:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945002090] [2023-09-08 02:52:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:49,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:49,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945002090] [2023-09-08 02:52:49,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945002090] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:52:49,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:52:49,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 02:52:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027472241] [2023-09-08 02:52:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:52:49,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 02:52:49,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:49,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 02:52:49,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 02:52:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,295 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:49,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09-08 02:52:49,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:49,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-08 02:52:49,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:49,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -63200966, now seen corresponding path program 1 times [2023-09-08 02:52:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820474467] [2023-09-08 02:52:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820474467] [2023-09-08 02:52:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820474467] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:52:49,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:52:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 02:52:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577238188] [2023-09-08 02:52:49,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:52:49,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 02:52:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 02:52:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 02:52:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,453 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:49,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 02:52:49,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:49,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:49,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-08 02:52:49,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:49,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1277973936, now seen corresponding path program 1 times [2023-09-08 02:52:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680287850] [2023-09-08 02:52:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680287850] [2023-09-08 02:52:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680287850] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:52:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645840071] [2023-09-08 02:52:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:52:49,736 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-09-08 02:52:49,737 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-09-08 02:52:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:49,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-08 02:52:49,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:52:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:49,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:52:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645840071] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:52:50,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:52:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-08 02:52:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905817476] [2023-09-08 02:52:50,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:52:50,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-08 02:52:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-08 02:52:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-09-08 02:52:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:50,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-09-08 02:52:50,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:50,156 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-09-08 02:52:50,351 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,SelfDestructingSolverStorable3 [2023-09-08 02:52:50,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:50,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1463355164, now seen corresponding path program 2 times [2023-09-08 02:52:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759169184] [2023-09-08 02:52:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-09-08 02:52:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759169184] [2023-09-08 02:52:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759169184] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:52:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 02:52:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 02:52:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237858196] [2023-09-08 02:52:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:52:50,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 02:52:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 02:52:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 02:52:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:50,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-09-08 02:52:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:50,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-08 02:52:50,590 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:50,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1255792490, now seen corresponding path program 1 times [2023-09-08 02:52:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:50,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876565598] [2023-09-08 02:52:50,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876565598] [2023-09-08 02:52:50,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876565598] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:52:50,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949515311] [2023-09-08 02:52:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:50,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:50,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:52:50,823 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-09-08 02:52:50,825 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-09-08 02:52:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:50,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-08 02:52:50,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:52:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:51,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:52:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:51,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949515311] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:52:51,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:52:51,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-09-08 02:52:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549224599] [2023-09-08 02:52:51,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:52:51,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-08 02:52:51,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:51,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-08 02:52:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-09-08 02:52:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:51,294 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:51,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.61111111111111) internal successors, (335), 18 states have internal predecessors, (335), 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-09-08 02:52:51,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:51,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:51,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:51,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:51,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:51,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:52:51,450 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-09-08 02:52:51,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:51,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:51,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1027634242, now seen corresponding path program 2 times [2023-09-08 02:52:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059387397] [2023-09-08 02:52:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:52,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:52,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059387397] [2023-09-08 02:52:52,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059387397] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:52:52,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405617003] [2023-09-08 02:52:52,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 02:52:52,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:52,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:52:52,161 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-09-08 02:52:52,184 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-09-08 02:52:52,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-08 02:52:52,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:52:52,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-08 02:52:52,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:52:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2023-09-08 02:52:52,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-08 02:52:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405617003] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:52:52,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-08 02:52:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2023-09-08 02:52:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843160650] [2023-09-08 02:52:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:52:52,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 02:52:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 02:52:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-09-08 02:52:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:52,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:52,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-09-08 02:52:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:52:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:52:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:52:52,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-09-08 02:52:52,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:52,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:52,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash -21173911, now seen corresponding path program 1 times [2023-09-08 02:52:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:52,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220481575] [2023-09-08 02:52:52,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:52,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220481575] [2023-09-08 02:52:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220481575] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:52:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747566511] [2023-09-08 02:52:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:53,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:52:53,173 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-09-08 02:52:53,175 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-09-08 02:52:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:53,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-08 02:52:53,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:52:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:53,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:52:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747566511] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:52:54,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:52:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-09-08 02:52:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20490697] [2023-09-08 02:52:54,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:52:54,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-08 02:52:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:54,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-08 02:52:54,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-09-08 02:52:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:54,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:54,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.88235294117647) internal successors, (574), 34 states have internal predecessors, (574), 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-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:52:54,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:52:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:52:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:52:54,521 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-09-08 02:52:54,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:54,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:54,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 970035481, now seen corresponding path program 2 times [2023-09-08 02:52:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695441050] [2023-09-08 02:52:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:52:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:55,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:52:55,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695441050] [2023-09-08 02:52:55,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695441050] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:52:55,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424789641] [2023-09-08 02:52:55,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 02:52:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:55,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:52:56,005 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-09-08 02:52:56,007 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-09-08 02:52:56,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 02:52:56,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:52:56,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 32 conjunts are in the unsatisfiable core [2023-09-08 02:52:56,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:52:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:56,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:52:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:52:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424789641] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:52:57,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:52:57,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2023-09-08 02:52:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508395822] [2023-09-08 02:52:57,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:52:57,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-08 02:52:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:52:57,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-08 02:52:57,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-09-08 02:52:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:57,535 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:52:57,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 16.837209302325583) internal successors, (724), 43 states have internal predecessors, (724), 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-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:52:57,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:52:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:52:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:52:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:52:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:52:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:52:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:52:58,299 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-09-08 02:52:58,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:52:58,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:52:58,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:52:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1046538073, now seen corresponding path program 3 times [2023-09-08 02:52:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:52:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739508372] [2023-09-08 02:52:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:52:58,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:52:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:53:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1400 proven. 37 refuted. 0 times theorem prover too weak. 4283 trivial. 0 not checked. [2023-09-08 02:53:02,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:53:02,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739508372] [2023-09-08 02:53:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739508372] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:53:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943686922] [2023-09-08 02:53:02,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-08 02:53:02,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:53:02,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:53:02,629 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-09-08 02:53:02,631 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-09-08 02:53:02,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-08 02:53:02,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:53:02,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 54 conjunts are in the unsatisfiable core [2023-09-08 02:53:02,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:53:05,278 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-09-08 02:53:05,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:53:05,330 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 14 treesize of output 16 [2023-09-08 02:53:05,486 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:53:05,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:53:05,530 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 19 treesize of output 18 [2023-09-08 02:53:05,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-08 02:53:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 588 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 0 not checked. [2023-09-08 02:53:05,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:53:05,881 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:53:05,881 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 53 treesize of output 43 [2023-09-08 02:53:05,890 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:53:05,890 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 77 treesize of output 79 [2023-09-08 02:53:05,910 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 61 treesize of output 53 [2023-09-08 02:53:05,924 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 7 treesize of output 3 [2023-09-08 02:53:05,976 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:53:05,976 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 47 treesize of output 43 [2023-09-08 02:53:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 588 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 0 not checked. [2023-09-08 02:53:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943686922] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:53:06,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:53:06,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 41 [2023-09-08 02:53:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785880884] [2023-09-08 02:53:06,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:53:06,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-09-08 02:53:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:53:06,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-09-08 02:53:06,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1437, Unknown=1, NotChecked=0, Total=1640 [2023-09-08 02:53:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:06,760 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:53:06,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.658536585365853) internal successors, (478), 41 states have internal predecessors, (478), 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-09-08 02:53:06,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:53:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:53:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 02:53:07,493 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-09-08 02:53:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:53:07,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:53:07,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:53:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 724881999, now seen corresponding path program 1 times [2023-09-08 02:53:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:53:07,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631782685] [2023-09-08 02:53:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:53:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:53:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:53:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 5749 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:53:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:53:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631782685] [2023-09-08 02:53:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631782685] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:53:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298162468] [2023-09-08 02:53:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:53:09,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:53:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:53:09,945 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-09-08 02:53:09,947 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-09-08 02:53:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:53:10,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 42 conjunts are in the unsatisfiable core [2023-09-08 02:53:10,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:53:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 6281 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 02:53:10,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-08 02:53:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298162468] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 02:53:10,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-08 02:53:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-09-08 02:53:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998181917] [2023-09-08 02:53:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 02:53:10,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-08 02:53:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:53:10,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-08 02:53:10,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-09-08 02:53:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:10,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:53:10,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 18.41860465116279) internal successors, (792), 43 states have internal predecessors, (792), 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-09-08 02:53:10,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:10,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:10,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:10,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:53:10,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:10,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:53:10,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:53:10,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:53:10,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:53:10,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 02:53:10,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:53:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:53:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 02:53:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-08 02:53:11,899 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-09-08 02:53:12,099 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,SelfDestructingSolverStorable10 [2023-09-08 02:53:12,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:53:12,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:53:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1231800167, now seen corresponding path program 2 times [2023-09-08 02:53:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:53:12,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530903940] [2023-09-08 02:53:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:53:12,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:53:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:53:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3419 proven. 182 refuted. 0 times theorem prover too weak. 2099 trivial. 0 not checked. [2023-09-08 02:53:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:53:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530903940] [2023-09-08 02:53:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530903940] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:53:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253796038] [2023-09-08 02:53:15,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 02:53:15,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:53:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:53:15,362 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-09-08 02:53:15,364 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-09-08 02:53:15,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 02:53:15,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:53:15,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 78 conjunts are in the unsatisfiable core [2023-09-08 02:53:15,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:53:17,007 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-09-08 02:53:17,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:53:17,058 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 14 treesize of output 16 [2023-09-08 02:53:17,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:53:17,248 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 21 treesize of output 20 [2023-09-08 02:53:17,290 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 19 treesize of output 18 [2023-09-08 02:53:17,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-09-08 02:53:17,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:53:17,513 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 14 treesize of output 16 [2023-09-08 02:53:17,655 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 19 treesize of output 18 [2023-09-08 02:53:17,682 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 19 treesize of output 18 [2023-09-08 02:53:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3287 proven. 201 refuted. 0 times theorem prover too weak. 2212 trivial. 0 not checked. [2023-09-08 02:53:17,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:53:18,014 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20))) is different from false [2023-09-08 02:53:18,037 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20))) is different from false [2023-09-08 02:53:18,045 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1))))) is different from false [2023-09-08 02:53:18,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2073) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20))) is different from false [2023-09-08 02:53:18,105 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2071 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2071)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2073) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1))))) is different from false [2023-09-08 02:53:18,117 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2071 Int)) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2071))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2073) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) v_ArrVal_2079)) .cse3)) 20)))))) is different from false [2023-09-08 02:53:18,138 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2073 Int) (v_ArrVal_2079 Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2071))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2073) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2077) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2079)) .cse1)) 20)) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|)))) is different from false [2023-09-08 02:53:18,433 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:53:18,434 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 204 treesize of output 144 [2023-09-08 02:53:18,442 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:53:18,443 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 224 treesize of output 222 [2023-09-08 02:53:18,452 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 97 treesize of output 85 [2023-09-08 02:53:18,460 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 9 [2023-09-08 02:53:18,477 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 8 treesize of output 4 [2023-09-08 02:53:18,498 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:53:18,498 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 96 treesize of output 84 [2023-09-08 02:53:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3165 proven. 167 refuted. 5 times theorem prover too weak. 2239 trivial. 124 not checked. [2023-09-08 02:53:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253796038] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:53:18,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:53:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 57 [2023-09-08 02:53:18,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038475500] [2023-09-08 02:53:18,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:53:18,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-09-08 02:53:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:53:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-09-08 02:53:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=2078, Unknown=15, NotChecked=714, Total=3192 [2023-09-08 02:53:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:18,946 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:53:18,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 10.982456140350877) internal successors, (626), 57 states have internal predecessors, (626), 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-09-08 02:53:18,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:18,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:18,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:18,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:53:18,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:18,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:53:18,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:53:18,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:53:18,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:53:18,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 02:53:18,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-08 02:53:18,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-08 02:53:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:53:20,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-08 02:53:21,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:53:21,138 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:53:21,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:53:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash -590754094, now seen corresponding path program 3 times [2023-09-08 02:53:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:53:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48891493] [2023-09-08 02:53:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:53:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:53:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:53:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3719 proven. 200 refuted. 0 times theorem prover too weak. 2071 trivial. 0 not checked. [2023-09-08 02:53:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:53:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48891493] [2023-09-08 02:53:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48891493] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:53:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416886900] [2023-09-08 02:53:28,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-08 02:53:28,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:53:28,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:53:28,598 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:53:28,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-08 02:54:53,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-09-08 02:54:53,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:54:53,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 139 conjunts are in the unsatisfiable core [2023-09-08 02:54:53,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:54:55,354 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-09-08 02:54:55,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:54:55,398 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 14 treesize of output 16 [2023-09-08 02:54:55,567 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:54:55,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2023-09-08 02:54:55,625 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 19 treesize of output 18 [2023-09-08 02:54:55,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2023-09-08 02:54:55,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:54:55,853 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 14 treesize of output 16 [2023-09-08 02:54:56,042 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:54:56,043 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2023-09-08 02:54:56,106 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 19 treesize of output 18 [2023-09-08 02:54:56,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2023-09-08 02:54:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:54:56,336 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 14 treesize of output 16 [2023-09-08 02:54:56,538 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:54:56,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2023-09-08 02:54:56,603 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 19 treesize of output 18 [2023-09-08 02:54:56,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2023-09-08 02:54:56,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:54:56,852 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 14 treesize of output 16 [2023-09-08 02:54:57,009 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:54:57,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-09-08 02:54:57,037 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 19 treesize of output 18 [2023-09-08 02:54:57,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-08 02:54:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3237 proven. 482 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2023-09-08 02:54:57,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:54:57,239 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20))) is different from false [2023-09-08 02:54:57,297 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20))) is different from false [2023-09-08 02:54:57,302 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20))) is different from false [2023-09-08 02:54:57,310 WARN L839 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20)))) is different from false [2023-09-08 02:54:57,371 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2482 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1)) 20))) (= .cse4 20)))) is different from false [2023-09-08 02:54:57,403 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2475)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1)) 20)) (= .cse4 20))))) is different from false [2023-09-08 02:54:57,427 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2475)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1)) 20)) (= .cse4 20)))))) is different from false [2023-09-08 02:54:57,456 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2475)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2478) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1)) 20)) (= .cse4 20)))))) is different from false [2023-09-08 02:54:57,587 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2482)) .cse2)))))))) is different from false [2023-09-08 02:54:57,646 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2) 20))))))) is different from false [2023-09-08 02:54:57,736 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2)))))))) is different from false [2023-09-08 02:54:57,935 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2471) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2) 20))))))) (= .cse8 20)))) is different from false [2023-09-08 02:54:58,001 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2469)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2471) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_2475)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse1) 20)) (= .cse4 20) (= 20 .cse5)))))))) is different from false [2023-09-08 02:54:58,029 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2469)))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2471) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse3))))))))))) is different from false [2023-09-08 02:54:58,074 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2469)))) (let ((.cse1 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2471) .cse8 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse0 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2478) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2482)) .cse3) 20)))))))))) is different from false [2023-09-08 02:54:58,321 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_2471) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_2475)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2478) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse3) 20)))))))))) is different from false [2023-09-08 02:54:58,541 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2471) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2478) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse2) 20)) (= 20 .cse6))))))))) is different from false [2023-09-08 02:54:58,789 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse12 .cse13))) (or (= .cse0 20) (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_2469)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_2471) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2478) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse3) 20)) (= .cse7 20)))))))))))) is different from false [2023-09-08 02:54:58,840 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse11 .cse12))) (or (forall ((v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2463) .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) v_ArrVal_2469)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2471) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2478) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1) 20)) (= 20 .cse6) (= 20 .cse5))))))))) (= .cse13 20)))) is different from false [2023-09-08 02:54:58,917 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2461)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse12 .cse13))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2463) .cse13 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2471) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse0 (select .cse6 .cse4))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2478) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_2482)) .cse4) 20)))))))))))) is different from false [2023-09-08 02:54:58,947 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230|) (forall ((v_ArrVal_2461 Int) (v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse14 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2461))) (let ((.cse2 (select .cse14 .cse1))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2463) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse12 .cse5))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2471) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse7 (let ((.cse10 (select .cse6 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse5)) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse9 (select .cse7 .cse5))) (or (= .cse2 20) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2478) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse5) 20)) (= 20 .cse9)))))))))))))) is different from false [2023-09-08 02:54:59,002 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse14 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2461)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (select .cse14 .cse9))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2463) .cse9 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) v_ArrVal_2469)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse12 .cse1))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2471) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse3 (let ((.cse10 (select .cse2 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2475)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2478) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2482)) .cse1) 20)) (= 20 .cse5) (= .cse6 20) (= .cse7 20) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230|)))))))))))) is different from false [2023-09-08 02:54:59,430 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2467 (Array Int Int)) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2460 (Array Int Int)) (v_ArrVal_2481 (Array Int Int)) (v_ArrVal_2461 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2471 Int) (v_ArrVal_2482 Int) (v_ArrVal_2463 Int) (v_ArrVal_2475 Int) (v_ArrVal_2478 Int) (v_ArrVal_2469 Int)) (let ((.cse13 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2460))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse14 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2461)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2463) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2469)))) (let ((.cse8 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2471) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2474))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_2475)))) (let ((.cse0 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2478) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2481) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2482)) .cse3))) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230|) (= 20 .cse8))))))))))))) is different from false [2023-09-08 02:54:59,542 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:54:59,543 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 5745 treesize of output 3875 [2023-09-08 02:54:59,567 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:54:59,568 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 3108 treesize of output 3032 [2023-09-08 02:54:59,580 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 601 treesize of output 589 [2023-09-08 02:54:59,591 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 38 treesize of output 30 [2023-09-08 02:54:59,601 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 32 treesize of output 20 [2023-09-08 02:54:59,611 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 32 treesize of output 20 [2023-09-08 02:54:59,633 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 7 treesize of output 3 [2023-09-08 02:54:59,670 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 02:54:59,670 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 575 treesize of output 511 [2023-09-08 02:55:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 1992 proven. 576 refuted. 233 times theorem prover too weak. 2271 trivial. 918 not checked. [2023-09-08 02:55:04,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416886900] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 02:55:04,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 02:55:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 46] total 105 [2023-09-08 02:55:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957210713] [2023-09-08 02:55:04,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 02:55:04,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2023-09-08 02:55:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 02:55:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2023-09-08 02:55:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=5413, Unknown=94, NotChecked=4186, Total=10920 [2023-09-08 02:55:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:55:04,513 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 02:55:04,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 7.780952380952381) internal successors, (817), 105 states have internal predecessors, (817), 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-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:55:04,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:55:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 02:55:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-08 02:55:17,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-09-08 02:55:17,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-09-08 02:55:17,188 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-08 02:55:17,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 02:55:17,189 INFO L85 PathProgramCache]: Analyzing trace with hash 910595484, now seen corresponding path program 4 times [2023-09-08 02:55:17,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 02:55:17,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274651844] [2023-09-08 02:55:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 02:55:17,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 02:55:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 02:55:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 4323 proven. 960 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2023-09-08 02:55:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 02:55:36,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274651844] [2023-09-08 02:55:36,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274651844] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 02:55:36,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464905747] [2023-09-08 02:55:36,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-08 02:55:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 02:55:36,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 02:55:36,048 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 02:55:36,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-09-08 02:55:46,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-08 02:55:46,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 02:55:46,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 169 conjunts are in the unsatisfiable core [2023-09-08 02:55:46,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 02:55:46,942 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-09-08 02:55:46,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:46,989 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 14 treesize of output 16 [2023-09-08 02:55:47,181 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:47,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:47,219 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 19 treesize of output 18 [2023-09-08 02:55:47,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-08 02:55:47,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:47,438 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 14 treesize of output 16 [2023-09-08 02:55:47,647 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:47,648 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:47,689 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 19 treesize of output 18 [2023-09-08 02:55:47,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-08 02:55:47,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:47,906 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 14 treesize of output 16 [2023-09-08 02:55:48,134 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:48,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:48,176 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 19 treesize of output 18 [2023-09-08 02:55:48,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-08 02:55:48,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:48,404 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 14 treesize of output 16 [2023-09-08 02:55:48,631 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:48,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:48,686 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 19 treesize of output 18 [2023-09-08 02:55:48,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-08 02:55:48,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:48,928 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 14 treesize of output 16 [2023-09-08 02:55:49,158 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:49,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:49,199 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 19 treesize of output 18 [2023-09-08 02:55:49,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-08 02:55:49,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:49,439 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 14 treesize of output 16 [2023-09-08 02:55:49,674 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:49,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:49,713 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 19 treesize of output 18 [2023-09-08 02:55:49,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-08 02:55:49,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:49,952 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 14 treesize of output 16 [2023-09-08 02:55:50,204 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:50,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:50,249 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 19 treesize of output 18 [2023-09-08 02:55:50,437 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2023-09-08 02:55:50,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 02:55:50,513 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 14 treesize of output 16 [2023-09-08 02:55:50,698 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 02:55:50,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 28 treesize of output 23 [2023-09-08 02:55:50,724 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 19 treesize of output 18 [2023-09-08 02:55:50,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-08 02:55:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3321 proven. 930 refuted. 0 times theorem prover too weak. 1911 trivial. 0 not checked. [2023-09-08 02:55:50,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 02:56:18,923 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2907 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2912 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2912) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2023-09-08 02:57:14,544 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2907 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2901)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2905) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2912)))))))) is different from false [2023-09-08 02:57:42,190 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2912) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2905) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2897) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|))))))))) is different from false [2023-09-08 02:57:42,221 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2897) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2912) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2905) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|))))))))) is different from false [2023-09-08 02:57:42,252 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_2903) .cse5 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2897) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2910) .cse5 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse5) 20) (< (+ (select .cse3 .cse5) 1) v_ArrVal_2912) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse7 .cse5) 1) v_ArrVal_2905) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|)))))))))) is different from false [2023-09-08 02:57:44,353 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2894)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2896) .cse5 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2912) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2897) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20)))))))))) is different from false [2023-09-08 02:57:44,404 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse0 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2894))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2897) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2912) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2905) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|)))))))))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|)))) is different from false [2023-09-08 02:57:44,489 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2894)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2905) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2912) (< (+ (select .cse9 .cse3) 1) v_ArrVal_2897))))))))))) is different from false [2023-09-08 02:58:18,208 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2905) (< (+ 1 (select .cse3 .cse1)) v_ArrVal_2912) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2891) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897)))))))))))) is different from false [2023-09-08 02:58:18,545 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2891) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2905) (< (+ 1 (select .cse5 .cse3)) v_ArrVal_2912) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2897))))))))))))) is different from false [2023-09-08 02:58:22,365 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2886)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2888) .cse5 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2912) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2891) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2905) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|))))))))))))) is different from false [2023-09-08 02:58:22,439 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse9 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2886))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse4 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse10 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_2897) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2912) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2891) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2905)))))))))))))))) is different from false [2023-09-08 02:58:22,555 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2886)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse4 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse9 .cse11 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2891) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2905) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2912) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2897) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20)))))))))))))) is different from false [2023-09-08 02:58:57,270 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2897) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2884) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2891) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2905) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|))))))))))))))) is different from false [2023-09-08 02:58:58,188 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse12 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse8 (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2897) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2884) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2912) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2891) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2905) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|)))))))))))))))) is different from false [2023-09-08 02:58:58,584 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2903 Int) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2882 Int) (v_ArrVal_2896 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2901 Int) (v_ArrVal_2912 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2882) .cse6 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse12 .cse11 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse3 (select .cse14 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2897) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2905) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2912) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2884) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2891)))))))))))))))) is different from false [2023-09-08 02:59:11,635 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2879)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2882) .cse6 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse0 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse2 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (+ (select .cse7 .cse6) 1) v_ArrVal_2884) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2891) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2897) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2905))))))))))))))))) is different from false [2023-09-08 02:59:36,794 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse16 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse9 (select .cse15 |c_~#queue~0.base|))) (let ((.cse11 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse3 (select .cse14 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse4 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse6 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2884) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2897) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_2912) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2905)))))))))))))))))) is different from false [2023-09-08 02:59:37,354 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse5 (select .cse16 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse11 (select .cse15 |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse9 (select .cse13 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse2 (store (store .cse13 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2905) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2891) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2877) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ 1 (select .cse12 .cse1)) v_ArrVal_2897)))))))))))))))))) is different from false [2023-09-08 02:59:38,031 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse9 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse13 (select .cse17 |c_~#queue~0.base|))) (let ((.cse10 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse11 (select .cse15 |c_~#queue~0.base|))) (let ((.cse0 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse2 (store (store .cse15 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2905) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2877) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2891) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ 1 (select .cse14 .cse1)) v_ArrVal_2897))))))))))))))))))) is different from false [2023-09-08 02:59:38,528 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2875) .cse5 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse10 (select .cse18 |c_~#queue~0.base|))) (let ((.cse0 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse0 .cse12 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse7 (select .cse17 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse3 .cse12 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse2 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse14 .cse12 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse9 (select .cse15 |c_~#queue~0.base|))) (let ((.cse13 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse11 (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse12 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2884) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2877) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2912) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2897))))))))))))))))))) is different from false [2023-09-08 02:59:38,893 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2873)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2875) .cse6 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse10 (select .cse18 |c_~#queue~0.base|))) (let ((.cse7 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse14 (select .cse17 |c_~#queue~0.base|))) (let ((.cse0 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse11 (select .cse15 |c_~#queue~0.base|))) (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse3 (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse12 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2912) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2877) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2905) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|))))))))))))))))))) is different from false [2023-09-08 02:59:39,031 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2873))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2875) .cse1 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse12 (select .cse19 |c_~#queue~0.base|))) (let ((.cse14 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse14 .cse10 v_ArrVal_2882) .cse3 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse15 (select .cse18 |c_~#queue~0.base|))) (let ((.cse5 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse2 (select .cse17 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse8 (store (store .cse16 |c_~#queue~0.base| (store (store .cse11 .cse10 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2891) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2897) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2905) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2877) (< (+ (select .cse9 .cse3) 1) v_ArrVal_2912) (< (+ (select .cse14 .cse3) 1) v_ArrVal_2884) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|)))))))))))))))))))))) is different from false [2023-09-08 02:59:39,251 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2901 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2873)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2875) .cse5 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse13 (select .cse19 |c_~#queue~0.base|))) (let ((.cse14 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse14 .cse2 v_ArrVal_2882) .cse3 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse12 (select .cse18 |c_~#queue~0.base|))) (let ((.cse8 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse9 (select .cse17 |c_~#queue~0.base|))) (let ((.cse15 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse0 (store (store .cse16 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse11 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2877) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2905) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2891) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2912) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse14 .cse3) 1) v_ArrVal_2884) (< (+ (select .cse15 .cse3) 1) v_ArrVal_2897)))))))))))))))))))) is different from false [2023-09-08 03:00:31,236 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2869 Int) (v_ArrVal_2901 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2869)) |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse14 (select .cse19 |c_~#queue~0.base|))) (let ((.cse6 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_2873)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_2875) .cse1 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse13 (select .cse18 |c_~#queue~0.base|))) (let ((.cse11 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse3 (select .cse17 |c_~#queue~0.base|))) (let ((.cse10 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse12 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse15 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse4 (store (store .cse15 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2912) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2877) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2897) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2869) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|))))))))))))))))))))) is different from false [2023-09-08 03:00:44,924 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2867 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2888 Int) (v_ArrVal_2869 Int) (v_ArrVal_2901 Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2867) .cse12 v_ArrVal_2869)) |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse5 (select .cse21 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_2873)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2875) .cse3 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse16 (select .cse20 |c_~#queue~0.base|))) (let ((.cse13 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_2882) .cse3 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse4 (select .cse19 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse14 (select .cse18 |c_~#queue~0.base|))) (let ((.cse9 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse6 (select .cse17 |c_~#queue~0.base|))) (let ((.cse10 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse0 (store (store .cse17 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse15 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2891) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2877) (< (+ (select .cse9 .cse3) 1) v_ArrVal_2897) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2905) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2912) (< (+ (select .cse11 .cse12) 1) v_ArrVal_2869) (< (+ (select .cse13 .cse3) 1) v_ArrVal_2884) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse16 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|)))))))))))))))))))))) is different from false [2023-09-08 03:00:45,453 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2867 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2866 Int) (v_ArrVal_2888 Int) (v_ArrVal_2869 Int) (v_ArrVal_2901 Int)) (let ((.cse15 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2866)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2867) .cse16 v_ArrVal_2869)) |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse12 (select .cse21 |c_~#queue~0.base|))) (let ((.cse14 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_2873)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2875) .cse1 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse10 (select .cse20 |c_~#queue~0.base|))) (let ((.cse13 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse7 (select .cse19 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse0 (select .cse18 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse3 (select .cse17 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse4 (store (store .cse17 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse11 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2891) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2905) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2877) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_2912) (< (+ (select .cse15 .cse16) 1) v_ArrVal_2869)))))))))))))))))))))) is different from false [2023-09-08 03:00:45,744 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2867 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2866 Int) (v_ArrVal_2888 Int) (v_ArrVal_2869 Int) (v_ArrVal_2901 Int)) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2866))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2867) .cse1 v_ArrVal_2869)) |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse17 (select .cse22 |c_~#queue~0.base|))) (let ((.cse12 (store .cse17 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_2873)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2875) .cse3 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse11 (select .cse21 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_2882) .cse3 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse13 (select .cse20 |c_~#queue~0.base|))) (let ((.cse14 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse16 (select .cse19 |c_~#queue~0.base|))) (let ((.cse9 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse15 (select .cse18 |c_~#queue~0.base|))) (let ((.cse5 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse6 (store (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2869) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2905) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse9 .cse3) 1) v_ArrVal_2897) (< (+ 1 (select .cse10 .cse3)) v_ArrVal_2884) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse12 .cse3) 1) v_ArrVal_2877) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2912) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse14 .cse3) 1) v_ArrVal_2891) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select .cse16 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse17 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|))))))))))))))))))))))))) is different from false [2023-09-08 03:00:46,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2903 Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2885 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| Int) (v_ArrVal_2891 Int) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_2897 Int) (v_ArrVal_2877 Int) (v_ArrVal_2910 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_2879 Int) (v_ArrVal_2912 Int) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2878 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2871 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_2882 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| Int) (v_ArrVal_2884 Int) (v_ArrVal_2886 Int) (v_ArrVal_2867 Int) (v_ArrVal_2906 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| Int) (v_ArrVal_2866 Int) (v_ArrVal_2888 Int) (v_ArrVal_2869 Int) (v_ArrVal_2901 Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse12 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327| 4)) v_ArrVal_2866)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2867) .cse3 v_ArrVal_2869)) |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse15 (select .cse22 |c_~#queue~0.base|))) (let ((.cse14 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_2873)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2875) .cse1 v_ArrVal_2877)) |c_~#stored_elements~0.base| v_ArrVal_2878))) (let ((.cse10 (select .cse21 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_2879))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse13 (select .cse20 |c_~#queue~0.base|))) (let ((.cse17 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse16 (select .cse19 |c_~#queue~0.base|))) (let ((.cse8 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse7 (select .cse18 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse5 (store (store .cse18 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2912) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2869) (< (+ 1 (select .cse4 .cse1)) v_ArrVal_2905) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2884) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_327|) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2877) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (< (select .cse16 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse17 .cse1) 1) v_ArrVal_2891))))))))))))))))))))))) is different from false [2023-09-08 03:01:48,311 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 03:01:48,312 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 14340 treesize of output 10530 [2023-09-08 03:01:51,188 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 03:01:51,189 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 18199 treesize of output 18189 [2023-09-08 03:01:51,275 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 42 treesize of output 34 [2023-09-08 03:01:51,302 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 42 treesize of output 34 [2023-09-08 03:01:51,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 42 treesize of output 34 [2023-09-08 03:01:51,354 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 42 treesize of output 34 [2023-09-08 03:01:51,382 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 42 treesize of output 34 [2023-09-08 03:01:51,411 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 42 treesize of output 34 [2023-09-08 03:01:51,440 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 42 treesize of output 34 [2023-09-08 03:01:51,480 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 7 treesize of output 3 [2023-09-08 03:01:51,810 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 03:01:51,811 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 220 treesize of output 216 [2023-09-08 03:01:52,210 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 7 treesize of output 3 [2023-09-08 03:02:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3181 proven. 392 refuted. 161 times theorem prover too weak. 1911 trivial. 517 not checked. [2023-09-08 03:02:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464905747] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 03:02:51,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 03:02:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 54, 75] total 185 [2023-09-08 03:02:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988318398] [2023-09-08 03:02:51,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 03:02:51,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 185 states [2023-09-08 03:02:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 03:02:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2023-09-08 03:02:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4080, Invalid=19414, Unknown=802, NotChecked=9744, Total=34040 [2023-09-08 03:02:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 03:02:51,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 03:02:51,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 185 states, 185 states have (on average 6.405405405405405) internal successors, (1185), 185 states have internal predecessors, (1185), 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-09-08 03:02:51,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 03:02:51,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 03:02:51,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 03:02:51,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 03:02:51,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 03:02:51,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-08 03:02:51,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 03:04:44,127 WARN L234 SmtUtils]: Spent 37.12s on a formula simplification. DAG size of input: 991 DAG size of output: 293 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 03:04:45,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 03:05:14,263 WARN L234 SmtUtils]: Spent 21.87s on a formula simplification. DAG size of input: 818 DAG size of output: 228 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 03:05:34,440 WARN L234 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 720 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 03:05:38,728 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-09-08 03:05:58,268 WARN L234 SmtUtils]: Spent 9.12s on a formula simplification. DAG size of input: 642 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 03:06:00,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-09-08 03:06:52,301 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-09-08 03:06:52,336 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 03:06:52,336 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 03:06:52,857 WARN L266 SmtUtils]: Removed 11 from assertion stack [2023-09-08 03:06:52,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-09-08 03:06:53,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-09-08 03:06:53,058 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 882 for 37803ms.. [2023-09-08 03:06:53,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-08 03:06:53,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-08 03:06:53,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-08 03:06:53,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-09-08 03:06:53,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-08 03:06:53,063 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1] [2023-09-08 03:06:53,066 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-08 03:06:53,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-08 03:06:53,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 03:06:53 BasicIcfg [2023-09-08 03:06:53,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-08 03:06:53,068 INFO L158 Benchmark]: Toolchain (without parser) took 845568.86ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 116.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 994.2MB. Max. memory is 7.0GB. [2023-09-08 03:06:53,068 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 03:06:53,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.01ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 86.0MB in the end (delta: 30.2MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. [2023-09-08 03:06:53,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.84ms. Allocated memory is still 165.7MB. Free memory was 86.0MB in the beginning and 83.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-08 03:06:53,069 INFO L158 Benchmark]: Boogie Preprocessor took 43.69ms. Allocated memory is still 165.7MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 03:06:53,069 INFO L158 Benchmark]: RCFGBuilder took 458.75ms. Allocated memory was 165.7MB in the beginning and 235.9MB in the end (delta: 70.3MB). Free memory was 80.9MB in the beginning and 186.5MB in the end (delta: -105.6MB). Peak memory consumption was 6.9MB. Max. memory is 7.0GB. [2023-09-08 03:06:53,069 INFO L158 Benchmark]: TraceAbstraction took 844534.54ms. Allocated memory was 235.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 186.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 992.5MB. Max. memory is 7.0GB. [2023-09-08 03:06:53,070 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.10ms. Allocated memory is still 165.7MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 478.01ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 86.0MB in the end (delta: 30.2MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 46.84ms. Allocated memory is still 165.7MB. Free memory was 86.0MB in the beginning and 83.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 43.69ms. Allocated memory is still 165.7MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 458.75ms. Allocated memory was 165.7MB in the beginning and 235.9MB in the end (delta: 70.3MB). Free memory was 80.9MB in the beginning and 186.5MB in the end (delta: -105.6MB). Peak memory consumption was 6.9MB. Max. memory is 7.0GB. * TraceAbstraction took 844534.54ms. Allocated memory was 235.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 186.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 992.5MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7897, independent: 7141, independent conditional: 7141, independent unconditional: 0, dependent: 756, dependent conditional: 756, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7153, independent: 7141, independent conditional: 7141, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7153, independent: 7141, independent conditional: 7141, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7243, independent: 7141, independent conditional: 0, independent unconditional: 7141, dependent: 102, dependent conditional: 90, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7243, independent: 7141, independent conditional: 0, independent unconditional: 7141, dependent: 102, dependent conditional: 12, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7243, independent: 7141, independent conditional: 0, independent unconditional: 7141, dependent: 102, dependent conditional: 12, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 398, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 398, independent: 392, independent conditional: 0, independent unconditional: 392, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7243, independent: 6747, independent conditional: 0, independent unconditional: 6747, dependent: 98, dependent conditional: 10, dependent unconditional: 88, unknown: 398, unknown conditional: 2, unknown unconditional: 396] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 394, Positive conditional cache size: 0, Positive unconditional cache size: 394, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 78, Maximal queried relation: 13, Independence queries for same thread: 744 - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 882 for 37803ms.. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 882 for 37803ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 882 for 37803ms.. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 882 for 37803ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 844.4s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 259.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 400, 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.6s SsaConstructionTime, 96.7s SatisfiabilityAnalysisTime, 484.0s InterpolantComputationTime, 11396 NumberOfCodeBlocks, 10284 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 15689 ConstructedInterpolants, 440 QuantifiedInterpolants, 752897 SizeOfPredicates, 240 NumberOfNonLiveVariables, 9456 ConjunctsInSsa, 547 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 76523/96333 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