/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-09-30 06:05:08,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 06:05:08,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 06:05:08,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 06:05:08,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 06:05:08,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 06:05:08,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 06:05:08,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 06:05:08,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 06:05:08,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 06:05:08,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 06:05:08,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 06:05:08,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 06:05:08,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 06:05:08,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 06:05:08,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 06:05:08,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 06:05:08,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 06:05:08,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 06:05:08,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 06:05:08,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 06:05:08,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 06:05:08,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 06:05:08,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 06:05:08,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 06:05:08,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 06:05:08,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 06:05:08,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 06:05:08,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 06:05:08,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 06:05:08,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 06:05:08,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 06:05:08,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 06:05:08,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 06:05:08,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 06:05:08,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 06:05:08,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 06:05:08,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 06:05:08,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 06:05:08,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 06:05:08,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 06:05:08,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 06:05:08,615 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 06:05:08,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 06:05:08,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 06:05:08,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 06:05:08,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 06:05:08,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 06:05:08,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 06:05:08,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 06:05:08,617 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 06:05:08,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 06:05:08,617 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 06:05:08,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 06:05:08,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 06:05:08,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 06:05:08,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 06:05:08,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 06:05:08,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 06:05:08,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 06:05:08,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:05:08,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 06:05:08,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 06:05:08,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 06:05:08,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 06:05:08,621 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-09-30 06:05:08,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 06:05:08,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 06:05:08,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 06:05:08,901 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 06:05:08,907 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 06:05:08,909 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-09-30 06:05:08,909 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_longer.line754.bpl' [2022-09-30 06:05:08,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 06:05:08,972 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 06:05:08,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 06:05:08,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 06:05:08,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 06:05:08,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:08,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:09,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:09,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:09,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:09,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:09,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:09,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 06:05:09,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 06:05:09,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 06:05:09,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 06:05:09,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/1) ... [2022-09-30 06:05:09,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:05:09,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:05:09,105 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-09-30 06:05:09,114 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-09-30 06:05:09,145 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-30 06:05:09,145 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-30 06:05:09,145 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-30 06:05:09,145 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-30 06:05:09,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 06:05:09,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 06:05:09,147 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 06:05:09,365 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 06:05:09,366 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 06:05:09,861 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 06:05:09,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 06:05:09,886 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-30 06:05:09,895 INFO L202 PluginConnector]: Adding new model queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:05:09 BoogieIcfgContainer [2022-09-30 06:05:09,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 06:05:09,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 06:05:09,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 06:05:09,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 06:05:09,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:05:08" (1/2) ... [2022-09-30 06:05:09,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6101cd93 and model type queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 06:05:09, skipping insertion in model container [2022-09-30 06:05:09,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_longer.line754.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:05:09" (2/2) ... [2022-09-30 06:05:09,908 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.line754.bpl [2022-09-30 06:05:09,916 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 06:05:09,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 06:05:09,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 06:05:09,925 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 06:05:10,115 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 06:05:10,180 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:05:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:05:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:05:10,183 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-09-30 06:05:10,192 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-09-30 06:05:10,218 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:05:10,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:05:10,232 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;@215a9a10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:05:10,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:05:10,309 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:05:10,314 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:05:10,316 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-09-30 06:05:10,329 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:05:10,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:05:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:05:10,332 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-09-30 06:05:10,339 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-09-30 06:05:10,343 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:05:10,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:05:10,345 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;@215a9a10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:05:10,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:05:10,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:05:10,870 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:05:10,873 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-09-30 06:05:10,881 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:05:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:05:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:05:10,916 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-09-30 06:05:10,918 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-09-30 06:05:10,925 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:05:10,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:05:10,926 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;@215a9a10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:05:10,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:05:10,927 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-30 06:05:10,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:05:10,927 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:05:10,928 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-09-30 06:05:10,934 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:05:10,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:05:10,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:05:10,938 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-09-30 06:05:10,942 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-09-30 06:05:10,948 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:05:10,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:05:10,949 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;@215a9a10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:05:10,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:05:11,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1817190746, now seen corresponding path program 1 times [2022-09-30 06:05:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:11,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324688180] [2022-09-30 06:05:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:05:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:11,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324688180] [2022-09-30 06:05:11,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324688180] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:11,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:11,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-30 06:05:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254551449] [2022-09-30 06:05:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:11,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-30 06:05:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-30 06:05:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-30 06:05:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:11,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:11,534 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-09-30 06:05:11,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:11,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 06:05:11,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash -621438259, now seen corresponding path program 1 times [2022-09-30 06:05:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:11,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644595712] [2022-09-30 06:05:11,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:05:11,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644595712] [2022-09-30 06:05:11,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644595712] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:11,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:11,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-30 06:05:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504402106] [2022-09-30 06:05:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:11,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-30 06:05:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:11,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-30 06:05:11,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-30 06:05:11,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:11,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:11,908 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-09-30 06:05:11,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:11,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:12,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 06:05:12,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1381408853, now seen corresponding path program 1 times [2022-09-30 06:05:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690129961] [2022-09-30 06:05:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:05:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:12,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690129961] [2022-09-30 06:05:12,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690129961] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:12,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:12,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-30 06:05:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216252852] [2022-09-30 06:05:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:12,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-30 06:05:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-30 06:05:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-30 06:05:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:13,006 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:13,011 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-09-30 06:05:13,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:13,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:13,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:14,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-30 06:05:14,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1143628880, now seen corresponding path program 1 times [2022-09-30 06:05:14,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:14,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667232424] [2022-09-30 06:05:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-09-30 06:05:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:14,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667232424] [2022-09-30 06:05:14,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667232424] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:14,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:14,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-30 06:05:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53755244] [2022-09-30 06:05:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:14,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-30 06:05:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:14,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-30 06:05:14,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-09-30 06:05:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:14,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:14,813 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-09-30 06:05:14,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:14,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:15,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:15,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-30 06:05:15,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1084552452, now seen corresponding path program 2 times [2022-09-30 06:05:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:15,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905814466] [2022-09-30 06:05:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:15,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-09-30 06:05:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:15,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905814466] [2022-09-30 06:05:15,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905814466] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:15,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:15,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-30 06:05:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908763833] [2022-09-30 06:05:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:15,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-30 06:05:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-30 06:05:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-30 06:05:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:15,430 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:15,430 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-09-30 06:05:15,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:15,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:15,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:15,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:15,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:05:15,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-30 06:05:15,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2077419964, now seen corresponding path program 1 times [2022-09-30 06:05:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:15,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121373820] [2022-09-30 06:05:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-09-30 06:05:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:16,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121373820] [2022-09-30 06:05:16,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121373820] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:16,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:16,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-09-30 06:05:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528177189] [2022-09-30 06:05:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:16,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-09-30 06:05:16,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-09-30 06:05:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-09-30 06:05:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:16,974 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:16,974 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-09-30 06:05:16,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:16,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:16,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:16,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:16,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:05:16,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:05:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:05:19,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-30 06:05:19,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash -906844975, now seen corresponding path program 1 times [2022-09-30 06:05:19,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:19,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594334195] [2022-09-30 06:05:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-09-30 06:05:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:21,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594334195] [2022-09-30 06:05:21,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594334195] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:21,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:21,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-09-30 06:05:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537709840] [2022-09-30 06:05:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:21,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-09-30 06:05:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-09-30 06:05:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1828, Unknown=0, NotChecked=0, Total=1980 [2022-09-30 06:05:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:21,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:21,721 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-09-30 06:05:21,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:21,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:21,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:21,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:21,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:05:21,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:05:21,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:05:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:05:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:05:30,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-30 06:05:30,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash -628061619, now seen corresponding path program 1 times [2022-09-30 06:05:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:30,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927037934] [2022-09-30 06:05:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:05:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-09-30 06:05:33,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:05:33,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927037934] [2022-09-30 06:05:33,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927037934] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:05:33,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:05:33,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-09-30 06:05:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450729032] [2022-09-30 06:05:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:05:33,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-09-30 06:05:33,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:05:33,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-09-30 06:05:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3528, Unknown=0, NotChecked=0, Total=3782 [2022-09-30 06:05:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:33,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:05:33,315 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-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:05:33,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:05:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:05:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:05:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:05:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:05:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:05:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:05:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:05:47,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-30 06:05:47,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:05:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:05:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1809678632, now seen corresponding path program 1 times [2022-09-30 06:05:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:05:47,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793294539] [2022-09-30 06:05:47,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:05:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:05:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:06:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-09-30 06:06:09,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:06:09,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793294539] [2022-09-30 06:06:09,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793294539] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:06:09,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406195845] [2022-09-30 06:06:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:06:09,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:06:09,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:06:09,012 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-09-30 06:06:09,014 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-09-30 06:06:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:06:09,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 225 conjunts are in the unsatisfiable core [2022-09-30 06:06:09,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:06:09,830 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-09-30 06:06:10,254 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:06:10,255 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-09-30 06:06:11,092 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-09-30 06:06:11,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:11,545 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-09-30 06:06:13,634 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:06:13,635 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-09-30 06:06:13,646 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-09-30 06:06:14,384 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:06:14,385 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-09-30 06:06:14,409 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-09-30 06:06:18,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:18,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:18,425 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-30 06:06:18,426 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-09-30 06:06:18,828 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:06:18,829 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-09-30 06:06:19,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:19,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:19,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:19,312 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-09-30 06:06:20,372 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-09-30 06:06:20,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:20,841 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-09-30 06:06:22,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:22,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:22,952 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-30 06:06:22,953 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-09-30 06:06:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:23,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:23,763 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-09-30 06:06:24,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:24,904 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:06:24,905 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-09-30 06:06:25,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:25,387 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-09-30 06:06:25,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:06:25,999 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-09-30 06:06:26,117 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-09-30 06:06:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-09-30 06:06:26,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:06:36,696 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-09-30 06:06:36,708 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-09-30 06:06:36,722 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-09-30 06:06:36,769 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-09-30 06:06:36,796 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-09-30 06:06:36,817 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-09-30 06:06:36,916 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-09-30 06:06:36,941 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-09-30 06:06:36,956 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-09-30 06:06:37,008 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-09-30 06:06:37,074 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-09-30 06:06:37,139 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-09-30 06:06:37,179 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-09-30 06:06:37,411 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-09-30 06:06:37,497 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-09-30 06:06:37,544 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-09-30 06:06:37,588 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-09-30 06:06:37,613 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-09-30 06:06:37,700 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-09-30 06:06:37,755 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-09-30 06:06:37,803 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-09-30 06:06:38,894 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-09-30 06:06:38,969 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-09-30 06:06:39,015 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-09-30 06:06:39,255 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-09-30 06:06:39,385 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-09-30 06:06:39,462 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-09-30 06:06:39,510 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-09-30 06:06:39,588 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-09-30 06:06:39,632 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-09-30 06:06:39,790 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-09-30 06:06:40,340 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-09-30 06:06:40,541 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-09-30 06:06:40,638 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-09-30 06:06:58,731 INFO L356 Elim1Store]: treesize reduction 113, result has 45.1 percent of original size [2022-09-30 06:06:58,732 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-09-30 06:06:58,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:06:58,827 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-09-30 06:06:58,869 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-09-30 06:06:58,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,908 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-09-30 06:06:58,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,954 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-09-30 06:06:58,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:06:58,999 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-09-30 06:07:00,383 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-09-30 06:07:01,206 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-09-30 06:07:02,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:07:02,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:07:02,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:07:02,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:07:02,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:07:02,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:07:02,409 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-09-30 06:07:10,772 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-09-30 06:07:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-09-30 06:07:11,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406195845] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:07:11,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:07:11,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 80, 85] total 243 [2022-09-30 06:07:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642267233] [2022-09-30 06:07:11,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:07:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 243 states [2022-09-30 06:07:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:07:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2022-09-30 06:07:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=41972, Unknown=171, NotChecked=15198, Total=58806 [2022-09-30 06:07:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:07:11,230 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:07:11,232 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-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:07:11,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:06,639 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-09-30 06:09:06,657 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-09-30 06:09:06,666 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-09-30 06:09:14,997 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-09-30 06:09:15,006 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-09-30 06:09:15,019 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-09-30 06:09:15,025 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-09-30 06:09:15,032 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-09-30 06:09:15,038 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-09-30 06:09:15,043 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-09-30 06:09:15,197 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-09-30 06:09:15,203 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-09-30 06:09:15,209 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-09-30 06:09:15,216 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-09-30 06:09:15,220 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-09-30 06:09:15,225 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-09-30 06:09:15,231 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-09-30 06:09:15,237 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-09-30 06:09:15,246 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-09-30 06:09:15,251 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-09-30 06:09:15,256 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-09-30 06:09:15,262 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-09-30 06:09:15,267 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-09-30 06:09:15,270 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-09-30 06:09:15,277 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-09-30 06:09:15,287 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-09-30 06:09:16,052 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-09-30 06:09:16,055 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-09-30 06:09:16,061 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-09-30 06:09:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:09:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:09:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:09:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:09:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:09:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:09:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:09:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-09-30 06:09:23,168 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-09-30 06:09:23,355 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-09-30 06:09:23,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:09:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:09:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1284917185, now seen corresponding path program 1 times [2022-09-30 06:09:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:09:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307908574] [2022-09-30 06:09:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:09:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:09:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:09:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:09:25,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:09:25,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307908574] [2022-09-30 06:09:25,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307908574] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:09:25,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534231422] [2022-09-30 06:09:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:09:25,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:09:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:09:25,012 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-09-30 06:09:25,013 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-09-30 06:09:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:09:25,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 56 conjunts are in the unsatisfiable core [2022-09-30 06:09:25,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:09:25,814 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:09:25,814 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-09-30 06:09:26,216 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-09-30 06:09:26,216 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-09-30 06:09:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:09:33,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:09:42,162 WARN L233 SmtUtils]: Spent 6.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-09-30 06:09:45,382 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-09-30 06:09:45,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:09:45,777 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-09-30 06:09:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:09:45,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534231422] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:09:45,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:09:45,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 27, 17] total 79 [2022-09-30 06:09:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804997604] [2022-09-30 06:09:45,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:09:45,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-30 06:09:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:09:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-30 06:09:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=5685, Unknown=1, NotChecked=154, Total=6320 [2022-09-30 06:09:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:45,925 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:09:45,926 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-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-09-30 06:09:45,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-09-30 06:09:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:09:55,038 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-09-30 06:09:55,218 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-09-30 06:09:55,218 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:09:55,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:09:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1224316434, now seen corresponding path program 2 times [2022-09-30 06:09:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:09:55,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594150286] [2022-09-30 06:09:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:09:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:09:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:09:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-09-30 06:09:55,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:09:55,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594150286] [2022-09-30 06:09:55,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594150286] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:09:55,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:09:55,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-30 06:09:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871491538] [2022-09-30 06:09:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:09:55,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-30 06:09:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:09:55,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-30 06:09:55,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-30 06:09:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:55,359 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:09:55,359 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-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:09:55,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:09:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:09:55,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-30 06:09:55,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONASSERT === [t2Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:09:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:09:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1198796287, now seen corresponding path program 2 times [2022-09-30 06:09:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:09:55,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021227409] [2022-09-30 06:09:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:09:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:09:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:09:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:09:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:09:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021227409] [2022-09-30 06:09:58,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021227409] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:09:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598000204] [2022-09-30 06:09:58,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-30 06:09:58,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:09:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:09:58,330 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-09-30 06:09:58,333 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-09-30 06:09:58,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-30 06:09:58,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 06:09:58,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 56 conjunts are in the unsatisfiable core [2022-09-30 06:09:58,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:09:59,185 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-30 06:09:59,185 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-09-30 06:09:59,264 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-09-30 06:09:59,515 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-30 06:09:59,515 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-09-30 06:09:59,608 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-09-30 06:10:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:10:06,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-30 06:10:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598000204] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:10:06,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-30 06:10:06,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [45] total 76 [2022-09-30 06:10:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738036109] [2022-09-30 06:10:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:10:06,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-30 06:10:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:10:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-30 06:10:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=5536, Unknown=0, NotChecked=0, Total=5852 [2022-09-30 06:10:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:10:06,532 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:10:06,533 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-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-30 06:10:06,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.