/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/ring_2w1r-1.line582.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 02:35:22,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 02:35:22,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 02:35:22,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 02:35:22,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 02:35:22,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 02:35:22,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 02:35:22,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 02:35:22,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 02:35:22,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 02:35:22,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 02:35:22,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 02:35:22,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 02:35:22,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 02:35:22,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 02:35:22,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 02:35:22,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 02:35:22,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 02:35:22,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 02:35:22,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 02:35:22,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 02:35:22,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 02:35:22,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 02:35:22,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 02:35:22,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 02:35:22,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 02:35:22,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 02:35:22,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 02:35:22,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 02:35:22,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 02:35:22,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 02:35:22,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 02:35:22,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 02:35:22,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 02:35:22,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 02:35:22,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 02:35:22,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 02:35:22,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 02:35:22,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 02:35:22,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 02:35:22,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 02:35:22,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 02:35:22,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 02:35:22,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 02:35:22,278 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 02:35:22,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 02:35:22,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 02:35:22,279 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 02:35:22,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 02:35:22,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 02:35:22,280 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 02:35:22,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 02:35:22,281 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 02:35:22,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 02:35:22,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 02:35:22,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 02:35:22,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 02:35:22,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 02:35:22,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 02:35:22,282 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 02:35:22,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 02:35:22,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 02:35:22,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 02:35:22,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 02:35:22,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 02:35:22,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 02:35:22,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 02:35:22,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 02:35:22,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 02:35:22,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 02:35:22,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 02:35:22,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 02:35:22,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 02:35:22,284 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 02:35:22,285 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 02:35:22,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 02:35:22,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 02:35:22,285 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 02:35:22,285 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 02:35:22,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 02:35:22,285 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-04 02:35:22,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 02:35:22,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 02:35:22,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 02:35:22,589 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 02:35:22,590 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 02:35:22,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/ring_2w1r-1.line582.bpl [2022-10-04 02:35:22,592 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/ring_2w1r-1.line582.bpl' [2022-10-04 02:35:22,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 02:35:22,659 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 02:35:22,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 02:35:22,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 02:35:22,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 02:35:22,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 02:35:22,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 02:35:22,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 02:35:22,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 02:35:22,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/1) ... [2022-10-04 02:35:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 02:35:22,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:22,797 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-04 02:35:22,809 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-04 02:35:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-10-04 02:35:22,840 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-10-04 02:35:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-10-04 02:35:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-10-04 02:35:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 02:35:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 02:35:22,842 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 02:35:23,023 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 02:35:23,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 02:35:23,661 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 02:35:23,687 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 02:35:23,688 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-04 02:35:23,691 INFO L202 PluginConnector]: Adding new model ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:35:23 BoogieIcfgContainer [2022-10-04 02:35:23,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 02:35:23,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 02:35:23,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 02:35:23,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 02:35:23,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:22" (1/2) ... [2022-10-04 02:35:23,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa40551 and model type ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:35:23, skipping insertion in model container [2022-10-04 02:35:23,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-1.line582.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:35:23" (2/2) ... [2022-10-04 02:35:23,703 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.line582.bpl [2022-10-04 02:35:23,713 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 02:35:23,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 02:35:23,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 02:35:23,722 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 02:35:23,889 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 02:35:23,962 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:35:23,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:35:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:23,967 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-04 02:35:23,990 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-04 02:35:24,013 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:35:24,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 02:35:24,040 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;@5018d273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:35:24,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:35:24,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 02:35:24,521 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 02:35:24,523 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 02:35:24,541 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:35:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:35:24,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:24,548 INFO L229 MonitoredProcess]: Starting monitored process 3 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-04 02:35:24,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-04 02:35:24,553 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:35:24,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 02:35:24,554 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;@5018d273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:35:24,554 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:35:24,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 02:35:24,560 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 02:35:24,561 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 02:35:24,569 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:35:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:35:24,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:24,613 INFO L229 MonitoredProcess]: Starting monitored process 4 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-04 02:35:24,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-04 02:35:24,619 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:35:24,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == writer_fnErr0ASSERT_VIOLATIONASSERT ======== [2022-10-04 02:35:24,622 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;@5018d273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:35:24,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:35:24,622 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 02:35:24,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location writer_fnErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 02:35:24,623 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 02:35:24,623 INFO L307 ceAbstractionStarter]: Result for error location writer_fnErr0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 02:35:24,630 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:35:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:35:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:24,635 INFO L229 MonitoredProcess]: Starting monitored process 5 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-04 02:35:24,645 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:35:24,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == writer_fnErr0ASSERT_VIOLATIONASSERT ======== [2022-10-04 02:35:24,646 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;@5018d273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:35:24,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:35:24,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-04 02:35:24,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:24,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash 512715179, now seen corresponding path program 1 times [2022-10-04 02:35:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:24,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438945583] [2022-10-04 02:35:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:25,144 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-04 02:35:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:25,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438945583] [2022-10-04 02:35:25,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438945583] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:35:25,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 02:35:25,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 02:35:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539660605] [2022-10-04 02:35:25,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:35:25,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 02:35:25,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 02:35:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 02:35:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:25,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:25,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 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-04 02:35:25,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:25,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 02:35:25,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1944044128, now seen corresponding path program 1 times [2022-10-04 02:35:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:25,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116748196] [2022-10-04 02:35:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:25,549 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-04 02:35:25,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:25,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116748196] [2022-10-04 02:35:25,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116748196] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:35:25,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 02:35:25,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-10-04 02:35:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123071307] [2022-10-04 02:35:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:35:25,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-04 02:35:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:25,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-04 02:35:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-10-04 02:35:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:25,554 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:25,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 17.916666666666668) internal successors, (215), 13 states have internal predecessors, (215), 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-04 02:35:25,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:25,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:31,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 02:35:31,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash 482480599, now seen corresponding path program 1 times [2022-10-04 02:35:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:31,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813255230] [2022-10-04 02:35:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 02:35:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:32,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813255230] [2022-10-04 02:35:32,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813255230] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:35:32,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 02:35:32,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 02:35:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206856355] [2022-10-04 02:35:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:35:32,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 02:35:32,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:32,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 02:35:32,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 02:35:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:32,206 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:32,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-04 02:35:32,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:32,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:32,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:38,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 02:35:38,556 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1122660751, now seen corresponding path program 1 times [2022-10-04 02:35:38,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:38,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567029928] [2022-10-04 02:35:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:38,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 131 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 02:35:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:38,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567029928] [2022-10-04 02:35:38,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567029928] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 02:35:38,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012089358] [2022-10-04 02:35:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:38,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:35:38,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:38,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 02:35:38,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-04 02:35:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:39,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-04 02:35:39,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 02:35:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 131 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 02:35:39,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 02:35:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 131 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 02:35:39,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012089358] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 02:35:39,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 02:35:39,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-04 02:35:39,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282836082] [2022-10-04 02:35:39,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 02:35:39,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-04 02:35:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-04 02:35:39,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-04 02:35:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:39,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:39,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 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-04 02:35:39,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:39,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:39,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:39,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:49,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-04 02:35:50,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:35:50,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1513133682, now seen corresponding path program 2 times [2022-10-04 02:35:50,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:50,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776130415] [2022-10-04 02:35:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2022-10-04 02:35:50,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:50,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776130415] [2022-10-04 02:35:50,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776130415] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:35:50,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 02:35:50,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-04 02:35:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046074155] [2022-10-04 02:35:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:35:50,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-04 02:35:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:50,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-04 02:35:50,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-04 02:35:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:50,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:50,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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-04 02:35:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:50,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:50,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:35:50,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-04 02:35:50,797 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash 135455746, now seen corresponding path program 1 times [2022-10-04 02:35:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:50,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62540233] [2022-10-04 02:35:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-04 02:35:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:51,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62540233] [2022-10-04 02:35:51,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62540233] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 02:35:51,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402166126] [2022-10-04 02:35:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:51,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:35:51,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:51,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 02:35:51,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-04 02:35:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:51,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 35 conjunts are in the unsatisfiable core [2022-10-04 02:35:51,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 02:35:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-04 02:35:51,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 02:35:51,969 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-04 02:35:51,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 12 treesize of output 11 [2022-10-04 02:35:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-04 02:35:52,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402166126] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 02:35:52,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 02:35:52,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 19 [2022-10-04 02:35:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982395185] [2022-10-04 02:35:52,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 02:35:52,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-04 02:35:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-04 02:35:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-10-04 02:35:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:52,241 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:52,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 26.57894736842105) internal successors, (505), 20 states have internal predecessors, (505), 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-04 02:35:52,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:52,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:52,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:52,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:52,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:35:52,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:35:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:35:53,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-04 02:35:54,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:35:54,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1176999296, now seen corresponding path program 2 times [2022-10-04 02:35:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:54,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524926192] [2022-10-04 02:35:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-04 02:35:54,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:54,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524926192] [2022-10-04 02:35:54,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524926192] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 02:35:54,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383564889] [2022-10-04 02:35:54,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 02:35:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:35:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:54,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 02:35:54,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-04 02:35:54,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-04 02:35:54,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 02:35:54,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-04 02:35:54,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 02:35:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-10-04 02:35:54,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 02:35:54,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383564889] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:35:54,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 02:35:54,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 19 [2022-10-04 02:35:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359748469] [2022-10-04 02:35:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:35:54,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-04 02:35:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-04 02:35:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-10-04 02:35:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:54,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:54,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 57.857142857142854) internal successors, (405), 8 states have internal predecessors, (405), 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-04 02:35:54,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:54,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:54,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:54,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:54,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:35:54,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:35:54,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:35:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:35:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:35:55,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-10-04 02:35:56,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:35:56,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:56,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:56,016 INFO L85 PathProgramCache]: Analyzing trace with hash 980497165, now seen corresponding path program 1 times [2022-10-04 02:35:56,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:56,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903156899] [2022-10-04 02:35:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 760 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-10-04 02:35:56,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:56,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903156899] [2022-10-04 02:35:56,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903156899] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:35:56,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 02:35:56,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-04 02:35:56,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463845245] [2022-10-04 02:35:56,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:35:56,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-04 02:35:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:35:56,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-04 02:35:56,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-04 02:35:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:56,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:35:56,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 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-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:35:56,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:35:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:35:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:35:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:35:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:35:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:35:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:35:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 02:35:57,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-04 02:35:57,327 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:35:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:35:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -360933338, now seen corresponding path program 1 times [2022-10-04 02:35:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:35:57,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099849590] [2022-10-04 02:35:57,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:57,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:35:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 597 proven. 577 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-10-04 02:35:57,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:35:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099849590] [2022-10-04 02:35:57,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099849590] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 02:35:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070831214] [2022-10-04 02:35:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:35:57,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:35:57,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:35:57,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 02:35:57,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-04 02:35:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:35:58,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 2148 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-04 02:35:58,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 02:35:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 597 proven. 577 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-10-04 02:35:59,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 02:35:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 597 proven. 577 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-10-04 02:35:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070831214] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 02:35:59,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 02:35:59,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-10-04 02:35:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950214348] [2022-10-04 02:35:59,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 02:36:00,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-04 02:36:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:36:00,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-04 02:36:00,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-10-04 02:36:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:00,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:36:00,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.11111111111111) internal successors, (1423), 9 states have internal predecessors, (1423), 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-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 02:36:00,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:36:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:36:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:36:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:36:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:36:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:36:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 02:36:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 02:36:02,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-04 02:36:03,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-04 02:36:03,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:36:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:36:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 851647528, now seen corresponding path program 2 times [2022-10-04 02:36:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:36:03,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798313792] [2022-10-04 02:36:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:36:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:36:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:36:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 715 proven. 2637 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2022-10-04 02:36:04,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:36:04,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798313792] [2022-10-04 02:36:04,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798313792] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 02:36:04,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322356542] [2022-10-04 02:36:04,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 02:36:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:36:04,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:36:04,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 02:36:04,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-04 02:36:04,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 02:36:04,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 02:36:04,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 3304 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-04 02:36:04,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 02:36:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 715 proven. 2637 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2022-10-04 02:36:06,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 02:36:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 715 proven. 2637 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2022-10-04 02:36:07,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322356542] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 02:36:07,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 02:36:07,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-10-04 02:36:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730577159] [2022-10-04 02:36:07,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 02:36:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-04 02:36:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:36:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-04 02:36:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-10-04 02:36:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:07,423 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:36:07,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 143.47058823529412) internal successors, (2439), 17 states have internal predecessors, (2439), 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-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 02:36:07,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-04 02:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-04 02:36:15,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-04 02:36:15,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-04 02:36:15,288 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:36:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:36:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1335488808, now seen corresponding path program 3 times [2022-10-04 02:36:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:36:15,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861102787] [2022-10-04 02:36:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:36:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:36:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:36:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13713 backedges. 715 proven. 12457 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2022-10-04 02:36:17,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:36:17,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861102787] [2022-10-04 02:36:17,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861102787] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 02:36:17,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502350508] [2022-10-04 02:36:17,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-04 02:36:17,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:36:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:36:17,772 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-04 02:36:17,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-04 02:36:18,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-04 02:36:18,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 02:36:18,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 172 conjunts are in the unsatisfiable core [2022-10-04 02:36:19,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 02:36:20,783 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 02:36:20,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-10-04 02:36:21,373 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2022-10-04 02:36:21,374 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 46 treesize of output 52 [2022-10-04 02:36:25,073 INFO L356 Elim1Store]: treesize reduction 76, result has 39.2 percent of original size [2022-10-04 02:36:25,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 126 [2022-10-04 02:36:26,091 INFO L356 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2022-10-04 02:36:26,091 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 64 treesize of output 58 [2022-10-04 02:36:27,391 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-04 02:36:27,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 27 [2022-10-04 02:36:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 13713 backedges. 3245 proven. 3490 refuted. 0 times theorem prover too weak. 6978 trivial. 0 not checked. [2022-10-04 02:36:27,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 02:36:54,995 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:37:00,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 02:37:01,002 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-04 02:37:01,003 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 1 case distinctions, treesize of input 15 treesize of output 14 [2022-10-04 02:37:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 13713 backedges. 3444 proven. 114 refuted. 0 times theorem prover too weak. 10120 trivial. 35 not checked. [2022-10-04 02:37:01,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502350508] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 02:37:01,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 02:37:01,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 68, 57] total 137 [2022-10-04 02:37:01,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607984138] [2022-10-04 02:37:01,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 02:37:01,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2022-10-04 02:37:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:37:01,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2022-10-04 02:37:01,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=17033, Unknown=17, NotChecked=268, Total=18632 [2022-10-04 02:37:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:37:01,265 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:37:01,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 137 states, 137 states have (on average 24.62773722627737) internal successors, (3374), 137 states have internal predecessors, (3374), 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-04 02:37:01,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:37:01,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-10-04 02:37:01,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-04 02:37:01,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-10-04 02:37:01,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-10-04 02:37:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-04 02:37:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-04 02:37:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-10-04 02:37:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-10-04 02:37:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-10-04 02:37:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:37:04,307 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (and (or (and .cse0 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|)) (< (+ |c_reader_twoThread1of1ForFork1_~i~3#1| 1) |c_reader_twoThread1of1ForFork1_~val~1#1|)) (<= |c_reader_twoThread1of1ForFork1_~i~3#1| 1) (= |c_writer_fnThread1of1ForFork0_~arg#1.offset| 0) .cse0 (= |c_writer_fnThread1of1ForFork0_#in~arg#1.offset| 0) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 0) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (or .cse1 (and .cse2 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse2) (= (+ |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset| 4) (+ (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) .cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base|) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (= |c_reader_twoThread1of1ForFork1_~i~2#1| 0))) is different from false [2022-10-04 02:37:04,749 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (= |c_reader_twoThread1of1ForFork1_~i~2#1| 0)) is different from false [2022-10-04 02:37:05,258 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 1) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:37:06,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (and (or (and .cse0 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|)) (< (+ |c_reader_twoThread1of1ForFork1_~i~3#1| 1) |c_reader_twoThread1of1ForFork1_~val~1#1|)) (<= |c_reader_twoThread1of1ForFork1_~i~3#1| 1) .cse0 (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (or .cse1 (and .cse2 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse2) (= (+ |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset| 4) (+ (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) .cse1 (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:37:06,971 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:37:32,371 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse1 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse7 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (let ((.cse0 (= |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse6 (<= 1 .cse5)) (.cse4 (and .cse7 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (.cse9 (+ .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse8 (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (and (or (and .cse0 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|)) (< (+ |c_reader_twoThread1of1ForFork1_~i~3#1| 1) |c_reader_twoThread1of1ForFork1_~val~1#1|)) (or (not (= .cse1 4)) (<= 2 (select .cse2 .cse3)) .cse4) (<= |c_reader_twoThread1of1ForFork1_~i~3#1| 1) .cse0 (<= .cse5 2) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (or .cse6 .cse4) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse7) (or (<= 1 (select .cse8 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) .cse4) (= (+ |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset| 4) .cse9) .cse6 (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) .cse4) (= (+ 4 |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset|) .cse9) (<= (+ (select .cse8 .cse3) 1) |c_reader_twoThread1of1ForFork1_write~int_#value#1|) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (= |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))))) is different from false [2022-10-04 02:37:32,872 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (<= .cse0 2) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:37:33,268 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base|) (<= .cse0 2) (= |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:37:33,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (<= .cse0 2) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:37:59,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse14 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse6 (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse12 (select .cse11 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (let ((.cse0 (< .cse12 4)) (.cse5 (<= 0 .cse12)) (.cse8 (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse13 (* (- 1) .cse12)) (.cse16 (< 1 |c_reader_twoThread1of1ForFork1_~val~1#1|)) (.cse7 (+ .cse14 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4))) (.cse24 (+ |c_reader_twoThread1of1ForFork1_#t~mem24#1| 1))) (and .cse0 (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse1 (select (let ((.cse2 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse4 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse4 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse4 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse1 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse1)))) .cse5 (= (+ (select .cse6 .cse7) 1) |c_reader_twoThread1of1ForFork1_write~int_#value#1|) (<= (+ (* (div (+ (* (- 1) .cse8) 1) 4) 4) .cse8 1) 0) (let ((.cse10 (= .cse14 4))) (or (let ((.cse9 (select .cse11 .cse7))) (and (< .cse9 5) (<= (+ (* (div (+ (- 2) (* (- 1) .cse9)) 4) 4) .cse9 4) 0) .cse10 (<= 1 .cse9))) (and (not .cse10) .cse0 .cse5 (<= (+ 5 .cse12 (* 4 (div (+ (- 3) .cse13) 4))) 0)))) (let ((.cse15 (select (store .cse11 .cse7 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse15 1) .cse16 (< 2 .cse15))) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse17 (select (let ((.cse18 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse20 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse20 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod (+ (select .cse20 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse19 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse17) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse17 1)))) (let ((.cse21 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (and (not (= 0 (mod .cse21 4))) (< .cse21 0)))) (< .cse8 4) (<= 0 .cse8) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (let ((.cse22 (select (store .cse11 .cse7 (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse22) (< .cse22 1) .cse16)) (<= (+ (* (div (+ 1 .cse13) 4) 4) .cse12 1) 0) (let ((.cse23 (select (store .cse11 .cse7 .cse24) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse23 1) (< 2 .cse23) .cse16)) (= (+ 4 |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset|) (+ .cse14 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (let ((.cse25 (select (store .cse6 .cse7 .cse24) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse25) .cse16 (< .cse25 1))) (= |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))))) is different from false [2022-10-04 02:38:00,652 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (select (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse0 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse0)))) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse4 (select (let ((.cse5 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse7 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod (+ (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse6 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse4) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse4 1)))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (and (not (= 0 (mod .cse8 4))) (< .cse8 0)))) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:38:53,036 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (select (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|))) (store .cse3 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ (select .cse3 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse0 1) (< 2 .cse0) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|)))) (let ((.cse4 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 1))) (and (not (= (mod .cse4 4) 0)) (< .cse4 0)))) (or (forall ((v_ArrVal_991 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_35| Int)) (let ((.cse5 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse6 (+ (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (let ((.cse7 (store .cse5 .cse6 v_ArrVal_991))) (let ((.cse8 (select (let ((.cse9 (select (let ((.cse11 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base| .cse7))) (store .cse11 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse12 (select .cse11 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse12 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse12 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4)))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse10 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_35| 4)))) (store .cse9 .cse10 (+ 1 (select .cse9 .cse10)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_35|) (< v_ArrVal_991 (+ (select .cse5 .cse6) 1)) (< (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_35|)) (< 2 .cse8) (< .cse8 1)))))) (< 1 |c_reader_twoThread1of1ForFork1_~val~1#1|)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse13 (select (let ((.cse14 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse16 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse16 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse15 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse13 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse13)))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse17 (select (let ((.cse18 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (let ((.cse20 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|))) (store .cse20 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (- 4) (mod (+ (select .cse20 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse19 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse17) (< .cse17 1)))) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse21 (select (let ((.cse22 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse24 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse24 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod (+ (select .cse24 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse23 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse22 .cse23 (+ (select .cse22 .cse23) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse21) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse21 1)))) (let ((.cse25 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (and (not (= 0 (mod .cse25 4))) (< .cse25 0)))) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) is different from false [2022-10-04 02:39:31,871 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (let ((.cse27 (+ |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| 1))) (and (< .cse27 0) (not (= (mod .cse27 4) 0))))) (.cse22 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse8 (< 1 |c_reader_twoThread1of1ForFork1_~val~1#1|))) (and (<= 1 (select (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (or (forall ((v_ArrVal_991 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_35| Int)) (let ((.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (let ((.cse2 (store .cse0 .cse1 v_ArrVal_991))) (let ((.cse3 (select (let ((.cse4 (select (let ((.cse6 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base| .cse2))) (store .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse7 (select .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4)))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_35| 4)))) (store .cse4 .cse5 (+ 1 (select .cse4 .cse5)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_35|) (< v_ArrVal_991 (+ (select .cse0 .cse1) 1)) (< (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_35|)) (< 2 .cse3) (< .cse3 1)))))) .cse8) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse9 (select (let ((.cse10 (select (store |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (- 4) (mod (+ |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse11 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse9 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse9)))) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse12 (select (let ((.cse13 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| 1) 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse14 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse12) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse12 1)))) .cse15) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse16 (select (let ((.cse17 (select (store |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| 1) 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse18 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse16 1) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse16)))) .cse15) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse19 (select (let ((.cse20 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (- 4) (mod (+ |c_reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse21 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse20 .cse21 (+ (select .cse20 .cse21) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse19 1) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse19)))) (<= 1 .cse22) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse23 (select (let ((.cse24 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse26 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse26 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse25 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse24 .cse25 (+ (select .cse24 .cse25) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse23 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse23)))) (< .cse22 1) .cse8) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) is different from false [2022-10-04 02:41:47,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse1 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse7 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (let ((.cse0 (= |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse6 (<= 1 .cse5)) (.cse4 (and .cse7 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (.cse9 (+ .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse8 (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (and (or (and .cse0 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|)) (< (+ |c_reader_twoThread1of1ForFork1_~i~3#1| 1) |c_reader_twoThread1of1ForFork1_~val~1#1|)) (or (not (= .cse1 4)) (<= 2 (select .cse2 .cse3)) .cse4) (<= |c_reader_twoThread1of1ForFork1_~i~3#1| 1) .cse0 (<= .cse5 2) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 1) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or .cse6 .cse4) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse7) (or (<= 1 (select .cse8 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) .cse4) (= (+ |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset| 4) .cse9) .cse6 (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) .cse4) (= (+ 4 |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset|) .cse9) (<= (+ (select .cse8 .cse3) 1) |c_reader_twoThread1of1ForFork1_write~int_#value#1|) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (= |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))))) is different from false [2022-10-04 02:42:25,236 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 02:42:26,576 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 2) (<= .cse0 2) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:43:08,987 WARN L233 SmtUtils]: Spent 14.45s on a formula simplification. DAG size of input: 47 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 02:43:10,222 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 2) (<= .cse0 2) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:43:20,989 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse28 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse29 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse18 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |c_reader_twoThread1of1ForFork1_~i~3#1| 4))) (.cse30 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|)) (.cse14 (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse12 (select .cse29 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse11 (= .cse28 4)) (.cse15 (+ .cse28 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (let ((.cse9 (select .cse29 .cse15)) (.cse0 (not .cse11)) (.cse13 (<= 0 .cse12)) (.cse17 (<= (+ 5 .cse12 (* 4 (div (+ (- 3) (* (- 1) .cse12)) 4))) 0)) (.cse16 (select .cse14 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse10 (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (.cse19 (select .cse30 (+ (* (- 4) |c_reader_twoThread1of1ForFork1_~i~3#1|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|))) (.cse5 (select .cse30 |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|)) (.cse20 (select .cse29 .cse18))) (and .cse0 (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse1 (select (let ((.cse2 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1) 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse1 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse1)))) (let ((.cse4 (+ .cse5 1))) (and (< .cse4 0) (not (= (mod .cse4 4) 0))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse6 (select (let ((.cse7 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (mod (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1) 4) (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse8 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse6) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse6 1)))) (or (and (or (<= 2 .cse9) .cse10) .cse11) (and .cse0 (or (<= 1 .cse12) .cse10))) (= |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (= |c_reader_twoThread1of1ForFork1_~i~3#1| 0) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 2) .cse13 (= (+ (select .cse14 .cse15) 1) |c_reader_twoThread1of1ForFork1_write~int_#value#1|) (<= (+ (* (div (+ (* (- 1) .cse16) 1) 4) 4) .cse16 1) 0) (or (and (< .cse9 5) (<= (+ (* (div (+ (- 2) (* (- 1) .cse9)) 4) 4) .cse9 4) 0) .cse11 (<= 1 .cse9)) (and .cse0 (< .cse12 4) .cse13 .cse17)) .cse17 (= .cse18 |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (<= 0 .cse19) (< .cse16 4) (<= 0 .cse16) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (<= .cse20 2) (or (let ((.cse21 (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1))) (and (not (= (mod .cse21 4) 0)) (< .cse21 0))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse22 (select (let ((.cse23 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1) 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse24 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse23 .cse24 (+ (select .cse23 .cse24) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse22 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse22))))) (<= |c_reader_twoThread1of1ForFork1_read~int_#value#1| 2) (or .cse10 (forall ((v_ArrVal_989 Int)) (<= 1 (select (select (store |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse25 (select (let ((.cse26 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (mod (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1) 4) (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse27 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse26 .cse27 (+ (select .cse26 .cse27) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse25 1) (< 2 .cse25)))) (= (+ 4 |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset|) (+ .cse28 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (<= (+ (* (div (+ (- 3) (* (- 1) .cse19)) 4) 4) 5 .cse19) 0) (<= |c_reader_twoThread1of1ForFork1_read~int_#value#1| .cse20) (<= .cse5 2) (= |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (<= .cse20 |c_reader_twoThread1of1ForFork1_read~int_#value#1|))))) is different from false [2022-10-04 02:43:29,648 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse25 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse15 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |c_reader_twoThread1of1ForFork1_~i~3#1| 4))) (.cse26 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|)) (.cse12 (select .cse25 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse11 (= .cse27 4))) (let ((.cse9 (select .cse25 (+ .cse27 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (.cse0 (not .cse11)) (.cse13 (<= 0 .cse12)) (.cse14 (<= (+ 5 .cse12 (* 4 (div (+ (- 3) (* (- 1) .cse12)) 4))) 0)) (.cse16 (select .cse26 (+ (* (- 4) |c_reader_twoThread1of1ForFork1_~i~3#1|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|))) (.cse5 (select .cse26 |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|)) (.cse17 (select .cse25 .cse15))) (and .cse0 (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse1 (select (let ((.cse2 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1) 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse1 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse1)))) (let ((.cse4 (+ .cse5 1))) (and (< .cse4 0) (not (= (mod .cse4 4) 0))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse6 (select (let ((.cse7 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (mod (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1) 4) (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse8 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse6) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse6 1)))) (let ((.cse10 (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (and (or (<= 2 .cse9) .cse10) .cse11) (and .cse0 (or (<= 1 .cse12) .cse10)))) (= |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (= |c_reader_twoThread1of1ForFork1_~i~3#1| 0) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 2) .cse13 (or (and (< .cse9 5) (<= (+ (* (div (+ (- 2) (* (- 1) .cse9)) 4) 4) .cse9 4) 0) .cse11 (<= 1 .cse9)) (and .cse0 (< .cse12 4) .cse13 .cse14)) .cse14 (= .cse15 |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (<= 0 .cse16) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (<= .cse17 2) (or (let ((.cse18 (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1))) (and (not (= (mod .cse18 4) 0)) (< .cse18 0))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse19 (select (let ((.cse20 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1) 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse21 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse20 .cse21 (+ (select .cse20 .cse21) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse19 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse19))))) (<= |c_reader_twoThread1of1ForFork1_read~int_#value#1| 2) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse22 (select (let ((.cse23 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (mod (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1) 4) (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse24 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse23 .cse24 (+ (select .cse23 .cse24) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse22 1) (< 2 .cse22)))) (<= (+ (* (div (+ (- 3) (* (- 1) .cse16)) 4) 4) 5 .cse16) 0) (<= |c_reader_twoThread1of1ForFork1_read~int_#value#1| .cse17) (<= .cse5 2) (<= .cse17 |c_reader_twoThread1of1ForFork1_read~int_#value#1|))))) is different from false [2022-10-04 02:43:32,247 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse5 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse4 (<= 1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (.cse8 (< 1 |c_reader_twoThread1of1ForFork1_~val~1#1|)) (.cse1 (+ .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4))) (.cse12 (+ |c_reader_twoThread1of1ForFork1_#t~mem24#1| 1))) (and (let ((.cse3 (= .cse6 4)) (.cse2 (and .cse5 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))) (or (and (or (<= 2 (select .cse0 .cse1)) .cse2) .cse3) (and (not .cse3) (or .cse4 .cse2)))) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 2) (let ((.cse7 (select (select (store |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset| |c_reader_twoThread1of1ForFork1_write~int_#value#1|)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse7) (< .cse7 1) .cse8)) (let ((.cse9 (select (store .cse0 .cse1 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse9 1) .cse8 (< 2 .cse9))) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse5) (let ((.cse10 (select (store .cse0 .cse1 (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse10) (< .cse10 1) .cse8)) (let ((.cse11 (select (store .cse0 .cse1 .cse12) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse11 1) (< 2 .cse11) .cse8)) .cse4 (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (let ((.cse13 (select (store (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) .cse1 .cse12) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse13) .cse8 (< .cse13 1)))))) is different from false [2022-10-04 02:43:32,930 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 2) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:43:33,390 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 3) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:43:37,656 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse1 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse7 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (let ((.cse0 (= |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse6 (<= 1 .cse5)) (.cse4 (and .cse7 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (.cse9 (+ .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse8 (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (and (or (and .cse0 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|)) (< (+ |c_reader_twoThread1of1ForFork1_~i~3#1| 1) |c_reader_twoThread1of1ForFork1_~val~1#1|)) (or (not (= .cse1 4)) (<= 2 (select .cse2 .cse3)) .cse4) (<= |c_reader_twoThread1of1ForFork1_~i~3#1| 1) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 3) .cse0 (<= .cse5 2) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or .cse6 .cse4) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse7) (or (<= 1 (select .cse8 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) .cse4) (= (+ |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset| 4) .cse9) .cse6 (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) .cse4) (= (+ 4 |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset|) .cse9) (<= (+ (select .cse8 .cse3) 1) |c_reader_twoThread1of1ForFork1_write~int_#value#1|) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (= |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))))) is different from false [2022-10-04 02:43:38,218 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 3) (<= .cse0 2) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:44:24,023 WARN L233 SmtUtils]: Spent 11.81s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 02:44:24,476 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 4) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base|) (<= .cse0 2) (= |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:44:24,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse1 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 4) (<= .cse0 2) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse1) (<= 1 .cse0) (or (exists ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (and (<= 2 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (< 0 |reader_twoThread1of1ForFork1_~val~1#1|) (<= |reader_twoThread1of1ForFork1_~val~1#1| 1))) (and .cse1 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-10-04 02:44:43,077 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse14 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse7 (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse12 (select .cse11 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (let ((.cse0 (< .cse12 4)) (.cse6 (<= 0 .cse12)) (.cse1 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse13 (* (- 1) .cse12)) (.cse16 (< 1 |c_reader_twoThread1of1ForFork1_~val~1#1|)) (.cse8 (+ .cse14 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4))) (.cse24 (+ |c_reader_twoThread1of1ForFork1_#t~mem24#1| 1))) (and .cse0 (<= 1 .cse1) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 4) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse2 (select (let ((.cse3 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse5 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse5 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse5 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse4 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse2 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse2)))) .cse6 (= (+ (select .cse7 .cse8) 1) |c_reader_twoThread1of1ForFork1_write~int_#value#1|) (<= (+ (* (div (+ (* (- 1) .cse1) 1) 4) 4) .cse1 1) 0) (let ((.cse10 (= .cse14 4))) (or (let ((.cse9 (select .cse11 .cse8))) (and (< .cse9 5) (<= (+ (* (div (+ (- 2) (* (- 1) .cse9)) 4) 4) .cse9 4) 0) .cse10 (<= 1 .cse9))) (and (not .cse10) .cse0 .cse6 (<= (+ 5 .cse12 (* 4 (div (+ (- 3) .cse13) 4))) 0)))) (let ((.cse15 (select (store .cse11 .cse8 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse15 1) .cse16 (< 2 .cse15))) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse17 (select (let ((.cse18 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse20 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse20 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod (+ (select .cse20 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse19 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse17) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse17 1)))) (let ((.cse21 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (and (not (= 0 (mod .cse21 4))) (< .cse21 0)))) (< .cse1 4) (<= 0 .cse1) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (let ((.cse22 (select (store .cse11 .cse8 (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse22) (< .cse22 1) .cse16)) (<= (+ (* (div (+ 1 .cse13) 4) 4) .cse12 1) 0) (let ((.cse23 (select (store .cse11 .cse8 .cse24) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse23 1) (< 2 .cse23) .cse16)) (<= 1 .cse12) (= (+ 4 |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset|) (+ .cse14 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (let ((.cse25 (select (store .cse7 .cse8 .cse24) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse25) .cse16 (< .cse25 1))) (= |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))))) is different from false [2022-10-04 02:44:44,542 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 4) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (select (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse0 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse0)))) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse4 (select (let ((.cse5 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse7 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod (+ (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse6 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse4) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse4 1)))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (and (not (= 0 (mod .cse8 4))) (< .cse8 0)))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:44:45,500 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 5) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (select (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse3 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse0 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse0)))) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse4 (select (let ((.cse5 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse7 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod (+ (select .cse7 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse6 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse4) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse4 1)))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (and (not (= 0 (mod .cse8 4))) (< .cse8 0)))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-10-04 02:44:46,175 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 5) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (select (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base|))) (store .cse3 |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| (mod (+ (select .cse3 |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse0) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse0 1)))) (let ((.cse4 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset|) 1))) (and (not (= (mod .cse4 4) 0)) (< .cse4 0)))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base|) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse5 (select (let ((.cse6 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| (let ((.cse8 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base|))) (store .cse8 |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| (+ (- 4) (mod (+ (select .cse8 |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse7 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse5) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse5 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|)))) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) is different from false [2022-10-04 02:45:53,791 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (select (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (mod (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1) 4) (- 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse0) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse0 1)))) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 5) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse3 (select (let ((.cse4 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (let ((.cse6 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|))) (store .cse6 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ (select .cse6 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse3 1) (< 2 .cse3) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|)))) (let ((.cse7 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 1))) (and (not (= (mod .cse7 4) 0)) (< .cse7 0)))) (or (forall ((v_ArrVal_991 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_35| Int)) (let ((.cse8 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse9 (+ (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (let ((.cse10 (store .cse8 .cse9 v_ArrVal_991))) (let ((.cse11 (select (let ((.cse12 (select (let ((.cse14 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base| .cse10))) (store .cse14 |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse15 (select .cse14 |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse15 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (mod (+ (select .cse15 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4) (- 4)))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse13 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_35| 4)))) (store .cse12 .cse13 (+ 1 (select .cse12 .cse13)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_35|) (< v_ArrVal_991 (+ (select .cse8 .cse9) 1)) (< (select .cse10 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_35|)) (< 2 .cse11) (< .cse11 1)))))) (< 1 |c_reader_twoThread1of1ForFork1_~val~1#1|)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse16 (select (let ((.cse17 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse19 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse19 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (+ (- 4) (mod (+ (select .cse19 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse18 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse16 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse16)))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse20 (select (let ((.cse21 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (let ((.cse23 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|))) (store .cse23 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (+ (- 4) (mod (+ (select .cse23 |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|) 1) 4))))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse22 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse21 .cse22 (+ (select .cse21 .cse22) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse20) (< .cse20 1)))) (or (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse24 (select (let ((.cse25 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (let ((.cse27 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (store .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (mod (+ (select .cse27 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) 4)))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse26 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse25 .cse26 (+ (select .cse25 .cse26) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 .cse24) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< .cse24 1)))) (let ((.cse28 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1))) (and (not (= 0 (mod .cse28 4))) (< .cse28 0)))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (let ((.cse29 (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1))) (and (not (= (mod .cse29 4) 0)) (< .cse29 0))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse30 (select (let ((.cse31 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| (mod (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1) 4))) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse32 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (store .cse31 .cse32 (+ (select .cse31 .cse32) 1))) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< .cse30 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 .cse30))))) (<= 1 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) (= |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) is different from false [2022-10-04 02:46:36,558 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 138 DAG size of output: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 02:47:13,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_reader_twoThread1of1ForFork1_~val~1#1| 4)) (.cse7 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))) (let ((.cse9 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (.cse12 (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse8 (+ .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (let ((.cse0 (select .cse7 .cse8)) (.cse1 (and .cse12 (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))) (.cse3 (<= 1 .cse9)) (.cse6 (< 1 |c_reader_twoThread1of1ForFork1_~val~1#1|)) (.cse13 (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse16 (+ |c_reader_twoThread1of1ForFork1_#t~mem24#1| 1))) (and (let ((.cse2 (= .cse4 4))) (or (and (or (<= 2 .cse0) .cse1) .cse2) (and (not .cse2) (or .cse3 .cse1)))) (<= |c_reader_twoThread1of1ForFork1_~i~2#1| 5) (let ((.cse5 (select (store .cse7 .cse8 (+ .cse0 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse5 1) (< 2 .cse5) .cse6)) (or (< .cse9 1) (< 2 .cse9) .cse6) (let ((.cse10 (select (select (store |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_reader_twoThread1of1ForFork1_write~int_old_#memory_int#1| |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset| |c_reader_twoThread1of1ForFork1_write~int_#value#1|)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse10) (< .cse10 1) .cse6)) (let ((.cse11 (select (store .cse7 .cse8 (+ (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.base|) |c_reader_twoThread1of1ForFork1_read~int_#ptr#1.offset|) 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse11 1) .cse6 (< 2 .cse11))) (< 0 |c_reader_twoThread1of1ForFork1_~val~1#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (or (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) .cse12) (or (<= 1 (select .cse13 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) .cse1) (let ((.cse14 (select (store .cse7 .cse8 (+ |c_reader_twoThread1of1ForFork1_read~int_#value#1| 1)) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse14) (< .cse14 1) .cse6)) (let ((.cse15 (select (store .cse7 .cse8 .cse16) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< .cse15 1) (< 2 .cse15) .cse6)) .cse3 (= (+ 4 |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.offset|) (+ .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (<= (+ (select .cse13 .cse8) 1) |c_reader_twoThread1of1ForFork1_write~int_#value#1|) (forall ((|reader_twoThread1of1ForFork1_~r~2#1.offset| Int) (v_ArrVal_989 Int)) (or (= |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| |reader_twoThread1of1ForFork1_~r~2#1.offset|) (<= 1 (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |reader_twoThread1of1ForFork1_~r~2#1.offset| v_ArrVal_989)) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (let ((.cse17 (select (store .cse13 .cse8 .cse16) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (or (< 2 .cse17) .cse6 (< .cse17 1))) (= |c_reader_twoThread1of1ForFork1_write~int_#ptr#1.base| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|))))) is different from false Received shutdown request... [2022-10-04 02:49:19,118 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 02:49:19,124 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-04 02:49:19,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 02:49:19,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 02:49:19,158 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-04 02:49:19,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 02:49:20,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-04 02:49:20,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2022-10-04 02:49:20,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-10-04 02:49:20,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-10-04 02:49:20,255 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-04 02:49:20,325 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-10-04 02:49:20,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-10-04 02:49:20,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-04 02:49:20,439 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:152) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:234) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:164) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:97) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:121) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:322) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-10-04 02:49:20,442 INFO L158 Benchmark]: Toolchain (without parser) took 837783.52ms. Allocated memory was 188.7MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 144.6MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-10-04 02:49:20,443 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 188.7MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 02:49:20,443 INFO L158 Benchmark]: Boogie Preprocessor took 83.85ms. Allocated memory is still 188.7MB. Free memory was 144.6MB in the beginning and 141.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-04 02:49:20,443 INFO L158 Benchmark]: RCFGBuilder took 935.50ms. Allocated memory is still 188.7MB. Free memory was 141.0MB in the beginning and 137.0MB in the end (delta: 3.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-10-04 02:49:20,444 INFO L158 Benchmark]: TraceAbstraction took 836747.48ms. Allocated memory was 188.7MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 136.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-10-04 02:49:20,444 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.16ms. Allocated memory is still 188.7MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 83.85ms. Allocated memory is still 188.7MB. Free memory was 144.6MB in the beginning and 141.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 935.50ms. Allocated memory is still 188.7MB. Free memory was 141.0MB in the beginning and 137.0MB in the end (delta: 3.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 836747.48ms. Allocated memory was 188.7MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 136.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2771, positive: 2612, positive conditional: 2612, positive unconditional: 0, negative: 159, negative conditional: 159, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2771, positive: 2612, positive conditional: 2612, positive unconditional: 0, negative: 159, negative conditional: 159, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2635, positive: 2612, positive conditional: 0, positive unconditional: 2612, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2568, positive: 2545, positive conditional: 0, positive unconditional: 2545, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2635, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2568, unknown conditional: 0, unknown unconditional: 2568] , Statistics on independence cache: Total cache size (in pairs): 2568, Positive cache size: 2545, Positive conditional cache size: 0, Positive unconditional cache size: 2545, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Independence queries for same thread: 136, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown