/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-2.line565.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 02:58:10,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 02:58:10,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 02:58:10,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 02:58:10,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 02:58:10,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 02:58:10,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 02:58:10,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 02:58:10,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 02:58:10,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 02:58:10,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 02:58:10,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 02:58:10,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 02:58:10,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 02:58:10,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 02:58:10,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 02:58:10,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 02:58:10,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 02:58:10,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 02:58:10,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 02:58:10,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 02:58:10,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 02:58:10,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 02:58:10,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 02:58:10,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 02:58:10,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 02:58:10,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 02:58:10,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 02:58:10,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 02:58:10,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 02:58:10,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 02:58:10,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 02:58:10,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 02:58:10,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 02:58:10,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 02:58:10,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 02:58:10,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 02:58:10,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 02:58:10,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 02:58:10,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 02:58:10,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 02:58:10,135 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:58:10,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 02:58:10,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 02:58:10,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 02:58:10,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 02:58:10,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 02:58:10,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 02:58:10,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 02:58:10,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 02:58:10,175 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 02:58:10,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 02:58:10,176 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 02:58:10,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 02:58:10,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 02:58:10,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 02:58:10,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 02:58:10,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 02:58:10,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 02:58:10,177 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 02:58:10,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 02:58:10,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 02:58:10,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 02:58:10,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 02:58:10,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 02:58:10,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 02:58:10,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 02:58:10,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 02:58:10,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 02:58:10,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 02:58:10,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 02:58:10,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 02:58:10,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 02:58:10,178 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 02:58:10,179 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 02:58:10,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 02:58:10,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 02:58:10,179 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 02:58:10,179 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 02:58:10,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 02:58:10,179 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:58:10,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 02:58:10,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 02:58:10,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 02:58:10,411 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 02:58:10,412 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 02:58:10,413 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-2.line565.bpl [2022-10-04 02:58:10,414 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/ring_2w1r-2.line565.bpl' [2022-10-04 02:58:10,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 02:58:10,478 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 02:58:10,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 02:58:10,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 02:58:10,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 02:58:10,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 02:58:10,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 02:58:10,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 02:58:10,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 02:58:10,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/1) ... [2022-10-04 02:58:10,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 02:58:10,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:58:10,601 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:58:10,609 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:58:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-10-04 02:58:10,638 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-10-04 02:58:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-10-04 02:58:10,638 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-10-04 02:58:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 02:58:10,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 02:58:10,640 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:58:10,819 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 02:58:10,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 02:58:11,406 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 02:58:11,435 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 02:58:11,435 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-04 02:58:11,438 INFO L202 PluginConnector]: Adding new model ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:58:11 BoogieIcfgContainer [2022-10-04 02:58:11,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 02:58:11,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 02:58:11,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 02:58:11,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 02:58:11,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:58:10" (1/2) ... [2022-10-04 02:58:11,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c74af34 and model type ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:58:11, skipping insertion in model container [2022-10-04 02:58:11,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:58:11" (2/2) ... [2022-10-04 02:58:11,456 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.line565.bpl [2022-10-04 02:58:11,463 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 02:58:11,473 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 02:58:11,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 02:58:11,473 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 02:58:11,653 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 02:58:11,702 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:58:11,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:58:11,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:58:11,705 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:58:11,707 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:58:11,739 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:58:11,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 02:58:11,753 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;@54a8010d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:58:11,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:58:12,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 02:58:12,299 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 02:58:12,301 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 02:58:12,310 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:58:12,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:58:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:58:12,315 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:58:12,325 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:58:12,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 02:58:12,327 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;@54a8010d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:58:12,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:58:12,328 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:58:12,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 02:58:12,336 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 02:58:12,340 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 02:58:12,346 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:58:12,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:58:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:58:12,390 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:58:12,392 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:58:12,395 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:58:12,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == writer_fnErr0ASSERT_VIOLATIONASSERT ======== [2022-10-04 02:58:12,396 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;@54a8010d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:58:12,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:58:12,397 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 02:58:12,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location writer_fnErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 02:58:12,398 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 02:58:12,398 INFO L307 ceAbstractionStarter]: Result for error location writer_fnErr0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 02:58:12,403 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 02:58:12,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 02:58:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:58:12,407 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:58:12,414 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 02:58:12,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == writer_fnErr0ASSERT_VIOLATIONASSERT ======== [2022-10-04 02:58:12,415 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;@54a8010d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 02:58:12,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 02:58:12,441 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:58:12,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:58:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:58:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1863674595, now seen corresponding path program 1 times [2022-10-04 02:58:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:58:12,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245995063] [2022-10-04 02:58:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:58:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:58:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:58:12,869 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:58:12,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:58:12,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245995063] [2022-10-04 02:58:12,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245995063] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:58:12,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 02:58:12,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 02:58:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776139829] [2022-10-04 02:58:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:58:12,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 02:58:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:58:12,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 02:58:12,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 02:58:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:12,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:58:12,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 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:58:12,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:12,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 02:58:12,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:58:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:58:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1784891576, now seen corresponding path program 1 times [2022-10-04 02:58:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:58:12,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980784675] [2022-10-04 02:58:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:58:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:58:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:58:14,938 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:58:14,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:58:14,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980784675] [2022-10-04 02:58:14,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980784675] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 02:58:14,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 02:58:14,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-10-04 02:58:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28352164] [2022-10-04 02:58:14,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 02:58:14,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-04 02:58:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:58:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-04 02:58:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1370, Unknown=0, NotChecked=0, Total=1482 [2022-10-04 02:58:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:14,943 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:58:14,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.684210526315789) internal successors, (178), 39 states have internal predecessors, (178), 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:58:14,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:14,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-04 02:58:20,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 02:58:20,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 02:58:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 02:58:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1682698569, now seen corresponding path program 1 times [2022-10-04 02:58:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 02:58:20,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456358862] [2022-10-04 02:58:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:58:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 02:58:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:58:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 02:58:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 02:58:22,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456358862] [2022-10-04 02:58:22,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456358862] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 02:58:22,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912013209] [2022-10-04 02:58:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 02:58:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 02:58:22,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 02:58:22,476 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:58:22,477 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:58:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 02:58:22,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 100 conjunts are in the unsatisfiable core [2022-10-04 02:58:22,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 02:58:24,291 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 02:58:24,292 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 26 treesize of output 31 [2022-10-04 02:58:25,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 02:58:25,149 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 45 treesize of output 33 [2022-10-04 02:58:25,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-04 02:58:26,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 02:58:26,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-10-04 02:58:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 02:58:26,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 02:58:26,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-10-04 02:58:26,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 02:58:26,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 02:58:29,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 02:58:29,044 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 109 treesize of output 113 [2022-10-04 02:58:29,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 02:58:29,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 02:58:29,102 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 136 treesize of output 140 [2022-10-04 02:58:30,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 02:58:30,739 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 22 treesize of output 26 [2022-10-04 02:58:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 02:58:31,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912013209] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 02:58:31,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 02:58:31,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 32, 32] total 113 [2022-10-04 02:58:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115063490] [2022-10-04 02:58:31,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 02:58:31,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2022-10-04 02:58:31,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 02:58:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2022-10-04 02:58:31,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=12308, Unknown=4, NotChecked=0, Total=12882 [2022-10-04 02:58:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:31,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 02:58:31,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 113 states have (on average 5.123893805309734) internal successors, (579), 114 states have internal predecessors, (579), 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:58:31,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:58:31,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-10-04 02:58:31,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 02:59:05,253 WARN L233 SmtUtils]: Spent 19.92s on a formula simplification. DAG size of input: 168 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 02:59:24,735 WARN L233 SmtUtils]: Spent 16.77s on a formula simplification. DAG size of input: 162 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 02:59:44,156 WARN L233 SmtUtils]: Spent 16.89s on a formula simplification. DAG size of input: 172 DAG size of output: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 03:00:03,377 WARN L233 SmtUtils]: Spent 14.90s on a formula simplification. DAG size of input: 160 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 03:00:38,130 WARN L233 SmtUtils]: Spent 18.56s on a formula simplification. DAG size of input: 202 DAG size of output: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 03:00:39,177 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse10 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse8 (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) (let ((.cse2 (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 19) .cse8)) (.cse9 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) .cse10)) (.cse4 (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse11 (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4))) (.cse6 (< 7 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|)) (.cse3 (select .cse5 20)) (.cse0 (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0)) (.cse7 (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (.cse1 (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (and (<= 0 |c_writer_fnThread1of1ForFork0_write~int_#value#1|) (or .cse0 .cse1) (or .cse0 .cse2) (<= 0 |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|) (<= (+ (* .cse3 4) 12) .cse4) (or (< (+ 7 (* (div (+ (- 9) (* |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (- 1))) 16) 16)) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select .cse5 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) 4))) .cse6) .cse7 (< .cse3 4) .cse2 (= |c_writer_fnThread1of1ForFork0_read~int_#value#1| 0) (= |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (< |c_writer_fnThread1of1ForFork0_write~int_#value#1| 4) (<= 0 |c_writer_fnThread1of1ForFork0_read~int_#value#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 0) (<= 24 .cse8) (< .cse9 4) (<= 0 .cse9) (<= (+ |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| |c_writer_fnThread1of1ForFork0_write~int_#sizeOfWrittenType#1|) (select |c_#length| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base|)) (= |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| .cse10) (<= 24 .cse4) (or .cse0 .cse11) (or .cse6 (forall ((v_ArrVal_66 Int)) (or (< (+ 7 (* (div (+ (- 9) (* |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (- 1))) 16) 16)) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_writer_fnThread1of1ForFork0_write~int_old_#memory_int#1| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base| (store (select |c_writer_fnThread1of1ForFork0_write~int_old_#memory_int#1| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base|) |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| v_ArrVal_66)) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) 4))) (not (<= |c_writer_fnThread1of1ForFork0_write~int_#value#1| v_ArrVal_66))))) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| 0) .cse11 (or (forall ((|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_21| Int) (v_ArrVal_66 Int)) (or (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_21|)) (< v_ArrVal_66 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_21|) (< (+ 7 (* (div (+ (- 9) (* |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (- 1))) 16) 16)) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_21| v_ArrVal_66) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) 4))))) .cse6) (<= |c_writer_fnThread1of1ForFork0_read~int_#value#1| .cse3) (<= 0 .cse3) (or .cse0 .cse7) .cse1))) is different from false [2022-10-04 03:00:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:00:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-04 03:00:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-10-04 03:00:40,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 03:00:40,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 03:00:40,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 03:00:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 03:00:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -832073254, now seen corresponding path program 2 times [2022-10-04 03:00:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 03:00:40,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771837983] [2022-10-04 03:00:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 03:00:40,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 03:00:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 03:00:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 03:00:42,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 03:00:42,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771837983] [2022-10-04 03:00:42,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771837983] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 03:00:42,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017175490] [2022-10-04 03:00:42,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 03:00:42,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 03:00:42,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 03:00:42,515 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 03:00:42,517 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 03:00:42,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 03:00:42,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 03:00:42,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 105 conjunts are in the unsatisfiable core [2022-10-04 03:00:42,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 03:00:43,994 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-04 03:00:43,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-10-04 03:00:45,360 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-04 03:00:45,361 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 42 treesize of output 45 [2022-10-04 03:00:45,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 03:00:45,793 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-10-04 03:00:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 3 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 03:00:45,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 03:00:48,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4))) (and (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| .cse0 7) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| .cse0 4)) (forall ((|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse1 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|))) (or (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4))) (not (< .cse1 0)) (>= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4) (> 0 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (not (<= (+ |c_writer_fnThread1of1ForFork0_read~int_#value#1| 1) .cse1))))) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int)) (let ((.cse2 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1))) (or (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) (mod .cse2 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (not (<= |c_writer_fnThread1of1ForFork0_read~int_#value#1| |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18|)) (< .cse2 0)))) (forall ((|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse3 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|))) (or (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (< .cse3 0)) (>= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4) (> 0 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (not (<= (+ |c_writer_fnThread1of1ForFork0_read~int_#value#1| 1) .cse3))))))) is different from false [2022-10-04 03:01:40,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 03:01:40,579 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 276 treesize of output 276 [2022-10-04 03:01:40,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-10-04 03:01:40,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 03:01:40,628 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 311 treesize of output 303 [2022-10-04 03:01:41,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 03:01:41,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 03:01:41,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-04 03:01:41,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 03:01:41,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 03:01:41,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-10-04 03:01:41,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 150 [2022-10-04 03:01:43,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 03:01:43,292 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 22 treesize of output 26 [2022-10-04 03:01:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 3 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-10-04 03:01:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017175490] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 03:01:43,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 03:01:43,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35, 35] total 96 [2022-10-04 03:01:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714738219] [2022-10-04 03:01:43,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 03:01:43,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-10-04 03:01:43,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 03:01:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-10-04 03:01:43,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=8694, Unknown=13, NotChecked=188, Total=9312 [2022-10-04 03:01:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:01:43,863 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 03:01:43,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 96 states have (on average 7.239583333333333) internal successors, (695), 97 states have internal predecessors, (695), 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 03:01:43,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:01:43,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-10-04 03:01:43,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-10-04 03:01:43,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:01:56,162 WARN L233 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 139 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 03:05:07,142 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) (.cse5 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse6 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (let ((.cse0 (* (select .cse5 .cse6) 4)) (.cse2 (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (.cse4 (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset|)) 4)) (.cse3 (* (select (select (store |c_writer_fnThread1of1ForFork0_write~int_old_#memory_int#1| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base| (store (select |c_writer_fnThread1of1ForFork0_write~int_old_#memory_int#1| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base|) |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| |c_writer_fnThread1of1ForFork0_write~int_#value#1|)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) .cse7) 4)) (.cse1 (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) .cse7) 4))) (and (< (+ .cse0 7 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 .cse1) .cse2) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 .cse3) .cse2) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (<= 0 |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|) (<= 0 (+ .cse0 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= 0 (+ .cse4 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| 4)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse5 .cse6 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) .cse7) 4) 4)) (forall ((|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse9 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse10 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (.cse8 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|))) (or (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (< .cse8 (+ (select .cse9 .cse10) 1)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 4 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse9 .cse10 (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4))) (not (< .cse8 0)) (<= 4 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (< |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0)))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (<= 24 .cse2) (<= (+ |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| |c_writer_fnThread1of1ForFork0_write~int_#sizeOfWrittenType#1|) (select |c_#length| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base|)) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| 0) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int)) (let ((.cse13 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1)) (.cse11 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse12 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse11 .cse12 (mod .cse13 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (< .cse13 0) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| (select .cse11 .cse12))))) (< (+ 7 .cse4 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset|) (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|)) (<= 2 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1|) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| .cse3 4)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| .cse1 4))))) is different from false [2022-10-04 03:07:17,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse0 (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4)) (.cse2 (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4)) (.cse6 (select (select |c_writer_fnThread1of1ForFork0_write~int_old_#memory_int#1| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 20))) (and (< (+ 7 .cse0 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) .cse1) (< (+ 7 .cse2 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) .cse1) (<= 0 (+ .cse0 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.base|) (<= 0 |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)))) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int) (|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse3 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|)) (.cse4 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse5 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (< .cse3 0)) (<= 4 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (not (<= |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| (+ (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (< .cse3 (+ (select .cse4 .cse5) 1)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse4 .cse5 (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4))))) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 0 (+ .cse2 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| (+ 4 (* .cse6 4) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= 0 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.offset| (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int) (v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (let ((.cse9 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1)) (.cse7 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse8 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse7 .cse8 (mod .cse9 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (not (<= |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| (+ (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (< .cse9 0) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| (select .cse7 .cse8))))) (or (exists ((|writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| Int)) (let ((.cse10 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (and (<= 0 |writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|) (<= |writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| (+ (* (select .cse10 20) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= 2 (select .cse10 |writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|))))) (<= 2 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 20))) (= |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (<= 2 |c_writer_fnThread1of1ForFork0_write~int_#value#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 0) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (not (<= |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| (+ (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))))) (<= (+ |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| |c_writer_fnThread1of1ForFork0_write~int_#sizeOfWrittenType#1|) (select |c_#length| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base|)) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| 0) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int) (v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (let ((.cse13 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1)) (.cse11 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse12 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse11 .cse12 (mod .cse13 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse13 0) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| (select .cse11 .cse12))))) (<= 2 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (<= 2 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1|) (<= |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| .cse6) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int) (|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse14 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|)) (.cse15 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse16 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (< .cse14 0)) (<= 4 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse14 (+ (select .cse15 .cse16) 1)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse15 .cse16 (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4))))))) is different from false [2022-10-04 03:07:36,444 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 20)) (.cse2 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|) 20)) (.cse0 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 20))) (and (<= 0 (+ (* .cse0 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|)) (< .cse1 4) (< .cse2 4) (<= 0 .cse1) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int) (v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (let ((.cse3 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (let ((.cse6 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1)) (.cse5 (store .cse3 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse4 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< (+ (* (select .cse3 .cse4) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse5 .cse4 (mod .cse6 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse6 0) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| (select .cse5 .cse4)))))) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int) (|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse7 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (let ((.cse9 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|)) (.cse10 (store .cse7 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse8 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (< (+ (* (select .cse7 .cse8) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (not (< .cse9 0)) (<= 4 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse9 (+ (select .cse10 .cse8) 1)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse10 .cse8 (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4)))))) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (< .cse0 4) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 0) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| 0) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (let ((.cse11 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse12 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store .cse11 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113) .cse12 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4)) (< (+ (* (select .cse11 .cse12) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|))))) (<= 0 .cse2) (<= 2 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1|) (<= 0 .cse0))) is different from false [2022-10-04 03:09:07,076 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 20)) (.cse2 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|) 20)) (.cse0 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 20))) (and (<= 0 (+ (* .cse0 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|)) (< .cse1 4) (< .cse2 4) (<= 0 .cse1) (<= 1 |c_writer_fnThread1of1ForFork0_~i~1#1|) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (< (+ (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.base|) |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.offset|) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)))) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int) (|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse3 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|)) (.cse4 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse5 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (< .cse3 0)) (<= 4 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (not (<= |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| (+ (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (< .cse3 (+ (select .cse4 .cse5) 1)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse4 .cse5 (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4))))) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (< .cse0 4) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int) (v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (let ((.cse8 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1)) (.cse6 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse7 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse6 .cse7 (mod .cse8 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (not (<= |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| (+ (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (< .cse8 0) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| (select .cse6 .cse7))))) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int) (|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse9 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|)) (.cse10 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse11 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (< (+ (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.base|) |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.offset|) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (not (< .cse9 0)) (<= 4 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse9 (+ (select .cse10 .cse11) 1)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse10 .cse11 (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4))))) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 0) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (not (<= |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| (+ (* |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))))) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int) (v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (let ((.cse14 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1)) (.cse12 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse13 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< (+ (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.base|) |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.offset|) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse12 .cse13 (mod .cse14 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse14 0) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| (select .cse12 .cse13))))) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| 0) (<= 0 .cse2) (<= 2 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (<= 2 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1|) (<= 0 .cse0))) is different from false [2022-10-04 03:10:00,959 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (div (+ (* (- 1) |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|) 4) (- 4))) (.cse1 (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 20)) (.cse2 (select (select |c_writer_fnThread1of1ForFork0_write~int_old_#memory_int#1| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 20))) (and (< .cse0 4) (<= |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| .cse1) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.base|) (<= 0 |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (or (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0)) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)))) (< |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) (<= 0 .cse0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 0 (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| (+ 4 (* .cse2 4) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= 0 |c_writer_fnThread1of1ForFork0_~i~1#1|) (= |c_writer_fnThread1of1ForFork0_read~int_#ptr#1.offset| (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= |c_writer_fnThread1of1ForFork0_write~int_#sizeOfWrittenType#1| 4) (or (exists ((|writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (and (<= 0 |writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|) (<= |writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| (+ (* (select .cse3 20) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (<= 2 (select .cse3 |writer_fnThread1of1ForFork0_write~int_#ptr#1.offset|))))) (<= 2 .cse1)) (= |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (<= 2 |c_writer_fnThread1of1ForFork0_write~int_#value#1|) (<= 0 |c_writer_fnThread1of1ForFork0_read~int_#value#1|) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 0) (= |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| 0) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (< |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (<= 24 (select |c_#length| |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.base|)) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| Int) (v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int)) (let ((.cse6 (+ |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| 1)) (.cse4 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse5 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse4 .cse5 (mod .cse6 4))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse6 0) (< |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18| (select .cse4 .cse5))))) (<= 2 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (<= 0 |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1|) (= (mod (* |c_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset| 3) 4) 0) (<= |c_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| .cse2) (forall ((v_ArrVal_113 Int) (|v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| Int) (|aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int) (|aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| Int)) (let ((.cse7 (+ (* 4 |aux_div_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|)) (.cse8 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25| v_ArrVal_113)) (.cse9 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (or (< (+ (* |c_writer_fnThread1of1ForFork0_read~int_#value#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|) (= |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (< .cse7 0)) (<= 4 |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71|) (< v_ArrVal_113 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|) (< |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 0) (not (<= 0 |v_writer_fnThread1of1ForFork0_write~int_#ptr#1.offset_25|)) (< .cse7 (+ (select .cse8 .cse9) 1)) (<= 0 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse8 .cse9 (+ (- 4) (mod |aux_mod_v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1_18_71| 4)))) |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20)) 4) 4))))))) is different from false [2022-10-04 03:10:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:10:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-10-04 03:10:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-10-04 03:10:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-10-04 03:10:08,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-04 03:10:08,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 03:10:08,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 03:10:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 03:10:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1241695262, now seen corresponding path program 1 times [2022-10-04 03:10:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 03:10:08,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087091892] [2022-10-04 03:10:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 03:10:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 03:10:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 03:10:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-10-04 03:10:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 03:10:08,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087091892] [2022-10-04 03:10:08,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087091892] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 03:10:08,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 03:10:08,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-04 03:10:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273423047] [2022-10-04 03:10:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 03:10:08,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-04 03:10:08,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 03:10:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-04 03:10:08,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-04 03:10:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:10:08,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 03:10:08,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 03:10:08,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:10:08,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-10-04 03:10:08,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-10-04 03:10:08,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2022-10-04 03:10:08,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:10:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 03:10:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-10-04 03:10:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-10-04 03:10:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-10-04 03:10:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-04 03:10:12,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-04 03:10:12,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writer_fnErr0ASSERT_VIOLATIONASSERT === [writer_fnErr0ASSERT_VIOLATIONASSERT] === [2022-10-04 03:10:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 03:10:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1995021683, now seen corresponding path program 1 times [2022-10-04 03:10:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 03:10:12,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054447657] [2022-10-04 03:10:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 03:10:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 03:10:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 03:10:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 151 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 03:10:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 03:10:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054447657] [2022-10-04 03:10:14,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054447657] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 03:10:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23580377] [2022-10-04 03:10:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 03:10:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 03:10:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 03:10:14,935 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 03:10:14,936 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 03:10:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 03:10:15,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 157 conjunts are in the unsatisfiable core [2022-10-04 03:10:15,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 03:10:16,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-04 03:10:17,946 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 03:10:17,946 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 26 treesize of output 31 [2022-10-04 03:10:20,281 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-04 03:10:20,282 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 44 treesize of output 47 [2022-10-04 03:10:23,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 03:10:23,822 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 03:10:23,823 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 30 [2022-10-04 03:10:24,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2022-10-04 03:10:24,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-04 03:10:25,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 03:10:25,258 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2022-10-04 03:10:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 12 proven. 283 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 03:10:25,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 03:10:26,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-10-04 03:10:26,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 03:10:26,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 03:11:15,312 WARN L233 SmtUtils]: Spent 26.14s on a formula simplification. DAG size of input: 70 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 03:12:02,943 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-10-04 03:12:20,001 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 03:12:20,001 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 03:12:20,001 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 03:12:20,002 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 03:12:20,002 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 03:12:20,002 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 03:12:20,843 WARN L249 SmtUtils]: Removed 5 from assertion stack [2022-10-04 03:12:20,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location writer_fnErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 03:12:20,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-04 03:12:21,045 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 03:12:21,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 03:12:21,046 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 419 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 4049ms.. [2022-10-04 03:12:21,047 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-10-04 03:12:21,048 INFO L307 ceAbstractionStarter]: Result for error location writer_fnErr0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-10-04 03:12:21,051 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 03:12:21,051 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 03:12:21,054 INFO L202 PluginConnector]: Adding new model ring_2w1r-2.line565.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 03:12:21 BasicIcfg [2022-10-04 03:12:21,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 03:12:21,055 INFO L158 Benchmark]: Toolchain (without parser) took 850576.34ms. Allocated memory was 190.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 139.6MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 421.2MB. Max. memory is 8.0GB. [2022-10-04 03:12:21,055 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 03:12:21,055 INFO L158 Benchmark]: Boogie Preprocessor took 84.28ms. Allocated memory is still 190.8MB. Free memory was 139.5MB in the beginning and 136.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-04 03:12:21,055 INFO L158 Benchmark]: RCFGBuilder took 870.66ms. Allocated memory was 190.8MB in the beginning and 268.4MB in the end (delta: 77.6MB). Free memory was 136.0MB in the beginning and 215.6MB in the end (delta: -79.5MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-10-04 03:12:21,056 INFO L158 Benchmark]: TraceAbstraction took 849613.90ms. Allocated memory was 268.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 215.1MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 417.6MB. Max. memory is 8.0GB. [2022-10-04 03:12:21,057 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-10-04 03:12:21,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 84.28ms. Allocated memory is still 190.8MB. Free memory was 139.5MB in the beginning and 136.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 870.66ms. Allocated memory was 190.8MB in the beginning and 268.4MB in the end (delta: 77.6MB). Free memory was 136.0MB in the beginning and 215.6MB in the end (delta: -79.5MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * TraceAbstraction took 849613.90ms. Allocated memory was 268.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 215.1MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 417.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2769, positive: 2616, positive conditional: 2616, positive unconditional: 0, negative: 153, negative conditional: 153, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2769, positive: 2616, positive conditional: 2616, positive unconditional: 0, negative: 153, negative conditional: 153, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2639, positive: 2616, positive conditional: 0, positive unconditional: 2616, 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: 2574, positive: 2551, positive conditional: 0, positive unconditional: 2551, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2639, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2574, unknown conditional: 0, unknown unconditional: 2574] , Statistics on independence cache: Total cache size (in pairs): 2574, Positive cache size: 2551, Positive conditional cache size: 0, Positive unconditional cache size: 2551, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Independence queries for same thread: 130, 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: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 91, positive: 87, positive conditional: 87, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 455611, positive: 443990, positive conditional: 443990, positive unconditional: 0, negative: 11621, negative conditional: 11621, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444954, positive: 443990, positive conditional: 0, positive unconditional: 443990, negative: 964, negative conditional: 0, negative unconditional: 964, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21209, positive: 21130, positive conditional: 0, positive unconditional: 21130, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 444954, positive: 422860, positive conditional: 0, positive unconditional: 422860, negative: 885, negative conditional: 0, negative unconditional: 885, unknown: 21209, unknown conditional: 0, unknown unconditional: 21209] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 142, positive: 139, positive conditional: 139, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 455611, positive: 443990, positive conditional: 443990, positive unconditional: 0, negative: 11621, negative conditional: 11621, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444954, positive: 443990, positive conditional: 0, positive unconditional: 443990, negative: 964, negative conditional: 0, negative unconditional: 964, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21209, positive: 21130, positive conditional: 0, positive unconditional: 21130, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 444954, positive: 422860, positive conditional: 0, positive unconditional: 422860, negative: 885, negative conditional: 0, negative unconditional: 885, unknown: 21209, unknown conditional: 0, unknown unconditional: 21209] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 343, positive: 337, positive conditional: 337, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 455611, positive: 443990, positive conditional: 443990, positive unconditional: 0, negative: 11621, negative conditional: 11621, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444954, positive: 443990, positive conditional: 0, positive unconditional: 443990, negative: 964, negative conditional: 0, negative unconditional: 964, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21209, positive: 21130, positive conditional: 0, positive unconditional: 21130, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 444954, positive: 422860, positive conditional: 0, positive unconditional: 422860, negative: 885, negative conditional: 0, negative unconditional: 885, unknown: 21209, unknown conditional: 0, unknown unconditional: 21209] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 225, Positive conditional cache size: 0, Positive unconditional cache size: 225, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 544, positive: 535, positive conditional: 535, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 455611, positive: 443990, positive conditional: 443990, positive unconditional: 0, negative: 11621, negative conditional: 11621, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444954, positive: 443990, positive conditional: 0, positive unconditional: 443990, negative: 964, negative conditional: 0, negative unconditional: 964, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21209, positive: 21130, positive conditional: 0, positive unconditional: 21130, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 444954, positive: 422860, positive conditional: 0, positive unconditional: 422860, negative: 885, negative conditional: 0, negative unconditional: 885, unknown: 21209, unknown conditional: 0, unknown unconditional: 21209] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 258, Positive conditional cache size: 0, Positive unconditional cache size: 258, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 22, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 171733, positive: 167361, positive conditional: 167361, positive unconditional: 0, negative: 4372, negative conditional: 4372, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 455611, positive: 443990, positive conditional: 443990, positive unconditional: 0, negative: 11621, negative conditional: 11621, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444954, positive: 443990, positive conditional: 0, positive unconditional: 443990, negative: 964, negative conditional: 0, negative unconditional: 964, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21209, positive: 21130, positive conditional: 0, positive unconditional: 21130, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 444954, positive: 422860, positive conditional: 0, positive unconditional: 422860, negative: 885, negative conditional: 0, negative unconditional: 885, unknown: 21209, unknown conditional: 0, unknown unconditional: 21209] , Statistics on independence cache: Total cache size (in pairs): 19688, Positive cache size: 19611, Positive conditional cache size: 0, Positive unconditional cache size: 19611, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Independence queries for same thread: 4044, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 282758, positive: 275531, positive conditional: 275531, positive unconditional: 0, negative: 7227, negative conditional: 7227, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 455611, positive: 443990, positive conditional: 443990, positive unconditional: 0, negative: 11621, negative conditional: 11621, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444954, positive: 443990, positive conditional: 0, positive unconditional: 443990, negative: 964, negative conditional: 0, negative unconditional: 964, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 21209, positive: 21130, positive conditional: 0, positive unconditional: 21130, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 444954, positive: 422860, positive conditional: 0, positive unconditional: 422860, negative: 885, negative conditional: 0, negative unconditional: 885, unknown: 21209, unknown conditional: 0, unknown unconditional: 21209] , Statistics on independence cache: Total cache size (in pairs): 21209, Positive cache size: 21130, Positive conditional cache size: 0, Positive unconditional cache size: 21130, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Independence queries for same thread: 10657, Statistics for Abstraction: - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 419 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 4049ms.. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 790 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 790 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: writer_fnErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 790 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: writer_fnErr0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 790 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 848.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 643.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 74.8s InterpolantComputationTime, 1944 NumberOfCodeBlocks, 1944 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 2483 ConstructedInterpolants, 73 QuantifiedInterpolants, 35997 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1254 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 309/828 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available [2022-10-04 03:12:21,106 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown