/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.line1582.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:42:26,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:42:26,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:42:26,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:42:26,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:42:26,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:42:26,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:42:26,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:42:26,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:42:26,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:42:26,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:42:26,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:42:26,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:42:26,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:42:26,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:42:26,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:42:26,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:42:26,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:42:26,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:42:26,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:42:26,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:42:26,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:42:26,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:42:26,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:42:26,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:42:26,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:42:26,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:42:26,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:42:26,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:42:26,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:42:26,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:42:26,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:42:26,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:42:26,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:42:26,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:42:26,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:42:26,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:42:26,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:42:26,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:42:26,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:42:26,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:42:26,882 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:42:26,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:42:26,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:42:26,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:42:26,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:42:26,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:42:26,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:42:26,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:42:26,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:42:26,915 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:42:26,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:42:26,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:42:26,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:42:26,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:42:26,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:42:26,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:42:26,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:42:26,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:42:26,917 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:42:26,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:42:26,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:42:26,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:42:26,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:42:26,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:42:26,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:42:26,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:42:26,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:42:26,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:42:26,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:42:26,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:42:26,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:42:26,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:42:26,921 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:42:26,921 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:42:26,921 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:42:26,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:42:26,921 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:42:26,921 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:42:26,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:42:26,922 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:42:27,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:42:27,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:42:27,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:42:27,186 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:42:27,187 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:42:27,188 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.line1582.bpl [2022-10-03 15:42:27,188 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1582.bpl' [2022-10-03 15:42:27,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:42:27,276 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:42:27,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:42:27,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:42:27,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:42:27,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:42:27,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:42:27,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:42:27,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:42:27,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/1) ... [2022-10-03 15:42:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:42:27,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:42:27,493 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:42:27,514 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:42:27,535 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:42:27,536 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:42:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:42:27,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:42:27,537 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:42:27,758 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:42:27,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:42:28,854 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:42:28,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:42:28,875 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:42:28,878 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:42:28 BoogieIcfgContainer [2022-10-03 15:42:28,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:42:28,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:42:28,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:42:28,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:42:28,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:42:27" (1/2) ... [2022-10-03 15:42:28,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d3948b and model type divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:42:28, skipping insertion in model container [2022-10-03 15:42:28,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:42:28" (2/2) ... [2022-10-03 15:42:28,886 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1582.bpl [2022-10-03 15:42:28,892 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:42:28,900 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:42:28,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:42:28,901 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:42:29,015 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:42:29,069 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:42:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:42:29,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:42:29,071 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:42:29,094 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:42:29,116 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:42:29,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:42:29,132 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;@35d68338, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:42:29,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:42:29,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:42:29,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:42:29,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1010896461, now seen corresponding path program 1 times [2022-10-03 15:42:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:42:29,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179150020] [2022-10-03 15:42:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:42:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:42:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:42:30,160 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:42:30,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:42:30,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179150020] [2022-10-03 15:42:30,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179150020] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:42:30,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:42:30,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:42:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867865204] [2022-10-03 15:42:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:42:30,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:42:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:42:30,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:42:30,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:42:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:30,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:42:30,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 363.5) internal successors, (727), 2 states have internal predecessors, (727), 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:42:30,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:30,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:42:30,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:42:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:42:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash 241340829, now seen corresponding path program 1 times [2022-10-03 15:42:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:42:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524836260] [2022-10-03 15:42:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:42:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:42:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:42:34,135 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:42:34,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:42:34,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524836260] [2022-10-03 15:42:34,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524836260] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:42:34,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:42:34,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-10-03 15:42:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862037200] [2022-10-03 15:42:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:42:34,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-10-03 15:42:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:42:34,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-10-03 15:42:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3360, Unknown=0, NotChecked=0, Total=3540 [2022-10-03 15:42:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:34,143 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:42:34,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 13.183333333333334) internal successors, (791), 60 states have internal predecessors, (791), 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:42:34,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:34,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 15:42:48,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:42:48,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:42:48,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:42:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash -87158438, now seen corresponding path program 1 times [2022-10-03 15:42:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:42:48,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506607709] [2022-10-03 15:42:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:42:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:42:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:42:52,112 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:42:52,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:42:52,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506607709] [2022-10-03 15:42:52,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506607709] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:42:52,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:42:52,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-10-03 15:42:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79618078] [2022-10-03 15:42:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:42:52,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-10-03 15:42:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:42:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-10-03 15:42:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5600, Unknown=0, NotChecked=0, Total=5852 [2022-10-03 15:42:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:52,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:42:52,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 9.532467532467532) internal successors, (734), 77 states have internal predecessors, (734), 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:42:52,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:42:52,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 15:42:52,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 15:43:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:43:13,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 15:43:13,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:43:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:43:13,164 INFO L85 PathProgramCache]: Analyzing trace with hash -481305164, now seen corresponding path program 1 times [2022-10-03 15:43:13,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:43:13,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469012865] [2022-10-03 15:43:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:43:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:43:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:43:14,474 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:43:14,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:43:14,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469012865] [2022-10-03 15:43:14,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469012865] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:43:14,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:43:14,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-10-03 15:43:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4683763] [2022-10-03 15:43:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:43:14,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-10-03 15:43:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:43:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-10-03 15:43:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1701, Unknown=0, NotChecked=0, Total=1806 [2022-10-03 15:43:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:14,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:43:14,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 15.666666666666666) internal successors, (658), 43 states have internal predecessors, (658), 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:43:14,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:14,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 15:43:14,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:43:14,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 15:43:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:43:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:43:23,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:43:23,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:43:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:43:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1880839221, now seen corresponding path program 1 times [2022-10-03 15:43:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:43:23,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905154032] [2022-10-03 15:43:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:43:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:43:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:43:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-10-03 15:43:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:43:27,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905154032] [2022-10-03 15:43:27,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905154032] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:43:27,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:43:27,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-10-03 15:43:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692530069] [2022-10-03 15:43:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:43:27,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-10-03 15:43:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:43:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-10-03 15:43:27,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=6069, Unknown=0, NotChecked=0, Total=6320 [2022-10-03 15:43:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:27,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:43:27,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 11.1375) internal successors, (891), 80 states have internal predecessors, (891), 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:43:27,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:27,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 15:43:27,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:43:27,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:43:27,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:43:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:43:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:43:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:43:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-10-03 15:43:56,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:43:56,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:43:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:43:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1382026903, now seen corresponding path program 1 times [2022-10-03 15:43:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:43:56,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446931757] [2022-10-03 15:43:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:43:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:43:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:44:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:44:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:44:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446931757] [2022-10-03 15:44:01,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446931757] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:44:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068351664] [2022-10-03 15:44:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:44:01,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:44:01,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:44:01,156 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:44:01,157 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:44:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:44:01,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 2854 conjuncts, 202 conjunts are in the unsatisfiable core [2022-10-03 15:44:01,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:44:02,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:44:02,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:44:02,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:44:03,988 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:44:03,989 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:44:04,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:44:07,098 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:44:07,104 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:44:09,969 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 15:44:09,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-10-03 15:44:10,970 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:44:10,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2022-10-03 15:44:10,977 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 31 treesize of output 29 [2022-10-03 15:44:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 204 proven. 123 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-03 15:44:12,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:44:12,771 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_482) |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_481 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_481) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:44:12,826 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_482) |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_481 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_481) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:44:12,839 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_481 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_481) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_482 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_482) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:44:12,892 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_482) |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_481 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_481) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:44:12,903 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_482) |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_481 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_481) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:44:12,937 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_482) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) (forall ((v_ArrVal_481 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_481) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:44:17,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 213 [2022-10-03 15:44:17,950 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 15:44:17,950 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 3 case distinctions, treesize of input 298 treesize of output 282 [2022-10-03 15:44:17,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:44:17,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 307 treesize of output 281 [2022-10-03 15:44:17,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2022-10-03 15:44:20,554 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:44:20,554 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:44:22,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:44:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 25 proven. 116 refuted. 0 times theorem prover too weak. 182 trivial. 41 not checked. [2022-10-03 15:44:22,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068351664] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:44:22,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:44:22,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 63, 56] total 211 [2022-10-03 15:44:22,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925247589] [2022-10-03 15:44:22,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:44:22,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 211 states [2022-10-03 15:44:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:44:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2022-10-03 15:44:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1164, Invalid=40674, Unknown=6, NotChecked=2466, Total=44310 [2022-10-03 15:44:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:22,687 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:44:22,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 211 states, 211 states have (on average 13.75829383886256) internal successors, (2903), 211 states have internal predecessors, (2903), 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:44:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:44:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:44:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:44:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:44:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-10-03 15:44:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:46:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:46:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:46:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:46:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 310 states. [2022-10-03 15:46:19,674 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:46:19,856 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,SelfDestructingSolverStorable5 [2022-10-03 15:46:19,857 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:46:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:46:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 40584386, now seen corresponding path program 1 times [2022-10-03 15:46:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:46:19,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64993359] [2022-10-03 15:46:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:46:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:46:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:46:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2022-10-03 15:46:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:46:20,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64993359] [2022-10-03 15:46:20,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64993359] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:46:20,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:46:20,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 15:46:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013159324] [2022-10-03 15:46:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:46:20,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 15:46:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:46:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 15:46:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-10-03 15:46:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:20,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:46:20,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 35.095238095238095) internal successors, (737), 21 states have internal predecessors, (737), 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:46:20,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:20,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:46:20,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:46:20,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:46:20,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:46:20,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 310 states. [2022-10-03 15:46:20,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:46:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:46:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:46:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:46:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 324 states. [2022-10-03 15:46:25,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:46:25,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 15:46:25,421 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:46:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:46:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1623192119, now seen corresponding path program 1 times [2022-10-03 15:46:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:46:25,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303490923] [2022-10-03 15:46:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:46:25,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:46:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:46:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 50 proven. 996 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-03 15:46:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:46:33,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303490923] [2022-10-03 15:46:33,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303490923] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:46:33,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708417393] [2022-10-03 15:46:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:46:33,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:46:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:46:33,541 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:46:33,542 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:46:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:46:34,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 3786 conjuncts, 226 conjunts are in the unsatisfiable core [2022-10-03 15:46:34,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:46:35,701 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:46:35,710 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:46:38,786 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:46:38,787 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:46:39,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:46:39,562 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 15:46:39,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 63 [2022-10-03 15:46:39,575 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:46:39,575 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 74 treesize of output 70 [2022-10-03 15:46:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-10-03 15:46:45,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:46:45,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708417393] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:46:45,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:46:45,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [112] total 173 [2022-10-03 15:46:45,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431851625] [2022-10-03 15:46:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:46:45,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-10-03 15:46:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:46:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-10-03 15:46:45,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=28984, Unknown=0, NotChecked=0, Total=29756 [2022-10-03 15:46:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:45,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:46:45,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 17.444444444444443) internal successors, (1099), 63 states have internal predecessors, (1099), 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:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 324 states. [2022-10-03 15:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:46:45,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 326 states. [2022-10-03 15:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:47:21,012 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:47:21,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:47:21,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:47:21,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:47:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1041713078, now seen corresponding path program 1 times [2022-10-03 15:47:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:47:21,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542249231] [2022-10-03 15:47:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:47:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:47:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:47:24,713 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:47:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:47:24,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542249231] [2022-10-03 15:47:24,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542249231] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:47:24,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:47:24,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-10-03 15:47:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944612408] [2022-10-03 15:47:24,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:47:24,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-10-03 15:47:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:47:24,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-10-03 15:47:24,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4367, Unknown=0, NotChecked=0, Total=4556 [2022-10-03 15:47:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:24,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:47:24,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 11.705882352941176) internal successors, (796), 68 states have internal predecessors, (796), 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:47:24,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:47:24,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:47:24,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 15:47:24,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-10-03 15:47:24,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-10-03 15:47:24,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 326 states. [2022-10-03 15:47:24,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:47:24,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 15:47:24,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:48:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:48:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:48:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-10-03 15:48:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-10-03 15:48:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-10-03 15:48:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2022-10-03 15:48:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:48:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:48:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:48:03,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-03 15:48:03,258 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:48:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:48:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1378774465, now seen corresponding path program 1 times [2022-10-03 15:48:03,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:48:03,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111771814] [2022-10-03 15:48:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:48:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:48:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:48:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-10-03 15:48:05,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:48:05,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111771814] [2022-10-03 15:48:05,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111771814] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:48:05,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:48:05,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-10-03 15:48:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545143631] [2022-10-03 15:48:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:48:05,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-10-03 15:48:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:48:05,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-03 15:48:05,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2199, Unknown=0, NotChecked=0, Total=2352 [2022-10-03 15:48:05,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:48:05,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:48:05,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 17.46938775510204) internal successors, (856), 49 states have internal predecessors, (856), 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:48:05,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:48:05,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:48:05,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-10-03 15:48:05,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-10-03 15:48:05,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 146 states. [2022-10-03 15:48:05,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 335 states. [2022-10-03 15:48:05,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:48:05,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:48:05,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:48:05,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:48:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:48:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:48:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-10-03 15:48:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-10-03 15:48:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-10-03 15:48:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2022-10-03 15:48:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-03 15:48:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:48:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:48:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-10-03 15:48:14,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-03 15:48:14,234 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:48:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:48:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1391136307, now seen corresponding path program 1 times [2022-10-03 15:48:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:48:14,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277319169] [2022-10-03 15:48:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:48:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:48:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:52:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:52:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:52:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277319169] [2022-10-03 15:52:37,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277319169] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:52:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327497963] [2022-10-03 15:52:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:52:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:52:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:52:37,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:52:37,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 15:52:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:52:38,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 2692 conjuncts, 243 conjunts are in the unsatisfiable core [2022-10-03 15:52:38,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:52:48,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:52:50,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:52:50,772 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 30 treesize of output 23 [2022-10-03 15:52:54,875 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:52:54,875 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:52:58,628 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 29 treesize of output 27 [2022-10-03 15:53:29,879 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:53:32,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:32,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:32,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-10-03 15:53:34,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:34,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:34,013 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 15:53:34,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-10-03 15:53:36,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:36,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:36,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2022-10-03 15:53:49,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:49,016 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-10-03 15:53:49,017 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 40 treesize of output 37 [2022-10-03 15:53:49,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-03 15:53:50,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:50,503 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 29 treesize of output 27 [2022-10-03 15:53:54,780 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:53:54,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 34 [2022-10-03 15:53:56,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:53:56,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-10-03 15:54:00,684 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:54:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-10-03 15:54:02,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:54:13,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int)) (< (select (select (let ((.cse0 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1081))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) v_ArrVal_1083))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-10-03 15:54:13,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int)) (< (select (select (let ((.cse0 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1081))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) v_ArrVal_1083))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-10-03 15:54:13,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1081))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) v_ArrVal_1083))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-10-03 15:54:13,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_1081))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) v_ArrVal_1083))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-10-03 15:54:13,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_1081))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) v_ArrVal_1083))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-10-03 15:54:13,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-10-03 15:54:13,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int))) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-10-03 15:54:13,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int))) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)))) is different from false [2022-10-03 15:54:13,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) is different from false [2022-10-03 15:54:13,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~int_#ptr#1.base| v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:13,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)))) is different from false [2022-10-03 15:54:13,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:13,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:13,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:13,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:13,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|)))) is different from false [2022-10-03 15:54:14,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:14,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:14,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| v_ArrVal_1077)))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079)) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:14,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (let ((.cse3 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| v_ArrVal_1077))) (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse3) (select .cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079)) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))) is different from false [2022-10-03 15:54:14,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| v_ArrVal_1077))) (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse3) (select .cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079)) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))) is different from false [2022-10-03 15:54:14,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse4 (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| v_ArrVal_1077))) (store (store .cse3 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse4) (select .cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079))) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))) is different from false [2022-10-03 15:54:14,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (let ((.cse3 (store (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| v_ArrVal_1077))) (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse3) (select .cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079)) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))) is different from false [2022-10-03 15:54:14,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1077 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (|pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse1 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (let ((.cse3 (store (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| v_ArrVal_1077))) (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse3) (select .cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079)) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse2 (select (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1) v_ArrVal_1081)))) (store .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse1 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))) is different from false [2022-10-03 15:54:16,899 INFO L356 Elim1Store]: treesize reduction 51, result has 56.0 percent of original size [2022-10-03 15:54:16,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 268 treesize of output 226 [2022-10-03 15:54:17,267 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|))) (.cse5 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse0 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|))) (not (= (select v_DerPreprocessor_2 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (< (select (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store .cse0 (select (store (store (select .cse4 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_1081)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|))))) .cse5) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse11 (store (store .cse7 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|))) (or (not (= v_DerPreprocessor_1 .cse6)) (not (= (select (select .cse7 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (select .cse6 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|))) (< (select (select (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (let ((.cse10 (store (store .cse11 (select (store (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse10 (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9) v_ArrVal_1081)))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse16 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (< (select (select (let ((.cse13 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse12 (let ((.cse14 (store (store .cse15 (select (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse14 (select (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse13) v_ArrVal_1081)))) (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse13 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= v_DerPreprocessor_1 (select .cse15 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))))) .cse17 .cse5) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse19 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse23 (store (store .cse19 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|))) (or (not (= v_DerPreprocessor_1 .cse18)) (not (= (select (select .cse19 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|) (select .cse18 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|))) (< (select (select (let ((.cse21 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse20 (let ((.cse22 (store (store .cse23 (select (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse22 (select (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21) v_ArrVal_1081)))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (or .cse17 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse28 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse24 (store (store .cse28 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse24 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|))) (< (select (select (let ((.cse26 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse25 (let ((.cse27 (store (store .cse24 (select (store (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse27 (select (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26) v_ArrVal_1081)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))) .cse5))) is different from false [2022-10-03 15:54:17,913 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))) (.cse0 (not (= |c_ULTIMATE.start_fifo_drop_head_~self#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (and (or .cse0 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_fifo_drop_head_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse1 |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (< (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (let ((.cse4 (store (store .cse1 (select (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse4 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_1081)))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))))) .cse6) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse7 (store (store .cse11 |c_ULTIMATE.start_fifo_drop_head_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse7 |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (let ((.cse10 (store (store .cse7 (select (store (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse10 (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9) v_ArrVal_1081)))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))) .cse0 .cse6) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse16 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse12 (store (store .cse16 |c_ULTIMATE.start_fifo_drop_head_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse12 |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (< (select (select (let ((.cse14 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse13 (let ((.cse15 (store (store .cse12 (select (store (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse15 (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse14) v_ArrVal_1081)))) (store .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse14 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) .cse0) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse22 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_fifo_drop_head_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (or (not (= v_DerPreprocessor_1 .cse17)) (< (select (select (let ((.cse19 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse18 (let ((.cse20 (store (store .cse21 (select (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse20 (select (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse19) v_ArrVal_1081)))) (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse19 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse17 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) (select (select .cse22 |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse24 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse28 (store (store .cse24 |c_ULTIMATE.start_fifo_drop_head_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse23 (select .cse28 |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (or (not (= v_DerPreprocessor_1 .cse23)) (not (= (select .cse23 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|) (select (select .cse24 |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))) (< (select (select (let ((.cse26 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse25 (let ((.cse27 (store (store .cse28 (select (store (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse27 (select (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26) v_ArrVal_1081)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))))) is different from false [2022-10-03 15:54:21,221 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|))) (.cse6 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|)))) (and (or .cse0 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (< (select (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store .cse4 (select (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_1081)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= (select .cse4 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) v_DerPreprocessor_1)))))) .cse6) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|))) (or (< (select (select (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (let ((.cse9 (store (store .cse10 (select (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse9 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_1081)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= .cse12 v_DerPreprocessor_1)) (not (= (select (select .cse11 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (select .cse12 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|)))))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse18 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|))) (or (not (= .cse13 v_DerPreprocessor_1)) (< (select (select (let ((.cse15 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse14 (let ((.cse16 (store (store .cse17 (select (store (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse16 (select (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse15) v_ArrVal_1081)))) (store .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse15 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= (select (select .cse18 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|) (select .cse13 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|)))))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse23 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse20 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse19 (let ((.cse21 (store (store .cse22 (select (store (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse21 (select (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse20) v_ArrVal_1081)))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse20 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse22 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) v_DerPreprocessor_1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) .cse6) (or .cse0 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse28 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse24 (store (store .cse28 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= (select .cse24 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) v_DerPreprocessor_1)) (< (select (select (let ((.cse26 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse25 (let ((.cse27 (store (store .cse24 (select (store (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse27 (select (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26) v_ArrVal_1081)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))) .cse6))) is different from false [2022-10-03 15:54:21,496 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (.cse17 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)))) (and (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse1 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse5 (store (store .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (or (not (= .cse0 v_DerPreprocessor_1)) (not (= (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (let ((.cse4 (store (store .cse5 (select (store (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse4 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_1081)))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|)))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse10 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (or (< (select (select (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (let ((.cse8 (store (store .cse9 (select (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse8 (select (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_1081)))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= .cse11 v_DerPreprocessor_1)) (not (= (select (select .cse10 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse11 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse16 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_fifo_pop_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse13 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse12 (let ((.cse14 (store (store .cse15 (select (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse14 (select (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse13) v_ArrVal_1081)))) (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse13 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse15 |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_DerPreprocessor_1)))))) .cse17 .cse18) (or .cse17 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse23 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_fifo_pop_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (< (select (select (let ((.cse20 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse19 (let ((.cse21 (store (store .cse22 (select (store (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse21 (select (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse20) v_ArrVal_1081)))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse20 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= (select .cse22 |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_DerPreprocessor_1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))) .cse18) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse28 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_fifo_pop_~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse25 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse24 (let ((.cse26 (store (store .cse27 (select (store (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse26 (select (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse25) v_ArrVal_1081)))) (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse25 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse27 |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_DerPreprocessor_1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) .cse17))) is different from false [2022-10-03 15:54:37,275 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|))) (.cse18 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|)))) (and (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse0 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse5 (store (store .cse0 |c_ULTIMATE.start_fifo_pop_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_fifo_pop_#in~self#1.base|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) (select .cse1 |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|))) (< (select (select (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (let ((.cse4 (store (store .cse5 (select (store (store (select .cse0 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse4 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_1081)))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) |c_#StackHeapBarrier|) (not (= .cse1 v_DerPreprocessor_1))))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse11 (store (store .cse6 |c_ULTIMATE.start_fifo_pop_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_fifo_pop_#in~self#1.base|))) (or (not (= (select (select .cse6 |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) (select .cse7 |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|))) (< (select (select (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse8 (let ((.cse10 (store (store .cse11 (select (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse10 (select (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9) v_ArrVal_1081)))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) |c_#StackHeapBarrier|) (not (= .cse7 v_DerPreprocessor_1))))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (or .cse12 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse17 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_fifo_pop_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (< (select (select (let ((.cse14 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse13 (let ((.cse15 (store (store .cse16 (select (store (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse15 (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse14) v_ArrVal_1081)))) (store .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse14 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= (select .cse16 |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) v_DerPreprocessor_1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))) .cse18) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse23 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_fifo_pop_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (< (select (select (let ((.cse20 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse19 (let ((.cse21 (store (store .cse22 (select (store (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse21 (select (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse20) v_ArrVal_1081)))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse20 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|))) (not (= (select .cse22 |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) v_DerPreprocessor_1)) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) .cse18) (or .cse12 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse28 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse24 (store (store .cse28 |c_ULTIMATE.start_fifo_pop_#in~self#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= (select .cse24 |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) v_DerPreprocessor_1)) (< (select (select (let ((.cse26 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse25 (let ((.cse27 (store (store .cse24 (select (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse27 (select (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26) v_ArrVal_1081)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse26 v_ArrVal_1083)))) |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|) |c_#StackHeapBarrier|))))) .cse18))) is different from false [2022-10-03 15:54:37,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (.cse6 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)))) (and (or .cse0 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store .cse4 (select (store (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_1081)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) v_DerPreprocessor_1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))) .cse6) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (< (select (select (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (let ((.cse9 (store (store .cse10 (select (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse9 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_1081)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= .cse12 v_DerPreprocessor_1)) (not (= (select (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (or .cse0 .cse6 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse17 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (< (select (select (let ((.cse14 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse13 (let ((.cse15 (store (store .cse16 (select (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse15 (select (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse14) v_ArrVal_1081)))) (store .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse14 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|) v_DerPreprocessor_1))))))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse22 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (< (select (select (let ((.cse19 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse18 (let ((.cse20 (store (store .cse21 (select (store (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse20 (select (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse19) v_ArrVal_1081)))) (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse19 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= .cse23 v_DerPreprocessor_1)) (not (= (select (select .cse22 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse23 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (or .cse6 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse28 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse25 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse24 (let ((.cse26 (store (store .cse27 (select (store (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|)) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse26 (select (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse25) v_ArrVal_1081)))) (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse25 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse27 |c_ULTIMATE.start_main_~#q~1#1.base|) v_DerPreprocessor_1)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (<= (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|))))))))) is different from false [2022-10-03 15:55:01,908 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)))) (and (forall ((|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse6 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse5 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse7 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse5))) (let ((.cse4 (store (store .cse7 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (not (= v_DerPreprocessor_1 .cse0)) (< (select (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store .cse4 (select (store (store .cse5 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) .cse6) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_1081)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (or .cse8 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse14 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse13 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse14 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse9 (store (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse13) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< (select (select (let ((.cse11 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse10 (let ((.cse12 (store (store .cse9 (select (store (store .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) .cse14) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse12 (select (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11) v_ArrVal_1081)))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse11 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|))))))) (or .cse8 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse20 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse19 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse20 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse15 (store (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse19) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse15 |c_ULTIMATE.start_main_~#q~1#1.base|))) (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse17 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse16 (let ((.cse18 (store (store .cse15 (select (store .cse19 |c_ULTIMATE.start_main_~#q~1#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse20) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse18 (select (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse17) v_ArrVal_1081)))) (store .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse17 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|))))))) (or .cse8 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse26 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse25 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse26 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse21 (store (store (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse25) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (= v_DerPreprocessor_1 (select .cse21 |c_ULTIMATE.start_main_~#q~1#1.base|))) (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (< (select (select (let ((.cse23 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse22 (let ((.cse24 (store (store .cse21 (select (store (store .cse25 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse26) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse24 (select (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse23) v_ArrVal_1081)))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse23 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))))))) (forall ((|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse33 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse32 (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse33 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse34 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse32))) (let ((.cse31 (store (store .cse34 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse27 (select .cse31 |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (not (= v_DerPreprocessor_1 .cse27)) (< (select (select (let ((.cse29 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse28 (let ((.cse30 (store (store .cse31 (select (store .cse32 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) .cse33) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse30 (select (select .cse30 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse29) v_ArrVal_1081)))) (store .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse29 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse27 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse34 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))))))))) is different from false [2022-10-03 15:55:04,459 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)))) (and (or .cse0 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int) (v_ArrVal_1079 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse6 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse5 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse5) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (< (select (select (let ((.cse2 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store (store .cse4 (select (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) .cse6) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse3 (select (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2) v_ArrVal_1081)))) (store .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse2 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= v_DerPreprocessor_1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))))))))) (forall ((|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse12 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse11 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse11))) (let ((.cse10 (store (store .cse14 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (< (select (select (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (let ((.cse9 (store (store .cse10 (select (store .cse11 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) .cse12) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse9 (select (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_1081)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= v_DerPreprocessor_1 .cse13))))))))) (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))))) (forall ((|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (or (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| Int)) (or (forall ((v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse20 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse19 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse20 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse19))) (let ((.cse18 (store (store .cse22 |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (let ((.cse21 (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (< (select (select (let ((.cse16 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse15 (let ((.cse17 (store (store .cse18 (select (store (store .cse19 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)) .cse20) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse17 (select (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse16) v_ArrVal_1081)))) (store .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse16 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= (select .cse21 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (select .cse22 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= v_DerPreprocessor_1 .cse21))))))))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|))))) (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_43|)))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (or .cse0 (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse28 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse27 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse26 (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse27) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (< (select (select (let ((.cse24 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse23 (let ((.cse25 (store (store .cse26 (select (store .cse27 |c_ULTIMATE.start_main_~#q~1#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse28) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse25 (select (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse24) v_ArrVal_1081)))) (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse24 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (not (= v_DerPreprocessor_1 (select .cse26 |c_ULTIMATE.start_main_~#q~1#1.base|))))))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1083 Int) (v_ArrVal_1080 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| Int) (v_ArrVal_1079 (Array Int Int)) (|pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| Int)) (let ((.cse34 (+ 12 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse33 (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse34 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| .cse33) |c_ULTIMATE.start_main_~#q~1#1.base| v_DerPreprocessor_1) |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| v_DerPreprocessor_2))) (or (not (<= (+ 16 |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (< (select (select (let ((.cse30 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse29 (let ((.cse31 (store (store .cse32 (select (store (store .cse33 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| (select v_DerPreprocessor_2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse34) v_ArrVal_1079) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base_54| v_ArrVal_1080))) (store .cse31 (select (select .cse31 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse30) v_ArrVal_1081)))) (store .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse29 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse30 v_ArrVal_1083)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_#StackHeapBarrier|) (not (= v_DerPreprocessor_1 (select .cse32 |c_ULTIMATE.start_main_~#q~1#1.base|))) (not (= |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (select v_DerPreprocessor_2 |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_45|)))))))) .cse0))) is different from false Received shutdown request... [2022-10-03 15:55:05,709 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:55:05,709 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:55:05,716 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:55:06,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-03 15:55:06,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 15:55:06,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:55:06,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-03 15:55:06,780 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1065 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2022-10-03 15:55:06,783 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-03 15:55:06,784 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:55:06,798 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:55:06,798 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:55:06,812 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1582.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:55:06 BasicIcfg [2022-10-03 15:55:06,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:55:06,816 INFO L158 Benchmark]: Toolchain (without parser) took 759536.22ms. Allocated memory was 194.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 140.8MB in the beginning and 740.6MB in the end (delta: -599.8MB). Peak memory consumption was 506.6MB. Max. memory is 8.0GB. [2022-10-03 15:55:06,816 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 194.0MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:55:06,816 INFO L158 Benchmark]: Boogie Preprocessor took 152.99ms. Allocated memory is still 194.0MB. Free memory was 140.7MB in the beginning and 162.0MB in the end (delta: -21.3MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-10-03 15:55:06,817 INFO L158 Benchmark]: RCFGBuilder took 1435.11ms. Allocated memory was 194.0MB in the beginning and 272.6MB in the end (delta: 78.6MB). Free memory was 162.0MB in the beginning and 228.3MB in the end (delta: -66.3MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2022-10-03 15:55:06,817 INFO L158 Benchmark]: TraceAbstraction took 757931.73ms. Allocated memory was 272.6MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 227.2MB in the beginning and 740.6MB in the end (delta: -513.4MB). Peak memory consumption was 513.7MB. Max. memory is 8.0GB. [2022-10-03 15:55:06,818 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.15ms. Allocated memory is still 194.0MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 152.99ms. Allocated memory is still 194.0MB. Free memory was 140.7MB in the beginning and 162.0MB in the end (delta: -21.3MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1435.11ms. Allocated memory was 194.0MB in the beginning and 272.6MB in the end (delta: 78.6MB). Free memory was 162.0MB in the beginning and 228.3MB in the end (delta: -66.3MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. * TraceAbstraction took 757931.73ms. Allocated memory was 272.6MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 227.2MB in the beginning and 740.6MB in the end (delta: -513.4MB). Peak memory consumption was 513.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 527, positive: 511, positive conditional: 511, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 511, Positive conditional cache size: 0, Positive unconditional cache size: 511, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 16, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1712, positive: 1663, positive conditional: 1663, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 1665, Positive cache size: 1665, Positive conditional cache size: 0, Positive unconditional cache size: 1665, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 65, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2338, positive: 2263, positive conditional: 2263, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 2201, Positive cache size: 2201, Positive conditional cache size: 0, Positive unconditional cache size: 2201, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 140, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2072, positive: 2004, positive conditional: 2004, positive unconditional: 0, negative: 68, negative conditional: 68, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 2231, Positive cache size: 2231, Positive conditional cache size: 0, Positive unconditional cache size: 2231, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 208, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2932, positive: 2841, positive conditional: 2841, positive unconditional: 0, negative: 91, negative conditional: 91, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 2273, Positive cache size: 2273, Positive conditional cache size: 0, Positive unconditional cache size: 2273, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 299, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4279, positive: 4143, positive conditional: 4143, positive unconditional: 0, negative: 136, negative conditional: 136, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 2563, Positive cache size: 2563, Positive conditional cache size: 0, Positive unconditional cache size: 2563, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 435, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4225, positive: 4087, positive conditional: 4087, positive unconditional: 0, negative: 138, negative conditional: 138, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 2778, Positive cache size: 2778, Positive conditional cache size: 0, Positive unconditional cache size: 2778, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 573, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6406, positive: 6200, positive conditional: 6200, positive unconditional: 0, negative: 206, negative conditional: 206, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 2834, Positive cache size: 2834, Positive conditional cache size: 0, Positive unconditional cache size: 2834, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 779, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8568, positive: 8293, positive conditional: 8293, positive unconditional: 0, negative: 275, negative conditional: 275, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 5859, Positive cache size: 5855, Positive conditional cache size: 0, Positive unconditional cache size: 5855, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 1050, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 12765, positive: 12378, positive conditional: 12378, positive unconditional: 0, negative: 387, negative conditional: 387, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 10870, Positive cache size: 10864, Positive conditional cache size: 0, Positive unconditional cache size: 10864, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 1432, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 12922, positive: 12530, positive conditional: 12530, positive unconditional: 0, negative: 392, negative conditional: 392, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 58746, positive: 56913, positive conditional: 56913, positive unconditional: 0, negative: 1833, negative conditional: 1833, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56927, positive: 56913, positive conditional: 0, positive unconditional: 56913, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11103, positive: 11096, positive conditional: 0, positive unconditional: 11096, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56927, positive: 45817, positive conditional: 0, positive unconditional: 45817, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 11103, unknown conditional: 0, unknown unconditional: 11103] , Statistics on independence cache: Total cache size (in pairs): 11103, Positive cache size: 11096, Positive conditional cache size: 0, Positive unconditional cache size: 11096, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Independence queries for same thread: 1819, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1582]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1065 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 757.7s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 280.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 60.7s InterpolantComputationTime, 12100 NumberOfCodeBlocks, 12100 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 13256 ConstructedInterpolants, 301 QuantifiedInterpolants, 191409 SizeOfPredicates, 229 NumberOfNonLiveVariables, 6640 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2517/3975 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown