/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 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -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 06:40:17,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 06:40:17,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-08 06:40:17,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 06:40:17,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 06:40:17,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 06:40:17,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 06:40:17,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 06:40:17,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 06:40:17,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 06:40:17,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 06:40:17,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 06:40:17,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 06:40:17,809 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 06:40:17,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 06:40:17,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 06:40:17,810 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 06:40:17,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 06:40:17,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 06:40:17,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 06:40:17,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 06:40:17,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 06:40:17,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 06:40:17,812 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 06:40:17,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 06:40:17,812 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 06:40:17,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 06:40:17,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 06:40:17,813 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 06:40:17,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 06:40:17,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 06:40:17,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 06:40:17,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 06:40:17,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 06:40:17,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 06:40:17,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 06:40:17,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 06:40:17,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 06:40:17,817 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 06:40:17,817 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-08 06:40:17,817 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2023-09-08 06:40:18,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 06:40:18,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 06:40:18,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 06:40:18,075 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 06:40:18,075 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 06:40:18,077 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 06:40:19,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 06:40:19,375 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 06:40:19,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-09-08 06:40:19,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabb4c525/2e122aba481042cd9fae3664b02bb414/FLAGf4ac6e5f6 [2023-09-08 06:40:19,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabb4c525/2e122aba481042cd9fae3664b02bb414 [2023-09-08 06:40:19,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 06:40:19,414 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 06:40:19,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 06:40:19,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 06:40:19,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 06:40:19,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:19,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c653b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19, skipping insertion in model container [2023-09-08 06:40:19,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:19,473 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 06:40:19,831 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 06:40:19,837 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 06:40:19,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 06:40:19,857 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 06:40:19,869 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 06:40:19,871 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 06:40:19,878 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-08 06:40:19,889 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 06:40:19,891 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 06:40:19,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 06:40:19,943 INFO L206 MainTranslator]: Completed translation [2023-09-08 06:40:19,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19 WrapperNode [2023-09-08 06:40:19,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 06:40:19,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 06:40:19,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 06:40:19,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 06:40:19,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:19,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,003 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-09-08 06:40:20,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 06:40:20,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 06:40:20,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 06:40:20,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 06:40:20,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 06:40:20,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 06:40:20,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 06:40:20,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 06:40:20,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (1/1) ... [2023-09-08 06:40:20,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 06:40:20,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:20,075 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 06:40:20,079 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 06:40:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-08 06:40:20,105 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-08 06:40:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-08 06:40:20,106 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-08 06:40:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 06:40:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 06:40:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 06:40:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 06:40:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-08 06:40:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 06:40:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 06:40:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 06:40:20,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 06:40:20,109 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 06:40:20,230 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 06:40:20,232 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 06:40:20,587 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 06:40:20,599 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 06:40:20,599 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-08 06:40:20,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:40:20 BoogieIcfgContainer [2023-09-08 06:40:20,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 06:40:20,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 06:40:20,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 06:40:20,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 06:40:20,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:40:19" (1/3) ... [2023-09-08 06:40:20,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed50581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:40:20, skipping insertion in model container [2023-09-08 06:40:20,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:19" (2/3) ... [2023-09-08 06:40:20,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed50581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:40:20, skipping insertion in model container [2023-09-08 06:40:20,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:40:20" (3/3) ... [2023-09-08 06:40:20,616 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-09-08 06:40:20,624 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 06:40:20,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 06:40:20,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-08 06:40:20,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 06:40:20,749 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 06:40:20,792 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 06:40:20,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 06:40:20,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:20,795 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 06:40:20,796 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 06:40:20,831 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-08 06:40:20,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 06:40:20,842 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;@46fc55c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 06:40:20,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-08 06:40:20,891 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 06:40:20,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash -783037911, now seen corresponding path program 1 times [2023-09-08 06:40:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898228036] [2023-09-08 06:40:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:20,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:21,095 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 06:40:21,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:21,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898228036] [2023-09-08 06:40:21,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898228036] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:21,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:21,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 06:40:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305885952] [2023-09-08 06:40:21,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:21,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 06:40:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:21,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 06:40:21,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 06:40:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,156 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:21,157 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 06:40:21,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 06:40:21,284 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 06:40:21,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -446658237, now seen corresponding path program 1 times [2023-09-08 06:40:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456983460] [2023-09-08 06:40:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:21,607 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 06:40:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456983460] [2023-09-08 06:40:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456983460] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 06:40:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989361668] [2023-09-08 06:40:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:21,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 06:40:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 06:40:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 06:40:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,612 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:21,612 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 06:40:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:21,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-08 06:40:21,721 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 06:40:21,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash -63200966, now seen corresponding path program 1 times [2023-09-08 06:40:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649045304] [2023-09-08 06:40:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:21,870 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 06:40:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:21,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649045304] [2023-09-08 06:40:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649045304] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:21,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 06:40:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331194509] [2023-09-08 06:40:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:21,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 06:40:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 06:40:21,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 06:40:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,873 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:21,874 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 06:40:21,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:21,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:21,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-08 06:40:21,915 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 06:40:21,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1277973936, now seen corresponding path program 1 times [2023-09-08 06:40:21,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:21,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376239996] [2023-09-08 06:40:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:22,184 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 06:40:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:22,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376239996] [2023-09-08 06:40:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376239996] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081020070] [2023-09-08 06:40:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:22,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:22,231 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 06:40:22,233 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 06:40:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:22,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-08 06:40:22,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:22,530 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 06:40:22,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:40:22,629 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 06:40:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081020070] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:40:22,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:40:22,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-08 06:40:22,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902836511] [2023-09-08 06:40:22,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:40:22,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-08 06:40:22,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-08 06:40:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-09-08 06:40:22,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:22,638 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:22,638 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 06:40:22,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:22,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:22,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:22,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:22,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-08 06:40:22,948 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 06:40:22,948 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 06:40:22,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1463355164, now seen corresponding path program 2 times [2023-09-08 06:40:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58118000] [2023-09-08 06:40:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:23,211 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 06:40:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58118000] [2023-09-08 06:40:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58118000] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 06:40:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785653579] [2023-09-08 06:40:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:23,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 06:40:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 06:40:23,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 06:40:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:23,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:23,217 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 06:40:23,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:23,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:23,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:23,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:23,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:23,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-08 06:40:23,314 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 06:40:23,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1255792490, now seen corresponding path program 1 times [2023-09-08 06:40:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:23,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732123369] [2023-09-08 06:40:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:23,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:23,643 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 06:40:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732123369] [2023-09-08 06:40:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732123369] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321975143] [2023-09-08 06:40:23,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:23,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:23,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:23,649 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 06:40:23,673 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 06:40:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:23,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-08 06:40:23,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:23,988 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 06:40:23,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:40:24,185 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 06:40:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321975143] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:40:24,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:40:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-09-08 06:40:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177019174] [2023-09-08 06:40:24,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:40:24,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-08 06:40:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-08 06:40:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-09-08 06:40:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:24,189 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:24,190 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 06:40:24,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:24,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:24,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:24,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:24,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:24,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:24,414 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 06:40:24,611 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 06:40:24,612 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 06:40:24,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1027634242, now seen corresponding path program 2 times [2023-09-08 06:40:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538590936] [2023-09-08 06:40:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:25,280 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 06:40:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538590936] [2023-09-08 06:40:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538590936] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47902411] [2023-09-08 06:40:25,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 06:40:25,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:25,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:25,282 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 06:40:25,294 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 06:40:25,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-08 06:40:25,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 06:40:25,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-08 06:40:25,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:25,495 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 06:40:25,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-08 06:40:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47902411] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-08 06:40:25,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2023-09-08 06:40:25,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227484002] [2023-09-08 06:40:25,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:25,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 06:40:25,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:25,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 06:40:25,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-09-08 06:40:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:25,504 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:25,504 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 06:40:25,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:25,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:25,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:25,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:25,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:25,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:25,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:25,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-08 06:40:25,778 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 06:40:25,778 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 06:40:25,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash -21173911, now seen corresponding path program 1 times [2023-09-08 06:40:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94983255] [2023-09-08 06:40:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:26,416 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 06:40:26,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:26,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94983255] [2023-09-08 06:40:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94983255] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655959157] [2023-09-08 06:40:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:26,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:26,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:26,422 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 06:40:26,425 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 06:40:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:26,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-08 06:40:26,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:26,921 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 06:40:26,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:40:27,448 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 06:40:27,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655959157] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:40:27,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:40:27,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-09-08 06:40:27,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199534583] [2023-09-08 06:40:27,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:40:27,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-08 06:40:27,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-08 06:40:27,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-09-08 06:40:27,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:27,452 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:27,452 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 06:40:27,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:27,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:27,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:27,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:27,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:27,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:27,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:27,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:28,084 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 06:40:28,283 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 06:40:28,283 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 06:40:28,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash 970035481, now seen corresponding path program 2 times [2023-09-08 06:40:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961283172] [2023-09-08 06:40:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:30,127 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 06:40:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:30,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961283172] [2023-09-08 06:40:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961283172] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134931818] [2023-09-08 06:40:30,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 06:40:30,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:30,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:30,129 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 06:40:30,132 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 06:40:30,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 06:40:30,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 06:40:30,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 32 conjunts are in the unsatisfiable core [2023-09-08 06:40:30,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:31,070 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 06:40:31,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:40:32,166 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 06:40:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134931818] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:40:32,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:40:32,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2023-09-08 06:40:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162844294] [2023-09-08 06:40:32,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:40:32,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-08 06:40:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:32,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-08 06:40:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-09-08 06:40:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:32,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:32,173 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 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:32,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:40:33,096 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 06:40:33,293 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 06:40:33,294 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 06:40:33,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1046538073, now seen corresponding path program 3 times [2023-09-08 06:40:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:33,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592504933] [2023-09-08 06:40:33,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:39,166 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 06:40:39,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:39,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592504933] [2023-09-08 06:40:39,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592504933] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:39,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264210950] [2023-09-08 06:40:39,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-08 06:40:39,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:39,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:39,168 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 06:40:39,171 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 06:40:39,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-08 06:40:39,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 06:40:39,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 54 conjunts are in the unsatisfiable core [2023-09-08 06:40:39,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:42,586 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 06:40:42,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:42,657 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 06:40:42,879 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:40:42,879 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 06:40:42,925 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 06:40:42,950 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 06:40:42,975 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 06:40:42,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:40:43,393 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:40:43,393 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 06:40:43,408 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:40:43,409 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 06:40:43,428 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 06:40:43,445 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 06:40:43,501 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:40:43,501 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 06:40:44,392 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 06:40:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264210950] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:40:44,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:40:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 41 [2023-09-08 06:40:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211551590] [2023-09-08 06:40:44,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:40:44,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-09-08 06:40:44,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:44,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-09-08 06:40:44,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1437, Unknown=1, NotChecked=0, Total=1640 [2023-09-08 06:40:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:44,400 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:44,401 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 06:40:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:40:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:40:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:40:45,337 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 06:40:45,536 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 06:40:45,536 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 06:40:45,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 724881999, now seen corresponding path program 1 times [2023-09-08 06:40:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086304513] [2023-09-08 06:40:45,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:48,461 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 06:40:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:48,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086304513] [2023-09-08 06:40:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086304513] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:48,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14297154] [2023-09-08 06:40:48,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:48,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:48,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:48,463 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 06:40:48,466 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 06:40:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:48,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 42 conjunts are in the unsatisfiable core [2023-09-08 06:40:48,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:49,715 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 06:40:49,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-08 06:40:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14297154] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:49,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-08 06:40:49,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-09-08 06:40:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219300420] [2023-09-08 06:40:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:49,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-08 06:40:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-08 06:40:49,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-09-08 06:40:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:49,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:49,721 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 06:40:49,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:49,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:49,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:49,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:49,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:49,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:49,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:49,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:49,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:40:49,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:40:49,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:40:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:40:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-08 06:40:50,801 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 06:40:51,001 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 06:40:51,001 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 06:40:51,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1231800167, now seen corresponding path program 2 times [2023-09-08 06:40:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600979102] [2023-09-08 06:40:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:55,181 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 06:40:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600979102] [2023-09-08 06:40:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600979102] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668245512] [2023-09-08 06:40:55,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 06:40:55,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:55,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:55,183 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 06:40:55,187 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 06:40:55,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 06:40:55,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 06:40:55,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 78 conjunts are in the unsatisfiable core [2023-09-08 06:40:55,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:57,132 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 06:40:57,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:57,190 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 06:40:57,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:57,402 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 06:40:57,451 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 06:40:57,605 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 06:40:57,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:57,673 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 06:40:57,843 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 06:40:57,877 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 06:40:57,931 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 06:40:57,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:40:58,236 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 06:40:58,242 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 06:40:58,251 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 06:40:58,285 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 06:40:58,311 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 06:40:58,325 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 06:40:58,351 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 06:40:58,657 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:40:58,658 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 06:40:58,668 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:40:58,669 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 06:40:58,680 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 06:40:58,688 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 06:40:58,708 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 06:40:58,727 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:40:58,727 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 06:40:59,203 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 06:40:59,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668245512] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:40:59,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:40:59,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 57 [2023-09-08 06:40:59,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856172129] [2023-09-08 06:40:59,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:40:59,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-09-08 06:40:59,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-09-08 06:40:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=2078, Unknown=15, NotChecked=714, Total=3192 [2023-09-08 06:40:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:59,215 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:59,215 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 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-08 06:40:59,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-08 06:41:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 06:41:01,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-09-08 06:41:01,731 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 06:41:01,731 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 06:41:01,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:41:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -590754094, now seen corresponding path program 3 times [2023-09-08 06:41:01,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:41:01,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285052155] [2023-09-08 06:41:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:41:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:41:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:41:10,977 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 06:41:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:41:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285052155] [2023-09-08 06:41:10,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285052155] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:41:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386952942] [2023-09-08 06:41:10,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-08 06:41:10,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:41:10,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:41:10,979 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 06:41:10,982 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 06:42:33,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-09-08 06:42:33,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 06:42:33,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 139 conjunts are in the unsatisfiable core [2023-09-08 06:42:33,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:42:35,825 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 06:42:35,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:35,894 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 06:42:36,116 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:42:36,116 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 06:42:36,183 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 06:42:36,394 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 06:42:36,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:36,464 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 06:42:36,689 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:42:36,690 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 06:42:36,774 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 06:42:37,010 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 06:42:37,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:37,101 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 06:42:37,393 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:42:37,393 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 06:42:37,475 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 06:42:37,698 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 06:42:37,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:37,782 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 06:42:37,955 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:42:37,955 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 06:42:37,985 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 06:42:38,007 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 06:42:38,034 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 06:42:38,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:42:38,247 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 06:42:38,308 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 06:42:38,313 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 06:42:38,331 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 06:42:38,398 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 06:42:38,430 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 06:42:38,444 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 06:42:38,464 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 06:42:38,588 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 06:42:38,647 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 06:42:38,733 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 06:42:38,920 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 06:42:38,988 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 06:42:39,015 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 06:42:39,053 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 06:42:39,318 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 06:42:39,540 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 06:42:39,836 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 06:42:39,895 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 06:42:39,980 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 06:42:40,019 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 06:42:40,088 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 06:42:40,577 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 06:42:40,722 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:42:40,722 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 06:42:40,757 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:42:40,757 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 06:42:40,778 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 06:42:40,792 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 06:42:40,803 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 06:42:40,817 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 06:42:40,846 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 06:42:40,892 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:42:40,892 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 06:42:46,306 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 06:42:46,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386952942] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:42:46,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:42:46,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 46] total 105 [2023-09-08 06:42:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708035426] [2023-09-08 06:42:46,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:42:46,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2023-09-08 06:42:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:42:46,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2023-09-08 06:42:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=5413, Unknown=94, NotChecked=4186, Total=10920 [2023-09-08 06:42:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:46,314 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:42:46,315 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 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:42:46,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:42:46,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-08 06:42:46,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 06:42:46,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-08 06:42:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-08 06:42:58,811 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 06:42:58,991 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 06:42:58,991 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 06:42:58,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:42:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash 910595484, now seen corresponding path program 4 times [2023-09-08 06:42:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:42:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214724334] [2023-09-08 06:42:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:42:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:42:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:43:19,384 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 06:43:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:43:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214724334] [2023-09-08 06:43:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214724334] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:43:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260879671] [2023-09-08 06:43:19,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-08 06:43:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:43:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:43:19,387 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 06:43:19,388 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 06:43:30,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-08 06:43:30,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 06:43:30,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 169 conjunts are in the unsatisfiable core [2023-09-08 06:43:30,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:43:31,018 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 06:43:31,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:31,077 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 06:43:31,331 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:31,331 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 06:43:31,389 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 06:43:31,609 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 06:43:31,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:31,669 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 06:43:31,874 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:31,874 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 06:43:31,915 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 06:43:32,073 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 06:43:32,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:32,130 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 06:43:32,349 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:32,350 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 06:43:32,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 19 treesize of output 18 [2023-09-08 06:43:32,571 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 06:43:32,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:32,635 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 06:43:32,853 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:32,853 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 06:43:32,893 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 06:43:33,054 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 06:43:33,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:33,121 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 06:43:33,359 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:33,360 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 06:43:33,413 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 06:43:33,627 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 06:43:33,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:33,718 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 06:43:34,014 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:34,015 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 06:43:34,054 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 06:43:34,229 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 06:43:34,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:34,298 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 06:43:34,549 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:34,550 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 06:43:34,605 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 06:43:34,796 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 06:43:34,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:43:34,881 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 06:43:35,107 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-08 06:43:35,107 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 06:43:35,139 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 06:43:35,165 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 06:43:35,194 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 06:43:35,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:43:35,413 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2023-09-08 06:45:00,670 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 06:45:16,609 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_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 ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .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) |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 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|))))))))) is different from false [2023-09-08 06:45:16,792 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 06:45:16,834 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 06:45:16,874 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 06:45:19,178 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 06:45:19,230 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 06:45:19,317 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 06:45:37,094 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_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 |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_2894)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |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 .cse8 .cse7 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |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 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2897) (< (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) 1) v_ArrVal_2905) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2912)))))))))))) is different from false [2023-09-08 06:45:38,047 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) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2891) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2897)))))))))))) is different from false [2023-09-08 06:45:38,110 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 06:45:43,620 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 06:45:43,728 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 06:45:43,856 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 06:46:01,005 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_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 |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |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 .cse6 .cse10 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |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_318|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2891) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2905) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2897) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2910) .cse1 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2912))))))))))))))) is different from false [2023-09-08 06:46:01,466 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 06:46:01,567 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) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2884) (< (+ (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 06:46:01,657 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 06:46:02,138 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 06:46:02,496 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_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 (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_2879)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2882) .cse5 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse0 (select .cse15 |c_~#queue~0.base|))) (let ((.cse10 (store .cse0 (+ (* |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 .cse10 .cse9 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse11 (+ (* |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 .cse6 .cse9 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse7 (+ (* |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 .cse12 .cse9 v_ArrVal_2903) .cse1 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |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_318|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2912) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2884) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2897) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .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) 1) v_ArrVal_2891) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2905)))))))))))))))) is different from false [2023-09-08 06:46:02,675 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 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_321|) (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_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 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2879))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_2886)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2888) .cse3 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |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 .cse6 .cse12 v_ArrVal_2896) .cse3 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312| 4) |c_~#queue~0.offset|) v_ArrVal_2901))) (let ((.cse10 (store (store .cse14 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2903) .cse3 v_ArrVal_2905)) |c_~#stored_elements~0.base| v_ArrVal_2906))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309| 4) |c_~#queue~0.offset|) v_ArrVal_2907))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_2891) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_312|) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2897) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2884) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2905) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_2910) .cse3 v_ArrVal_2912)) |c_~#stored_elements~0.base| v_ArrVal_2913) |c_~#queue~0.base|) .cse3) 20) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_309|) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2912))))))))))))))))))) is different from false [2023-09-08 06:46:02,863 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 06:46:37,143 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 06:46:37,258 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|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2877) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2912) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318|) (< (+ 1 (select .cse12 .cse1)) v_ArrVal_2897)))))))))))))))))) is different from false [2023-09-08 06:46:37,374 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 06:46:37,968 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 06:46:38,410 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 06:46:38,613 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 06:46:38,992 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 06:47:18,664 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) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2869) (< (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) (< (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 06:47:19,533 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 ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse15 .cse16 v_ArrVal_2869)) |c_~#stored_elements~0.base| v_ArrVal_2871))) (let ((.cse14 (select .cse21 |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 ((.cse20 (store (store .cse21 |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 .cse20 |c_~#queue~0.base|))) (let ((.cse11 (store .cse13 (+ (* |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 .cse11 .cse5 v_ArrVal_2882) .cse1 v_ArrVal_2884)) |c_~#stored_elements~0.base| v_ArrVal_2885))) (let ((.cse3 (select .cse19 |c_~#queue~0.base|))) (let ((.cse10 (store .cse3 (+ (* |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 .cse10 .cse5 v_ArrVal_2888) .cse1 v_ArrVal_2891)) |c_~#stored_elements~0.base| v_ArrVal_2892))) (let ((.cse7 (select .cse18 |c_~#queue~0.base|))) (let ((.cse12 (store .cse7 (+ (* |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 .cse12 .cse5 v_ArrVal_2896) .cse1 v_ArrVal_2897)) |c_~#stored_elements~0.base| v_ArrVal_2899))) (let ((.cse8 (select .cse17 |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 .cse17 |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) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321|) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324|) (< (+ (select .cse15 .cse16) 1) v_ArrVal_2869)))))))))))))))))))))) is different from false [2023-09-08 06:47:20,344 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 06:47:20,898 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 06:47:21,089 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 06:47:21,474 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 06:48:13,014 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:48:13,015 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 06:48:16,067 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:48:16,068 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 06:48:16,165 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 06:48:16,193 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 06:48:16,220 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 06:48:16,248 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 06:48:16,282 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 06:48:16,325 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 06:48:16,368 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 06:48:16,419 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 06:48:16,866 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:48:16,867 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 06:48:17,331 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 06:49:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3181 proven. 363 refuted. 92 times theorem prover too weak. 1911 trivial. 615 not checked. [2023-09-08 06:49:06,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260879671] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:49:06,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:49:06,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 54, 75] total 185 [2023-09-08 06:49:06,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603156898] [2023-09-08 06:49:06,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:49:06,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 185 states [2023-09-08 06:49:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:49:06,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2023-09-08 06:49:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=17946, Unknown=472, NotChecked=11844, Total=34040 [2023-09-08 06:49:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:49:06,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:49:06,487 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 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 06:49:06,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-08 06:49:06,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-08 06:49:06,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-08 06:49:06,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:50:14,071 WARN L234 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 556 DAG size of output: 165 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:50:29,040 WARN L234 SmtUtils]: Spent 9.79s on a formula simplification. DAG size of input: 745 DAG size of output: 271 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:50:43,730 WARN L234 SmtUtils]: Spent 9.51s on a formula simplification. DAG size of input: 664 DAG size of output: 255 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:51:45,457 WARN L234 SmtUtils]: Spent 21.29s on a formula simplification. DAG size of input: 709 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:52:25,472 WARN L234 SmtUtils]: Spent 24.64s on a formula simplification. DAG size of input: 581 DAG size of output: 142 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:53:23,647 WARN L234 SmtUtils]: Spent 36.06s on a formula simplification. DAG size of input: 691 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:53:47,409 WARN L234 SmtUtils]: Spent 16.27s on a formula simplification. DAG size of input: 722 DAG size of output: 146 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-09-08 06:53:54,816 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 06:53:54,816 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 06:53:54,816 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 06:53:55,091 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 06:53:55,279 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 06:53:55,280 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 263 known predicates. [2023-09-08 06:53:55,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-08 06:53:55,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-08 06:53:55,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-08 06:53:55,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-09-08 06:53:55,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-08 06:53:55,288 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1] [2023-09-08 06:53:55,298 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-08 06:53:55,298 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-08 06:53:55,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:53:55 BasicIcfg [2023-09-08 06:53:55,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-08 06:53:55,300 INFO L158 Benchmark]: Toolchain (without parser) took 815886.71ms. Allocated memory was 232.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 180.7MB in the beginning and 731.4MB in the end (delta: -550.7MB). Peak memory consumption was 860.1MB. Max. memory is 7.0GB. [2023-09-08 06:53:55,301 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 164.6MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 06:53:55,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.52ms. Allocated memory is still 232.8MB. Free memory was 180.7MB in the beginning and 150.8MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. [2023-09-08 06:53:55,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 232.8MB. Free memory was 150.3MB in the beginning and 147.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-08 06:53:55,301 INFO L158 Benchmark]: Boogie Preprocessor took 36.32ms. Allocated memory is still 232.8MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 06:53:55,301 INFO L158 Benchmark]: RCFGBuilder took 560.74ms. Allocated memory is still 232.8MB. Free memory was 145.5MB in the beginning and 124.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 7.0GB. [2023-09-08 06:53:55,301 INFO L158 Benchmark]: TraceAbstraction took 814696.84ms. Allocated memory was 232.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 123.0MB in the beginning and 731.4MB in the end (delta: -608.4MB). Peak memory consumption was 802.5MB. Max. memory is 7.0GB. [2023-09-08 06:53:55,302 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.16ms. Allocated memory is still 164.6MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 528.52ms. Allocated memory is still 232.8MB. Free memory was 180.7MB in the beginning and 150.8MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 232.8MB. Free memory was 150.3MB in the beginning and 147.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 36.32ms. Allocated memory is still 232.8MB. Free memory was 147.6MB in the beginning and 145.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 560.74ms. Allocated memory is still 232.8MB. Free memory was 145.5MB in the beginning and 124.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 7.0GB. * TraceAbstraction took 814696.84ms. Allocated memory was 232.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 123.0MB in the beginning and 731.4MB in the end (delta: -608.4MB). Peak memory consumption was 802.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 IndependenceRelationWithAbstraction.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 76, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 182, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 2, Independence queries for same thread: 23, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 248, independent: 230, independent conditional: 230, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 229, Positive conditional cache size: 0, Positive unconditional cache size: 229, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 3, Independence queries for same thread: 40, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 317, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 235, Positive conditional cache size: 0, Positive unconditional cache size: 235, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 4, Independence queries for same thread: 64, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 218, independent: 194, independent conditional: 194, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 337, Positive conditional cache size: 0, Positive unconditional cache size: 337, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 5, Independence queries for same thread: 87, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 364, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 337, Positive conditional cache size: 0, Positive unconditional cache size: 337, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 6, Independence queries for same thread: 126, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 447, independent: 406, independent conditional: 406, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 420, Positive conditional cache size: 0, Positive unconditional cache size: 420, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 7, Independence queries for same thread: 166, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 743, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 420, Positive conditional cache size: 0, Positive unconditional cache size: 420, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 8, Independence queries for same thread: 238, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 928, independent: 835, independent conditional: 835, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 420, Positive conditional cache size: 0, Positive unconditional cache size: 420, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 9, Independence queries for same thread: 330, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1005, independent: 908, independent conditional: 908, independent unconditional: 0, dependent: 97, dependent conditional: 97, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 475, Positive conditional cache size: 0, Positive unconditional cache size: 475, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 10, Independence queries for same thread: 426, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 968, independent: 875, independent conditional: 875, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 475, Positive conditional cache size: 0, Positive unconditional cache size: 475, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 65, Maximal queried relation: 11, Independence queries for same thread: 518, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 988, independent: 895, independent conditional: 895, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 481, Positive conditional cache size: 0, Positive unconditional cache size: 481, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 12, Independence queries for same thread: 610, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 996, independent: 903, independent conditional: 903, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 481, Positive conditional cache size: 0, Positive unconditional cache size: 481, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 13, Independence queries for same thread: 702, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 420, independent: 378, independent conditional: 378, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7903, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7159, independent: 7147, independent conditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, 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: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7249, independent: 7147, independent conditional: 0, independent unconditional: 7147, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7249, independent: 6666, independent conditional: 0, independent unconditional: 6666, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 481, Positive conditional cache size: 0, Positive unconditional cache size: 481, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 13, Independence queries for same thread: 744, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 263 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 263 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 263 known predicates. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 263 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 814.5s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 307.7s, 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: 404, 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.7s SsaConstructionTime, 95.7s SatisfiabilityAnalysisTime, 406.2s 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