/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1442.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:31:48,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:31:48,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:31:48,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:31:48,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:31:48,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:31:48,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:31:48,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:31:48,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:31:48,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:31:48,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:31:48,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:31:48,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:31:48,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:31:48,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:31:48,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:31:48,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:31:48,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:31:48,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:31:48,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:31:48,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:31:48,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:31:48,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:31:48,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:31:48,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:31:48,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:31:48,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:31:48,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:31:48,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:31:48,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:31:48,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:31:48,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:31:48,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:31:48,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:31:48,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:31:48,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:31:48,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:31:48,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:31:48,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:31:48,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:31:48,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:31:48,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:31:48,854 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:31:48,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:31:48,855 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:31:48,855 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:31:48,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:31:48,856 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:31:48,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:31:48,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:31:48,856 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:31:48,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:31:48,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:31:48,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:31:48,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:31:48,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:31:48,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:31:48,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:31:48,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:31:48,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:31:48,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:31:48,859 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 15:31:49,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:31:49,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:31:49,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:31:49,084 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:31:49,084 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:31:49,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1442.bpl [2022-10-03 15:31:49,086 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1442.bpl' [2022-10-03 15:31:49,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:31:49,152 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:31:49,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:31:49,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:31:49,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:31:49,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:31:49,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:31:49,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:31:49,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:31:49,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/1) ... [2022-10-03 15:31:49,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:31:49,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:31:49,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 15:31:49,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 15:31:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:31:49,417 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:31:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:31:49,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:31:49,419 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:31:49,580 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:31:49,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:31:50,558 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:31:50,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:31:50,585 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:31:50,588 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:31:50 BoogieIcfgContainer [2022-10-03 15:31:50,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:31:50,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:31:50,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:31:50,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:31:50,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:31:49" (1/2) ... [2022-10-03 15:31:50,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47398521 and model type divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:31:50, skipping insertion in model container [2022-10-03 15:31:50,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1442.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:31:50" (2/2) ... [2022-10-03 15:31:50,596 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1442.bpl [2022-10-03 15:31:50,601 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:31:50,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:31:50,610 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:31:50,610 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:31:50,744 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:31:50,798 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:31:50,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:31:50,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:31:50,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:31:50,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 15:31:50,830 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:31:50,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:31:50,844 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;@3d0b624a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:31:50,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:31:51,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:31:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:31:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -274334810, now seen corresponding path program 1 times [2022-10-03 15:31:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:31:51,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773732748] [2022-10-03 15:31:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:31:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:31:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:31:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773732748] [2022-10-03 15:31:51,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773732748] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:31:51,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:31:51,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:31:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856239899] [2022-10-03 15:31:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:31:51,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:31:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:51,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:31:51,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:31:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:51,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:51,977 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 15:31:51,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:52,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:52,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:31:52,129 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:31:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:31:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -288926543, now seen corresponding path program 1 times [2022-10-03 15:31:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:31:52,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904042859] [2022-10-03 15:31:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:31:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:31:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:31:52,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904042859] [2022-10-03 15:31:52,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904042859] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:31:52,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:31:52,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-03 15:31:52,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694185551] [2022-10-03 15:31:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:31:52,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 15:31:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:52,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 15:31:52,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-10-03 15:31:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:52,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:52,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 62.63636363636363) internal successors, (689), 12 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 15:31:52,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:52,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-03 15:31:54,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:31:54,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:31:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:31:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1029371079, now seen corresponding path program 1 times [2022-10-03 15:31:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:31:54,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521730322] [2022-10-03 15:31:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:54,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:31:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:31:54,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:31:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521730322] [2022-10-03 15:31:54,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521730322] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:31:54,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:31:54,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-03 15:31:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356781605] [2022-10-03 15:31:54,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:31:54,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 15:31:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 15:31:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-03 15:31:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:54,386 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:54,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 108.22222222222223) internal successors, (974), 10 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:31:54,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:54,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-10-03 15:31:54,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-03 15:31:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-03 15:31:55,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 15:31:55,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:31:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:31:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash 891545003, now seen corresponding path program 1 times [2022-10-03 15:31:55,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:31:55,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796417961] [2022-10-03 15:31:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:55,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:31:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 29612 backedges. 18460 proven. 236 refuted. 0 times theorem prover too weak. 10916 trivial. 0 not checked. [2022-10-03 15:32:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:32:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796417961] [2022-10-03 15:32:03,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796417961] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:32:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810795120] [2022-10-03 15:32:03,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:32:03,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:32:03,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:32:03,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:32:03,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 15:32:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:32:07,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 13673 conjuncts, 121 conjunts are in the unsatisfiable core [2022-10-03 15:32:07,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:32:16,640 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:32:16,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:32:17,969 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 15:32:19,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-03 15:32:19,128 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-03 15:32:19,128 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 16 treesize of output 18 [2022-10-03 15:32:19,270 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 17 treesize of output 9 [2022-10-03 15:32:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 29612 backedges. 17839 proven. 6281 refuted. 0 times theorem prover too weak. 5492 trivial. 0 not checked. [2022-10-03 15:32:19,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:32:19,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int) (v_ArrVal_1209 (Array Int Int))) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 15:32:19,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int) (v_ArrVal_1209 (Array Int Int))) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 15:32:20,158 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 34 treesize of output 25 [2022-10-03 15:32:20,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (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 15:32:20,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= (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|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_1209) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 15:32:20,323 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 18 treesize of output 14 [2022-10-03 15:32:20,478 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:32:20,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-03 15:32:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 29612 backedges. 14246 proven. 3769 refuted. 0 times theorem prover too weak. 9085 trivial. 2512 not checked. [2022-10-03 15:32:24,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810795120] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:32:24,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:32:24,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 47, 33] total 113 [2022-10-03 15:32:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498665442] [2022-10-03 15:32:24,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:32:24,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2022-10-03 15:32:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:32:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2022-10-03 15:32:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=9976, Unknown=11, NotChecked=2310, Total=12656 [2022-10-03 15:32:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:24,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:32:24,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 48.85840707964602) internal successors, (5521), 113 states have internal predecessors, (5521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:32:24,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:24,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-10-03 15:32:24,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-10-03 15:32:24,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-03 15:33:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:33:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 413 states. [2022-10-03 15:33:13,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 15:33:13,535 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,SelfDestructingSolverStorable3 [2022-10-03 15:33:13,536 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:33:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:33:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash -634305920, now seen corresponding path program 1 times [2022-10-03 15:33:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:33:13,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457811076] [2022-10-03 15:33:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:33:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:33:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:33:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 58798 backedges. 19558 proven. 230 refuted. 0 times theorem prover too weak. 39010 trivial. 0 not checked. [2022-10-03 15:33:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:33:27,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457811076] [2022-10-03 15:33:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457811076] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:33:27,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821002590] [2022-10-03 15:33:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:33:27,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:33:27,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:33:27,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:33:27,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 15:33:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:33:30,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 18939 conjuncts, 289 conjunts are in the unsatisfiable core [2022-10-03 15:33:30,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:33:30,832 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-10-03 15:33:45,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:33:45,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:33:46,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:33:46,947 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:33:46,947 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 89 treesize of output 62 [2022-10-03 15:33:46,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:33:46,994 INFO L356 Elim1Store]: treesize reduction 44, result has 63.6 percent of original size [2022-10-03 15:33:46,994 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 54 treesize of output 99 [2022-10-03 15:33:51,240 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 15:33:53,276 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-03 15:33:53,277 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 16 treesize of output 18 [2022-10-03 15:33:57,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:33:57,826 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 15:33:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 58798 backedges. 7594 proven. 21195 refuted. 0 times theorem prover too weak. 30009 trivial. 0 not checked. [2022-10-03 15:33:57,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:33:57,996 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2573 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_#memory_$Pointer$.offset|))) (forall ((v_ArrVal_2572 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572) |c_#memory_$Pointer$.base|)))) is different from false [2022-10-03 15:33:58,082 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2573 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_#memory_$Pointer$.offset|))) (and (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem47#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem47#1.offset|)) (forall ((v_ArrVal_2572 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572) |c_#memory_$Pointer$.base|)))) is different from false [2022-10-03 15:33:58,182 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2573 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_#memory_$Pointer$.offset|))) (and (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (forall ((v_ArrVal_2572 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572) |c_#memory_$Pointer$.base|)))) is different from false [2022-10-03 15:33:58,341 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2573 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_#memory_$Pointer$.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0)))) (forall ((v_ArrVal_2572 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572) |c_#memory_$Pointer$.base|)))) is different from false [2022-10-03 15:33:58,364 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) (forall ((v_ArrVal_2573 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_#memory_$Pointer$.offset|))) (forall ((v_ArrVal_2572 (Array Int Int))) (not (= (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572) |c_#memory_$Pointer$.base|)))) is different from false [2022-10-03 15:33:59,730 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse1 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573))) (or (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (< (select (select .cse2 .cse3) .cse4) (+ (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 12)) (not (= (select (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select .cse5 .cse3) .cse4))))))) (not (<= 0 (select (select .cse1 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse8 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse6 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select .cse11 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse10 (select (select .cse8 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (= (select .cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7) (< (select (select .cse8 .cse9) .cse10) (+ (select (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 12)) (not (= .cse7 (select (select .cse11 .cse9) .cse10)))))))) (not (<= 0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))))) is different from false [2022-10-03 15:34:02,403 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1))) (and (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1) (not (= (select (select .cse2 .cse1) .cse3) .cse1)) (< (select (select .cse4 .cse1) .cse3) (+ .cse3 12))))))) (not (<= 0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse6) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse10 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse7 .cse8) .cse9) .cse8)) (< (select (select .cse10 .cse8) .cse9) (+ .cse9 12)))))) (not (<= 0 .cse6)))))))) is different from false [2022-10-03 15:34:02,548 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| Int)) (not (= (select (store |c_#valid| |ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| 0) |c_ULTIMATE.start_fifo_pop_~self#1.base|) 1))) (and (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1) (not (= (select (select .cse2 .cse1) .cse3) .cse1)) (< (select (select .cse4 .cse1) .cse3) (+ .cse3 12))))))) (not (<= 0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse6) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse10 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse7 .cse8) .cse9) .cse8)) (< (select (select .cse10 .cse8) .cse9) (+ .cse9 12)))))) (not (<= 0 .cse6)))))))) is different from false [2022-10-03 15:34:04,712 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 13 treesize of output 11 [2022-10-03 15:34:04,716 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (and (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1) (not (= (select (select .cse2 .cse1) .cse3) .cse1)) (< (select (select .cse4 .cse1) .cse3) (+ .cse3 12))))))) (not (<= 0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse6) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse10 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse7 .cse8) .cse9) .cse8)) (< (select (select .cse10 .cse8) .cse9) (+ .cse9 12)))))) (not (<= 0 .cse6)))))))) is different from false [2022-10-03 15:34:04,784 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|) (and (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1) (not (= (select (select .cse2 .cse1) .cse3) .cse1)) (< (select (select .cse4 .cse1) .cse3) (+ .cse3 12))))))) (not (<= 0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse6) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse10 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2573)) (.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2572))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse7 .cse8) .cse9) .cse8)) (< (select (select .cse10 .cse8) .cse9) (+ .cse9 12)))))) (not (<= 0 .cse6)))))))) is different from false [2022-10-03 15:34:05,566 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|) (and (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse0 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse1 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< (select (select .cse0 .cse1) .cse2) (+ .cse2 12)) (not (= (select (select .cse3 .cse1) .cse2) .cse1)) (= (select .cse4 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1)))))) (not (<= 0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse6) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse10 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572)) (.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< (select (select .cse7 .cse8) .cse9) (+ .cse9 12)) (not (= (select (select .cse10 .cse8) .cse9) .cse8)))))) (not (<= 0 .cse6)))))))) is different from false [2022-10-03 15:34:05,611 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|) (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) is different from false [2022-10-03 15:34:06,118 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|)) is different from false [2022-10-03 15:34:06,181 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) is different from false [2022-10-03 15:34:06,210 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= |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 15:34:06,319 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|)) (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) is different from false [2022-10-03 15:34:06,436 WARN L833 $PredicateComparison]: unable to prove that (or (= (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|) (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) is different from false [2022-10-03 15:34:06,470 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |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 15:34:06,539 WARN L833 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem47#1.base|) (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem47#1.offset|)) (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |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 15:34:06,599 WARN L833 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem46#1.offset|) (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |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 15:34:06,624 WARN L833 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (= |c_ULTIMATE.start_fifo_pop_#t~mem46#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (and (forall ((v_ArrVal_2573 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse1 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) .cse2)) (< (select (select .cse4 .cse2) .cse3) (+ .cse3 12)))))) (= .cse0 (select .cse5 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))))) (forall ((v_ArrVal_2573 (Array Int Int))) (or (forall ((v_ArrVal_2572 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse10 (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse7 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse7)) (< (select (select .cse9 .cse7) .cse8) (+ .cse8 12)) (= (select .cse10 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse7)))))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |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 15:34:09,744 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (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|))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse5 (= (select .cse27 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse28))) (and (or (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse2 (store (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_2566)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse4 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse0)) (< (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) v_ArrVal_2566) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (< (select (select .cse2 .cse3) .cse0) (+ .cse0 12)) (not (= .cse3 (select (select .cse4 .cse3) .cse0)))))))) .cse5) (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse10 (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_2566)))) (let ((.cse11 (store .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse13 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse8 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse12 (select (select .cse13 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse6)) (< (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) v_ArrVal_2566) (= .cse6 (select .cse7 .cse8)) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse9 .cse8))) (< (select (select .cse11 .cse12) .cse6) (+ .cse6 12)) (not (= .cse12 (select (select .cse13 .cse12) .cse6))))))))) (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse21 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572)) (.cse17 (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_2566)))) (let ((.cse18 (store .cse17 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse20 (select .cse21 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse16 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse19 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse14 (select (select .cse18 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse14)) (< (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) v_ArrVal_2566) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse15 .cse16))) (< (select (select .cse18 .cse19) .cse14) (+ .cse14 12)) (= .cse19 (select .cse20 .cse16)) (not (= .cse19 (select (select .cse21 .cse19) .cse14)))))))) (or .cse5 (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse26 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse23 (store (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_2566)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse25 (select .cse26 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= 0 .cse22)) (< (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4) v_ArrVal_2566) (< (select (select .cse23 .cse24) .cse22) (+ .cse22 12)) (= .cse24 (select .cse25 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (not (= .cse24 (select (select .cse26 .cse24) .cse22))))))))))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse28)))) is different from false [2022-10-03 15:34:10,872 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse28 (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|))) (let ((.cse0 (select .cse28 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse0) (let ((.cse22 (= .cse0 (select .cse28 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (and (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse8 (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_2566)))) (let ((.cse4 (store .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse2 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= .cse1 (select (select .cse2 .cse1) .cse3))) (not (<= 0 .cse3)) (< (select (select .cse4 .cse1) .cse3) (+ .cse3 12)) (< (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) v_ArrVal_2566) (= .cse3 (select .cse5 .cse6)) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse7 .cse6) (select .cse7 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))))) (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse10 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572)) (.cse16 (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_2566)))) (let ((.cse14 (store .cse16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse12 (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse11 (select (select .cse14 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse13 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= .cse9 (select (select .cse10 .cse9) .cse11))) (not (<= 0 .cse11)) (= .cse9 (select .cse12 .cse13)) (< (select (select .cse14 .cse9) .cse11) (+ .cse11 12)) (< (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) v_ArrVal_2566) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse15 .cse13) (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) (or (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse18 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse21 (store (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_2566)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573)) (.cse20 (select .cse18 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse19 (select (select .cse21 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse17 (select (select .cse18 .cse17) .cse19))) (not (<= 0 .cse19)) (= .cse17 (select .cse20 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (< (select (select .cse21 .cse17) .cse19) (+ .cse19 12)) (< (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) v_ArrVal_2566)))))) .cse22) (or (forall ((v_ArrVal_2566 Int) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse26 (store (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_2566)) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2573))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse24 (store (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_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_2572))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse25 (select .cse27 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (= .cse23 (select (select .cse24 .cse23) .cse25))) (not (<= 0 .cse25)) (< (select (select .cse26 .cse23) .cse25) (+ .cse25 12)) (< (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) v_ArrVal_2566) (= .cse25 (select .cse27 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))))) .cse22)))))) is different from false [2022-10-03 15:34:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 58798 backedges. 14335 proven. 141 refuted. 0 times theorem prover too weak. 44275 trivial. 47 not checked. [2022-10-03 15:34:35,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821002590] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:34:35,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:34:35,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 66, 61] total 178 [2022-10-03 15:34:35,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125180034] [2022-10-03 15:34:35,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:34:35,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-10-03 15:34:35,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:34:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-10-03 15:34:35,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1169, Invalid=22576, Unknown=217, NotChecked=7544, Total=31506 [2022-10-03 15:34:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:34:35,716 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:34:35,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 178 states, 178 states have (on average 24.06179775280899) internal successors, (4283), 178 states have internal predecessors, (4283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:34:35,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:34:35,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-10-03 15:34:35,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:34:35,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 413 states. [2022-10-03 15:34:35,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:41:06,406 WARN L233 SmtUtils]: Spent 13.83s on a formula simplification. DAG size of input: 362 DAG size of output: 272 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:41:25,987 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 308 DAG size of output: 255 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:41:40,650 WARN L233 SmtUtils]: Spent 11.55s on a formula simplification. DAG size of input: 330 DAG size of output: 285 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:45:12,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-10-03 15:45:12,762 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 15:45:12,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 15:45:12,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:45:12,976 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.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:234) 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) ... 53 more [2022-10-03 15:45:12,980 INFO L158 Benchmark]: Toolchain (without parser) took 803828.01ms. Allocated memory was 170.9MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 117.6MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 764.9MB. Max. memory is 8.0GB. [2022-10-03 15:45:12,981 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 170.9MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:45:12,981 INFO L158 Benchmark]: Boogie Preprocessor took 96.70ms. Allocated memory is still 170.9MB. Free memory was 117.5MB in the beginning and 111.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:45:12,981 INFO L158 Benchmark]: RCFGBuilder took 1329.23ms. Allocated memory was 170.9MB in the beginning and 234.9MB in the end (delta: 64.0MB). Free memory was 111.1MB in the beginning and 140.3MB in the end (delta: -29.3MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-10-03 15:45:12,982 INFO L158 Benchmark]: TraceAbstraction took 802389.47ms. Allocated memory was 234.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 139.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 721.9MB. Max. memory is 8.0GB. [2022-10-03 15:45:12,984 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.14ms. Allocated memory is still 170.9MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 96.70ms. Allocated memory is still 170.9MB. Free memory was 117.5MB in the beginning and 111.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1329.23ms. Allocated memory was 170.9MB in the beginning and 234.9MB in the end (delta: 64.0MB). Free memory was 111.1MB in the beginning and 140.3MB in the end (delta: -29.3MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 802389.47ms. Allocated memory was 234.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 139.8MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 721.9MB. 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 15:45:13,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...