/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1362.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:40:06,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:40:06,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:40:06,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:40:06,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:40:06,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:40:06,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:40:06,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:40:06,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:40:06,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:40:06,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:40:06,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:40:06,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:40:06,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:40:06,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:40:06,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:40:06,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:40:06,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:40:06,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:40:06,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:40:06,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:40:06,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:40:06,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:40:06,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:40:06,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:40:06,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:40:06,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:40:06,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:40:06,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:40:06,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:40:06,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:40:06,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:40:06,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:40:06,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:40:06,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:40:06,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:40:06,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:40:06,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:40:06,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:40:06,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:40:06,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:40:06,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:40:06,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:40:06,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:40:06,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:40:06,438 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:40:06,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:40:06,439 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:40:06,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:40:06,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:40:06,439 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:40:06,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:40:06,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:40:06,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:40:06,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:40:06,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:40:06,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:40:06,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:40:06,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:40:06,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:40:06,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:40:06,442 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:40:06,443 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:40:06,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:40:06,443 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 14:40:06,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:40:06,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:40:06,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:40:06,698 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:40:06,701 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:40:06,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1362.bpl [2022-10-03 14:40:06,703 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1362.bpl' [2022-10-03 14:40:06,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:40:06,799 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:40:06,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:40:06,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:40:06,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:40:06,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:40:06,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:40:06,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:40:06,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:40:06,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/1) ... [2022-10-03 14:40:06,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:40:06,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:40:07,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 14:40:07,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 14:40:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:40:07,049 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:40:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:40:07,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:40:07,051 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:40:07,280 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:40:07,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:40:08,279 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:40:08,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:40:08,305 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:40:08,309 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:40:08 BoogieIcfgContainer [2022-10-03 14:40:08,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:40:08,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:40:08,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:40:08,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:40:08,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:40:06" (1/2) ... [2022-10-03 14:40:08,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbae8c5 and model type divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:40:08, skipping insertion in model container [2022-10-03 14:40:08,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:40:08" (2/2) ... [2022-10-03 14:40:08,325 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1362.bpl [2022-10-03 14:40:08,332 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:40:08,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:40:08,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:40:08,344 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:40:08,513 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:40:08,587 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:40:08,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:40:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:40:08,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 14:40:08,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 14:40:08,627 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:40:08,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:40:08,641 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;@49a5e285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:40:08,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:40:09,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:40:09,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:40:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash -309715366, now seen corresponding path program 1 times [2022-10-03 14:40:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:40:09,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750496630] [2022-10-03 14:40:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:40:09,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:40:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:40:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:40:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:40:09,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750496630] [2022-10-03 14:40:09,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750496630] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:40:09,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:40:09,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:40:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114084727] [2022-10-03 14:40:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:40:09,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:40:09,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:40:09,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:40:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:40:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:09,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:40:09,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 276.5) internal successors, (553), 2 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:40:09,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:09,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:40:09,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:40:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:40:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1798748144, now seen corresponding path program 1 times [2022-10-03 14:40:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:40:09,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677449108] [2022-10-03 14:40:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:40:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:40:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:40:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:40:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:40:13,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677449108] [2022-10-03 14:40:13,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677449108] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:40:13,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:40:13,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-10-03 14:40:13,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682931407] [2022-10-03 14:40:13,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:40:13,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-10-03 14:40:13,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:40:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-10-03 14:40:13,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3360, Unknown=0, NotChecked=0, Total=3540 [2022-10-03 14:40:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:13,595 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:40:13,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 10.316666666666666) internal successors, (619), 60 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:40:13,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:13,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:40:28,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:40:28,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:40:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:40:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1866576128, now seen corresponding path program 1 times [2022-10-03 14:40:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:40:28,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602255779] [2022-10-03 14:40:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:40:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:40:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:40:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:40:30,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:40:30,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602255779] [2022-10-03 14:40:30,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602255779] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:40:30,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:40:30,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-10-03 14:40:30,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431296300] [2022-10-03 14:40:30,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:40:30,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-10-03 14:40:30,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:40:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-10-03 14:40:30,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2809, Unknown=0, NotChecked=0, Total=2970 [2022-10-03 14:40:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:30,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:40:30,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 10.407407407407407) internal successors, (562), 55 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:40:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:40:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:40:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:40:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:40:46,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:40:46,464 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:40:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:40:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2040438537, now seen corresponding path program 1 times [2022-10-03 14:40:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:40:46,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225129725] [2022-10-03 14:40:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:40:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:40:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:40:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 33 proven. 72 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:40:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:40:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225129725] [2022-10-03 14:40:48,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225129725] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:40:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124195944] [2022-10-03 14:40:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:40:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:40:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:40:48,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:40:48,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 14:40:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:40:48,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 2147 conjuncts, 132 conjunts are in the unsatisfiable core [2022-10-03 14:40:48,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:40:48,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:40:49,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:40:49,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:40:50,308 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:40:50,309 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 18 [2022-10-03 14:40:54,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:40:54,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:40:57,381 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:40:57,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-10-03 14:40:57,399 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 14:40:57,407 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 33 treesize of output 33 [2022-10-03 14:40:57,596 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 23 treesize of output 15 [2022-10-03 14:40:57,603 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 26 treesize of output 14 [2022-10-03 14:40:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 98 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:40:57,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:40:58,298 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (< (+ (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_301) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_300) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_301 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_301) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:40:58,338 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_301 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_301) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (< (+ (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_301) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_300) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:40:58,351 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_301 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_301) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_301) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_300) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:41:01,434 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 85 treesize of output 77 [2022-10-03 14:41:01,447 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 344 treesize of output 316 [2022-10-03 14:41:01,452 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 308 treesize of output 294 [2022-10-03 14:41:01,459 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 151 treesize of output 135 [2022-10-03 14:41:01,465 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 214 treesize of output 198 [2022-10-03 14:41:08,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_296 Int)) (let ((.cse0 (select (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_296) |c_ULTIMATE.start_main_~#q~1#1.base|))) (or (< .cse0 16) (< .cse0 (+ 8 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 14:41:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-10-03 14:41:50,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124195944] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:41:50,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:41:50,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 40] total 139 [2022-10-03 14:41:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145153299] [2022-10-03 14:41:50,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:41:50,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2022-10-03 14:41:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:41:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2022-10-03 14:41:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=942, Invalid=17413, Unknown=21, NotChecked=1084, Total=19460 [2022-10-03 14:41:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:50,388 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:41:50,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 140 states, 139 states have (on average 17.93525179856115) internal successors, (2493), 140 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:41:50,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:50,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:41:50,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:41:50,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:42:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:42:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:42:08,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 14:42:08,253 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,SelfDestructingSolverStorable3 [2022-10-03 14:42:08,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:42:08,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:42:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 166874755, now seen corresponding path program 1 times [2022-10-03 14:42:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:42:08,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577057498] [2022-10-03 14:42:08,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:42:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2022-10-03 14:42:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:42:12,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577057498] [2022-10-03 14:42:12,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577057498] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:42:12,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:42:12,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 14:42:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431667438] [2022-10-03 14:42:12,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:42:12,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 14:42:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:42:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 14:42:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5315, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 14:42:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:12,159 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:42:12,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 12.64) internal successors, (948), 75 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:42:12,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:12,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:42:12,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:42:12,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:42:12,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:42:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:42:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:42:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:42:37,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 14:42:37,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:42:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:42:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2034583586, now seen corresponding path program 1 times [2022-10-03 14:42:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:42:37,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519454180] [2022-10-03 14:42:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:42:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:42:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:42:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2022-10-03 14:42:42,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:42:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519454180] [2022-10-03 14:42:42,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519454180] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:42:42,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:42:42,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-10-03 14:42:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793865570] [2022-10-03 14:42:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:42:42,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-10-03 14:42:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:42:42,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-10-03 14:42:42,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=6393, Unknown=0, NotChecked=0, Total=6642 [2022-10-03 14:42:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:42,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:42:42,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 12.134146341463415) internal successors, (995), 82 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:42:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:42:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:42:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:42:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 14:42:42,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:43:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:43:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:43:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:43:20,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 14:43:20,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 14:43:20,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1893202316, now seen corresponding path program 1 times [2022-10-03 14:43:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:20,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832579180] [2022-10-03 14:43:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 143 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:43:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832579180] [2022-10-03 14:43:24,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832579180] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:43:24,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976730409] [2022-10-03 14:43:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:43:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:24,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:43:24,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 14:43:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:25,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 2466 conjuncts, 137 conjunts are in the unsatisfiable core [2022-10-03 14:43:25,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:43:25,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:43:25,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:25,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:43:26,600 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:43:26,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 14:43:26,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:43:29,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:43:29,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:43:32,549 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:43:32,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-10-03 14:43:32,559 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 14:43:32,560 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 33 treesize of output 33 [2022-10-03 14:43:32,719 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 23 treesize of output 15 [2022-10-03 14:43:32,721 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 26 treesize of output 14 [2022-10-03 14:43:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-03 14:43:33,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:43:33,603 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ 3 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:43:33,620 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ 3 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:43:33,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:43:33,681 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:43:33,690 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (< (+ 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:43:33,714 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) is different from false [2022-10-03 14:43:36,854 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 117 treesize of output 109 [2022-10-03 14:43:36,879 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-03 14:43:36,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 168 [2022-10-03 14:43:36,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:43:36,890 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 183 treesize of output 170 [2022-10-03 14:43:36,895 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 54 treesize of output 50 [2022-10-03 14:43:38,526 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 14:43:38,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-03 14:43:41,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_639 Int) (v_ArrVal_638 Int)) (or (= |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (< (select (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_638) |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~#q~1#1.base|) 16))))) is different from false [2022-10-03 14:45:09,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:45:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 182 trivial. 41 not checked. [2022-10-03 14:45:10,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976730409] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:45:10,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:45:10,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 51, 40] total 178 [2022-10-03 14:45:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552561911] [2022-10-03 14:45:10,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:45:10,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-10-03 14:45:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:45:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-10-03 14:45:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=28334, Unknown=41, NotChecked=2408, Total=31506 [2022-10-03 14:45:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:10,071 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:45:10,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 178 states, 178 states have (on average 15.348314606741573) internal successors, (2732), 178 states have internal predecessors, (2732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:45:10,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:10,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:45:10,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:45:10,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:45:10,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:45:10,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 14:45:10,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:47:29,944 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (.cse4 (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 3 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) (let ((.cse0 (and .cse3 .cse4))) (and (or (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|) 16)) .cse0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))) (or (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (+ .cse1 16)) .cse0 (< .cse1 0))) (or .cse0 (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (+ 16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) (or (not (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|))) .cse0) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (+ 16 .cse2)) (< .cse2 0) .cse0)) .cse3 .cse4 (or (< (select |c_#length| |c_ULTIMATE.start_fifo_empty_#t~mem7#1.base|) (+ 16 |c_ULTIMATE.start_fifo_empty_#t~mem7#1.offset|)) .cse0) (<= (select |c_#length| |c_ULTIMATE.start_main_~#q~1#1.base|) 8)))) is different from false [2022-10-03 14:47:31,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 3 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) (and (or (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|) 16)) .cse0) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))) (or (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (+ .cse1 16)) .cse0 (< .cse1 0))) (or .cse0 (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (+ 16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (or (not (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|))) .cse0) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (+ 16 .cse2)) (< .cse2 0) .cse0)) (<= (select |c_#length| |c_ULTIMATE.start_main_~#q~1#1.base|) 8))) is different from false [2022-10-03 14:47:31,843 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= (select |c_#length| |c_ULTIMATE.start_main_~#q~1#1.base|) 8) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:47:31,852 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ 3 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (<= (select |c_#length| |c_ULTIMATE.start_main_~#q~1#1.base|) 8)) is different from false [2022-10-03 14:47:31,856 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< (+ 3 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_645) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((v_ArrVal_644 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_644) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (<= (select |c_#length| |c_ULTIMATE.start_main_~#q~1#1.base|) 8)) is different from false [2022-10-03 14:47:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:47:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:47:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:47:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:47:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:47:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-10-03 14:47:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 356 states. [2022-10-03 14:47:34,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 14:47:34,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:47:34,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:47:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:47:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 795349642, now seen corresponding path program 1 times [2022-10-03 14:47:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:47:34,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877198906] [2022-10-03 14:47:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:47:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:47:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:47:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 101 proven. 610 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2022-10-03 14:47:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:47:36,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877198906] [2022-10-03 14:47:36,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877198906] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:47:36,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347120999] [2022-10-03 14:47:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:47:36,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:47:36,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:47:36,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:47:36,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 14:47:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:47:37,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 3840 conjuncts, 121 conjunts are in the unsatisfiable core [2022-10-03 14:47:37,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:47:37,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:47:38,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:47:38,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:47:38,887 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:47:38,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 14:47:38,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 14:47:43,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:47:43,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:47:44,775 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:47:44,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-10-03 14:47:44,786 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 14:47:44,786 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 33 treesize of output 33 [2022-10-03 14:47:44,991 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 23 treesize of output 15 [2022-10-03 14:47:44,994 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 26 treesize of output 14 [2022-10-03 14:47:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 358 proven. 459 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-10-03 14:47:45,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:47:45,564 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (< (+ (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_839) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_840) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_839 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_839) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:47:45,580 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_839 (Array Int Int))) (<= 0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_839) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (< (+ (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_839) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_840) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:47:45,597 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_839 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_839) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (forall ((v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_839) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_840) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 14:47:47,811 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 503 treesize of output 427 [2022-10-03 14:47:47,822 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 2408 treesize of output 2284 [2022-10-03 14:47:47,839 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 2236 treesize of output 2116 [2022-10-03 14:47:47,857 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 2156 treesize of output 2094 [2022-10-03 14:47:47,875 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 2029 treesize of output 1933 [2022-10-03 14:47:47,893 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 1933 treesize of output 1837 [2022-10-03 14:47:47,910 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 1837 treesize of output 1821 [2022-10-03 14:50:23,361 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 14:50:23,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 13 treesize of output 12 [2022-10-03 14:50:28,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:50:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 109 proven. 672 refuted. 0 times theorem prover too weak. 365 trivial. 36 not checked. [2022-10-03 14:50:29,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347120999] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:50:29,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:50:29,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 42] total 140 [2022-10-03 14:50:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170055710] [2022-10-03 14:50:29,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:50:29,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2022-10-03 14:50:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:50:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2022-10-03 14:50:29,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=18011, Unknown=5, NotChecked=822, Total=19740 [2022-10-03 14:50:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:29,051 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:50:29,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 140 states have (on average 24.5) internal successors, (3430), 141 states have internal predecessors, (3430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:50:29,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:29,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:50:29,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:50:29,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:50:29,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:50:29,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 140 states. [2022-10-03 14:50:29,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 356 states. [2022-10-03 14:50:29,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-10-03 14:50:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 14:50:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 14:50:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:50:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-10-03 14:50:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 357 states. [2022-10-03 14:50:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-10-03 14:50:57,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 14:50:57,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:50:57,338 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:50:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:50:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2065692788, now seen corresponding path program 1 times [2022-10-03 14:50:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:50:57,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148506164] [2022-10-03 14:50:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:50:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:50:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:51:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 436 proven. 889 refuted. 0 times theorem prover too weak. 1943 trivial. 0 not checked. [2022-10-03 14:51:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:51:00,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148506164] [2022-10-03 14:51:00,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148506164] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:51:00,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332428153] [2022-10-03 14:51:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:51:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:51:00,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:51:00,425 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-03 14:51:00,426 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-03 14:51:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:51:01,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 5467 conjuncts, 247 conjunts are in the unsatisfiable core [2022-10-03 14:51:01,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:51:02,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:51:02,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 14:51:04,390 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 14:51:04,390 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 15 treesize of output 15 [2022-10-03 14:51:04,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:51:04,969 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-10-03 14:51:04,970 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 80 [2022-10-03 14:51:04,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:51:04,987 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:51:04,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-10-03 14:51:05,005 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 43 treesize of output 35 [2022-10-03 14:51:05,031 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 104 treesize of output 84 [2022-10-03 14:51:15,905 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 75 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 14:51:57,672 INFO L356 Elim1Store]: treesize reduction 8, result has 94.1 percent of original size [2022-10-03 14:51:57,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 184 treesize of output 240 Received shutdown request... [2022-10-03 14:52:43,000 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-10-03 14:52:43,004 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 14:52:43,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 14:52:43,043 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 14:52:43,043 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-03 14:52:43,043 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 14:52:43,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:52:43,231 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 2239 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 4ms.. [2022-10-03 14:52:43,235 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-03 14:52:43,237 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 14:52:43,238 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 14:52:43,239 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 14:52:43,241 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1362.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:52:43 BasicIcfg [2022-10-03 14:52:43,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 14:52:43,241 INFO L158 Benchmark]: Toolchain (without parser) took 756442.16ms. Allocated memory was 194.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 141.9MB in the beginning and 711.5MB in the end (delta: -569.6MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-10-03 14:52:43,241 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 194.0MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:52:43,242 INFO L158 Benchmark]: Boogie Preprocessor took 149.83ms. Allocated memory is still 194.0MB. Free memory was 141.9MB in the beginning and 162.2MB in the end (delta: -20.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-10-03 14:52:43,242 INFO L158 Benchmark]: RCFGBuilder took 1356.82ms. Allocated memory was 194.0MB in the beginning and 237.0MB in the end (delta: 43.0MB). Free memory was 162.2MB in the beginning and 179.9MB in the end (delta: -17.7MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. [2022-10-03 14:52:43,242 INFO L158 Benchmark]: TraceAbstraction took 754929.45ms. Allocated memory was 237.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 179.3MB in the beginning and 711.5MB in the end (delta: -532.1MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-10-03 14:52:43,243 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.17ms. Allocated memory is still 194.0MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 149.83ms. Allocated memory is still 194.0MB. Free memory was 141.9MB in the beginning and 162.2MB in the end (delta: -20.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1356.82ms. Allocated memory was 194.0MB in the beginning and 237.0MB in the end (delta: 43.0MB). Free memory was 162.2MB in the beginning and 179.9MB in the end (delta: -17.7MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. * TraceAbstraction took 754929.45ms. Allocated memory was 237.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 179.3MB in the beginning and 711.5MB in the end (delta: -532.1MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 343, positive: 330, positive conditional: 330, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 330, Positive conditional cache size: 0, Positive unconditional cache size: 330, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1158, positive: 1124, positive conditional: 1124, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 1124, Positive cache size: 1124, Positive conditional cache size: 0, Positive unconditional cache size: 1124, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 47, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1644, positive: 1589, positive conditional: 1589, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 1464, Positive cache size: 1464, Positive conditional cache size: 0, Positive unconditional cache size: 1464, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 102, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2485, positive: 2406, positive conditional: 2406, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 2165, Positive cache size: 2165, Positive conditional cache size: 0, Positive unconditional cache size: 2165, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 181, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4942, positive: 4784, positive conditional: 4784, positive unconditional: 0, negative: 158, negative conditional: 158, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 4212, Positive cache size: 4208, Positive conditional cache size: 0, Positive unconditional cache size: 4208, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 335, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4861, positive: 4706, positive conditional: 4706, positive unconditional: 0, negative: 155, negative conditional: 155, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 5713, Positive cache size: 5707, Positive conditional cache size: 0, Positive unconditional cache size: 5707, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 487, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3929, positive: 3798, positive conditional: 3798, positive unconditional: 0, negative: 131, negative conditional: 131, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 6024, Positive cache size: 6018, Positive conditional cache size: 0, Positive unconditional cache size: 6018, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 618, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6392, positive: 6185, positive conditional: 6185, positive unconditional: 0, negative: 207, negative conditional: 207, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 6042, Positive cache size: 6036, Positive conditional cache size: 0, Positive unconditional cache size: 6036, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 825, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8232, positive: 7960, positive conditional: 7960, positive unconditional: 0, negative: 272, negative conditional: 272, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 33986, positive: 32882, positive conditional: 32882, positive unconditional: 0, negative: 1104, negative conditional: 1104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32891, positive: 32882, positive conditional: 0, positive unconditional: 32882, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6612, positive: 6604, positive conditional: 0, positive unconditional: 6604, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32891, positive: 26278, positive conditional: 0, positive unconditional: 26278, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 6612, unknown conditional: 0, unknown unconditional: 6612] , Statistics on independence cache: Total cache size (in pairs): 6612, Positive cache size: 6604, Positive conditional cache size: 0, Positive unconditional cache size: 6604, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 1095, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1362]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 2239 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 4ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1463 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 754.7s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 284.6s, 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: 1131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 359.8s InterpolantComputationTime, 11692 NumberOfCodeBlocks, 11692 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 15147 ConstructedInterpolants, 1361 QuantifiedInterpolants, 196899 SizeOfPredicates, 293 NumberOfNonLiveVariables, 8453 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 4775/7174 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