/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/divinefifo_1w1r.line1393.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:30:29,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:30:29,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:30:29,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:30:29,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:30:29,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:30:29,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:30:29,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:30:29,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:30:29,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:30:29,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:30:29,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:30:29,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:30:29,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:30:29,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:30:29,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:30:29,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:30:29,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:30:29,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:30:29,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:30:29,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:30:29,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:30:29,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:30:29,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:30:29,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:30:29,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:30:29,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:30:29,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:30:29,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:30:29,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:30:29,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:30:29,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:30:29,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:30:29,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:30:29,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:30:29,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:30:29,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:30:29,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:30:29,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:30:29,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:30:29,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:30:29,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:30:29,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:30:29,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:30:29,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:30:29,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:30:29,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:30:29,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:30:29,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:30:29,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:30:29,261 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:30:29,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:30:29,262 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:30:29,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:30:29,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:30:29,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:30:29,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:30:29,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:30:29,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:30:29,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:30:29,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:30:29,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:30:29,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:30:29,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:30:29,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:30:29,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:30:29,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:30:29,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:30:29,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:30:29,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:30:29,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:30:29,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:30:29,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:30:29,265 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:30:29,265 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:30:29,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:30:29,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:30:29,266 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:30:29,266 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:30:29,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:30:29,266 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-03 15:30:29,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:30:29,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:30:29,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:30:29,538 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:30:29,539 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:30:29,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1393.bpl [2022-10-03 15:30:29,540 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1393.bpl' [2022-10-03 15:30:29,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:30:29,632 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:30:29,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:30:29,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:30:29,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:30:29,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:30:29,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:30:29,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:30:29,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:30:29,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/1) ... [2022-10-03 15:30:29,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:30:29,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:30:29,821 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-03 15:30:29,829 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-03 15:30:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:30:29,861 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:30:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:30:29,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:30:29,863 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:30:30,072 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:30:30,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:30:30,946 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:30:30,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:30:30,964 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:30:30,967 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:30:30 BoogieIcfgContainer [2022-10-03 15:30:30,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:30:30,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:30:30,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:30:30,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:30:30,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:29" (1/2) ... [2022-10-03 15:30:30,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413bb397 and model type divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:30:30, skipping insertion in model container [2022-10-03 15:30:30,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1393.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:30:30" (2/2) ... [2022-10-03 15:30:30,979 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1393.bpl [2022-10-03 15:30:30,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:30:30,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:30:30,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:30:30,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:30:31,177 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:30:31,243 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:30:31,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:30:31,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:30:31,251 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-03 15:30:31,271 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-03 15:30:31,286 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:30:31,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:30:31,298 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;@4403b49b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:30:31,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:30:31,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:31,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1423455124, now seen corresponding path program 1 times [2022-10-03 15:30:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:31,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112972969] [2022-10-03 15:30:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:32,262 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-03 15:30:32,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:32,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112972969] [2022-10-03 15:30:32,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112972969] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:32,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:30:32,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:30:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007425064] [2022-10-03 15:30:32,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:30:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:32,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:30:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:30:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:32,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:32,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 290.5) internal successors, (581), 2 states have internal predecessors, (581), 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-03 15:30:32,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:32,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:30:32,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:32,517 INFO L85 PathProgramCache]: Analyzing trace with hash -569261813, now seen corresponding path program 1 times [2022-10-03 15:30:32,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:32,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860997761] [2022-10-03 15:30:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:33,535 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-03 15:30:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:33,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860997761] [2022-10-03 15:30:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860997761] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:33,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:30:33,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-03 15:30:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349543540] [2022-10-03 15:30:33,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:33,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-03 15:30:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-03 15:30:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-10-03 15:30:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:33,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:33,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 46.214285714285715) internal successors, (647), 15 states have internal predecessors, (647), 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-03 15:30:33,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:33,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:30:35,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:30:35,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash -156969076, now seen corresponding path program 1 times [2022-10-03 15:30:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:35,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107784127] [2022-10-03 15:30:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:30:36,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:36,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107784127] [2022-10-03 15:30:36,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107784127] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:30:36,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783764435] [2022-10-03 15:30:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:36,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:30:36,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:30:36,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:30:36,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 15:30:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:36,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 186 conjunts are in the unsatisfiable core [2022-10-03 15:30:36,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:30:36,846 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-03 15:30:37,318 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-03 15:30:37,329 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-03 15:30:37,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:37,646 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-03 15:30:37,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:37,659 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-03 15:30:37,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:37,847 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-03 15:30:37,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:37,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-10-03 15:30:38,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:38,830 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-03 15:30:38,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 15:30:39,210 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:30:39,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2022-10-03 15:30:39,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:39,231 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 41 treesize of output 44 [2022-10-03 15:30:42,440 INFO L356 Elim1Store]: treesize reduction 140, result has 16.2 percent of original size [2022-10-03 15:30:42,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 94 treesize of output 82 [2022-10-03 15:30:42,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:42,455 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-03 15:30:42,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2022-10-03 15:30:42,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:30:42,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:42,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-10-03 15:30:42,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:30:42,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:30:42,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-10-03 15:30:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-10-03 15:30:43,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:30:43,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783764435] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:43,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:30:43,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [12] total 54 [2022-10-03 15:30:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759265160] [2022-10-03 15:30:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:43,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-03 15:30:43,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:43,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-03 15:30:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2677, Unknown=0, NotChecked=0, Total=2862 [2022-10-03 15:30:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:43,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:43,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 19.136363636363637) internal successors, (842), 44 states have internal predecessors, (842), 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-03 15:30:43,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:43,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-03 15:30:43,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:30:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-10-03 15:30:50,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 15:30:50,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 15:30:50,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 171954875, now seen corresponding path program 1 times [2022-10-03 15:30:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:50,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343726033] [2022-10-03 15:30:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:50,795 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-03 15:30:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343726033] [2022-10-03 15:30:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343726033] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:30:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-10-03 15:30:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326718479] [2022-10-03 15:30:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-03 15:30:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-03 15:30:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-10-03 15:30:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:50,798 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:50,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 54.53846153846154) internal successors, (709), 14 states have internal predecessors, (709), 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-03 15:30:50,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:50,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:30:50,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-10-03 15:30:50,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:30:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-10-03 15:30:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:30:53,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:30:53,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 836830014, now seen corresponding path program 1 times [2022-10-03 15:30:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:53,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355834843] [2022-10-03 15:30:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 34779 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 34425 trivial. 0 not checked. [2022-10-03 15:31:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:31:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355834843] [2022-10-03 15:31:07,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355834843] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:31:07,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:31:07,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-10-03 15:31:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545577979] [2022-10-03 15:31:07,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:31:07,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-10-03 15:31:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-10-03 15:31:07,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=4344, Unknown=0, NotChecked=0, Total=4556 [2022-10-03 15:31:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:07,228 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:07,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 14.985294117647058) internal successors, (1019), 68 states have internal predecessors, (1019), 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-03 15:31:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:07,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:31:07,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-10-03 15:31:07,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:31:07,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:31:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-10-03 15:31:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:31:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-10-03 15:31:26,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:31:26,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:31:26,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:31:26,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2119507656, now seen corresponding path program 2 times [2022-10-03 15:31:26,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:31:26,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523507136] [2022-10-03 15:31:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:31:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18399 backedges. 2246 proven. 689 refuted. 0 times theorem prover too weak. 15464 trivial. 0 not checked. [2022-10-03 15:31:34,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:31:34,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523507136] [2022-10-03 15:31:34,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523507136] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:31:34,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632841813] [2022-10-03 15:31:34,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:31:34,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:31:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:31:34,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:31:34,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 15:31:35,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 15:31:35,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:31:35,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 256 conjunts are in the unsatisfiable core [2022-10-03 15:31:35,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:31:35,795 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-03 15:31:35,802 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-03 15:31:36,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,114 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-03 15:31:36,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,133 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-03 15:31:36,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,356 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-03 15:31:36,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,366 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-03 15:31:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,691 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 14 treesize of output 16 [2022-10-03 15:31:36,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,699 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 14 treesize of output 16 [2022-10-03 15:31:36,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,914 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 19 treesize of output 18 [2022-10-03 15:31:36,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,921 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-03 15:31:38,542 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-03 15:31:38,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:38,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:38,869 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:31:38,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 34 [2022-10-03 15:31:38,894 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-10-03 15:31:38,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 55 [2022-10-03 15:31:38,911 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 35 treesize of output 25 [2022-10-03 15:31:38,933 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 5 treesize of output 3 [2022-10-03 15:31:42,640 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:31:42,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 89 [2022-10-03 15:31:45,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:31:45,706 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-10-03 15:31:45,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 67 [2022-10-03 15:31:45,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:45,716 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-10-03 15:31:45,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 34 [2022-10-03 15:31:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18399 trivial. 0 not checked. [2022-10-03 15:31:45,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:31:45,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632841813] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:31:45,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:31:45,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [23] total 94 [2022-10-03 15:31:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12853463] [2022-10-03 15:31:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:31:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 15:31:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 15:31:45,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=8389, Unknown=0, NotChecked=0, Total=8742 [2022-10-03 15:31:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:45,928 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:45,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 13.150684931506849) internal successors, (960), 73 states have internal predecessors, (960), 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-03 15:31:45,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:45,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:31:45,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-10-03 15:31:45,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:31:45,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-10-03 15:31:45,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:32:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:32:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:32:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:32:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:32:01,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 15:32:02,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:02,094 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:32:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:32:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -628116704, now seen corresponding path program 1 times [2022-10-03 15:32:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:32:02,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861827331] [2022-10-03 15:32:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:32:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-10-03 15:32:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:32:05,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861827331] [2022-10-03 15:32:05,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861827331] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:32:05,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:32:05,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 15:32:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122979498] [2022-10-03 15:32:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:32:05,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 15:32:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:32:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 15:32:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5033, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 15:32:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:05,353 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:32:05,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 12.41095890410959) internal successors, (906), 73 states have internal predecessors, (906), 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-03 15:32:05,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:05,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:32:05,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:32:05,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:32:05,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:32:05,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:32:05,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:32:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:32:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:32:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:32:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:32:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:32:28,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 15:32:28,457 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:32:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:32:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1274712433, now seen corresponding path program 1 times [2022-10-03 15:32:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:32:28,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588819687] [2022-10-03 15:32:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:32:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 47538 backedges. 419 proven. 16668 refuted. 0 times theorem prover too weak. 30451 trivial. 0 not checked. [2022-10-03 15:32:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:32:41,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588819687] [2022-10-03 15:32:41,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588819687] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:32:41,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289199137] [2022-10-03 15:32:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:32:41,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:32:41,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 15:32:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:43,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 17044 conjuncts, 136 conjunts are in the unsatisfiable core [2022-10-03 15:32:44,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:32:58,741 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 6 treesize of output 5 [2022-10-03 15:32:58,749 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 11 treesize of output 7 [2022-10-03 15:33:00,480 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:33:00,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2022-10-03 15:33:00,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:33:00,486 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 20 treesize of output 20 [2022-10-03 15:33:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 47538 backedges. 24151 proven. 5392 refuted. 0 times theorem prover too weak. 17995 trivial. 0 not checked. [2022-10-03 15:33:01,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:33:01,873 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3309 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_3308 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:33:01,894 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (forall ((v_ArrVal_3309 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (forall ((v_ArrVal_3308 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))))) is different from false [2022-10-03 15:33:01,916 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (forall ((v_ArrVal_3308 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (forall ((v_ArrVal_3309 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))) is different from false [2022-10-03 15:33:02,012 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< |c_ULTIMATE.start_read~$Pointer$_#value#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< |c_ULTIMATE.start_read~$Pointer$_#value#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) is different from false [2022-10-03 15:33:02,027 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|)))) is different from false [2022-10-03 15:33:02,064 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|)))) is different from false [2022-10-03 15:33:04,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 252 treesize of output 222 [2022-10-03 15:33:04,955 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 197 treesize of output 173 [2022-10-03 15:33:04,967 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 198 treesize of output 180 [2022-10-03 15:33:05,004 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 15:33:05,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 284 [2022-10-03 15:33:05,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:33:05,023 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 312 treesize of output 296 [2022-10-03 15:33:05,031 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 163 treesize of output 157 [2022-10-03 15:33:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 47538 backedges. 24151 proven. 4909 refuted. 0 times theorem prover too weak. 17995 trivial. 483 not checked. [2022-10-03 15:33:24,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289199137] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:33:24,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:33:24,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 42] total 120 [2022-10-03 15:33:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732474458] [2022-10-03 15:33:24,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:33:24,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2022-10-03 15:33:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:33:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2022-10-03 15:33:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=12446, Unknown=6, NotChecked=1374, Total=14280 [2022-10-03 15:33:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:24,481 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:33:24,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 120 states have (on average 50.53333333333333) internal successors, (6064), 120 states have internal predecessors, (6064), 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-03 15:33:24,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:24,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:33:24,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:33:24,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-10-03 15:33:24,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:33:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 15:33:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:33:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:35:43,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse17 (select .cse15 .cse9)) (.cse2 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse11 (select .cse3 .cse9))) (let ((.cse5 (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse12 (= .cse4 .cse11)) (.cse7 (= .cse17 .cse2)) (.cse8 (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse13 (+ |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (- 4))) (.cse10 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| 4) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= .cse2 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.offset| 0) (<= (+ 2 (select .cse3 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse4) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= 8 .cse5) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q_#1.offset| 0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) .cse7 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse8) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse5 .cse10) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) .cse10) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse2) (= .cse11 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q_#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base| .cse11) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= 4 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 .cse10) .cse12 (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (or (and .cse7 |c_ULTIMATE.start_fifo_empty_#t~short10#1| .cse12) (and (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|) (or (not .cse12) (not .cse7)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select .cse3 .cse13)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| .cse8 8) (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| .cse10 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= .cse1 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| 0) (= .cse14 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= (select .cse15 .cse13) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) .cse10) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse16 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse16 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse14) (= .cse17 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse17))))) is different from false [2022-10-03 15:35:43,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse2 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse4) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 .cse4)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))))) is different from false [2022-10-03 15:35:43,772 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse2 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse4) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 .cse4)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))))) is different from false [2022-10-03 15:35:43,828 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse2 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse4) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 .cse4)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))))) is different from false [2022-10-03 15:35:43,836 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse2 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse4) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 .cse4)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))))) is different from false [2022-10-03 15:35:43,974 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse2 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse4) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 .cse4)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0))) is different from false [2022-10-03 15:35:43,981 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse5 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse1 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< |c_ULTIMATE.start_read~$Pointer$_#value#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse4) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse5) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= .cse5 (select .cse1 .cse4)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< |c_ULTIMATE.start_read~$Pointer$_#value#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))))) is different from false [2022-10-03 15:35:43,985 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (<= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| .cse0) (<= .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= (+ 2 (select .cse2 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse1 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 .cse4) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (forall ((v_ArrVal_3308 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (forall ((v_ArrVal_3309 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= .cse0 (select .cse2 .cse4)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0)))) is different from false [2022-10-03 15:35:43,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| .cse1) (<= (+ (select .cse2 4) 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (let ((.cse3 (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse3 .cse4))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)) (forall ((v_ArrVal_3309 (Array Int Int))) (let ((.cse5 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int)) (or (forall ((v_ArrVal_3308 (Array Int Int))) (let ((.cse6 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|)))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select .cse2 .cse4) .cse1)))) is different from false [2022-10-03 15:36:49,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse17 (select .cse15 .cse9)) (.cse2 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse11 (select .cse3 .cse9))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse5 (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse12 (= .cse4 .cse11)) (.cse7 (= .cse17 .cse2)) (.cse8 (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse13 (+ |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (- 4))) (.cse10 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| 4) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse1) (= .cse2 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.offset| 0) (<= (+ 2 (select .cse3 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse4) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= 8 .cse5) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) .cse7 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse8) (<= 8 (select |c_#length| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse5 .cse10) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) .cse10) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse2) (= .cse11 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base| .cse11) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= 4 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 .cse10) .cse12 (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (or (and .cse7 |c_ULTIMATE.start_fifo_empty_#t~short10#1| .cse12) (and (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|) (or (not .cse12) (not .cse7)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select .cse3 .cse13)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| .cse8 8) (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| .cse10 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= .cse1 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) 1) (= .cse14 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= (select .cse15 .cse13) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) .cse10) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse16 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse16 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse14) (= .cse17 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse17))))) is different from false [2022-10-03 15:38:52,419 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse17 (select .cse15 .cse9)) (.cse2 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse11 (select .cse3 .cse9))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse5 (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse12 (= .cse4 .cse11)) (.cse7 (= .cse17 .cse2)) (.cse8 (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse13 (+ |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (- 4))) (.cse10 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| 4) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse1) (= .cse2 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.offset| 0) (<= (+ 2 (select .cse3 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse4) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= 8 .cse5) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (<= (+ 2 |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) .cse7 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse8) (<= 8 (select |c_#length| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse5 .cse10) (<= (select |c_#length| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) .cse10) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse2) (= .cse11 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base| .cse11) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= 4 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (not (= |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (not (= |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 .cse10) .cse12 (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (or (and .cse7 |c_ULTIMATE.start_fifo_empty_#t~short10#1| .cse12) (and (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|) (or (not .cse12) (not .cse7)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select .cse3 .cse13)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| .cse8 8) (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| .cse10 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= .cse1 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) 1) (= .cse14 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= (select .cse15 .cse13) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) .cse10) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse16 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse16 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse14) (= .cse17 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse17))))) is different from false [2022-10-03 15:39:09,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse16 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse18 (select .cse16 .cse9)) (.cse2 (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse12 (select .cse3 .cse9))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse5 (select |c_#length| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse11 (select |c_#length| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|)) (.cse13 (= .cse4 .cse12)) (.cse7 (= .cse18 .cse2)) (.cse8 (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (- 4))) (.cse10 (select |c_#length| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse15 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (<= .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse1) (= .cse2 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= (+ |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.offset| 0) (<= (+ 2 (select .cse3 4)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse4) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= 8 .cse5) (= |c_pusherThread1of1ForFork0_~q~0#1.offset| 0) (= (select |c_#valid| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (<= .cse0 |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3308 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|) (let ((.cse6 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3308) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) .cse7 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 0) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse8) (<= 8 (select |c_#length| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse9) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= .cse4 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= .cse5 .cse10) (<= .cse11 .cse10) (= |c_pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| 0) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse2) (= .cse12 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base| .cse12) (= |c_pusherThread1of1ForFork0_#in~q_#1.offset| 0) (<= 8 .cse11) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (<= 4 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (not (= |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (not (= |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_#res#1.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (<= 8 .cse10) .cse13 (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (or (and .cse7 |c_ULTIMATE.start_fifo_empty_#t~short10#1| .cse13) (and (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|) (or (not .cse13) (not .cse7)))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select .cse3 .cse14)) (<= (+ 2 |c_pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|)) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| .cse8 8) (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| .cse10 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= .cse1 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) 1) (= .cse15 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= 8 (select |c_pusherThread1of1ForFork0_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= (select .cse16 .cse14) |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) .cse10) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| Int) (v_ArrVal_3309 (Array Int Int))) (or (let ((.cse17 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74| v_ArrVal_3309) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse17 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse17 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.base_74|))) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse15) (= .cse18 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|) (<= (+ |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| 2) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse18))))) is different from false