/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1599.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:49:27,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:49:27,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:49:27,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:49:27,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:49:27,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:49:27,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:49:27,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:49:27,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:49:27,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:49:27,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:49:27,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:49:27,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:49:27,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:49:27,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:49:27,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:49:27,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:49:27,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:49:27,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:49:27,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:49:27,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:49:27,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:49:27,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:49:27,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:49:27,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:49:27,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:49:27,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:49:27,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:49:27,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:49:27,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:49:27,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:49:27,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:49:27,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:49:27,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:49:27,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:49:27,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:49:27,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:49:27,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:49:27,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:49:27,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:49:27,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:49:27,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:49:27,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:49:27,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:49:27,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:49:27,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:49:27,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:49:27,681 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:49:27,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:49:27,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:49:27,682 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:49:27,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:49:27,683 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:49:27,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:49:27,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:49:27,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:49:27,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:49:27,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:49:27,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:49:27,684 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:49:27,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:49:27,684 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:49:27,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:49:27,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:49:27,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:49:27,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:49:27,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:49:27,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:49:27,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:49:27,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:49:27,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:49:27,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:49:27,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:49:27,685 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:49:27,685 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:49:27,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:49:27,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:49:27,686 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:49:27,686 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:49:27,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:49:27,686 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 14:49:27,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:49:27,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:49:27,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:49:27,917 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:49:27,918 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:49:27,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1599.bpl [2022-10-03 14:49:27,919 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1599.bpl' [2022-10-03 14:49:28,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:49:28,002 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:49:28,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:49:28,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:49:28,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:49:28,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:49:28,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:49:28,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:49:28,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:49:28,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/1) ... [2022-10-03 14:49:28,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:49:28,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:49:28,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 14:49:28,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 14:49:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:49:28,214 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:49:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:49:28,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:49:28,215 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:49:28,373 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:49:28,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:49:29,415 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:49:29,446 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:49:29,447 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:49:29,450 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:49:29 BoogieIcfgContainer [2022-10-03 14:49:29,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:49:29,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:49:29,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:49:29,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:49:29,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:49:27" (1/2) ... [2022-10-03 14:49:29,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536f1717 and model type divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:49:29, skipping insertion in model container [2022-10-03 14:49:29,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1599.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:49:29" (2/2) ... [2022-10-03 14:49:29,461 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1599.bpl [2022-10-03 14:49:29,468 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:49:29,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:49:29,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:49:29,479 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:49:29,647 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:49:29,710 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:49:29,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:49:29,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:49:29,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 14:49:29,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 14:49:29,746 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:49:29,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:49:29,758 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;@3a4449e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:49:29,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:49:30,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:49:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:49:30,244 INFO L85 PathProgramCache]: Analyzing trace with hash -105544780, now seen corresponding path program 1 times [2022-10-03 14:49:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:49:30,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805080404] [2022-10-03 14:49:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:49:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:49:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:49:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:49:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:49:30,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805080404] [2022-10-03 14:49:30,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805080404] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:49:30,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:49:30,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:49:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027308018] [2022-10-03 14:49:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:49:30,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:49:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:49:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:49:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:49:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:30,803 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:49:30,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 370.0) internal successors, (740), 2 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:49:30,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:31,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:49:31,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:49:31,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:49:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1943605445, now seen corresponding path program 1 times [2022-10-03 14:49:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:49:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961636009] [2022-10-03 14:49:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:49:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:49:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:49:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:49:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:49:31,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961636009] [2022-10-03 14:49:31,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961636009] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:49:31,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:49:31,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-03 14:49:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095392756] [2022-10-03 14:49:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:49:31,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-03 14:49:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:49:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-03 14:49:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-03 14:49:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:31,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:49:31,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 115.0) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:49:31,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:31,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-03 14:49:33,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:49:33,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:49:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:49:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 891206637, now seen corresponding path program 1 times [2022-10-03 14:49:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:49:33,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510610018] [2022-10-03 14:49:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:49:33,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:49:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:49:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14319 backedges. 4505 proven. 7983 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2022-10-03 14:49:43,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:49:43,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510610018] [2022-10-03 14:49:43,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510610018] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:49:43,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274519986] [2022-10-03 14:49:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:49:43,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:49:43,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:49:43,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:49:43,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:49:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:49:45,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 10338 conjuncts, 251 conjunts are in the unsatisfiable core [2022-10-03 14:49:46,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:49:46,495 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 14:50:04,773 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:50:04,773 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 14:50:05,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:50:05,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:50:05,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:50:05,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:50:13,692 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 42 treesize of output 41 [2022-10-03 14:50:23,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:50:23,695 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-03 14:50:23,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 73 [2022-10-03 14:50:23,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:50:23,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2022-10-03 14:50:23,919 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-10-03 14:50:23,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-10-03 14:50:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14319 backedges. 7481 proven. 4862 refuted. 0 times theorem prover too weak. 1976 trivial. 0 not checked. [2022-10-03 14:50:24,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:50:26,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:26,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_ULTIMATE.start_ULTIMATE.dealloc_old_#valid#1| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:26,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_#valid| |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:26,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= 1 (select (store |c_#valid| |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base| v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:50:26,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:26,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:26,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:26,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_#valid| (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|) v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:26,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_909 Int) (v_ArrVal_907 (Array Int Int))) (not (= (select (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_909) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) 1))) is different from false [2022-10-03 14:50:27,803 INFO L356 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2022-10-03 14:50:27,804 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 224 treesize of output 204 [2022-10-03 14:50:27,823 WARN L833 $PredicateComparison]: unable to prove that (or (= (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_ULTIMATE.dealloc_~addr#1.base|) (and (forall ((v_ArrVal_907 (Array Int Int))) (let ((.cse0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_ULTIMATE.dealloc_~addr#1.base| .cse0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0)))) (forall ((v_ArrVal_907 (Array Int Int))) (not (= (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_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) is different from false [2022-10-03 14:50:27,849 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_907 (Array Int Int))) (not (= (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_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_907 (Array Int Int))) (let ((.cse0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0))))) (= (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_drop_head_~old~0#1.base|)) is different from false [2022-10-03 14:50:28,663 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_905 Int)) (or (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_907 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |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_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_905 Int)) (or (forall ((v_ArrVal_907 (Array Int Int))) (let ((.cse0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| .cse0)))) (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:50:28,943 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_905 Int)) (or (= |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (forall ((v_ArrVal_907 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |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_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (forall ((v_ArrVal_905 Int)) (or (forall ((v_ArrVal_907 (Array Int Int))) (let ((.cse0 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) .cse0) (= |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base| .cse0)))) (= |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| v_ArrVal_905)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:50:30,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (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_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (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_~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_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))) |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_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse0 (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (let ((.cse0 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_900))) (= (select (select (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse2 .cse3 (select .cse2 .cse3))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store .cse0 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:50:30,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_900))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse2 .cse3 (select .cse2 .cse3)))))) |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_fifo_node_init_~self#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_900))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse2 .cse3 (select .cse2 .cse3)))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) is different from false [2022-10-03 14:50:30,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_898))) (= (select (select (let ((.cse0 (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_900))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_899) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_901) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse2 .cse3 (select .cse2 .cse3)))))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_ArrVal_907) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:50:30,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:50:30,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1270 treesize of output 1144 [2022-10-03 14:50:30,662 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 1407 treesize of output 1279 [2022-10-03 14:50:30,689 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 666 treesize of output 618 [2022-10-03 14:50:30,702 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 1210 treesize of output 1146 [2022-10-03 14:50:30,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:50:30,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1331 treesize of output 1229 [2022-10-03 14:50:31,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-03 14:50:31,872 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 14:50:31,873 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 14:50:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14319 backedges. 4233 proven. 3181 refuted. 0 times theorem prover too weak. 4910 trivial. 1995 not checked. [2022-10-03 14:50:41,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274519986] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:50:41,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:50:41,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 72, 77] total 217 [2022-10-03 14:50:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395161963] [2022-10-03 14:50:41,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:50:41,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 217 states [2022-10-03 14:50:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:50:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2022-10-03 14:50:41,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1004, Invalid=34192, Unknown=76, NotChecked=11600, Total=46872 [2022-10-03 14:50:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:41,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:50:41,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 217 states, 217 states have (on average 30.22119815668203) internal successors, (6558), 217 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:50:41,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:41,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-10-03 14:50:41,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:54:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:54:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-03 14:54:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 436 states. [2022-10-03 14:54:00,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 14:54:00,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 14:54:00,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:54:00,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:54:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 3934545, now seen corresponding path program 1 times [2022-10-03 14:54:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:54:00,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967765802] [2022-10-03 14:54:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:54:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:54:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:54:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 136162 backedges. 114441 proven. 13730 refuted. 0 times theorem prover too weak. 7991 trivial. 0 not checked. [2022-10-03 14:54:31,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:54:31,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967765802] [2022-10-03 14:54:31,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967765802] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:54:31,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17193840] [2022-10-03 14:54:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:54:31,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:54:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:54:31,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:54:31,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 14:54:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:54:36,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 29322 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-03 14:54:36,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:54:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 136162 backedges. 115854 proven. 0 refuted. 0 times theorem prover too weak. 20308 trivial. 0 not checked. [2022-10-03 14:54:43,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 14:54:43,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17193840] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:54:43,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 14:54:43,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 15 [2022-10-03 14:54:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578860459] [2022-10-03 14:54:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:54:43,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 14:54:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:54:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 14:54:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2022-10-03 14:54:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:54:43,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:54:43,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 484.6) internal successors, (4846), 10 states have internal predecessors, (4846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:54:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:54:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-10-03 14:54:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 436 states. [2022-10-03 14:54:43,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.