/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.line861.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m
[2022-10-04 03:04:35,535 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-10-04 03:04:35,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-10-04 03:04:35,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-10-04 03:04:35,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-10-04 03:04:35,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-10-04 03:04:35,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-10-04 03:04:35,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-10-04 03:04:35,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-10-04 03:04:35,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-10-04 03:04:35,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-10-04 03:04:35,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-10-04 03:04:35,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-10-04 03:04:35,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-10-04 03:04:35,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-10-04 03:04:35,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-10-04 03:04:35,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-10-04 03:04:35,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-10-04 03:04:35,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-10-04 03:04:35,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-10-04 03:04:35,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-10-04 03:04:35,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-10-04 03:04:35,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-10-04 03:04:35,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-10-04 03:04:35,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-10-04 03:04:35,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-10-04 03:04:35,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-10-04 03:04:35,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-10-04 03:04:35,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-10-04 03:04:35,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-10-04 03:04:35,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-10-04 03:04:35,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-10-04 03:04:35,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-10-04 03:04:35,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-10-04 03:04:35,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-10-04 03:04:35,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-10-04 03:04:35,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-10-04 03:04:35,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-10-04 03:04:35,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-10-04 03:04:35,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-10-04 03:04:35,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-10-04 03:04:35,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf
[2022-10-04 03:04:35,651 INFO L113 SettingsManager]: Loading preferences was successful
[2022-10-04 03:04:35,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-10-04 03:04:35,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-10-04 03:04:35,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-10-04 03:04:35,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-10-04 03:04:35,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-10-04 03:04:35,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-10-04 03:04:35,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-10-04 03:04:35,654 INFO L138 SettingsManager]: * Use SBE=true
[2022-10-04 03:04:35,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-10-04 03:04:35,654 INFO L138 SettingsManager]: * sizeof long=4
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * sizeof long double=12
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-10-04 03:04:35,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-10-04 03:04:35,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-10-04 03:04:35,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-10-04 03:04:35,656 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-10-04 03:04:35,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-10-04 03:04:35,657 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL
[2022-10-04 03:04:35,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2022-10-04 03:04:35,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-10-04 03:04:35,658 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION
[2022-10-04 03:04:35,658 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES
[2022-10-04 03:04:35,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-10-04 03:04:35,658 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 03:04:35,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-10-04 03:04:35,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-10-04 03:04:35,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-10-04 03:04:35,930 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2022-10-04 03:04:35,932 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized
[2022-10-04 03:04:35,933 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.line861.bpl
[2022-10-04 03:04:35,933 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/ring_2w1r-2.line861.bpl'
[2022-10-04 03:04:35,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-10-04 03:04:35,986 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements.
[2022-10-04 03:04:35,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-10-04 03:04:35,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-10-04 03:04:35,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-10-04 03:04:35,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-10-04 03:04:36,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-10-04 03:04:36,098 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-10-04 03:04:36,099 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-10-04 03:04:36,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/1) ...
[2022-10-04 03:04:36,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-10-04 03:04:36,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-04 03:04:36,135 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 03:04:36,138 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 03:04:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two
[2022-10-04 03:04:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two
[2022-10-04 03:04:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn
[2022-10-04 03:04:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn
[2022-10-04 03:04:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-10-04 03:04:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-10-04 03:04:36,164 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 03:04:36,317 INFO L234 CfgBuilder]: Building ICFG
[2022-10-04 03:04:36,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-10-04 03:04:36,936 INFO L275 CfgBuilder]: Performing block encoding
[2022-10-04 03:04:36,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-10-04 03:04:36,958 INFO L299 CfgBuilder]: Removed 6 assume(true) statements.
[2022-10-04 03:04:36,961 INFO L202 PluginConnector]: Adding new model ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 03:04:36 BoogieIcfgContainer
[2022-10-04 03:04:36,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-10-04 03:04:36,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-10-04 03:04:36,964 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-10-04 03:04:36,967 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-10-04 03:04:36,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 03:04:35" (1/2) ...
[2022-10-04 03:04:36,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585ed35f and model type ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 03:04:36, skipping insertion in model container
[2022-10-04 03:04:36,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 03:04:36" (2/2) ...
[2022-10-04 03:04:36,972 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.line861.bpl
[2022-10-04 03:04:36,977 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-10-04 03:04:36,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-10-04 03:04:36,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-10-04 03:04:36,985 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-10-04 03:04:37,121 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2022-10-04 03:04:37,165 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2022-10-04 03:04:37,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2022-10-04 03:04:37,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-04 03:04:37,169 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 03:04:37,170 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 03:04:37,195 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2022-10-04 03:04:37,200 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ========
[2022-10-04 03:04:37,205 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;@494c1c17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-10-04 03:04:37,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-10-04 03:04:37,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-04 03:04:37,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-10-04 03:04:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1737142182, now seen corresponding path program 1 times
[2022-10-04 03:04:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-04 03:04:37,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146886226]
[2022-10-04 03:04:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:04:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-04 03:04:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:04:37,689 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 03:04:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-04 03:04:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146886226]
[2022-10-04 03:04:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146886226] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-04 03:04:37,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-04 03:04:37,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-10-04 03:04:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808068568]
[2022-10-04 03:04:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-04 03:04:37,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-10-04 03:04:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-04 03:04:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-10-04 03:04:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-10-04 03:04:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:04:37,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-04 03:04:37,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 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:04:37,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:04:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:04:37,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-10-04 03:04:37,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-04 03:04:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-10-04 03:04:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1700267521, now seen corresponding path program 1 times
[2022-10-04 03:04:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-04 03:04:37,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097304910]
[2022-10-04 03:04:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:04:37,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-04 03:04:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:04:39,227 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 03:04:39,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-04 03:04:39,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097304910]
[2022-10-04 03:04:39,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097304910] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-04 03:04:39,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-04 03:04:39,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39
[2022-10-04 03:04:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308067520]
[2022-10-04 03:04:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-04 03:04:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2022-10-04 03:04:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-04 03:04:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2022-10-04 03:04:39,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560
[2022-10-04 03:04:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:04:39,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-04 03:04:39,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.717948717948718) internal successors, (184), 40 states have internal predecessors, (184), 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:04:39,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:04:39,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:04:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:04:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2022-10-04 03:04:43,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-10-04 03:04:43,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-04 03:04:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-10-04 03:04:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1395366295, now seen corresponding path program 1 times
[2022-10-04 03:04:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-04 03:04:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974254558]
[2022-10-04 03:04:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:04:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-04 03:04:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:04:45,517 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 03:04:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-04 03:04:45,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974254558]
[2022-10-04 03:04:45,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974254558] provided 0 perfect and 1 imperfect interpolant sequences
[2022-10-04 03:04:45,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168618096]
[2022-10-04 03:04:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:04:45,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-04 03:04:45,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-04 03:04:45,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-10-04 03:04:45,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-10-04 03:04:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:04:45,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 133 conjunts are in the unsatisfiable core
[2022-10-04 03:04:45,733 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-10-04 03:04:45,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-10-04 03:04:45,838 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2022-10-04 03:04:45,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2022-10-04 03:04:45,896 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size
[2022-10-04 03:04:45,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18
[2022-10-04 03:04:46,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:04:46,477 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:04:46,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2022-10-04 03:04:46,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2022-10-04 03:04:46,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2022-10-04 03:04:47,891 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:04:47,903 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size
[2022-10-04 03:04:47,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 40
[2022-10-04 03:04:48,346 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:04:48,349 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-10-04 03:04:48,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:04:48,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 45
[2022-10-04 03:04:48,634 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 03:04:49,025 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-10-04 03:04:49,026 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:04:49,213 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 03:04:49,213 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-10-04 03:04:49,708 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:04:49,718 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:04:49,719 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:05:18,077 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size
[2022-10-04 03:05:18,078 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 73
[2022-10-04 03:05:18,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:05:18,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 356
[2022-10-04 03:05:18,110 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 203 treesize of output 187
[2022-10-04 03:05:18,118 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 438 treesize of output 406
[2022-10-04 03:05:18,135 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 03:05:18,183 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 03:05:18,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:05:18,212 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 23 treesize of output 27
[2022-10-04 03:05:18,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:05:18,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 508 treesize of output 514
[2022-10-04 03:05:18,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:05:18,943 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 107 treesize of output 111
[2022-10-04 03:05:20,105 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 03:05:20,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168618096] provided 0 perfect and 2 imperfect interpolant sequences
[2022-10-04 03:05:20,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-10-04 03:05:20,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 45, 45] total 125
[2022-10-04 03:05:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643513089]
[2022-10-04 03:05:20,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-10-04 03:05:20,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states
[2022-10-04 03:05:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-04 03:05:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants.
[2022-10-04 03:05:20,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=15087, Unknown=58, NotChecked=0, Total=15750
[2022-10-04 03:05:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:05:20,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-04 03:05:20,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 4.784) internal successors, (598), 126 states have internal predecessors, (598), 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:05:20,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:05:20,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states.
[2022-10-04 03:05:20,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:05:31,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 20))) (and (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) (<= (+ (* .cse0 4) 12) .cse1) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (<= 24 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (< .cse2 4) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) .cse1) (or (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (forall ((|ULTIMATE.start_write~int_#ptr#1.offset| Int) (v_ArrVal_74 Int)) (or (let ((.cse3 (select (store (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) |ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_74) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))) (< (* 16 (div (+ (- 2) (* (- 1) .cse3)) 4)) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse3 4) 9))) (< v_ArrVal_74 1)))) (<= 0 |c_ULTIMATE.start_read~int_#value#1|) (<= 24 .cse1) (< |c_ULTIMATE.start_read~int_#value#1| 4) (< |c_ULTIMATE.start_write~int_#value#1| 4) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) (<= 0 .cse0) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false
[2022-10-04 03:05:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:05:32,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2022-10-04 03:05:32,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2022-10-04 03:05:32,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2022-10-04 03:05:32,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-10-04 03:05:32,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-04 03:05:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-10-04 03:05:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1458078419, now seen corresponding path program 2 times
[2022-10-04 03:05:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-04 03:05:32,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345610937]
[2022-10-04 03:05:32,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:05:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-04 03:05:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:05:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 54 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-04 03:05:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-04 03:05:34,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345610937]
[2022-10-04 03:05:34,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345610937] provided 0 perfect and 1 imperfect interpolant sequences
[2022-10-04 03:05:34,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23292677]
[2022-10-04 03:05:34,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-10-04 03:05:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-04 03:05:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-04 03:05:34,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-10-04 03:05:34,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-10-04 03:05:34,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-10-04 03:05:34,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-10-04 03:05:34,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 107 conjunts are in the unsatisfiable core
[2022-10-04 03:05:34,322 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-10-04 03:05:35,731 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size
[2022-10-04 03:05:35,732 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:05:36,624 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size
[2022-10-04 03:05:36,626 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 49 treesize of output 52
[2022-10-04 03:05:36,895 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-10-04 03:05:36,896 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:05:37,035 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:05:37,035 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-10-04 03:05:39,967 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4))) (and (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< .cse0 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (mod .cse0 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (not (<= |c_ULTIMATE.start_read~int_#value#1| |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11|))))) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) (forall ((|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int)) (let ((.cse2 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|))) (or (>= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (not (< .cse2 0)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) 4)) (> 0 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (not (<= (+ |c_ULTIMATE.start_read~int_#value#1| 1) .cse2))))) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 .cse1) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (forall ((|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int)) (let ((.cse3 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|))) (or (>= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (not (< .cse3 0)) (> 0 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (not (<= (+ |c_ULTIMATE.start_read~int_#value#1| 1) .cse3))))))) is different from false
[2022-10-04 03:06:29,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:06:29,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 545 treesize of output 555
[2022-10-04 03:06:29,222 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 03:06:34,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:06:34,253 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 25 treesize of output 29
[2022-10-04 03:06:34,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:06:34,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 207
[2022-10-04 03:06:34,841 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size
[2022-10-04 03:06:34,843 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 97 treesize of output 92
[2022-10-04 03:06:34,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:06:34,890 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 171 treesize of output 163
[2022-10-04 03:06:35,019 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:35,028 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:35,091 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 12 treesize of output 8
[2022-10-04 03:06:35,099 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 10 treesize of output 8
[2022-10-04 03:06:35,104 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 22 treesize of output 18
[2022-10-04 03:06:35,141 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size
[2022-10-04 03:06:35,142 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 109 treesize of output 1
[2022-10-04 03:06:35,146 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:35,156 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:35,161 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:35,182 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:06:35,187 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size
[2022-10-04 03:06:35,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 1
[2022-10-04 03:06:35,199 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:06:35,204 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 55 treesize of output 53
[2022-10-04 03:06:35,230 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:35,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:06:35,269 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 76 treesize of output 74
[2022-10-04 03:06:35,361 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2022-10-04 03:06:35,361 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 109 treesize of output 97
[2022-10-04 03:06:35,384 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 11 treesize of output 9
[2022-10-04 03:06:35,407 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:35,420 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:06:35,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:06:35,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 189
[2022-10-04 03:06:35,682 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:06:35,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53
[2022-10-04 03:06:35,724 WARN L234 Elim1Store]: Array PQE input equivalent to true
[2022-10-04 03:06:37,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:06:37,725 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:06:38,157 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:06:38,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23292677] provided 0 perfect and 2 imperfect interpolant sequences
[2022-10-04 03:06:38,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-10-04 03:06:38,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 34] total 102
[2022-10-04 03:06:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763909260]
[2022-10-04 03:06:38,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-10-04 03:06:38,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states
[2022-10-04 03:06:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-04 03:06:38,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants.
[2022-10-04 03:06:38,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=9832, Unknown=13, NotChecked=200, Total=10506
[2022-10-04 03:06:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:06:38,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-04 03:06:38,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 102 states have (on average 7.147058823529412) internal successors, (729), 103 states have internal predecessors, (729), 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:06:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:06:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states.
[2022-10-04 03:06:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states.
[2022-10-04 03:06:38,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:08:54,348 WARN L233 SmtUtils]: Spent 15.31s on a formula simplification. DAG size of input: 164 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:08:57,920 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|) 20)) (.cse5 (* 4 .cse6))) (and (< .cse0 4) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse2 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse3 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| (select .cse1 .cse2)) (< .cse3 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse1 .cse2 (mod .cse3 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))))) (< .cse4 4) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 24 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse5 4)) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 .cse4) (<= 24 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|))) (< .cse6 4) (<= 0 .cse0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= (* .cse4 4) 12) (<= 0 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 24 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse8 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse9 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| (select .cse7 .cse8)) (< .cse9 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse7 .cse8 (mod .cse9 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (forall ((v_ArrVal_122 Int) (|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (let ((.cse10 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|)) (.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse12 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (<= 4 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (< |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (< .cse10 (+ (select .cse11 .cse12) 1)) (not (< .cse10 0)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse11 .cse12 (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= .cse5 12) (<= 0 .cse6) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (forall ((v_ArrVal_122 Int)) (or (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|))) (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)))) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (forall ((v_ArrVal_122 Int) (|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int)) (let ((.cse13 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|)) (.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (or (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (<= 4 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (< |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (< .cse13 (+ (select .cse14 .cse15) 1)) (not (< .cse13 0)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse14 .cse15 (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))))) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0)))) is different from false
[2022-10-04 03:08:59,355 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (.cse4 (* 4 .cse5)) (.cse6 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (and (< .cse0 4) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse2 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse3 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| (select .cse1 .cse2)) (< .cse3 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse1 .cse2 (mod .cse3 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))))) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse4 4)) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4)) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (<= 24 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|))) (< .cse5 4) (<= 0 .cse0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (<= 0 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 24 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse6 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse8 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse9 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| (select .cse7 .cse8)) (< .cse9 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse7 .cse8 (mod .cse9 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (forall ((v_ArrVal_122 Int) (|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (let ((.cse10 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|)) (.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse12 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (<= 4 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (< |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (< .cse10 (+ (select .cse11 .cse12) 1)) (not (< .cse10 0)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse11 .cse12 (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= .cse4 12) (<= 0 .cse5) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (forall ((v_ArrVal_122 Int)) (or (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|))) (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)))) (<= .cse6 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (forall ((v_ArrVal_122 Int) (|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int)) (let ((.cse13 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|)) (.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (or (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (<= 4 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (< |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (< .cse13 (+ (select .cse14 .cse15) 1)) (not (< .cse13 0)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse14 .cse15 (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))))) (<= |c_ULTIMATE.start_read~int_#ptr#1.offset| .cse6) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0)))) is different from false
[2022-10-04 03:10:34,767 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (.cse4 (* 4 .cse5))) (and (< .cse0 4) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse2 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse3 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| (select .cse1 .cse2)) (< .cse3 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse1 .cse2 (mod .cse3 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))))) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse4 4)) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (<= 24 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|))) (< .cse5 4) (<= 0 .cse0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (<= 0 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 24 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) |c_ULTIMATE.start_read~int_#ptr#1.offset|) (forall ((v_ArrVal_122 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse8 (+ |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| 1))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11| (select .cse6 .cse7)) (< .cse8 0) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse6 .cse7 (mod .cse8 4))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (forall ((v_ArrVal_122 Int) (|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (let ((.cse9 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|)) (.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse11 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_30|) (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (<= 4 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (< |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (< .cse9 (+ (select .cse10 .cse11) 1)) (not (< .cse9 0)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse10 .cse11 (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= .cse4 12) (<= 0 .cse5) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (forall ((v_ArrVal_122 Int)) (or (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) 0)) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|))) (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)))) (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_30| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_30| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_30|)) (forall ((v_ArrVal_122 Int) (|aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int) (|aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| Int)) (let ((.cse12 (+ (* |aux_div_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|)) (.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_30| v_ArrVal_122)) (.cse14 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (or (= |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (<= 4 |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58|) (< |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 0) (< .cse12 (+ (select .cse13 .cse14) 1)) (not (< .cse12 0)) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse13 .cse14 (+ (mod |aux_mod_v_ULTIMATE.start_ring_enqueue_#t~mem7#1_11_58| 4) (- 4)))) |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4) 4)) (< v_ArrVal_122 |c_ULTIMATE.start_ring_enqueue_~x#1|)))))) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0)))) is different from false
[2022-10-04 03:10:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:10:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2022-10-04 03:10:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2022-10-04 03:10:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2022-10-04 03:10:51,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-10-04 03:10:52,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-04 03:10:52,013 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-04 03:10:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-10-04 03:10:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash -859850218, now seen corresponding path program 1 times
[2022-10-04 03:10:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-04 03:10:52,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60181562]
[2022-10-04 03:10:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:10:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-04 03:10:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:10:52,115 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:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-04 03:10:52,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60181562]
[2022-10-04 03:10:52,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60181562] provided 1 perfect and 0 imperfect interpolant sequences
[2022-10-04 03:10:52,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-10-04 03:10:52,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-10-04 03:10:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403630425]
[2022-10-04 03:10:52,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-10-04 03:10:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-10-04 03:10:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-04 03:10:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-10-04 03:10:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-10-04 03:10:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:10:52,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-04 03:10:52,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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:52,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:10:52,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states.
[2022-10-04 03:10:52,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states.
[2022-10-04 03:10:52,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states.
[2022-10-04 03:10:52,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:10:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:10:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2022-10-04 03:10:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2022-10-04 03:10:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2022-10-04 03:10:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-10-04 03:10:55,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-10-04 03:10:55,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-04 03:10:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-10-04 03:10:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 257229229, now seen corresponding path program 1 times
[2022-10-04 03:10:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-04 03:10:55,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709436654]
[2022-10-04 03:10:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:10:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-04 03:10:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:10:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 3 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-04 03:10:58,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-04 03:10:58,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709436654]
[2022-10-04 03:10:58,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709436654] provided 0 perfect and 1 imperfect interpolant sequences
[2022-10-04 03:10:58,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387347064]
[2022-10-04 03:10:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:10:58,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-04 03:10:58,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-04 03:10:58,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-10-04 03:10:58,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-10-04 03:10:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:10:58,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 107 conjunts are in the unsatisfiable core
[2022-10-04 03:10:58,887 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-10-04 03:10:59,899 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:11:03,261 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size
[2022-10-04 03:11:03,262 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:11:04,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:11:04,610 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 03:11:04,977 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 03:11:05,520 INFO L173 IndexEqualityManager]: detected equality via solver
[2022-10-04 03:11:05,521 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:11:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 70 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-04 03:11:05,795 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-10-04 03:11:06,624 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:11:06,633 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:11:06,634 INFO L190 IndexEqualityManager]: detected not equals via solver
[2022-10-04 03:11:07,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-10-04 03:11:07,133 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 53 treesize of output 57
[2022-10-04 03:11:28,866 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 36 treesize of output 30
[2022-10-04 03:11:28,870 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 12 treesize of output 8
[2022-10-04 03:11:28,881 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 95 treesize of output 91
[2022-10-04 03:11:28,889 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 73 treesize of output 65
[2022-10-04 03:11:28,898 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 75 treesize of output 67
[2022-10-04 03:11:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 58 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-10-04 03:11:30,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387347064] provided 0 perfect and 2 imperfect interpolant sequences
[2022-10-04 03:11:30,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-10-04 03:11:30,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 34, 32] total 125
[2022-10-04 03:11:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095240048]
[2022-10-04 03:11:30,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-10-04 03:11:30,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states
[2022-10-04 03:11:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-10-04 03:11:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants.
[2022-10-04 03:11:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=15126, Unknown=5, NotChecked=0, Total=15750
[2022-10-04 03:11:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:11:30,679 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2022-10-04 03:11:30,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 10.424) internal successors, (1303), 126 states have internal predecessors, (1303), 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:11:30,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:11:30,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states.
[2022-10-04 03:11:30,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states.
[2022-10-04 03:11:30,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states.
[2022-10-04 03:11:30,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2022-10-04 03:11:30,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:11:43,824 WARN L233 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 95 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:11:53,988 WARN L233 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:12:05,870 WARN L233 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:12:19,843 WARN L233 SmtUtils]: Spent 13.84s on a formula simplification. DAG size of input: 58 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:12:27,498 WARN L233 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:12:35,536 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 56 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:12:45,514 WARN L233 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 56 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:13:43,126 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4)) (.cse10 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (let ((.cse3 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse17 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse16 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse10 4)) (.cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse13 4))) (let ((.cse0 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse8 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse6 (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16)))) (.cse11 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse5 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse7 (< .cse15 0)) (.cse14 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse9 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse12 (< .cse16 0)) (.cse2 (not .cse17)) (.cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20) 4) 4)) (.cse1 (and .cse3 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse17))) (and (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) 4)) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse0 4)) (or .cse1 (and .cse2 .cse3 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| .cse4))) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse5 (< .cse6 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse0))) (or .cse7 .cse8) .cse9 (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse10) .cse11) .cse8 (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (or .cse8 .cse12) (or .cse5 (< .cse6 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse10))) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse13) .cse11) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse14 (or .cse5 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse5 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse7 .cse14) (<= 0 .cse15) (or .cse7 .cse9) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (<= 0 .cse16) (or .cse14 .cse12) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse9 .cse12) (or (and .cse2 .cse3 (<= 0 .cse4)) .cse1) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))))) is different from false
[2022-10-04 03:16:12,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse21 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse13 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (let ((.cse25 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse13 4)) (.cse8 (select .cse27 .cse21)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse6 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse26 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse3 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20)) (.cse2 (select .cse26 20)) (.cse17 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse10 (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16)))) (.cse7 (not .cse6)) (.cse0 (* 4 (select .cse28 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)))) (.cse16 (select .cse28 20)) (.cse5 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse12 (select .cse27 20)) (.cse9 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse20 (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4)) (.cse15 (* .cse8 4)) (.cse1 (* (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (.cse18 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse23 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse11 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse19 (< .cse25 0)) (.cse22 (select .cse26 .cse21)) (.cse4 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse14 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 (+ .cse0 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) (<= 0 .cse2) (<= 0 .cse3) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse4 4)) (or (and .cse5 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse6) (and .cse7 .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* .cse3 4) 4)))) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse8) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse2) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse9 (< .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse4))) .cse11 (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse12) (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse13) .cse14) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 .cse15)) (<= 0 .cse16) .cse17 (<= .cse4 12) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) .cse18) (or .cse17 .cse19) (<= 3 |c_ULTIMATE.start_write~int_#value#1|) (= |c_reader_twoThread1of1ForFork1_~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse9 (< .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse13))) (<= 2 |c_ULTIMATE.start_writer_fn_~i~1#1|) .cse7 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse20) .cse14) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= .cse20 12) (< (+ 7 .cse0 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (select |c_#length| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (<= (* .cse16 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse21 |c_ULTIMATE.start_read~int_#ptr#1.offset|) .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 .cse22) 4)) .cse23 (<= (* 4 .cse12) 12) (or (exists ((|ULTIMATE.start_write~int_#ptr#1.offset| Int)) (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 (select .cse24 |ULTIMATE.start_write~int_#ptr#1.offset|)) (<= 0 |ULTIMATE.start_write~int_#ptr#1.offset|) (<= |ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse24 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)))))) (<= 3 .cse8)) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse12) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_reader_twoThread1of1ForFork1_~arg#1.offset| 0) (or .cse9 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse20 4)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse15) .cse14) (<= 0 .cse25) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 .cse1) .cse18) (or .cse23 .cse19) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse11 .cse19) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse22) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse4) .cse14))))) is different from false
[2022-10-04 03:16:13,376 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse21 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) (.cse13 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (let ((.cse25 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse13 4)) (.cse8 (select .cse27 .cse21)) (.cse28 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse6 (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20)) (.cse26 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse3 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 20)) (.cse2 (select .cse26 20)) (.cse17 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse10 (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16)))) (.cse7 (not .cse6)) (.cse0 (* 4 (select .cse28 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)))) (.cse16 (select .cse28 20)) (.cse5 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (.cse12 (select .cse27 20)) (.cse9 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse20 (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4)) (.cse15 (* .cse8 4)) (.cse1 (* (select (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 4)) (.cse18 (select |c_#length| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse23 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse11 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse19 (< .cse25 0)) (.cse22 (select .cse26 .cse21)) (.cse4 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse14 (select |c_#length| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 (+ .cse0 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse1 4)) (<= 0 .cse2) (<= 0 .cse3) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse4 4)) (or (and .cse5 (<= 2 |c_ULTIMATE.start_write~int_#value#1|) .cse6) (and .cse7 .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* .cse3 4) 4)))) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse8) (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse2) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse9 (< .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse4))) .cse11 (= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse12) (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse13) .cse14) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 .cse15)) (<= 0 .cse16) .cse17 (<= .cse4 12) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) .cse18) (or .cse17 .cse19) (<= 3 |c_ULTIMATE.start_write~int_#value#1|) (or .cse9 (< .cse10 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse13))) (<= 2 |c_ULTIMATE.start_writer_fn_~i~1#1|) .cse7 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse20) .cse14) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= .cse20 12) (< (+ 7 .cse0 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (select |c_#length| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (<= (* .cse16 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse21 |c_ULTIMATE.start_read~int_#ptr#1.offset|) .cse5 (<= |c_ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 .cse22) 4)) .cse23 (<= (* 4 .cse12) 12) (or (exists ((|ULTIMATE.start_write~int_#ptr#1.offset| Int)) (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (<= 3 (select .cse24 |ULTIMATE.start_write~int_#ptr#1.offset|)) (<= 0 |ULTIMATE.start_write~int_#ptr#1.offset|) (<= |ULTIMATE.start_write~int_#ptr#1.offset| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse24 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4)))))) (<= 3 .cse8)) (<= (+ |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse12) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse9 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse20 4)) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse15) .cse14) (<= 0 .cse25) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 7 .cse1) .cse18) (or .cse23 .cse19) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse11 .cse19) (<= |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| .cse22) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (<= 0 |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 7 .cse4) .cse14))))) is different from false
[2022-10-04 03:16:54,368 WARN L233 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 163 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2022-10-04 03:18:41,290 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse3 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|) 20)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse1 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse2 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse4 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse6 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) 0))) (and (<= 3 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse0 4)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse1 (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse0))) (or .cse2 .cse3) .cse4 (<= 2 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 |c_ULTIMATE.start_write~int_#value#1|) (< (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 19) (+ |c_ULTIMATE.start_read~int_#sizeOfReadType#1| |c_ULTIMATE.start_read~int_#ptr#1.offset|)) (<= 0 .cse5) .cse3 (<= .cse0 12) (or .cse3 .cse6) (<= 2 |c_ULTIMATE.start_writer_fn_~i~1#1|) (or .cse1 (forall ((v_ArrVal_212 Int)) (or (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (select (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_212)) |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (not (<= |c_ULTIMATE.start_write~int_#value#1| v_ArrVal_212))))) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|) (<= (* .cse5 4) 12) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) |c_ULTIMATE.start_read~int_#ptr#1.offset|) .cse7 (<= (* 4 .cse8) 12) (or .cse1 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse8) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse1 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse2 .cse7) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse2 .cse4) (<= (+ (* 4 |c_ULTIMATE.start_write~int_#value#1|) 8) |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset| 0) (or .cse7 .cse6) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= |c_ULTIMATE.start_write~int_#ptr#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 20) (or .cse4 .cse6) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false
[2022-10-04 03:18:42,770 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse3 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse0 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse4 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse5 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) 0))) (and (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse0 .cse1) .cse2 (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)))) (or .cse2 .cse4) .cse1 (or .cse1 .cse5) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= (* 4 .cse6) 12) (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or .cse4 .cse1) (<= 0 .cse6) (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse0 .cse7) (or .cse0 .cse2) (or .cse4 .cse7) (or .cse7 .cse5) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (or .cse2 .cse5) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false
[2022-10-04 03:18:43,421 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse0 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse2 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) 0))) (and (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) .cse0 .cse1 (or .cse1 .cse2) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= (* 4 .cse3) 12) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse3) (or (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5)) .cse2) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (or .cse0 .cse2) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false
[2022-10-04 03:18:44,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4)) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) 20)) (.cse6 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse1 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse3 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse4 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) 0))) (and (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse0 4)) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse1 .cse2) .cse3 .cse2 (<= .cse0 12) (or .cse2 .cse4) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_read~int_#ptr#1.base|) (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20) |c_ULTIMATE.start_read~int_#ptr#1.offset|) (<= (* 4 .cse5) 12) (or .cse6 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= 0 .cse5) (= 20 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (or .cse6 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_read~int_#value#1| 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (or .cse1 .cse7) (or .cse1 .cse3) (or .cse7 .cse4) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (or .cse3 .cse4) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0))) is different from false
[2022-10-04 03:18:48,640 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse3 (< 7 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse1 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse6 (select .cse5 20)) (.cse0 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) 0)) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|)) (.cse4 (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 5))) (.cse8 (* |c_ULTIMATE.start_read~int_#value#1| 4))) (and (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (or .cse0 .cse1) .cse2 (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|) (< (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 4) 4) |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)))) (or .cse2 .cse4) .cse1 (<= 1 |c_ULTIMATE.start_writer_fn_~i~1#1|) (<= 2 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= |c_ULTIMATE.start_read~int_#value#1| (select .cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (<= (* 4 .cse6) 12) (or .cse3 (forall ((v_ArrVal_212 Int) (|v_ULTIMATE.start_write~int_#ptr#1.offset_39| Int)) (or (not (<= |v_ULTIMATE.start_write~int_#ptr#1.offset_39| (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (not (<= 0 |v_ULTIMATE.start_write~int_#ptr#1.offset_39|)) (< (+ 7 (* 16 (div (+ (- 9) (* |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (- 1))) 16))) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_39| v_ArrVal_212) (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 4))) (< v_ArrVal_212 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_read~int_#value#1| .cse6) (or .cse4 .cse1) (<= 0 .cse6) (or .cse0 .cse7) (or .cse0 .cse2) (or .cse4 .cse7) (<= 0 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse8 4)) (<= 3 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= .cse8 12) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0)))) is different from false
[2022-10-04 03:18:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-10-04 03:18:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2022-10-04 03:18:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2022-10-04 03:18:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states.
[2022-10-04 03:18:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-10-04 03:18:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states.
[2022-10-04 03:18:56,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-10-04 03:18:56,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-04 03:18:56,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] ===
[2022-10-04 03:18:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-10-04 03:18:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2011562193, now seen corresponding path program 2 times
[2022-10-04 03:18:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-10-04 03:18:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219784384]
[2022-10-04 03:18:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-10-04 03:18:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-10-04 03:18:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-10-04 03:18:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 289 proven. 173 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2022-10-04 03:18:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-10-04 03:18:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219784384]
[2022-10-04 03:18:58,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219784384] provided 0 perfect and 1 imperfect interpolant sequences
[2022-10-04 03:18:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813519530]
[2022-10-04 03:18:58,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-10-04 03:18:58,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-04 03:18:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-10-04 03:18:58,334 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 03:18:58,335 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 03:18:58,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-10-04 03:18:58,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-10-04 03:18:58,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 344 conjunts are in the unsatisfiable core
[2022-10-04 03:18:58,593 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-10-04 03:18:58,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-10-04 03:18:58,756 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2022-10-04 03:18:58,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2022-10-04 03:18:58,919 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size
[2022-10-04 03:18:58,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18
[2022-10-04 03:18:59,391 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
Received shutdown request...
[2022-10-04 03:18:59,439 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2022-10-04 03:18:59,442 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining)
[2022-10-04 03:18:59,449 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:18:59,449 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:18:59,470 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:18:59,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-10-04 03:18:59,643 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 561 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 58 known predicates.
[2022-10-04 03:18:59,648 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1]
[2022-10-04 03:18:59,650 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/3)
[2022-10-04 03:18:59,651 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-10-04 03:18:59,651 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-10-04 03:18:59,654 INFO L202 PluginConnector]: Adding new model ring_2w1r-2.line861.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 03:18:59 BasicIcfg
[2022-10-04 03:18:59,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-10-04 03:18:59,655 INFO L158 Benchmark]: Toolchain (without parser) took 863668.49ms. Allocated memory was 186.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 146.6MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 857.6MB. Max. memory is 8.0GB.
[2022-10-04 03:18:59,655 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-10-04 03:18:59,655 INFO L158 Benchmark]: Boogie Preprocessor took 99.48ms. Allocated memory is still 186.6MB. Free memory was 146.5MB in the beginning and 143.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
[2022-10-04 03:18:59,655 INFO L158 Benchmark]: RCFGBuilder took 863.59ms. Allocated memory is still 186.6MB. Free memory was 143.0MB in the beginning and 146.4MB in the end (delta: -3.4MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB.
[2022-10-04 03:18:59,655 INFO L158 Benchmark]: TraceAbstraction took 862690.27ms. Allocated memory was 186.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 145.6MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 855.7MB. Max. memory is 8.0GB.
[2022-10-04 03:18:59,656 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Boogie PL CUP Parser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB.
* Boogie Preprocessor took 99.48ms. Allocated memory is still 186.6MB. Free memory was 146.5MB in the beginning and 143.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
* RCFGBuilder took 863.59ms. Allocated memory is still 186.6MB. Free memory was 143.0MB in the beginning and 146.4MB in the end (delta: -3.4MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB.
* TraceAbstraction took 862690.27ms. Allocated memory was 186.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 145.6MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 855.7MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Independence relation #1 benchmarks
IndependenceRelationWithAbstraction.Independence Queries: [ total: 107, positive: 105, positive conditional: 105, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1351416, positive: 1309289, positive conditional: 1309289, positive unconditional: 0, negative: 42127, negative conditional: 42127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312364, positive: 1309289, positive conditional: 0, positive unconditional: 1309289, negative: 3075, negative conditional: 0, negative unconditional: 3075, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22914, positive: 22829, positive conditional: 0, positive unconditional: 22829, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1312364, positive: 1286460, positive conditional: 0, positive unconditional: 1286460, negative: 2990, negative conditional: 0, negative unconditional: 2990, unknown: 22914, unknown conditional: 0, unknown unconditional: 22914] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction:
- StatisticsResult: Independence relation #2 benchmarks
IndependenceRelationWithAbstraction.Independence Queries: [ total: 160, positive: 157, positive conditional: 157, 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: 1351416, positive: 1309289, positive conditional: 1309289, positive unconditional: 0, negative: 42127, negative conditional: 42127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312364, positive: 1309289, positive conditional: 0, positive unconditional: 1309289, negative: 3075, negative conditional: 0, negative unconditional: 3075, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22914, positive: 22829, positive conditional: 0, positive unconditional: 22829, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1312364, positive: 1286460, positive conditional: 0, positive unconditional: 1286460, negative: 2990, negative conditional: 0, negative unconditional: 2990, unknown: 22914, unknown conditional: 0, unknown unconditional: 22914] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 5, Statistics for Abstraction:
- StatisticsResult: Independence relation #3 benchmarks
IndependenceRelationWithAbstraction.Independence Queries: [ total: 361, positive: 355, positive conditional: 355, 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: 1351416, positive: 1309289, positive conditional: 1309289, positive unconditional: 0, negative: 42127, negative conditional: 42127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312364, positive: 1309289, positive conditional: 0, positive unconditional: 1309289, negative: 3075, negative conditional: 0, negative unconditional: 3075, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22914, positive: 22829, positive conditional: 0, positive unconditional: 22829, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1312364, positive: 1286460, positive conditional: 0, positive unconditional: 1286460, negative: 2990, negative conditional: 0, negative unconditional: 2990, unknown: 22914, unknown conditional: 0, unknown unconditional: 22914] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 11, Statistics for Abstraction:
- StatisticsResult: Independence relation #4 benchmarks
IndependenceRelationWithAbstraction.Independence Queries: [ total: 562, positive: 553, positive conditional: 553, 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: 1351416, positive: 1309289, positive conditional: 1309289, positive unconditional: 0, negative: 42127, negative conditional: 42127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312364, positive: 1309289, positive conditional: 0, positive unconditional: 1309289, negative: 3075, negative conditional: 0, negative unconditional: 3075, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22914, positive: 22829, positive conditional: 0, positive unconditional: 22829, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1312364, positive: 1286460, positive conditional: 0, positive unconditional: 1286460, negative: 2990, negative conditional: 0, negative unconditional: 2990, unknown: 22914, unknown conditional: 0, unknown unconditional: 22914] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 265, Positive conditional cache size: 0, Positive unconditional cache size: 265, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 20, Statistics for Abstraction:
- StatisticsResult: Independence relation #5 benchmarks
IndependenceRelationWithAbstraction.Independence Queries: [ total: 162975, positive: 157810, positive conditional: 157810, positive unconditional: 0, negative: 5165, negative conditional: 5165, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1351416, positive: 1309289, positive conditional: 1309289, positive unconditional: 0, negative: 42127, negative conditional: 42127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312364, positive: 1309289, positive conditional: 0, positive unconditional: 1309289, negative: 3075, negative conditional: 0, negative unconditional: 3075, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22914, positive: 22829, positive conditional: 0, positive unconditional: 22829, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1312364, positive: 1286460, positive conditional: 0, positive unconditional: 1286460, negative: 2990, negative conditional: 0, negative unconditional: 2990, unknown: 22914, unknown conditional: 0, unknown unconditional: 22914] , Statistics on independence cache: Total cache size (in pairs): 16166, Positive cache size: 16098, Positive conditional cache size: 0, Positive unconditional cache size: 16098, Negative cache size: 68, Negative conditional cache size: 0, Negative unconditional cache size: 68, Independence queries for same thread: 4759, Statistics for Abstraction:
- StatisticsResult: Independence relation #6 benchmarks
IndependenceRelationWithAbstraction.Independence Queries: [ total: 274100, positive: 265340, positive conditional: 265340, positive unconditional: 0, negative: 8760, negative conditional: 8760, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1351416, positive: 1309289, positive conditional: 1309289, positive unconditional: 0, negative: 42127, negative conditional: 42127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312364, positive: 1309289, positive conditional: 0, positive unconditional: 1309289, negative: 3075, negative conditional: 0, negative unconditional: 3075, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22914, positive: 22829, positive conditional: 0, positive unconditional: 22829, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1312364, positive: 1286460, positive conditional: 0, positive unconditional: 1286460, negative: 2990, negative conditional: 0, negative unconditional: 2990, unknown: 22914, unknown conditional: 0, unknown unconditional: 22914] , Statistics on independence cache: Total cache size (in pairs): 16647, Positive cache size: 16579, Positive conditional cache size: 0, Positive unconditional cache size: 16579, Negative cache size: 68, Negative conditional cache size: 0, Negative unconditional cache size: 68, Independence queries for same thread: 12869, Statistics for Abstraction:
- StatisticsResult: Independence relation #7 benchmarks
IndependenceRelationWithAbstraction.Independence Queries: [ total: 913151, positive: 884969, positive conditional: 884969, positive unconditional: 0, negative: 28182, negative conditional: 28182, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1351416, positive: 1309289, positive conditional: 1309289, positive unconditional: 0, negative: 42127, negative conditional: 42127, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1312364, positive: 1309289, positive conditional: 0, positive unconditional: 1309289, negative: 3075, negative conditional: 0, negative unconditional: 3075, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22914, positive: 22829, positive conditional: 0, positive unconditional: 22829, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1312364, positive: 1286460, positive conditional: 0, positive unconditional: 1286460, negative: 2990, negative conditional: 0, negative unconditional: 2990, unknown: 22914, unknown conditional: 0, unknown unconditional: 22914] , Statistics on independence cache: Total cache size (in pairs): 22914, Positive cache size: 22829, Positive conditional cache size: 0, Positive unconditional cache size: 22829, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85, Independence queries for same thread: 39052, Statistics for Abstraction:
- TimeoutResultAtElement [Line: 861]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 561 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 58 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances
CFG has 5 procedures, 788 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 862.5s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 719.9s, 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: 347, 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.8s SatisfiabilityAnalysisTime, 137.1s InterpolantComputationTime, 2940 NumberOfCodeBlocks, 2940 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 3984 ConstructedInterpolants, 316 QuantifiedInterpolants, 71718 SizeOfPredicates, 220 NumberOfNonLiveVariables, 2393 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 494/1737 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Completed graceful shutdown