/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-bug_1w1r.line1446.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:42:25,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:42:25,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:42:25,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:42:25,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:42:25,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:42:25,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:42:25,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:42:25,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:42:25,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:42:25,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:42:25,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:42:25,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:42:25,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:42:25,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:42:25,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:42:25,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:42:25,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:42:25,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:42:25,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:42:25,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:42:25,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:42:25,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:42:25,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:42:25,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:42:25,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:42:25,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:42:25,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:42:25,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:42:25,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:42:25,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:42:25,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:42:25,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:42:25,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:42:25,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:42:25,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:42:25,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:42:25,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:42:25,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:42:25,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:42:25,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:42:25,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:42:25,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:42:25,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:42:25,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:42:25,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:42:25,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:42:25,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:42:25,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:42:25,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:42:25,775 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:42:25,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:42:25,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:42:25,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:42:25,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:42:25,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:42:25,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:42:25,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:42:25,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:42:25,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:42:25,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:42:25,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:42:25,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:42:25,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:42:25,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:42:25,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:42:25,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:42:25,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:42:25,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:42:25,779 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:42:25,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:42:25,780 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 14:42:25,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:42:25,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:42:25,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:42:25,953 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:42:25,954 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:42:25,955 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-bug_1w1r.line1446.bpl [2022-10-03 14:42:25,956 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1446.bpl' [2022-10-03 14:42:26,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:42:26,028 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:42:26,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:42:26,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:42:26,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:42:26,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:42:26,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:42:26,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:42:26,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:42:26,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/1) ... [2022-10-03 14:42:26,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:42:26,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:42:26,211 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 14:42:26,218 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 14:42:26,245 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:42:26,246 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:42:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:42:26,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:42:26,248 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 14:42:26,378 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:42:26,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:42:27,286 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:42:27,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:42:27,323 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:42:27,326 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:42:27 BoogieIcfgContainer [2022-10-03 14:42:27,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:42:27,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:42:27,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:42:27,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:42:27,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:42:26" (1/2) ... [2022-10-03 14:42:27,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307d5ee3 and model type divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:42:27, skipping insertion in model container [2022-10-03 14:42:27,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1446.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:42:27" (2/2) ... [2022-10-03 14:42:27,339 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1446.bpl [2022-10-03 14:42:27,345 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:42:27,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:42:27,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:42:27,354 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:42:27,485 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:42:27,543 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:42:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:42:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:42:27,545 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 14:42:27,555 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 14:42:27,587 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:42:27,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:42:27,605 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;@2fcceef3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:42:27,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:42:27,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:42:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:42:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1449636382, now seen corresponding path program 1 times [2022-10-03 14:42:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:42:28,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25227298] [2022-10-03 14:42:28,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:42:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:28,418 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 14:42:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:42:28,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25227298] [2022-10-03 14:42:28,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25227298] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:42:28,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:42:28,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:42:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963162341] [2022-10-03 14:42:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:42:28,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:42:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:42:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:42:28,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:42:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:28,443 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:42:28,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 311.5) internal successors, (623), 2 states have internal predecessors, (623), 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 14:42:28,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:28,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:42:28,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:42:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:42:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash -394341134, now seen corresponding path program 1 times [2022-10-03 14:42:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:42:28,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133084819] [2022-10-03 14:42:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:42:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:29,491 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 14:42:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:42:29,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133084819] [2022-10-03 14:42:29,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133084819] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:42:29,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:42:29,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 14:42:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577347026] [2022-10-03 14:42:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:42:29,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 14:42:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:42:29,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 14:42:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 14:42:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:29,498 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:42:29,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 43.0625) internal successors, (689), 17 states have internal predecessors, (689), 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 14:42:29,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:29,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:42:31,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:42:31,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:42:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:42:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1728229747, now seen corresponding path program 1 times [2022-10-03 14:42:31,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:42:31,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565752922] [2022-10-03 14:42:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:42:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 143 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:42:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:42:31,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565752922] [2022-10-03 14:42:31,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565752922] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:42:31,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840271887] [2022-10-03 14:42:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:31,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:42:31,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:42:31,771 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 14:42:31,772 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 14:42:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:32,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 149 conjunts are in the unsatisfiable core [2022-10-03 14:42:32,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:42:34,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-10-03 14:42:34,670 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 12 treesize of output 11 [2022-10-03 14:42:34,874 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-10-03 14:42:34,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-10-03 14:42:35,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:42:35,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:42:35,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:42:35,320 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 17 [2022-10-03 14:42:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-10-03 14:42:35,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:42:35,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840271887] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:42:35,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:42:35,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [14] total 59 [2022-10-03 14:42:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715944059] [2022-10-03 14:42:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:42:35,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-03 14:42:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:42:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-03 14:42:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3198, Unknown=0, NotChecked=0, Total=3422 [2022-10-03 14:42:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:35,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:42:35,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 18.479166666666668) internal successors, (887), 48 states have internal predecessors, (887), 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 14:42:35,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:35,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:42:35,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:42:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:42:44,164 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 14:42:44,357 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 14:42:44,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:42:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:42:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1903739038, now seen corresponding path program 1 times [2022-10-03 14:42:44,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:42:44,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586675223] [2022-10-03 14:42:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:42:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-10-03 14:42:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:42:45,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586675223] [2022-10-03 14:42:45,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586675223] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:42:45,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352013235] [2022-10-03 14:42:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:45,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:42:45,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:42:45,137 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 14:42:45,138 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 14:42:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:45,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 3256 conjuncts, 310 conjunts are in the unsatisfiable core [2022-10-03 14:42:45,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:42:45,925 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 14:42:46,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:42:46,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:42:46,855 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:42:46,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-03 14:42:51,614 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 14:42:51,619 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 14:42:53,429 INFO L356 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2022-10-03 14:42:53,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 49 [2022-10-03 14:42:53,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-10-03 14:42:54,196 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:42:54,197 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2022-10-03 14:42:55,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:42:55,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-10-03 14:42:55,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-03 14:42:57,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 34 [2022-10-03 14:42:58,642 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-10-03 14:42:58,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2022-10-03 14:42:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 287 proven. 309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:42:59,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:43:03,384 INFO L356 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-10-03 14:43:03,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 94 [2022-10-03 14:43:04,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (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_459) |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))))) is different from false [2022-10-03 14:43:04,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_459) |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|)))) is different from false [2022-10-03 14:43:04,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_459) |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))))) is different from false [2022-10-03 14:43:07,584 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 251 treesize of output 201 [2022-10-03 14:43:07,588 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 182 treesize of output 154 [2022-10-03 14:43:07,593 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 118 treesize of output 94 [2022-10-03 14:43:07,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2022-10-03 14:43:07,601 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 71 treesize of output 65 [2022-10-03 14:43:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 196 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-10-03 14:43:16,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352013235] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:43:16,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:43:16,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 109, 96] total 216 [2022-10-03 14:43:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609168588] [2022-10-03 14:43:16,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:43:16,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2022-10-03 14:43:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:43:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2022-10-03 14:43:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=43404, Unknown=4, NotChecked=1272, Total=46440 [2022-10-03 14:43:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:16,452 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:43:16,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 216 states have (on average 16.01851851851852) internal successors, (3460), 216 states have internal predecessors, (3460), 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 14:43:16,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:16,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:43:16,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:43:16,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:43:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:43:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-10-03 14:43:45,475 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 14:43:45,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:43:45,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:45,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1694292634, now seen corresponding path program 2 times [2022-10-03 14:43:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:45,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110482411] [2022-10-03 14:43:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 150 proven. 64 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2022-10-03 14:43:46,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110482411] [2022-10-03 14:43:46,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110482411] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:43:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534871197] [2022-10-03 14:43:46,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 14:43:46,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:43:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:46,356 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 14:43:46,357 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 14:43:46,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 14:43:46,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 14:43:46,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 217 conjunts are in the unsatisfiable core [2022-10-03 14:43:46,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:43:46,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:43:47,185 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 14:43:47,187 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 14:43:49,270 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-10-03 14:43:49,271 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 14:43:49,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:49,697 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 14:43:49,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2022-10-03 14:43:49,705 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 14:43:49,705 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 73 treesize of output 69 [2022-10-03 14:43:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-10-03 14:43:51,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:43:51,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534871197] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:43:51,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:43:51,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [11] total 71 [2022-10-03 14:43:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976714889] [2022-10-03 14:43:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:43:51,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-10-03 14:43:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:43:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-10-03 14:43:51,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=4738, Unknown=0, NotChecked=0, Total=4970 [2022-10-03 14:43:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:51,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:43:51,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 13.73015873015873) internal successors, (865), 63 states have internal predecessors, (865), 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 14:43:51,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:51,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:43:51,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:43:51,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 172 states. [2022-10-03 14:43:51,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:44:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:44:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-10-03 14:44:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:44:01,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 14:44:01,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:44:01,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:44:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:44:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1420223238, now seen corresponding path program 1 times [2022-10-03 14:44:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:44:01,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559016395] [2022-10-03 14:44:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:44:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 150 proven. 64 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-10-03 14:44:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:44:02,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559016395] [2022-10-03 14:44:02,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559016395] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:44:02,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319113900] [2022-10-03 14:44:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:44:02,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:44:02,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:44:02,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:44:02,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 14:44:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:44:03,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 3329 conjuncts, 289 conjunts are in the unsatisfiable core [2022-10-03 14:44:03,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:44:03,823 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 14:44:03,825 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 14:44:04,714 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 14:44:04,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 40 [2022-10-03 14:44:04,731 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 14:44:04,731 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 24 treesize of output 32 [2022-10-03 14:44:04,737 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 9 treesize of output 3 [2022-10-03 14:44:06,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 57 [2022-10-03 14:44:06,671 INFO L356 Elim1Store]: treesize reduction 65, result has 30.9 percent of original size [2022-10-03 14:44:06,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 66 [2022-10-03 14:44:11,998 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 39 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 14:44:17,212 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 12 treesize of output 11 [2022-10-03 14:44:28,186 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-10-03 14:44:28,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-10-03 14:44:28,634 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 49 treesize of output 42 [2022-10-03 14:44:28,637 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2022-10-03 14:44:31,702 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:44:31,703 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-10-03 14:44:31,714 INFO L356 Elim1Store]: treesize reduction 41, result has 6.8 percent of original size [2022-10-03 14:44:31,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 50 [2022-10-03 14:44:31,948 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 54 treesize of output 30 [2022-10-03 14:44:32,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:44:32,562 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2022-10-03 14:44:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 441 proven. 153 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-03 14:44:32,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:44:33,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_867)) (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))))) is different from false [2022-10-03 14:44:33,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (< v_ArrVal_867 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))))) is different from false [2022-10-03 14:44:33,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (< v_ArrVal_867 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))))) is different from false [2022-10-03 14:44:33,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4)))) is different from false [2022-10-03 14:44:33,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4)))) is different from false [2022-10-03 14:44:33,466 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4))))) is different from false [2022-10-03 14:44:33,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse0) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4))))) is different from false [2022-10-03 14:44:33,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store .cse3 .cse4 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse3 .cse4) 4)))))) is different from false [2022-10-03 14:44:33,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store .cse3 .cse4 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse3 .cse4) 4)))))) is different from false [2022-10-03 14:44:35,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse5 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_866)))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse6 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_864)))) (let ((.cse9 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse7 (select .cse6 .cse0)) (.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse8 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (let ((.cse4 (store .cse6 .cse0 (store .cse7 .cse8 v_ArrVal_867)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse3 12) (select (select .cse4 (select (select (store .cse5 .cse0 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse3)))) (< v_ArrVal_867 (+ (select .cse7 .cse8) 4)) (not (= (select .cse9 .cse2) .cse8)))))))) is different from false [2022-10-03 14:44:35,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse7 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_866)))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_864)))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select .cse8 .cse2)) (.cse4 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= (select .cse0 .cse1) .cse2)) (< v_ArrVal_867 (+ (select .cse3 .cse4) 4)) (let ((.cse6 (store .cse8 .cse2 (store .cse3 .cse4 v_ArrVal_867)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse5) (select (select .cse6 (select (select (store .cse7 .cse2 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse5)))) (not (= .cse4 (select .cse9 .cse1))))))))) is different from false [2022-10-03 14:44:35,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_866)))) (let ((.cse7 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_864)))) (let ((.cse9 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse5 (select .cse4 .cse3)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse6 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse1 (store .cse4 .cse3 (store .cse5 .cse6 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store .cse2 .cse3 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (not (= .cse3 (select .cse7 .cse8))) (< v_ArrVal_867 (+ 4 (select .cse5 .cse6))) (not (= (select .cse9 .cse8) .cse6)))))))) is different from false [2022-10-03 14:44:37,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-03 14:44:37,804 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_860)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_861)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse8))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|)) is different from false [2022-10-03 14:44:37,867 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_860)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_861)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse8))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ 4 (select .cse6 .cse7))))))))))) is different from false [2022-10-03 14:44:37,893 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_860)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_861)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse8))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse8))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_867 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_867)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))))))))))) is different from false [2022-10-03 14:44:38,297 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_860)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_861)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse8))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse8))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_867 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_867)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) is different from false [2022-10-03 14:44:38,309 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_860)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_861)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse8))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse8))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_867 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_867)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) is different from false [2022-10-03 14:44:38,343 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_860)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_861)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse8))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse8))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_867 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_867)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse2) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))))))))))) is different from false [2022-10-03 14:44:38,363 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_860)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_861)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse8))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:44:41,972 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse13 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse13 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse11 .cse12))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse2))) (.cse7 (select .cse6 .cse12))) (let ((.cse1 (select .cse8 .cse7))) (or (< v_ArrVal_867 (+ (select .cse1 .cse2) 4)) (let ((.cse4 (store .cse8 .cse7 (store .cse1 .cse2 v_ArrVal_867)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse3 12) (select (select .cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7)) .cse7 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse3)))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse9 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse10) (+ .cse10 12))))))))))) is different from false [2022-10-03 14:44:42,006 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_855))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse12 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse12 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse11))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse11))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_867 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_867)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse2 12) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse8 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9) (+ .cse9 12)))))))))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse13 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse13 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:44:42,021 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_855))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$.base| .cse12 (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse13 .cse14 (select .cse13 .cse14)))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse11))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse11))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4)) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9) (+ .cse9 12))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse15 (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse15)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse16 .cse17 (select .cse16 .cse17))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:44:42,076 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_855))) (let ((.cse13 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse14 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$.base| .cse15 (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse15)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse16 .cse17 (select .cse16 .cse17)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse10 (select .cse13 .cse14))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse10))) (.cse7 (select .cse6 .cse14))) (let ((.cse9 (select .cse8 .cse7))) (or (let ((.cse4 (store .cse8 .cse7 (store .cse9 .cse10 v_ArrVal_867)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse3 12) (select (select .cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7)) .cse7 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse3)))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse11 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse12) (+ .cse12 12))) (< v_ArrVal_867 (+ (select .cse9 .cse10) 4))))))))))) is different from false [2022-10-03 14:44:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 475 proven. 50 refuted. 0 times theorem prover too weak. 39 trivial. 69 not checked. [2022-10-03 14:44:44,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319113900] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:44:44,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:44:44,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 93, 77] total 178 [2022-10-03 14:44:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120770757] [2022-10-03 14:44:44,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:44:44,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-10-03 14:44:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:44:44,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-10-03 14:44:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=22270, Unknown=70, NotChecked=7544, Total=31506 [2022-10-03 14:44:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:44,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:44:44,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 178 states, 178 states have (on average 18.34269662921348) internal successors, (3265), 178 states have internal predecessors, (3265), 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 14:44:44,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:44:44,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:44:44,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:44:44,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 173 states. [2022-10-03 14:44:44,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:44:44,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:40,575 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse12))) (and (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| 0) (<= 4 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|)) (= |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| 0) (<= |c_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType#1| (select |c_#length| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (not (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| .cse0)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| 0) (= |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|) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_866)))) (let ((.cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_864)))) (let ((.cse10 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse6 (select .cse5 .cse4)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse2 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse1 12) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1)))) (not (= .cse4 (select .cse8 .cse9))) (< v_ArrVal_867 (+ 4 (select .cse6 .cse7))) (not (= (select .cse10 .cse9) .cse7)))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse12))) (<= (+ .cse11 12) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse11))) (<= 4 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| 0)))) is different from false [2022-10-03 14:45:41,937 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse12))) (and (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (not (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| .cse0)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_866)))) (let ((.cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_864)))) (let ((.cse10 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse6 (select .cse5 .cse4)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse2 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse1 12) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1)))) (not (= .cse4 (select .cse8 .cse9))) (< v_ArrVal_867 (+ 4 (select .cse6 .cse7))) (not (= (select .cse10 .cse9) .cse7)))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (let ((.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse12))) (<= (+ .cse11 12) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse11)))))) is different from false [2022-10-03 14:45:42,888 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse1 (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse2))) (and (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (let ((.cse0 (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse2))) (<= (+ .cse0 12) (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| .cse1) .cse0))) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (not (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| .cse1)) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse10 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_866)))) (let ((.cse3 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_864)))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse5 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse6 (select .cse11 .cse5)) (.cse7 (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= (select .cse3 .cse4) .cse5)) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4)) (let ((.cse9 (store .cse11 .cse5 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse8) (select (select .cse9 (select (select (store .cse10 .cse5 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse8)))) (not (= .cse7 (select .cse12 .cse4)))))))))))) is different from false [2022-10-03 14:45:44,894 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse1 (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse2))) (and (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (let ((.cse0 (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse2))) (<= (+ .cse0 12) (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| .cse1) .cse0))) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse8 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_866)))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_864)))) (let ((.cse12 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse10 (select .cse9 .cse3)) (.cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse11 (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse3 (select .cse4 .cse5))) (let ((.cse7 (store .cse9 .cse3 (store .cse10 .cse11 v_ArrVal_867)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse6 12) (select (select .cse7 (select (select (store .cse8 .cse3 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse6)))) (< v_ArrVal_867 (+ (select .cse10 .cse11) 4)) (not (= (select .cse12 .cse5) .cse11)))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_pusherThread1of1ForFork0_#in~q_#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|))))) is different from false [2022-10-03 14:46:57,245 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse29 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse4 (select .cse7 .cse29)) (.cse5 (select .cse6 .cse29)) (.cse0 (= (select (select (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse26 (let ((.cse27 (select |c_#memory_$Pointer$.base| .cse26)) (.cse28 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse27 .cse28 (select .cse27 .cse28))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse23 v_ArrVal_855))) (let ((.cse21 (select .cse19 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse22 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse13 (store |c_#memory_$Pointer$.base| .cse23 (let ((.cse24 (select |c_#memory_$Pointer$.base| .cse23)) (.cse25 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse24 .cse25 (select .cse24 .cse25)))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse18 (select .cse21 .cse22))) (let ((.cse16 (store .cse19 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse21 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse18))) (.cse15 (select .cse14 .cse22))) (let ((.cse17 (select .cse16 .cse15))) (or (let ((.cse12 (store .cse16 .cse15 (store .cse17 .cse18 v_ArrVal_867)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse11 12) (select (select .cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse15)) .cse15 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse11)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse19 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse20) (+ .cse20 12))) (< v_ArrVal_867 (+ (select .cse17 .cse18) 4)))))))))))) (and (or .cse0 .cse1 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse2)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| .cse3))) (or (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)) .cse0 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) .cse1) (or .cse0 .cse1) (or .cse0 (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse4)) (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse5)) .cse1) (or (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base|)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|)) .cse0 .cse1) (or (not (= (select .cse6 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) .cse5)) .cse0 .cse1 (not (= (select .cse7 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) .cse4))) (or .cse0 .cse1 (not (= .cse4 .cse3)) (not (= .cse2 .cse5))) (or .cse0 .cse1 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| .cse4)) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse5))) (let ((.cse9 (+ 4 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))) (or (not (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse8 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (select .cse8 .cse9)))) .cse0 (not (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse10 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (select .cse10 .cse9)))) .cse1))))) is different from false [2022-10-03 14:46:58,836 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (and (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse8 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse11))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse11))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4)) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9) (+ .cse9 12))))))))))) (or (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse12 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_855))) (let ((.cse15 (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse23 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse20 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)))) (let ((.cse13 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse17 (select .cse15 .cse23))) (let ((.cse22 (store .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse17))) (.cse21 (select .cse13 .cse23))) (let ((.cse16 (select .cse22 .cse21))) (or (let ((.cse14 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse12 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse14) (+ .cse14 12))) (< v_ArrVal_867 (+ (select .cse16 .cse17) 4)) (let ((.cse19 (store .cse22 .cse21 (store .cse16 .cse17 v_ArrVal_867)))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse18 12) (select (select .cse19 (select (select (store (store .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse21)) .cse21 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse18))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse24 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse36 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse32 (select .cse35 .cse36))) (let ((.cse30 (store .cse33 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse35 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse32))) (.cse29 (select .cse28 .cse36))) (let ((.cse31 (select .cse30 .cse29))) (or (let ((.cse26 (store .cse30 .cse29 (store .cse31 .cse32 v_ArrVal_867)))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse25 12) (select (select .cse26 (select (select (store (store .cse27 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse28 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse29)) .cse29 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse25)))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse33 (select .cse28 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse34) (+ .cse34 12))) (< v_ArrVal_867 (+ 4 (select .cse31 .cse32))))))))))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse24 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse42 (select .cse39 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse48 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)))) (let ((.cse40 (select .cse45 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse38 (select .cse42 .cse48))) (let ((.cse47 (store .cse39 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse42 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse38))) (.cse46 (select .cse40 .cse48))) (let ((.cse37 (select .cse47 .cse46))) (or (< v_ArrVal_867 (+ 4 (select .cse37 .cse38))) (let ((.cse41 (select .cse42 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse39 (select .cse40 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse41) (+ .cse41 12))) (let ((.cse44 (store .cse47 .cse46 (store .cse37 .cse38 v_ArrVal_867)))) (let ((.cse43 (select (select .cse44 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse43 12) (select (select .cse44 (select (select (store (store .cse45 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse40 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse46)) .cse46 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse43)))))))))))))) is different from false [2022-10-03 14:47:02,272 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_861 Int) (v_ArrVal_860 Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_860)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_861)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse11 .cse9))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse2))) (.cse7 (select .cse6 .cse9))) (let ((.cse1 (select .cse8 .cse7))) (or (< v_ArrVal_867 (+ (select .cse1 .cse2) 4)) (let ((.cse4 (store .cse8 .cse7 (store .cse1 .cse2 v_ArrVal_867)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse3) (select (select .cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7)) .cse7 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse3))))))))))))) (and (or .cse0 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|)) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|) .cse0))) is different from false [2022-10-03 14:47:02,432 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse9 .cse8))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse8))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse2 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse1 12) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1)))) (< v_ArrVal_867 (+ 4 (select .cse6 .cse7))))))))))) (and (or .cse0 (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base|)) (or .cse0 (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)))) is different from false [2022-10-03 14:47:02,472 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_866 Int) (v_ArrVal_864 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_866)))) (let ((.cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_864)))) (let ((.cse10 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse6 (select .cse5 .cse4)) (.cse9 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse2 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse1 12) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1)))) (not (= .cse4 (select .cse8 .cse9))) (< v_ArrVal_867 (+ 4 (select .cse6 .cse7))) (not (= (select .cse10 .cse9) .cse7)))))))))) (and (or (not (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1)) .cse0) .cse0)) is different from false [2022-10-03 14:47:05,031 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse27 (let ((.cse28 (select |c_#memory_$Pointer$.base| .cse27)) (.cse29 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse28 .cse29 (select .cse28 .cse29))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse24 v_ArrVal_855))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse23 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse14 (store |c_#memory_$Pointer$.base| .cse24 (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse24)) (.cse26 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse25 .cse26 (select .cse25 .cse26)))))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse19 (select .cse22 .cse23))) (let ((.cse17 (store .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse19))) (.cse16 (select .cse15 .cse23))) (let ((.cse18 (select .cse17 .cse16))) (or (let ((.cse13 (store .cse17 .cse16 (store .cse18 .cse19 v_ArrVal_867)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse12 12) (select (select .cse13 (select (select (store (store .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse16)) .cse16 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse12)))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse20 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse21) (+ .cse21 12))) (< v_ArrVal_867 (+ (select .cse18 .cse19) 4))))))))))) (.cse1 (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|)) (.cse3 (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse9 (store .cse10 .cse11 v_ArrVal_867)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse7 12) (select (select .cse8 (select (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse7)))) (< v_ArrVal_867 (+ (select .cse10 .cse11) 4)))))))) (and (or .cse0 .cse1 .cse2) (or (not (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|)) .cse3 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) .cse3 (or (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base|)) .cse3 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|))) (or .cse0 .cse2) (let ((.cse5 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (or (not (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse4 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (select .cse4 .cse5)))) .cse0 .cse2 (not (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse6 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (select .cse6 .cse5)))))) (or .cse3 .cse1) (or .cse3 (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (not (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))))) is different from false [2022-10-03 14:47:05,041 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store .cse3 .cse4 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse3 .cse4) 4)))))) (or (= (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse6 .cse7 (select .cse6 .cse7))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse20 v_ArrVal_855))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse19 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse10 (store |c_#memory_$Pointer$.base| .cse20 (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20)) (.cse22 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse21 .cse22 (select .cse21 .cse22)))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse15 (select .cse18 .cse19))) (let ((.cse13 (store .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse18 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse15))) (.cse12 (select .cse11 .cse19))) (let ((.cse14 (select .cse13 .cse12))) (or (let ((.cse9 (store .cse13 .cse12 (store .cse14 .cse15 v_ArrVal_867)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse8 12) (select (select .cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse12)) .cse12 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse8)))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse16 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse17) (+ .cse17 12))) (< v_ArrVal_867 (+ (select .cse14 .cse15) 4)))))))))))) is different from false [2022-10-03 14:47:05,082 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_855))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$.base| .cse12 (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse13 .cse14 (select .cse13 .cse14)))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse11))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse11))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4)) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9) (+ .cse9 12))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse15 (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse15)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse16 .cse17 (select .cse16 .cse17))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse21 (select |c_#memory_$Pointer$.offset| .cse20)) (.cse22 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse20 (store .cse21 .cse22 v_ArrVal_867)))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse18 12) (select (select .cse19 (select (select (store |c_#memory_$Pointer$.base| .cse20 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse18)))) (< v_ArrVal_867 (+ (select .cse21 .cse22) 4))))))) is different from false [2022-10-03 14:47:05,091 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_855))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse12 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse12 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse10 .cse11))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse6 (select .cse5 .cse11))) (let ((.cse0 (select .cse7 .cse6))) (or (< v_ArrVal_867 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store .cse7 .cse6 (store .cse0 .cse1 v_ArrVal_867)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse2 12) (select (select .cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6)) .cse6 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse8 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9) (+ .cse9 12)))))))))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse13 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse13 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (or (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse16 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_867)))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse14) (select (select .cse15 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse14)))) (< v_ArrVal_867 (+ (select .cse16 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4)))))) is different from false [2022-10-03 14:47:05,098 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse12 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse13 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse13 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (select .cse11 .cse12))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse2))) (.cse7 (select .cse6 .cse12))) (let ((.cse1 (select .cse8 .cse7))) (or (< v_ArrVal_867 (+ (select .cse1 .cse2) 4)) (let ((.cse4 (store .cse8 .cse7 (store .cse1 .cse2 v_ArrVal_867)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse3 12) (select (select .cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7)) .cse7 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse3)))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse9 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse10) (+ .cse10 12))))))))))) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (or (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse16 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse14 12) (select (select .cse15 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse14)))) (< v_ArrVal_867 (+ (select .cse16 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4)))))) is different from false [2022-10-03 14:47:06,549 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse5 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (select .cse5 .cse11))) (let ((.cse10 (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse1))) (.cse9 (select .cse3 .cse11))) (let ((.cse0 (select .cse10 .cse9))) (or (< v_ArrVal_867 (+ 4 (select .cse0 .cse1))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse4) (+ .cse4 12))) (let ((.cse7 (store .cse10 .cse9 (store .cse0 .cse1 v_ArrVal_867)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse6 12) (select (select .cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse9)) .cse9 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse6)))))))))))) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse12 12) (select (select .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse12)))) (< v_ArrVal_867 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4))))) is different from false [2022-10-03 14:47:08,327 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse8 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse11))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse11))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4)) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9) (+ .cse9 12))))))))))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse23 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse19 (select .cse22 .cse23))) (let ((.cse17 (store .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse19))) (.cse16 (select .cse15 .cse23))) (let ((.cse18 (select .cse17 .cse16))) (or (let ((.cse13 (store .cse17 .cse16 (store .cse18 .cse19 v_ArrVal_867)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse12 12) (select (select .cse13 (select (select (store (store .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse16)) .cse16 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse12)))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse20 (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse21) (+ .cse21 12))) (< v_ArrVal_867 (+ 4 (select .cse18 .cse19))))))))))) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (< v_ArrVal_867 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (let ((.cse25 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse24 12) (select (select .cse25 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse24))))))) is different from false [2022-10-03 14:47:08,337 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse8 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_855))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse11 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse10 .cse11))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse4 (select .cse3 .cse11))) (let ((.cse6 (select .cse5 .cse4))) (or (let ((.cse1 (store .cse5 .cse4 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4)) .cse4 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4)) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse8 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9) (+ .cse9 12))))))))))) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (< v_ArrVal_867 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)) (let ((.cse13 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_867)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse12 12) (select (select .cse13 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse12))))))) is different from false [2022-10-03 14:47:08,348 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (or (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_867)) (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_867)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))))) (or (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_855))) (let ((.cse5 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse13 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse10 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)))) (let ((.cse3 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse5 .cse13))) (let ((.cse12 (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse11 (select .cse3 .cse13))) (let ((.cse6 (select .cse12 .cse11))) (or (let ((.cse4 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse4) (+ .cse4 12))) (< v_ArrVal_867 (+ (select .cse6 .cse7) 4)) (let ((.cse9 (store .cse12 .cse11 (store .cse6 .cse7 v_ArrVal_867)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse8 12) (select (select .cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse11)) .cse11 v_ArrVal_868) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse8))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:47:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:47:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:47:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:47:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-10-03 14:47:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:47:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2022-10-03 14:47:18,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 14:47:18,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:47:18,207 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:47:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:47:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash -610186518, now seen corresponding path program 1 times [2022-10-03 14:47:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:47:18,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130708766] [2022-10-03 14:47:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:47:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:47:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:47:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12217 backedges. 372 proven. 6154 refuted. 0 times theorem prover too weak. 5691 trivial. 0 not checked. [2022-10-03 14:47:22,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:47:22,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130708766] [2022-10-03 14:47:22,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130708766] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:47:22,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16821531] [2022-10-03 14:47:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:47:22,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:47:22,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:47:22,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:47:22,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-03 14:47:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:47:24,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 9887 conjuncts, 346 conjunts are in the unsatisfiable core [2022-10-03 14:47:24,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:47:27,146 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 14:47:27,151 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 14:47:28,347 INFO L356 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-10-03 14:47:28,348 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 38 [2022-10-03 14:47:28,360 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 14:47:28,360 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 22 treesize of output 30 [2022-10-03 14:47:29,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2022-10-03 14:47:29,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-10-03 14:47:29,795 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 10 treesize of output 9 [2022-10-03 14:47:30,411 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 14:47:30,418 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 14:47:30,461 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 14:47:30,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-10-03 14:47:31,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:47:31,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:47:31,855 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 14:47:31,858 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 66 [2022-10-03 14:47:31,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:47:31,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2022-10-03 14:47:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12217 backedges. 2886 proven. 4342 refuted. 0 times theorem prover too weak. 4989 trivial. 0 not checked. [2022-10-03 14:47:33,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:47:59,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-03 14:48:10,603 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1503 Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse16 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse16 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse15 .cse5))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse9 (select .cse12 .cse5))) (let ((.cse6 (select .cse13 .cse9))) (let ((.cse0 (store .cse13 .cse9 (store .cse6 .cse7 v_ArrVal_1503)))) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (let ((.cse8 (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse9)))) (store .cse8 .cse9 (let ((.cse10 (select .cse8 .cse9))) (store .cse10 .cse7 (select .cse10 .cse7))))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< (select (select .cse0 .cse1) .cse2) (+ .cse2 13)) (not (= .cse1 (select (select .cse3 .cse1) .cse2))) (= (select .cse4 .cse5) .cse2) (not (<= 0 .cse2)) (< (+ (select .cse6 .cse7) 4) v_ArrVal_1503))))))))))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse17 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse17 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:48:10,659 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1503 Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_1490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse16 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse16 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse6 (select .cse15 .cse1))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse6))) (.cse9 (select .cse12 .cse1))) (let ((.cse5 (select .cse13 .cse9))) (let ((.cse3 (store .cse13 .cse9 (store .cse5 .cse6 v_ArrVal_1503)))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (let ((.cse8 (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse9)))) (store .cse8 .cse9 (let ((.cse10 (select .cse8 .cse9))) (store .cse10 .cse6 (select .cse10 .cse6))))))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse0 .cse1) .cse2) (< (select (select .cse3 .cse4) .cse2) (+ .cse2 13)) (not (<= 0 .cse2)) (< (+ (select .cse5 .cse6) 4) v_ArrVal_1503) (not (= .cse4 (select (select .cse7 .cse4) .cse2))))))))))))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse17 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse17 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:48:10,683 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1503 Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse16 v_ArrVal_1490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse11 (store |c_#memory_$Pointer$.base| .cse16 (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16)) (.cse18 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse17 .cse18 (select .cse17 .cse18)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse7 (select .cse15 .cse5))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse7))) (.cse9 (select .cse12 .cse5))) (let ((.cse6 (select .cse13 .cse9))) (let ((.cse1 (store .cse13 .cse9 (store .cse6 .cse7 v_ArrVal_1503)))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse3 (let ((.cse8 (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse9)))) (store .cse8 .cse9 (let ((.cse10 (select .cse8 .cse9))) (store .cse10 .cse7 (select .cse10 .cse7))))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse0 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (< (select (select .cse1 .cse2) .cse0) (+ .cse0 13)) (not (= .cse2 (select (select .cse3 .cse2) .cse0))) (= (select .cse4 .cse5) .cse0) (< (+ (select .cse6 .cse7) 4) v_ArrVal_1503)))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (select (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse19 (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse19)) (.cse21 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse20 .cse21 (select .cse20 .cse21))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:48:10,767 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1503 Int) (v_ArrVal_1490 (Array Int Int))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse16 v_ArrVal_1490))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse11 (store |c_#memory_$Pointer$.base| .cse16 (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16)) (.cse18 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse17 .cse18 (select .cse17 .cse18)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (select .cse15 .cse6))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse4))) (.cse9 (select .cse12 .cse6))) (let ((.cse3 (select .cse13 .cse9))) (let ((.cse7 (store .cse13 .cse9 (store .cse3 .cse4 v_ArrVal_1503)))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse0 (let ((.cse8 (store .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset| .cse9)))) (store .cse8 .cse9 (let ((.cse10 (select .cse8 .cse9))) (store .cse10 .cse4 (select .cse10 .cse4))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (< (+ (select .cse3 .cse4) 4) v_ArrVal_1503) (= (select .cse5 .cse6) .cse2) (< (select (select .cse7 .cse1) .cse2) (+ 13 .cse2)) (not (<= 0 .cse2))))))))))))) (= (select (select (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse19 (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse19)) (.cse21 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse20 .cse21 (select .cse20 .cse21))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) is different from false [2022-10-03 14:48:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12217 backedges. 5467 proven. 108 refuted. 0 times theorem prover too weak. 6587 trivial. 55 not checked. [2022-10-03 14:48:15,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16821531] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:48:15,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:48:15,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 82, 81] total 168 [2022-10-03 14:48:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550082866] [2022-10-03 14:48:15,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:48:15,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2022-10-03 14:48:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:48:15,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2022-10-03 14:48:15,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1918, Invalid=24816, Unknown=14, NotChecked=1308, Total=28056 [2022-10-03 14:48:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:48:15,586 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:48:15,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 23.821428571428573) internal successors, (4002), 168 states have internal predecessors, (4002), 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 14:48:15,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:48:15,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:48:15,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-10-03 14:48:15,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 202 states. [2022-10-03 14:48:15,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-10-03 14:48:15,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 393 states. [2022-10-03 14:48:15,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:53,830 WARN L233 SmtUtils]: Spent 21.92s on a formula simplification. DAG size of input: 145 DAG size of output: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 14:51:21,539 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (= (select |c_#valid| (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) 0) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1499 Int) (v_ArrVal_1503 Int)) (let ((.cse11 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_1497)))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse13 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_1499)))) (let ((.cse6 (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse7 (select .cse13 .cse10)) (.cse5 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse8 (store .cse13 .cse10 (store .cse7 .cse5 v_ArrVal_1503)))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (store .cse11 .cse10 (let ((.cse12 (select .cse11 .cse10))) (store .cse12 .cse5 (select .cse12 .cse5)))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= .cse2 (select .cse3 .cse4)) (not (= .cse5 (select .cse6 .cse4))) (< (+ (select .cse7 .cse5) 4) v_ArrVal_1503) (< (select (select .cse8 .cse0) .cse2) (+ .cse2 13)) (not (<= 0 .cse2)) (not (= (select .cse9 .cse4) .cse10))))))))))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|)) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| 0) (= |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|) (<= 8 (select |c_#length| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) 4)) 0) (<= (+ |c_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType#1| 4) (select |c_#length| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1499 Int) (v_ArrVal_1503 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_1497)))) (let ((.cse19 (select .cse25 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| v_ArrVal_1499)))) (let ((.cse22 (select .cse27 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse21 (select .cse19 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse17 (select .cse27 .cse21)) (.cse18 (select .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse14 (store .cse27 .cse21 (store .cse17 .cse18 v_ArrVal_1503)))) (let ((.cse24 (store .cse25 .cse21 (let ((.cse26 (select .cse25 .cse21))) (store .cse26 .cse18 (select .cse26 .cse18))))) (.cse23 (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse20 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse16 (select .cse23 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse15 (select (select .cse24 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< (select (select .cse14 .cse15) .cse16) (+ .cse16 13)) (< (+ (select .cse17 .cse18) 4) v_ArrVal_1503) (not (= (select .cse19 .cse20) .cse21)) (not (= (select .cse22 .cse20) .cse18)) (= .cse16 (select .cse23 .cse20)) (not (<= 0 .cse16)) (not (= (select (select .cse24 .cse15) .cse16) .cse15))))))))))) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| 0) (<= (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|))) is different from false [2022-10-03 14:54:19,132 WARN L233 SmtUtils]: Spent 57.21s on a formula simplification. DAG size of input: 232 DAG size of output: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 14:54:50,320 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-10-03 14:54:50,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-10-03 14:54:50,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-03 14:54:50,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:54:50,522 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:152) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:164) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:97) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:121) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:322) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 58 more [2022-10-03 14:54:50,524 INFO L158 Benchmark]: Toolchain (without parser) took 744495.66ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 155.3MB in the beginning and 455.8MB in the end (delta: -300.4MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-10-03 14:54:50,524 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:54:50,524 INFO L158 Benchmark]: Boogie Preprocessor took 107.69ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 148.3MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 14:54:50,525 INFO L158 Benchmark]: RCFGBuilder took 1167.39ms. Allocated memory is still 201.3MB. Free memory was 148.3MB in the beginning and 141.1MB in the end (delta: 7.2MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2022-10-03 14:54:50,525 INFO L158 Benchmark]: TraceAbstraction took 743195.06ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 140.0MB in the beginning and 455.8MB in the end (delta: -315.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-10-03 14:54:50,525 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 107.69ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 148.3MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1167.39ms. Allocated memory is still 201.3MB. Free memory was 148.3MB in the beginning and 141.1MB in the end (delta: 7.2MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. * TraceAbstraction took 743195.06ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 140.0MB in the beginning and 455.8MB in the end (delta: -315.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 14:54:50,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...