/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longer.line754.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:42:26,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:42:26,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:42:26,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:42:26,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:42:26,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:42:26,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:42:26,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:42:26,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:42:26,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:42:26,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:42:26,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:42:26,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:42:26,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:42:26,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:42:26,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:42:26,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:42:26,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:42:26,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:42:26,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:42:26,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:42:26,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:42:26,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:42:26,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:42:26,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:42:26,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:42:26,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:42:26,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:42:26,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:42:26,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:42:26,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:42:26,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:42:26,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:42:26,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:42:26,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:42:26,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:42:26,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:42:26,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:42:26,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:42:26,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:42:26,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:42:26,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:42:26,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:42:26,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:42:26,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:42:26,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:42:26,948 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:42:26,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:42:26,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:42:26,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:42:26,949 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:42:26,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:42:26,949 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:42:26,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:42:26,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:42:26,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:42:26,952 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:42:26,953 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:42:26,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:42:26,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:42:26,953 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:42:26,953 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:42:26,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:42:26,953 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-04 00:42:27,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:42:27,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:42:27,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:42:27,156 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:42:27,158 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:42:27,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longer.line754.bpl [2022-10-04 00:42:27,159 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longer.line754.bpl' [2022-10-04 00:42:27,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:42:27,204 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:42:27,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:42:27,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:42:27,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:42:27,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:42:27,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:42:27,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:42:27,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:42:27,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/1) ... [2022-10-04 00:42:27,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:42:27,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:42:27,334 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) [2022-10-04 00:42:27,366 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 [2022-10-04 00:42:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:42:27,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:42:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:42:27,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:42:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:42:27,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:42:27,405 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:42:27,573 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:42:27,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:42:28,034 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:42:28,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:42:28,048 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:42:28,050 INFO L202 PluginConnector]: Adding new model queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:28 BoogieIcfgContainer [2022-10-04 00:42:28,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:42:28,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:42:28,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:42:28,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:42:28,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:27" (1/2) ... [2022-10-04 00:42:28,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb02eb7 and model type queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:42:28, skipping insertion in model container [2022-10-04 00:42:28,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:28" (2/2) ... [2022-10-04 00:42:28,057 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.line754.bpl [2022-10-04 00:42:28,062 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:42:28,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:42:28,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:42:28,069 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:42:28,184 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:42:28,226 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:42:28,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:42:28,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:42:28,228 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) [2022-10-04 00:42:28,244 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 [2022-10-04 00:42:28,267 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:42:28,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:42:28,287 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;@dbac296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:42:28,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:42:28,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:42:28,376 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:42:28,377 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:42:28,384 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:42:28,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:42:28,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:42:28,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:42:28,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-04 00:42:28,389 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:42:28,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:42:28,391 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;@dbac296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:42:28,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:42:28,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:42:28,862 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:42:28,862 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:42:28,867 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:42:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:42:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:42:28,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:42:28,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-04 00:42:28,919 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:42:28,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:42:28,920 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;@dbac296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:42:28,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:42:28,921 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:42:28,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:42:28,921 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:42:28,922 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:42:28,926 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:42:28,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:42:28,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:42:28,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:42:28,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-04 00:42:28,936 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:42:28,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:42:28,938 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;@dbac296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:42:28,938 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:42:29,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1817190746, now seen corresponding path program 1 times [2022-10-04 00:42:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:29,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046518339] [2022-10-04 00:42:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:42:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:29,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046518339] [2022-10-04 00:42:29,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046518339] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:29,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:29,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:42:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710568613] [2022-10-04 00:42:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:29,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:42:29,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:29,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:42:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:42:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:29,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:29,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 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) [2022-10-04 00:42:29,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:29,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:42:29,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash -621438259, now seen corresponding path program 1 times [2022-10-04 00:42:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:29,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883882945] [2022-10-04 00:42:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:42:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:29,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883882945] [2022-10-04 00:42:29,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883882945] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:29,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:29,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 00:42:29,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353557870] [2022-10-04 00:42:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:29,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 00:42:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 00:42:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 00:42:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:29,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:29,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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) [2022-10-04 00:42:29,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:29,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:30,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:42:30,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1381408853, now seen corresponding path program 1 times [2022-10-04 00:42:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:30,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453964682] [2022-10-04 00:42:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:42:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:30,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453964682] [2022-10-04 00:42:30,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453964682] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:30,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:30,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:42:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665109762] [2022-10-04 00:42:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:30,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:42:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:42:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:42:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:30,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:30,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:42:30,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:30,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:30,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:31,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:42:31,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1143628880, now seen corresponding path program 1 times [2022-10-04 00:42:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:31,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141665695] [2022-10-04 00:42:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-10-04 00:42:31,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:31,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141665695] [2022-10-04 00:42:31,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141665695] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:31,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:31,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:42:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629273669] [2022-10-04 00:42:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:31,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:42:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:31,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:42:31,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:42:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:31,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:31,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 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) [2022-10-04 00:42:31,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:31,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:31,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:31,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:31,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-04 00:42:31,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1084552452, now seen corresponding path program 2 times [2022-10-04 00:42:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:31,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791597165] [2022-10-04 00:42:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:42:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791597165] [2022-10-04 00:42:32,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791597165] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:32,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:32,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:42:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507768593] [2022-10-04 00:42:32,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:32,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:42:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:32,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:42:32,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:42:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:32,067 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:32,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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) [2022-10-04 00:42:32,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:32,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:32,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:32,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:32,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:42:32,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-04 00:42:32,322 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2077419964, now seen corresponding path program 1 times [2022-10-04 00:42:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:32,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033485159] [2022-10-04 00:42:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:42:33,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033485159] [2022-10-04 00:42:33,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033485159] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:33,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:33,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-10-04 00:42:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752981660] [2022-10-04 00:42:33,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:33,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-04 00:42:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-04 00:42:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-10-04 00:42:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:33,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:33,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 22.954545454545453) internal successors, (505), 22 states have internal predecessors, (505), 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) [2022-10-04 00:42:33,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:33,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:33,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:33,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:33,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:42:33,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:42:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:42:34,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-04 00:42:34,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash -906844975, now seen corresponding path program 1 times [2022-10-04 00:42:34,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:34,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197460527] [2022-10-04 00:42:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:42:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197460527] [2022-10-04 00:42:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197460527] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:36,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:36,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-10-04 00:42:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763020196] [2022-10-04 00:42:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:36,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-04 00:42:36,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:36,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-04 00:42:36,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1828, Unknown=0, NotChecked=0, Total=1980 [2022-10-04 00:42:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:36,436 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:36,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 11.466666666666667) internal successors, (516), 45 states have internal predecessors, (516), 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) [2022-10-04 00:42:36,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:36,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:36,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:36,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:36,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:42:36,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:42:36,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:42:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:42:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:42:43,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-04 00:42:43,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash -628061619, now seen corresponding path program 1 times [2022-10-04 00:42:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:43,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284146864] [2022-10-04 00:42:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:43,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:42:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:42:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:42:45,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284146864] [2022-10-04 00:42:45,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284146864] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:42:45,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:42:45,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-04 00:42:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054725399] [2022-10-04 00:42:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:42:45,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-04 00:42:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:42:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-04 00:42:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3528, Unknown=0, NotChecked=0, Total=3782 [2022-10-04 00:42:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:45,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:42:45,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 8.32258064516129) internal successors, (516), 62 states have internal predecessors, (516), 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) [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:42:45,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:42:58,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-04 00:42:58,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:42:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:42:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1809678632, now seen corresponding path program 1 times [2022-10-04 00:42:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:42:58,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401590188] [2022-10-04 00:42:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:42:58,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:42:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:43:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:43:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:43:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401590188] [2022-10-04 00:43:12,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401590188] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:43:12,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141483108] [2022-10-04 00:43:12,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:43:12,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:43:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:43:12,556 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) [2022-10-04 00:43:12,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-04 00:43:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:43:12,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 225 conjunts are in the unsatisfiable core [2022-10-04 00:43:12,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:43:13,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:43:13,570 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:43:13,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-10-04 00:43:14,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-04 00:43:14,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:14,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:43:16,408 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:43:16,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2022-10-04 00:43:16,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:43:16,871 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:43:16,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 38 [2022-10-04 00:43:16,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:43:19,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:19,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:19,764 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:43:19,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-10-04 00:43:20,137 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:43:20,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-10-04 00:43:20,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:20,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:20,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:20,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-04 00:43:21,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-10-04 00:43:21,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:21,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-10-04 00:43:22,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:22,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:22,859 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:43:22,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-10-04 00:43:23,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:23,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:23,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-04 00:43:23,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:23,905 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:43:23,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-10-04 00:43:24,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:24,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:43:24,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:43:24,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:43:24,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:43:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-04 00:43:25,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:43:35,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (not (= 400 (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2022-10-04 00:43:35,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int)) (or (forall ((v_ArrVal_508 (Array Int Int))) (not (= (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:43:35,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int))) (or (not (= 400 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:43:35,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int)) (or (not (= 400 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:43:35,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:43:35,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:43:35,543 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:35,562 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_read~int_#value#1|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:35,573 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:35,610 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:35,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_504)))) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (= (select .cse0 .cse1) 400) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= (select (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)))))) is different from false [2022-10-04 00:43:35,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse1 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:35,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (= 400 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:35,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_502)))) (let ((.cse2 (store (select .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= (select (select (store (store .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= (select .cse2 .cse0) 400))))) is different from false [2022-10-04 00:43:35,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 400 (select .cse0 .cse1)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= 400 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))) is different from false [2022-10-04 00:43:35,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 400 (select .cse0 .cse1)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:36,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:36,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 400 (select .cse0 .cse1)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:43:36,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (store (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse2 (+ (* (select .cse2 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:36,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (store (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (= 400 (select .cse0 .cse1)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:36,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (store (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse1 .cse0)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:36,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:37,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse1 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse3 (select .cse1 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse2 .cse0)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:43:37,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse1 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse3 (select .cse1 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 400 (select .cse2 .cse0)))))) is different from false [2022-10-04 00:43:37,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse1 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_write~int_#value#1|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse3 (select .cse1 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse2 .cse0)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:37,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse0) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#value#1_48| (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:37,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#value#1_48| (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:37,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:37,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:37,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:43:37,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse1 .cse0)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:43:38,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (v_ArrVal_497 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse6 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_497)))) (let ((.cse2 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse0 (store (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 400 (select .cse0 .cse1)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (< (+ (select .cse2 .cse3) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))))) is different from false [2022-10-04 00:43:38,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse3 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse0 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (= 400 (select .cse0 .cse1)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (< (+ (select .cse3 .cse4) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:43:38,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ (select .cse1 .cse2) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 400 (select .cse4 .cse0))))))) is different from false [2022-10-04 00:43:53,385 INFO L356 Elim1Store]: treesize reduction 113, result has 45.1 percent of original size [2022-10-04 00:43:53,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 968 treesize of output 724 [2022-10-04 00:43:53,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:43:53,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2275 treesize of output 2261 [2022-10-04 00:43:53,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 894 treesize of output 830 [2022-10-04 00:43:53,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1858 treesize of output 1810 [2022-10-04 00:43:53,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1604 treesize of output 1412 [2022-10-04 00:43:53,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:53,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1848 treesize of output 1824 [2022-10-04 00:43:54,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-10-04 00:43:55,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-10-04 00:43:56,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:56,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:56,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:56,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:56,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:43:56,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:43:56,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 500 treesize of output 466 [2022-10-04 00:44:02,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 185 treesize of output 179 [2022-10-04 00:44:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 00:44:03,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141483108] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:44:03,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:44:03,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 80, 85] total 243 [2022-10-04 00:44:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226388006] [2022-10-04 00:44:03,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:44:03,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 243 states [2022-10-04 00:44:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:44:03,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2022-10-04 00:44:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=41972, Unknown=171, NotChecked=15198, Total=58806 [2022-10-04 00:44:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:44:03,269 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:44:03,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 243 states, 243 states have (on average 5.893004115226337) internal successors, (1432), 243 states have internal predecessors, (1432), 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) [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:44:03,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:31,984 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse31 (@diff .cse30 .cse1))) (let ((.cse11 (store .cse30 .cse31 0))) (let ((.cse12 (@diff .cse11 .cse1)) (.cse41 (+ |c_~#queue~0.offset| 1604))) (let ((.cse39 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse42 (select .cse30 .cse41)) (.cse2 (store .cse11 .cse12 0)) (.cse40 (+ 1600 |c_~#queue~0.offset|)) (.cse43 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse27 (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse5 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (.cse29 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse9 (select .cse10 1604)) (.cse0 (+ (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse29) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select .cse5 1604)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse25 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (.cse6 (<= .cse27 4)) (.cse8 (select .cse43 .cse41)) (.cse26 (select .cse43 .cse40)) (.cse3 (@diff .cse2 .cse1)) (.cse21 (select |c_#length| |c_~#queue~0.base|)) (.cse22 (+ |c_ULTIMATE.start_init_~q#1.offset| 1604)) (.cse23 (= .cse42 0)) (.cse24 (= (select .cse30 .cse40) .cse42)) (.cse32 (select .cse39 .cse41)) (.cse28 (select .cse39 .cse40))) (and (= .cse0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= .cse1 (store .cse2 .cse3 0)) (= .cse4 (select .cse5 1600)) .cse6 (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= .cse7 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= .cse8 1) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (= .cse9 0) (<= 0 |c_~#queue~0.offset|) (= (select .cse10 1600) .cse9) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (= .cse1 .cse11) (<= .cse12 1600) (<= 1608 .cse12)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| .cse0) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (v_ArrVal_508 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| Int)) (let ((.cse20 (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_494))) (let ((.cse13 (select .cse20 |c_~#queue~0.base|))) (let ((.cse17 (store (store .cse13 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70| v_ArrVal_495) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse14 (+ |c_~#queue~0.offset| 1604))) (let ((.cse15 (store (store .cse20 |c_~#queue~0.base| (store .cse17 .cse14 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse16 (store (let ((.cse19 (select .cse15 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse14) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse18 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ |c_~#queue~0.offset| (* (select .cse13 .cse14) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_70|) (not (<= .cse14 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse15 |c_~#queue~0.base| (store .cse16 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (= 400 (select .cse16 .cse14)) (< (+ (select .cse17 .cse14) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= .cse18 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= .cse18 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))))))) (< .cse21 (+ |c_~#queue~0.offset| 1612))) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse22) 0) .cse23 .cse24 (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse25 (= .cse4 0) (<= .cse7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= .cse26 0) (or .cse25 (and .cse6 (not (= .cse27 4)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0))) (= .cse28 0) (= (select .cse10 .cse29) 0) (= (select .cse30 1604) (select .cse30 1600)) (= .cse8 0) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (or (<= 1608 .cse31) (<= .cse31 1600) (= .cse1 .cse30)) (= .cse32 0) (exists ((|ULTIMATE.start_read~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_read~int_#ptr#1.base|) 4)) (= 7 |c_~#queue~0.base|) (= .cse8 .cse26) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse34 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse35 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse33 (+ |c_~#queue~0.offset| 1604)) (.cse36 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse34 .cse35 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse37 (store (let ((.cse38 (select .cse36 |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse33) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= .cse33 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ (select .cse34 .cse35) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (= 400 (select (select (store (store .cse36 |c_~#queue~0.base| (store .cse37 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 400 (select .cse37 .cse33))))))) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (or (<= .cse3 1600) (= .cse1 .cse2) (<= 1608 .cse3)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (not (= .cse21 .cse27)) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse22) 0) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) (or (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) (and .cse23 .cse24)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= .cse32 .cse28) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))))))) is different from false [2022-10-04 00:45:31,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select .cse1 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= .cse0 0) (<= 0 |c_~#queue~0.offset|) (= (select .cse1 1600) .cse0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 0) (= (select .cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse6 (store (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (< (+ (select .cse3 .cse4) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 400 (select .cse6 .cse2))))))) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 00:45:32,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse7 (select .cse0 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 0) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse4 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse1 (store (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (= 400 (select .cse1 .cse2)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (< (+ (select .cse4 .cse5) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))))) (= .cse7 0) (= (select .cse0 1600) .cse7) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 00:45:39,685 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse20 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse1 (select .cse20 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 1600 |c_~#queue~0.offset|)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse11 (select .cse20 1600)) (.cse12 (select .cse20 1604)) (.cse0 (select .cse7 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|))) (and (<= (* |c_t1Thread1of1ForFork1_write~int_#value#1| 4) 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| (+ .cse0 1)) (= .cse1 0) (<= 0 |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| .cse1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (* (select .cse2 1604) 4) 4) (= |c_~#queue~0.offset| 0) (not (= 400 (select .cse2 1600))) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| 1604) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 400 (select .cse5 .cse3)))))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse7 .cse8) 0) (<= 1604 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select .cse9 .cse8) 0) (<= (select .cse9 .cse10) 1) (= 7 |c_~#queue~0.base|) (not (= 400 .cse11)) (= .cse10 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= .cse12 0) (not (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1600))) (not (= 1600 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 0) (= .cse11 .cse12) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (|v_t1Thread1of1ForFork1_write~int_#value#1_48| Int) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (v_ArrVal_508 (Array Int Int))) (let ((.cse19 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_495)))) (let ((.cse13 (store (select .cse19 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69| v_ArrVal_497)) (.cse14 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (+ |c_~#queue~0.offset| 1604)) (.cse17 (store (store .cse19 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse13 .cse14 |v_t1Thread1of1ForFork1_write~int_#value#1_48|)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse16 (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse15) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_69|)) (< (+ (select .cse13 .cse14) 1) |v_t1Thread1of1ForFork1_write~int_#value#1_48|) (not (<= .cse15 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse16 .cse15)) (not (= 400 (select (select (store (store .cse17 |c_~#queue~0.base| (store .cse16 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))))) (< (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (<= |c_~#stored_elements~0.base| 6) (= .cse0 0)))) is different from false [2022-10-04 00:45:39,691 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse3 (store (let ((.cse4 (select .cse2 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= 400 (select .cse3 .cse1)))))) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (<= 0 |c_~#queue~0.offset|) (<= (* (select .cse0 1604) 4) 4) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| v_ArrVal_501))) (let ((.cse3 (store (let ((.cse4 (select .cse2 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse3 .cse1)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_87| |c_~#stored_elements~0.base|)))) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,707 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (<= 0 |c_~#queue~0.offset|) (<= (* (select .cse0 1604) 4) 4) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_501))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse2 .cse1)) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#stored_elements~0.base|) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|)) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse2 .cse1)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,717 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse2 .cse1)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.base| |c_~#queue~0.base|))) is different from false [2022-10-04 00:45:39,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork1_empty_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse2 .cse1)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,881 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= (select .cse0 1600) 400)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= (* (select .cse0 1604) 4) 4) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse1 (store (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (= 400 (select .cse1 .cse2)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= (select .cse4 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse4 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,887 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (* (select .cse0 1604) 4) 4) (= |c_~#queue~0.offset| 0) (not (= 400 (select .cse0 1600))) (= (select .cse1 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse3 .cse2)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,892 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1600))) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 400 (select .cse1 .cse2)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,898 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (<= (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) 4) (= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select .cse0 1600))) (= (select .cse1 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse3 .cse2)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select .cse0 1600))) (= (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (= (select .cse1 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 4) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 400 (select .cse2 .cse3)) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:45:39,906 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_502) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (= 400 (select .cse0 .cse1)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= 400 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse2 (+ |c_~#queue~0.offset| 1604)) 1) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select .cse2 (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (not (= 400 (select .cse3 1600))) (= (select .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= |c_~#stored_elements~0.base| 6) (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 4))) is different from false [2022-10-04 00:45:39,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= (+ (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (not (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1600))) (not (= 1600 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int) (v_ArrVal_502 Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_502)))) (let ((.cse3 (store (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= (select (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (= (select .cse3 .cse1) 400))))))) is different from false [2022-10-04 00:45:39,916 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1600))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (= 400 (select .cse1 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= (select .cse2 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse2 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,924 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (not (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1600))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse2 (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65| v_ArrVal_504))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (= 400 (select .cse2 .cse1)) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_65|)) (not (= 400 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,929 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_504 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (let ((.cse3 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_504)))) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (= (select .cse1 .cse2) 400) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)) (not (= (select (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)))))) (= 7 |c_~#queue~0.base|) (not (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1600))) (not (= 1600 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,933 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select .cse0 1600))) (or (= 400 (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= (select .cse1 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,938 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1600))) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:45:39,943 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select .cse0 1600))) (= (select .cse1 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 1) (or (= 400 |c_t1Thread1of1ForFork1_read~int_#value#1|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,946 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select .cse0 1600))) (= (select .cse1 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,950 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1600))) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:39,957 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| Int)) (or (not (= 400 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64| v_ArrVal_507)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_64|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (not (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:40,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 .cse1) 1) (<= 0 |c_~#queue~0.offset|) (<= (* (select .cse0 1604) 4) 4) (= |c_~#queue~0.offset| 0) (= (select .cse0 .cse2) 0) (= (select .cse3 .cse2) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int))) (or (not (= 400 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (not (= 400 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1600))) (not (= 400 (select .cse3 1600))) (not (= 1600 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|)) (not (= 400 (select .cse0 1600))) (<= .cse1 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:40,682 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int) (v_ArrVal_508 (Array Int Int))) (or (not (= 400 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:40,688 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| Int)) (or (forall ((v_ArrVal_508 (Array Int Int))) (not (= (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| v_ArrVal_508) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_83| |c_~#stored_elements~0.base|)))) (= |c_~#queue~0.offset| 0) (= (select .cse0 (+ 1600 |c_~#queue~0.offset|)) 0) (= 7 |c_~#queue~0.base|) (not (= 400 (select .cse0 1600))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:45:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:45:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-04 00:45:46,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-04 00:45:47,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:45:47,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:45:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:45:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1284917185, now seen corresponding path program 1 times [2022-10-04 00:45:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:45:47,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560954610] [2022-10-04 00:45:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:45:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:45:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:45:48,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560954610] [2022-10-04 00:45:48,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560954610] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:45:48,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242335825] [2022-10-04 00:45:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:45:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:45:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:45:48,499 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) [2022-10-04 00:45:48,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-04 00:45:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:45:48,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 56 conjunts are in the unsatisfiable core [2022-10-04 00:45:48,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:45:49,134 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:45:49,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-10-04 00:45:49,435 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-10-04 00:45:49,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 21 treesize of output 42 [2022-10-04 00:45:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:45:54,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:46:03,788 WARN L233 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 23 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:46:07,974 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 Int)) (or (forall ((v_ArrVal_620 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_subst_2 Int)) (let ((.cse0 (select (store (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_619) v_subst_2 v_ArrVal_620) |c_~#stored_elements~0.base|))) (or (< .cse0 (+ |c_~#stored_elements~0.offset| 8)) (< 4 v_ArrVal_620) (< (+ |c_~#stored_elements~0.offset| 11) .cse0)))) (not (<= v_ArrVal_619 |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1|)))) (<= 0 (+ |c_~#stored_elements~0.offset| 8))) is different from false [2022-10-04 00:46:08,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:46:08,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 61 [2022-10-04 00:46:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:46:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242335825] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:46:08,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:46:08,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 27, 17] total 79 [2022-10-04 00:46:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846325673] [2022-10-04 00:46:08,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:46:08,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-10-04 00:46:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:46:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-10-04 00:46:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=5685, Unknown=1, NotChecked=154, Total=6320 [2022-10-04 00:46:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:08,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:46:08,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 20.037974683544302) internal successors, (1583), 80 states have internal predecessors, (1583), 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) [2022-10-04 00:46:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:46:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:46:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-10-04 00:46:08,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:08,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:46:08,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:46:08,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:46:08,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-04 00:46:08,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:46:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:46:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:46:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:46:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:46:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:46:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-10-04 00:46:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:46:15,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-04 00:46:16,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:46:16,057 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:46:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:46:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1224316434, now seen corresponding path program 2 times [2022-10-04 00:46:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:46:16,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770451426] [2022-10-04 00:46:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:46:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:46:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:46:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-10-04 00:46:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:46:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770451426] [2022-10-04 00:46:16,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770451426] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:46:16,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:46:16,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:46:16,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916866458] [2022-10-04 00:46:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:46:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:46:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:46:16,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:46:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:46:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:16,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:46:16,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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) [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-10-04 00:46:16,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:46:16,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:46:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:16,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-04 00:46:16,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:46:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:46:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1198796287, now seen corresponding path program 2 times [2022-10-04 00:46:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:46:16,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433769326] [2022-10-04 00:46:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:46:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:46:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:46:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:46:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:46:18,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433769326] [2022-10-04 00:46:18,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433769326] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:46:18,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147964459] [2022-10-04 00:46:18,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:46:18,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:46:18,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:46:18,673 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) [2022-10-04 00:46:18,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-04 00:46:19,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 00:46:19,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:46:19,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 56 conjunts are in the unsatisfiable core [2022-10-04 00:46:19,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:46:19,495 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-04 00:46:19,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-10-04 00:46:19,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-04 00:46:19,744 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-04 00:46:19,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-10-04 00:46:19,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-04 00:46:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:46:25,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:46:25,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147964459] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:46:25,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:46:25,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [45] total 76 [2022-10-04 00:46:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010143093] [2022-10-04 00:46:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:46:25,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-04 00:46:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:46:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-04 00:46:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=5536, Unknown=0, NotChecked=0, Total=5852 [2022-10-04 00:46:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:25,894 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:46:25,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 19.242424242424242) internal successors, (635), 34 states have internal predecessors, (635), 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) [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:46:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.