/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.line576.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:36:00,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:36:00,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:36:00,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:36:00,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:36:00,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:36:00,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:36:00,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:36:00,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:36:00,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:36:00,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:36:00,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:36:00,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:36:00,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:36:00,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:36:00,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:36:00,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:36:00,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:36:00,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:36:00,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:36:00,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:36:00,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:36:00,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:36:00,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:36:00,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:36:00,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:36:00,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:36:00,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:36:00,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:36:00,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:36:00,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:36:00,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:36:00,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:36:00,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:36:00,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:36:00,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:36:00,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:36:00,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:36:00,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:36:00,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:36:00,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:36:00,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:36:00,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:36:00,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:36:00,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:36:00,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:36:00,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:36:00,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:36:00,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:36:00,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:36:00,482 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:36:00,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:36:00,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:36:00,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:36:00,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:36:00,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:36:00,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:36:00,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:36:00,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:36:00,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:36:00,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:36:00,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:36:00,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:36:00,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:36:00,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:36:00,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:36:00,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:36:00,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:36:00,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:36:00,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:36:00,486 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-04 00:36:00,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:36:00,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:36:00,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:36:00,706 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:36:00,723 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:36:00,724 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.line576.bpl [2022-10-04 00:36:00,725 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue.line576.bpl' [2022-10-04 00:36:00,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:36:00,784 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:36:00,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:36:00,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:36:00,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:36:00,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:36:00,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:36:00,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:36:00,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:36:00,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/1) ... [2022-10-04 00:36:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:36:00,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:00,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-04 00:36:00,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-04 00:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:36:00,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:36:00,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:36:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:36:00,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:36:00,954 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:36:01,110 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:36:01,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:36:01,585 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:36:01,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:36:01,609 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:36:01,612 INFO L202 PluginConnector]: Adding new model queue.line576.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:36:01 BoogieIcfgContainer [2022-10-04 00:36:01,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:36:01,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:36:01,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:36:01,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:36:01,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:36:00" (1/2) ... [2022-10-04 00:36:01,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d28064c and model type queue.line576.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:36:01, skipping insertion in model container [2022-10-04 00:36:01,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue.line576.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:36:01" (2/2) ... [2022-10-04 00:36:01,622 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.line576.bpl [2022-10-04 00:36:01,628 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:36:01,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:36:01,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:36:01,635 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:36:01,774 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:36:01,833 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:36:01,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:36:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:01,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:36:01,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-04 00:36:01,867 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:36:01,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:36:01,878 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;@2b749087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:36:01,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:36:02,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:36:02,275 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:36:02,276 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:36:02,284 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:36:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:36:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:02,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:36:02,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-04 00:36:02,290 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:36:02,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:36:02,291 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;@2b749087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:36:02,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:36:02,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:36:02,305 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:36:02,305 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:36:02,310 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:36:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:36:02,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:02,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:36:02,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-04 00:36:02,352 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:36:02,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:36:02,353 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;@2b749087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:36:02,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:36:02,353 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:36:02,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:36:02,354 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:36:02,354 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:36:02,358 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:36:02,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:36:02,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:02,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:36:02,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-04 00:36:02,377 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:36:02,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:36:02,378 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;@2b749087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:36:02,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:36:02,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1040876288, now seen corresponding path program 1 times [2022-10-04 00:36:02,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:02,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414930176] [2022-10-04 00:36:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:36:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414930176] [2022-10-04 00:36:03,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414930176] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:03,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:03,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:36:03,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448065703] [2022-10-04 00:36:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:03,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:36:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:03,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:36:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:36:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:03,063 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:03,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:03,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:03,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:36:03,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -213128261, now seen corresponding path program 1 times [2022-10-04 00:36:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:03,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945355363] [2022-10-04 00:36:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:36:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:04,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945355363] [2022-10-04 00:36:04,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945355363] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:04,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:04,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-10-04 00:36:04,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512612512] [2022-10-04 00:36:04,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:04,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-04 00:36:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:04,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-04 00:36:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-10-04 00:36:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:04,755 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:04,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.846153846153847) internal successors, (386), 26 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:04,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:04,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:06,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:36:06,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1013342580, now seen corresponding path program 1 times [2022-10-04 00:36:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:06,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858434907] [2022-10-04 00:36:06,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:06,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:36:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:07,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858434907] [2022-10-04 00:36:07,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858434907] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:07,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:07,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-10-04 00:36:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329172719] [2022-10-04 00:36:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:07,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-04 00:36:07,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:07,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-04 00:36:07,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2022-10-04 00:36:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:07,648 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:07,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 12.806451612903226) internal successors, (397), 31 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:07,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:07,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:07,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:10,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:36:10,530 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2125613135, now seen corresponding path program 1 times [2022-10-04 00:36:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:10,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927645896] [2022-10-04 00:36:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:36:11,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:11,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927645896] [2022-10-04 00:36:11,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927645896] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:11,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:11,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-10-04 00:36:11,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379557014] [2022-10-04 00:36:11,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:11,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-10-04 00:36:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-04 00:36:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2127, Unknown=0, NotChecked=0, Total=2352 [2022-10-04 00:36:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:11,963 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:11,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 8.10204081632653) internal successors, (397), 49 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:11,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:11,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:11,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:36:17,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-04 00:36:17,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash -694378562, now seen corresponding path program 1 times [2022-10-04 00:36:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:17,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098028843] [2022-10-04 00:36:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:36:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098028843] [2022-10-04 00:36:18,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098028843] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:18,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:18,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-04 00:36:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438903410] [2022-10-04 00:36:18,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:18,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-04 00:36:18,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:18,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-04 00:36:18,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-10-04 00:36:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:18,369 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:18,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 31.384615384615383) internal successors, (408), 14 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:18,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:18,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:18,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:18,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:36:18,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:36:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:19,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-04 00:36:19,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1192253597, now seen corresponding path program 1 times [2022-10-04 00:36:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:19,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528191797] [2022-10-04 00:36:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:19,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:36:19,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:19,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528191797] [2022-10-04 00:36:19,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528191797] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:19,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:19,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 00:36:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487170575] [2022-10-04 00:36:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:19,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 00:36:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 00:36:19,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 00:36:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:19,321 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:19,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:19,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:19,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:19,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:19,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-04 00:36:19,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:19,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:36:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:19,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-04 00:36:19,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash -310871939, now seen corresponding path program 1 times [2022-10-04 00:36:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:19,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843859807] [2022-10-04 00:36:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-04 00:36:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:20,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843859807] [2022-10-04 00:36:20,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843859807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:20,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:20,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:36:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586819163] [2022-10-04 00:36:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:20,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:36:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:20,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:36:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:36:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:20,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:20,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:20,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:20,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:20,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:20,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:36:20,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:20,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:20,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:36:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:36:20,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-04 00:36:20,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash 66770536, now seen corresponding path program 1 times [2022-10-04 00:36:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:20,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222731962] [2022-10-04 00:36:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:20,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-04 00:36:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:20,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222731962] [2022-10-04 00:36:20,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222731962] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:20,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:20,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 00:36:20,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726359475] [2022-10-04 00:36:20,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:20,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 00:36:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 00:36:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-04 00:36:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:20,459 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:20,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:20,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:20,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:20,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:20,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:36:20,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:20,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:20,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:36:20,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:36:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:20,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-04 00:36:20,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash 466192596, now seen corresponding path program 2 times [2022-10-04 00:36:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:20,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559507376] [2022-10-04 00:36:20,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-04 00:36:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:20,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559507376] [2022-10-04 00:36:20,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559507376] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:36:20,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:36:20,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 00:36:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847560417] [2022-10-04 00:36:20,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:36:20,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 00:36:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:36:20,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 00:36:20,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-04 00:36:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:20,877 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:36:20,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:36:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:36:21,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-04 00:36:21,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:36:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:36:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash -922446019, now seen corresponding path program 2 times [2022-10-04 00:36:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:36:21,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676180682] [2022-10-04 00:36:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:36:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:36:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:36:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 9 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 00:36:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:36:31,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676180682] [2022-10-04 00:36:31,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676180682] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:36:31,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60905367] [2022-10-04 00:36:31,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:36:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:36:31,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:36:31,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:36:31,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-04 00:36:31,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 00:36:31,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:36:31,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 213 conjunts are in the unsatisfiable core [2022-10-04 00:36:31,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:36:31,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:36:31,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:36:32,250 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:36:32,250 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 11 treesize of output 11 [2022-10-04 00:36:32,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-04 00:36:33,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 00:36:33,593 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 23 treesize of output 22 [2022-10-04 00:36:34,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:34,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:34,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-04 00:36:35,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:35,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-04 00:36:37,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:36:37,236 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:36:37,236 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 43 treesize of output 39 [2022-10-04 00:36:37,587 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-04 00:36:37,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 25 [2022-10-04 00:36:38,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:38,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:38,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-10-04 00:36:39,233 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 0 case distinctions, treesize of input 43 treesize of output 30 [2022-10-04 00:36:39,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:39,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-04 00:36:41,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:36:41,301 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-04 00:36:41,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-10-04 00:36:41,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:41,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:41,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-04 00:36:42,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:42,326 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:36:42,326 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 1 case distinctions, treesize of input 30 treesize of output 38 [2022-10-04 00:36:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:42,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:36:43,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:36:43,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:36:43,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:36:43,871 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 19 treesize of output 7 [2022-10-04 00:36:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-04 00:36:43,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:36:50,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-10-04 00:36:50,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 (Array Int Int))) (not (= (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) is different from false [2022-10-04 00:36:50,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 (Array Int Int))) (not (= 20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80))))) is different from false [2022-10-04 00:36:50,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (not (= 20 (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80))))) is different from false [2022-10-04 00:36:50,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int)) (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:50,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (or (not (= 20 (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:50,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= (select (select (store (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_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:50,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:50,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= 20 (select (select (store (store (let ((.cse0 (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_556)))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (let ((.cse0 (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_555)))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 00:36:51,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:36:51,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (< (+ (* (select .cse0 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:36:51,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (+ 84 |c_~#queue~0.offset|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse1 .cse0) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)))) is different from false [2022-10-04 00:36:52,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:52,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse0 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse2 |c_~#queue~0.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse0) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))))) is different from false [2022-10-04 00:36:52,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse0 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:52,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse0 (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_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= v_ArrVal_551 |c_t1Thread1of1ForFork1_write~int_#value#1|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:52,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse0 (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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_551) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:52,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) v_ArrVal_551) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:52,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_551) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:53,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1) v_ArrVal_551) (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:53,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) v_ArrVal_551) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) is different from false [2022-10-04 00:36:53,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_551) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:36:53,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_549 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse5 (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_549)))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_551) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (= (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))))) is different from false [2022-10-04 00:36:53,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_549 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_549) .cse4 v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_551) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:36:53,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_549 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_549) .cse4 v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_551) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))))) is different from false [2022-10-04 00:37:01,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:01,832 INFO L356 Elim1Store]: treesize reduction 41, result has 53.9 percent of original size [2022-10-04 00:37:01,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 390 treesize of output 205 [2022-10-04 00:37:01,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:37:01,876 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 608 treesize of output 622 [2022-10-04 00:37:01,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:01,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:01,893 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 698 treesize of output 674 [2022-10-04 00:37:01,909 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 634 treesize of output 594 [2022-10-04 00:37:01,924 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 594 treesize of output 574 [2022-10-04 00:37:01,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:01,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:01,941 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 658 treesize of output 642 [2022-10-04 00:37:02,157 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 7 treesize of output 3 [2022-10-04 00:37:02,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 00:37:02,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:37:02,267 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 37 treesize of output 41 [2022-10-04 00:37:02,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:02,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:02,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:37:02,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 249 [2022-10-04 00:37:18,965 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 142 treesize of output 138 [2022-10-04 00:37:19,245 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 10 treesize of output 8 [2022-10-04 00:37:19,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2022-10-04 00:37:19,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:37:19,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2022-10-04 00:37:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 36 not checked. [2022-10-04 00:37:19,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60905367] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:37:19,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:37:19,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 75, 77] total 233 [2022-10-04 00:37:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328844074] [2022-10-04 00:37:19,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:37:19,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 233 states [2022-10-04 00:37:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:37:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2022-10-04 00:37:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=38128, Unknown=124, NotChecked=14124, Total=54056 [2022-10-04 00:37:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:37:19,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:37:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 233 states, 233 states have (on average 7.085836909871245) internal successors, (1651), 233 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:37:19,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:38:52,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse38 (@diff .cse23 .cse0))) (let ((.cse39 (store .cse23 .cse38 0))) (let ((.cse40 (@diff .cse39 .cse0))) (let ((.cse36 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (store .cse39 .cse40 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse11 (< .cse36 (+ 92 |c_~#queue~0.offset|))) (.cse21 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse24 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse35 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|)) (.cse37 (+ |c_ULTIMATE.start_init_~q#1.offset| 84)) (.cse20 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse22 (+ |c_~#queue~0.offset| 80))) (and (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= .cse0 (store .cse1 .cse2 0)) (<= .cse3 4) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 0) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_549 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_547 Int) (v_ArrVal_558 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78| Int) (v_ArrVal_556 Int) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse10 (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_546))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78| v_ArrVal_547)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_549) .cse5 v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse5))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse5 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (= (select (select (store (store (store .cse7 |c_~#queue~0.base| (store (store (store .cse6 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= .cse8 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)) (< (+ (select .cse9 .cse5) 1) v_ArrVal_551)))))))) .cse11) (or (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_18| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_549 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_547 Int) (v_ArrVal_558 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78| Int) (v_ArrVal_556 Int) (v_ArrVal_544 Int) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_555 Int) (v_ArrVal_542 Int) (v_ArrVal_551 Int)) (let ((.cse18 (store (let ((.cse19 (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_542)))) (store .cse19 |c_ULTIMATE.start_init_~q#1.base| (store (select .cse19 |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_18| v_ArrVal_544))) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_546))) (let ((.cse15 (select .cse18 |c_~#queue~0.base|))) (let ((.cse16 (store .cse15 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78| v_ArrVal_547)) (.cse17 (+ 88 |c_~#queue~0.offset|)) (.cse14 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse18 |c_~#queue~0.base| (store (store .cse16 .cse17 v_ArrVal_549) .cse14 v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (or (not (= (select (select (store (store (store .cse12 |c_~#queue~0.base| (store (store (store .cse13 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse14 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ |c_~#queue~0.offset| (* (select .cse15 .cse14) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78|) (not (<= v_ArrVal_542 |c_ULTIMATE.start_write~int_#value#1|)) (< (+ (select .cse16 .cse14) 1) v_ArrVal_551) (< (+ |c_~#queue~0.offset| (* (select .cse13 .cse14) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_18|)) (not (<= .cse17 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))))))) .cse11) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= |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| (+ (select .cse20 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) 1)) (= (select .cse21 .cse22) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse23 .cse22) 0) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (or (<= 88 .cse2) (= .cse0 .cse1) (<= .cse2 80)) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select .cse20 .cse24) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_549 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_547 Int) (v_ArrVal_558 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78| Int) (v_ArrVal_556 Int) (v_ArrVal_544 Int) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_555 Int) (v_ArrVal_551 Int)) (let ((.cse31 (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_544)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_546))) (let ((.cse30 (select .cse31 |c_~#queue~0.base|))) (let ((.cse27 (store .cse30 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78| v_ArrVal_547)) (.cse29 (+ 88 |c_~#queue~0.offset|)) (.cse26 (+ 84 |c_~#queue~0.offset|))) (let ((.cse28 (store (store .cse31 |c_~#queue~0.base| (store (store .cse27 .cse29 v_ArrVal_549) .cse26 v_ArrVal_551)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse25 (select .cse28 |c_~#queue~0.base|))) (or (< (+ |c_~#queue~0.offset| (* (select .cse25 .cse26) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (< (+ (select .cse27 .cse26) 1) v_ArrVal_551) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (not (<= .cse26 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= 20 (select (select (store (store (store .cse28 |c_~#queue~0.base| (store (store (store .cse25 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= .cse29 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (< (+ (* 4 (select .cse30 .cse26)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_78|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))))))) .cse11) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse32 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse33 (select .cse32 |c_~#queue~0.base|)) (.cse34 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (select (store (store (store .cse32 |c_~#queue~0.base| (store (store (store .cse33 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse33 .cse34) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= .cse34 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) (= 7 |c_~#queue~0.base|) (= (select .cse35 (+ |c_ULTIMATE.start_init_~q#1.offset| 80)) 0) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= .cse24 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (select .cse21 .cse24) 1) (not (= .cse36 .cse3)) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (<= (select .cse35 .cse37) 0) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) (<= .cse37 (select |c_#length| |c_ULTIMATE.start_init_~q#1.base|)) (or (<= 88 .cse38) (= .cse0 .cse23) (<= .cse38 80)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (or (= .cse0 .cse39) (<= 88 .cse40) (<= .cse40 80)) (<= |c_~#stored_elements~0.base| 6) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) (= (select .cse20 .cse22) 0)))))))) is different from false [2022-10-04 00:38:52,825 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse1 (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= .cse3 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:52,837 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse2 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_95| v_ArrVal_553))) (let ((.cse0 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse2 |c_~#queue~0.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse0) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (= (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))))) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse3 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:38:52,843 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse0 (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_553))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))))) (<= (select .cse3 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#stored_elements~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse3 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:38:52,850 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:52,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)))) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (= |c_t1Thread1of1ForFork1_empty_#in~q#1.base| |c_~#queue~0.base|))) is different from false [2022-10-04 00:38:52,863 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |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|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)) (< (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,033 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (< (+ (* (select .cse1 .cse2) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (= 20 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (< (+ (* (select .cse1 .cse0) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse2 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,047 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (< (+ (* (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= |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 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset| (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,055 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse1 (+ |c_~#queue~0.offset| 80)) 0) (<= (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) 4) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74|) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 1) (= (select .cse0 84) |c_t1Thread1of1ForFork1_read~int_#value#1|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,060 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |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| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= (select .cse1 84) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= |c_~#stored_elements~0.base| 6) (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 4) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select .cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))) is different from false [2022-10-04 00:38:53,067 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select .cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#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|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= (select .cse1 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_555 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_74| v_ArrVal_555) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (= (select .cse0 84) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (<= |c_~#stored_elements~0.base| 6) (<= (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) 4) (= (select .cse1 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:38:53,392 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 .cse1) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse2 .cse3) 1) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4))) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (<= (select .cse0 .cse3) 1) (<= |c_~#stored_elements~0.base| 6) (= (select .cse2 .cse1) 0))) is different from false [2022-10-04 00:38:53,397 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73| v_ArrVal_556) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_73|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:38:53,690 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 .cse1) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (select .cse2 .cse3) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= 7 |c_~#queue~0.base|) (<= (select .cse0 .cse3) 1) (<= |c_~#stored_elements~0.base| 6) (= (select .cse2 .cse1) 0))) is different from false [2022-10-04 00:38:53,695 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 20)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 20)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (not (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,717 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |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| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |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| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,727 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |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| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,732 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (= 20 (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |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| 80)) 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:53,736 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|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (or (not (<= (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_72|)) (not (= (select (select (store (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_72| v_ArrVal_558)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:38:54,117 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (and (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_~#queue~0.base|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 84 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select .cse0 .cse1) 0) (<= |c_t1Thread1of1ForFork1_write~int_#value#1| 2) (<= (select .cse2 .cse3) 1) (= |c_~#queue~0.offset| 0) (not (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| 84) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= (select .cse0 84) 2) (= 7 |c_~#queue~0.base|) (<= .cse3 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (or (not (= 20 (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6) (= (select .cse2 .cse1) 0))) is different from false [2022-10-04 00:38:54,122 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|)) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (<= (select .cse0 84) 2) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (or (not (= 20 (select (select (store (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 00:38:54,129 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= (select .cse0 84) 2) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| Int)) (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (not (= (select (select (store (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| v_ArrVal_560) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_91| |c_~#stored_elements~0.base|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse0 (+ |c_~#queue~0.offset| 80)) 0))) is different from false [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-04 00:39:06,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 00:39:06,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-04 00:39:06,534 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:39:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:39:06,534 INFO L85 PathProgramCache]: Analyzing trace with hash 830206739, now seen corresponding path program 1 times [2022-10-04 00:39:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:39:06,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53314326] [2022-10-04 00:39:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:39:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:39:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:39:07,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53314326] [2022-10-04 00:39:07,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53314326] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:39:07,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188723541] [2022-10-04 00:39:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:07,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:39:07,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:07,633 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:39:07,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-04 00:39:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:08,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-04 00:39:08,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:39:08,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 00:39:08,550 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:39:08,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-04 00:39:08,774 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:39:08,774 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 11 treesize of output 11 [2022-10-04 00:39:08,888 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-04 00:39:08,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 30 [2022-10-04 00:39:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:39:20,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:39:29,266 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:39:29,338 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 10 treesize of output 8 [2022-10-04 00:39:29,352 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 10 treesize of output 8 [2022-10-04 00:39:42,213 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:39:46,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:39:46,771 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 125 treesize of output 127 [2022-10-04 00:39:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:39:46,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188723541] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:39:46,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:39:46,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 20] total 72 [2022-10-04 00:39:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81262927] [2022-10-04 00:39:46,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:39:46,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-04 00:39:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:39:46,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-04 00:39:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=4781, Unknown=0, NotChecked=0, Total=5256 [2022-10-04 00:39:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:46,937 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:39:46,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 25.90277777777778) internal successors, (1865), 73 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:39:46,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:46,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:39:46,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:39:46,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:39:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:39:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:39:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:39:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:39:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-04 00:39:46,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:39:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-04 00:39:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-10-04 00:39:49,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-04 00:39:50,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:39:50,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:39:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:39:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash 729110035, now seen corresponding path program 2 times [2022-10-04 00:39:50,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:39:50,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688647973] [2022-10-04 00:39:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:39:50,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:39:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:39:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:39:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:39:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688647973] [2022-10-04 00:39:51,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688647973] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:39:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720923466] [2022-10-04 00:39:51,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:39:51,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:39:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:39:51,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 00:39:51,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-04 00:39:51,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 00:39:51,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:39:51,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 77 conjunts are in the unsatisfiable core [2022-10-04 00:39:51,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:39:53,111 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-10-04 00:39:53,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2022-10-04 00:39:53,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-04 00:39:53,750 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-10-04 00:39:53,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 46 [2022-10-04 00:39:54,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-04 00:39:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 415 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:39:59,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:40:08,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:40:08,597 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 104 treesize of output 108 [2022-10-04 00:40:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 250 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:40:09,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720923466] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:40:09,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:40:09,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 43, 28] total 107 [2022-10-04 00:40:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186673588] [2022-10-04 00:40:09,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:40:09,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-10-04 00:40:09,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:40:09,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-10-04 00:40:09,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=800, Invalid=10756, Unknown=0, NotChecked=0, Total=11556 [2022-10-04 00:40:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:40:09,087 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:40:09,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 19.869158878504674) internal successors, (2126), 108 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-10-04 00:40:09,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.