/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.line1523.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 21:55:27,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 21:55:27,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 21:55:27,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 21:55:27,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 21:55:27,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 21:55:27,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 21:55:27,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 21:55:27,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 21:55:27,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 21:55:27,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 21:55:27,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 21:55:27,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 21:55:27,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 21:55:27,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 21:55:27,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 21:55:27,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 21:55:27,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 21:55:27,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 21:55:27,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 21:55:27,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 21:55:27,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 21:55:27,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 21:55:27,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 21:55:27,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 21:55:27,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 21:55:27,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 21:55:27,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 21:55:27,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 21:55:27,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 21:55:27,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 21:55:27,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 21:55:27,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 21:55:27,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 21:55:27,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 21:55:27,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 21:55:27,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 21:55:27,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 21:55:27,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 21:55:27,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 21:55:27,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 21:55:27,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 21:55:27,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 21:55:27,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 21:55:27,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 21:55:27,834 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 21:55:27,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 21:55:27,835 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 21:55:27,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 21:55:27,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 21:55:27,835 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 21:55:27,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 21:55:27,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 21:55:27,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 21:55:27,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 21:55:27,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 21:55:27,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 21:55:27,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 21:55:27,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 21:55:27,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 21:55:27,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 21:55:27,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 21:55:27,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 21:55:27,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 21:55:27,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 21:55:27,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 21:55:27,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 21:55:27,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 21:55:27,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 21:55:27,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 21:55:27,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 21:55:27,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 21:55:27,839 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-09-29 21:55:28,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 21:55:28,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 21:55:28,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 21:55:28,025 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 21:55:28,028 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 21:55:28,029 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.line1523.bpl [2022-09-29 21:55:28,029 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1523.bpl' [2022-09-29 21:55:28,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 21:55:28,100 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 21:55:28,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 21:55:28,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 21:55:28,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 21:55:28,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 21:55:28,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 21:55:28,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 21:55:28,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 21:55:28,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/1) ... [2022-09-29 21:55:28,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 21:55:28,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 21:55:28,252 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-09-29 21:55:28,267 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-09-29 21:55:28,286 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 21:55:28,286 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 21:55:28,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 21:55:28,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 21:55:28,288 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 21:55:28,443 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 21:55:28,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 21:55:29,282 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 21:55:29,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 21:55:29,297 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 21:55:29,299 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 09:55:29 BoogieIcfgContainer [2022-09-29 21:55:29,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 21:55:29,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 21:55:29,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 21:55:29,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 21:55:29,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:55:28" (1/2) ... [2022-09-29 21:55:29,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c3db22 and model type divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 09:55:29, skipping insertion in model container [2022-09-29 21:55:29,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 09:55:29" (2/2) ... [2022-09-29 21:55:29,312 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1523.bpl [2022-09-29 21:55:29,316 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 21:55:29,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 21:55:29,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 21:55:29,322 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 21:55:29,459 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 21:55:29,507 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 21:55:29,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 21:55:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 21:55:29,509 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-09-29 21:55:29,524 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-09-29 21:55:29,554 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 21:55:29,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 21:55:29,582 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;@86e75ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 21:55:29,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 21:55:30,011 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:55:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:55:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash -711035464, now seen corresponding path program 1 times [2022-09-29 21:55:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:55:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799836316] [2022-09-29 21:55:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:55:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:55:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:55:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:55:30,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:55:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799836316] [2022-09-29 21:55:30,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799836316] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:55:30,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:55:30,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 21:55:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936636643] [2022-09-29 21:55:30,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:55:30,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 21:55:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:55:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 21:55:30,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 21:55:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:30,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:55:30,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 338.0) internal successors, (676), 2 states have internal predecessors, (676), 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-09-29 21:55:30,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:30,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 21:55:30,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:55:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:55:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1508485799, now seen corresponding path program 1 times [2022-09-29 21:55:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:55:30,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782577964] [2022-09-29 21:55:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:55:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:55:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:55:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:55:34,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:55:34,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782577964] [2022-09-29 21:55:34,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782577964] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:55:34,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:55:34,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-09-29 21:55:34,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243072723] [2022-09-29 21:55:34,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:55:34,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-09-29 21:55:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:55:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-09-29 21:55:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4340, Unknown=0, NotChecked=0, Total=4556 [2022-09-29 21:55:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:34,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:55:34,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 10.897058823529411) internal successors, (741), 68 states have internal predecessors, (741), 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-09-29 21:55:34,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:34,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-09-29 21:55:53,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 21:55:53,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:55:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:55:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash -585989211, now seen corresponding path program 1 times [2022-09-29 21:55:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:55:53,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475969040] [2022-09-29 21:55:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:55:53,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:55:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:55:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:55:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:55:56,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475969040] [2022-09-29 21:55:56,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475969040] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:55:56,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:55:56,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-09-29 21:55:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43673635] [2022-09-29 21:55:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:55:56,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-09-29 21:55:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:55:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-09-29 21:55:56,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3360, Unknown=0, NotChecked=0, Total=3540 [2022-09-29 21:55:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:56,062 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:55:56,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 13.066666666666666) internal successors, (784), 60 states have internal predecessors, (784), 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-09-29 21:55:56,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:55:56,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-09-29 21:55:56,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-09-29 21:56:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-09-29 21:56:08,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-29 21:56:08,151 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:56:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:56:08,151 INFO L85 PathProgramCache]: Analyzing trace with hash 139774529, now seen corresponding path program 1 times [2022-09-29 21:56:08,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:56:08,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061715345] [2022-09-29 21:56:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:56:08,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:56:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:56:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:56:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:56:10,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061715345] [2022-09-29 21:56:10,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061715345] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:56:10,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:56:10,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-09-29 21:56:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282229667] [2022-09-29 21:56:10,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:56:10,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-09-29 21:56:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:56:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-09-29 21:56:10,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5600, Unknown=0, NotChecked=0, Total=5852 [2022-09-29 21:56:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:10,845 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:56:10,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 8.883116883116884) internal successors, (684), 77 states have internal predecessors, (684), 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-09-29 21:56:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-09-29 21:56:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-09-29 21:56:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-09-29 21:56:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-09-29 21:56:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-09-29 21:56:30,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-29 21:56:30,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:56:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:56:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1972585066, now seen corresponding path program 1 times [2022-09-29 21:56:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:56:30,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637891749] [2022-09-29 21:56:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:56:30,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:56:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:56:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:56:32,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:56:32,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637891749] [2022-09-29 21:56:32,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637891749] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:56:32,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:56:32,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-09-29 21:56:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077619164] [2022-09-29 21:56:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:56:32,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-09-29 21:56:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:56:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-09-29 21:56:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=4205, Unknown=0, NotChecked=0, Total=4422 [2022-09-29 21:56:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:32,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:56:32,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 9.212121212121213) internal successors, (608), 67 states have internal predecessors, (608), 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-09-29 21:56:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-09-29 21:56:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-09-29 21:56:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-09-29 21:56:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-09-29 21:56:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-09-29 21:56:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-09-29 21:56:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-09-29 21:56:49,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-29 21:56:49,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:56:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:56:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash -693131419, now seen corresponding path program 1 times [2022-09-29 21:56:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:56:49,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646429671] [2022-09-29 21:56:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:56:49,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:56:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:56:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:56:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:56:52,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646429671] [2022-09-29 21:56:52,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646429671] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:56:52,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:56:52,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-09-29 21:56:52,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271899477] [2022-09-29 21:56:52,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:56:52,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-09-29 21:56:52,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:56:52,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-09-29 21:56:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=6536, Unknown=0, NotChecked=0, Total=6806 [2022-09-29 21:56:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:52,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:56:52,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 11.036144578313253) internal successors, (916), 83 states have internal predecessors, (916), 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-09-29 21:56:52,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:56:52,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-09-29 21:56:52,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-09-29 21:56:52,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-09-29 21:56:52,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-09-29 21:56:52,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:57:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:57:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-09-29 21:57:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-09-29 21:57:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-09-29 21:57:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-09-29 21:57:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-09-29 21:57:19,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-29 21:57:19,586 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:57:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:57:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash -582666841, now seen corresponding path program 1 times [2022-09-29 21:57:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:57:19,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049114544] [2022-09-29 21:57:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:57:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:57:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:57:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 186 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:57:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:57:23,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049114544] [2022-09-29 21:57:23,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049114544] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 21:57:23,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088740800] [2022-09-29 21:57:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:57:23,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 21:57:23,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 21:57:23,043 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-09-29 21:57:23,043 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-09-29 21:57:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:57:23,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 2772 conjuncts, 248 conjunts are in the unsatisfiable core [2022-09-29 21:57:23,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 21:57:24,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 21:57:24,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:57:24,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-09-29 21:57:25,350 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 21:57:25,350 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-09-29 21:57:25,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-09-29 21:57:27,074 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 21:57:27,075 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 20 treesize of output 24 [2022-09-29 21:57:27,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:57:27,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-09-29 21:57:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 186 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:57:31,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 21:57:32,969 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 18 treesize of output 12 [2022-09-29 21:57:39,461 INFO L356 Elim1Store]: treesize reduction 4, result has 97.2 percent of original size [2022-09-29 21:57:39,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 190 [2022-09-29 21:57:41,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (and (forall ((v_arrayElimIndex_1 Int)) (or (= v_arrayElimIndex_1 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= .cse6 (select (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimIndex_1)))))) (or .cse2 (forall ((v_arrayElimIndex_1 Int)) (not (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= .cse7 (select (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimIndex_1))))))))) (and (or (and (or .cse2 (forall ((v_arrayElimIndex_1 Int)) (or (not (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimIndex_1)))) (= v_arrayElimIndex_1 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) (forall ((v_arrayElimIndex_1 Int)) (or (= v_arrayElimIndex_1 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= .cse4 (select (select |c_#memory_$Pointer$.base| .cse4) v_arrayElimIndex_1)))) (= v_arrayElimIndex_1 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or .cse5 (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (or (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (and (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse5) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse5))))))) is different from false [2022-09-29 21:57:43,767 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (or (forall ((v_arrayElimIndex_1 Int)) (or (= v_arrayElimIndex_1 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse1 .cse2) v_arrayElimIndex_1) .cse2)))))) (let ((.cse3 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse7 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse4) (forall ((v_arrayElimIndex_1 Int)) (not (let ((.cse5 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse5 .cse6) v_arrayElimIndex_1) .cse6))))) (= (select .cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse4)))))))) (and (or .cse0 (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (or (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) .cse0))) is different from false [2022-09-29 21:57:43,949 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1) (forall ((v_arrayElimIndex_1 Int)) (not (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse2 .cse3) v_arrayElimIndex_1) .cse3))))) (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))) (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (or (forall ((v_arrayElimIndex_1 Int)) (or (= v_arrayElimIndex_1 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse5 .cse6) v_arrayElimIndex_1) .cse6)))))) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (and (or .cse0 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (or .cse0 (= |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-09-29 21:57:46,633 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse1) (forall ((v_arrayElimIndex_1 Int)) (not (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse2 .cse3) v_arrayElimIndex_1) .cse3))))) (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1))))) (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (or (forall ((v_arrayElimIndex_1 Int)) (or (= v_arrayElimIndex_1 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse5 .cse6) v_arrayElimIndex_1) .cse6)))))) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (and (or .cse0 (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (or .cse0 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|)))) is different from false [2022-09-29 21:57:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 52 not checked. [2022-09-29 21:57:46,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088740800] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-29 21:57:46,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-29 21:57:46,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 48, 55] total 193 [2022-09-29 21:57:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617968845] [2022-09-29 21:57:46,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-29 21:57:46,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2022-09-29 21:57:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:57:46,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2022-09-29 21:57:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=34523, Unknown=41, NotChecked=1508, Total=37056 [2022-09-29 21:57:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:57:46,698 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:57:46,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 14.512953367875648) internal successors, (2801), 193 states have internal predecessors, (2801), 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-09-29 21:57:46,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:57:46,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-09-29 21:57:46,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-09-29 21:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-09-29 21:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-09-29 21:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 141 states. [2022-09-29 21:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:59:15,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (let ((.cse0 (and (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse6) (forall ((v_arrayElimIndex_1 Int)) (not (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse7 .cse8) v_arrayElimIndex_1) .cse8))))) (= (select .cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse6))))) (forall ((|ULTIMATE.start_write~$Pointer$_#ptr#1.base| Int) (v_ArrVal_499 (Array Int Int))) (or (forall ((v_arrayElimIndex_1 Int)) (or (= v_arrayElimIndex_1 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select (select .cse10 .cse11) v_arrayElimIndex_1) .cse11)))))) (let ((.cse12 (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse12 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) (.cse3 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) .cse5)) (.cse4 (+ .cse5 8))) (and (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (or .cse0 (= |c_ULTIMATE.start_fifo_pop_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (not (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) (+ .cse2 12))))) (or .cse0 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|)) (<= .cse3 .cse4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_front_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|) |c_ULTIMATE.start_fifo_empty_~self#1.offset|) .cse3) .cse4) (<= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) .cse3) .cse4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset|)) 8) (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-09-29 21:59:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:59:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-09-29 21:59:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-09-29 21:59:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-09-29 21:59:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-09-29 21:59:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-09-29 21:59:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-09-29 21:59:19,257 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-09-29 21:59:19,439 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,SelfDestructingSolverStorable6 [2022-09-29 21:59:19,439 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:59:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:59:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -392288717, now seen corresponding path program 1 times [2022-09-29 21:59:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:59:19,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87290552] [2022-09-29 21:59:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:59:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:59:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:59:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 29 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:59:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:59:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87290552] [2022-09-29 21:59:27,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87290552] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 21:59:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020037269] [2022-09-29 21:59:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:59:27,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 21:59:27,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 21:59:27,575 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-09-29 21:59:27,576 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-09-29 21:59:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:59:28,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 325 conjunts are in the unsatisfiable core [2022-09-29 21:59:28,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 21:59:29,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 21:59:30,273 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-09-29 21:59:30,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:59:30,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-09-29 21:59:37,960 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 21:59:37,961 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-09-29 21:59:39,337 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-09-29 21:59:39,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 77 [2022-09-29 21:59:39,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:59:39,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:59:39,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2022-09-29 21:59:51,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 21:59:51,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 21:59:51,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:59:51,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 21:59:51,348 INFO L356 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-09-29 21:59:51,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 143 treesize of output 98 [2022-09-29 21:59:51,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 21:59:51,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:59:51,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:59:51,371 INFO L356 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-09-29 21:59:51,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 88 [2022-09-29 22:00:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 110 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:00:01,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:01:07,131 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse3 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_631))) (let ((.cse7 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_632)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select .cse7 .cse4)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (let ((.cse2 (store .cse7 .cse4 (store .cse8 .cse6 v_ArrVal_633)))) (let ((.cse0 (select .cse2 (select (select (store .cse3 .cse4 (let ((.cse5 (select .cse3 .cse4))) (store .cse5 .cse6 (select .cse5 .cse6)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< (select .cse0 (+ 12 .cse1)) (+ (select .cse0 .cse1) 1)))) (< v_ArrVal_633 (+ (select .cse8 .cse6) 4))))))) (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse16 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_631))) (let ((.cse11 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_632)) (.cse12 (select (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse13 (select .cse11 .cse12)) (.cse14 (select (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (let ((.cse9 (let ((.cse15 (store .cse16 .cse12 (let ((.cse17 (select .cse16 .cse12))) (store .cse17 .cse14 (select .cse17 .cse14)))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (.cse10 (select (select (store .cse11 .cse12 (store .cse13 .cse14 v_ArrVal_633)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select .cse9 (+ 12 .cse10)) (select .cse9 .cse10))) (< v_ArrVal_633 (+ (select .cse13 .cse14) 4)))))))) is different from false [2022-09-29 22:01:07,184 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse7 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_631))) (let ((.cse4 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_632)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse4 .cse5)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ 4 (select .cse0 .cse1))) (let ((.cse2 (let ((.cse6 (store .cse7 .cse5 (let ((.cse8 (select .cse7 .cse5))) (store .cse8 .cse1 (select .cse8 .cse1)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (.cse3 (select (select (store .cse4 .cse5 (store .cse0 .cse1 v_ArrVal_633)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select .cse2 (+ .cse3 12)) (select .cse2 .cse3)))))))) (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse14 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_631))) (let ((.cse17 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_632)) (.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse9 (select .cse17 .cse15)) (.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ 4 (select .cse9 .cse10))) (let ((.cse13 (store .cse17 .cse15 (store .cse9 .cse10 v_ArrVal_633)))) (let ((.cse11 (select .cse13 (select (select (store .cse14 .cse15 (let ((.cse16 (select .cse14 .cse15))) (store .cse16 .cse10 (select .cse16 .cse10)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< (select .cse11 (+ .cse12 12)) (+ (select .cse11 .cse12) 1)))))))))) is different from false [2022-09-29 22:01:07,212 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_631))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_632)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse8 .cse6)) (.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ (select .cse0 .cse1) 4)) (let ((.cse4 (store .cse8 .cse6 (store .cse0 .cse1 v_ArrVal_633)))) (let ((.cse2 (select .cse4 (select (select (store .cse5 .cse6 (let ((.cse7 (select .cse5 .cse6))) (store .cse7 .cse1 (select .cse7 .cse1)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< (select .cse2 (+ 12 .cse3)) (+ (select .cse2 .cse3) 1))))))))) (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_631))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_632)) (.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse9 (select .cse13 .cse14)) (.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ (select .cse9 .cse10) 4)) (let ((.cse11 (let ((.cse15 (store .cse16 .cse14 (let ((.cse17 (select .cse16 .cse14))) (store .cse17 .cse10 (select .cse17 .cse10)))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (.cse12 (select (select (store .cse13 .cse14 (store .cse9 .cse10 v_ArrVal_633)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select .cse11 (+ 12 .cse12)) (select .cse11 .cse12))))))))) is different from false [2022-09-29 22:01:07,260 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_631))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_632)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse4 .cse5)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ (select .cse0 .cse1) 4)) (let ((.cse2 (let ((.cse6 (store .cse7 .cse5 (let ((.cse8 (select .cse7 .cse5))) (store .cse8 .cse1 (select .cse8 .cse1)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (.cse3 (select (select (store .cse4 .cse5 (store .cse0 .cse1 v_ArrVal_633)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select .cse2 (+ .cse3 12)) (select .cse2 .cse3)))))))) (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_631))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_632)) (.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse9 (select .cse17 .cse15)) (.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ (select .cse9 .cse10) 4)) (let ((.cse13 (store .cse17 .cse15 (store .cse9 .cse10 v_ArrVal_633)))) (let ((.cse11 (select .cse13 (select (select (store .cse14 .cse15 (let ((.cse16 (select .cse14 .cse15))) (store .cse16 .cse10 (select .cse16 .cse10)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< (select .cse11 (+ .cse12 12)) (+ (select .cse11 .cse12) 1)))))))))) is different from false [2022-09-29 22:01:07,288 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_631))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_632)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select .cse4 .cse5)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ (select .cse0 .cse1) 4)) (let ((.cse2 (let ((.cse6 (store .cse7 .cse5 (let ((.cse8 (select .cse7 .cse5))) (store .cse8 .cse1 (select .cse8 .cse1)))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (.cse3 (select (select (store .cse4 .cse5 (store .cse0 .cse1 v_ArrVal_633)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= (select .cse2 (+ .cse3 12)) (select .cse2 .cse3)))))))) (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_631))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_632)) (.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse9 (select .cse17 .cse15)) (.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< v_ArrVal_633 (+ (select .cse9 .cse10) 4)) (let ((.cse13 (store .cse17 .cse15 (store .cse9 .cse10 v_ArrVal_633)))) (let ((.cse11 (select .cse13 (select (select (store .cse14 .cse15 (let ((.cse16 (select .cse14 .cse15))) (store .cse16 .cse10 (select .cse16 .cse10)))) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< (select .cse11 (+ .cse12 12)) (+ (select .cse11 .cse12) 1)))))))))) (not (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))) is different from false [2022-09-29 22:01:53,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:01:54,283 INFO L356 Elim1Store]: treesize reduction 179, result has 63.8 percent of original size [2022-09-29 22:01:54,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 1978 treesize of output 1712 [2022-09-29 22:01:55,629 INFO L356 Elim1Store]: treesize reduction 310, result has 63.6 percent of original size [2022-09-29 22:01:55,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 55 case distinctions, treesize of input 18302 treesize of output 16330 [2022-09-29 22:01:56,330 INFO L356 Elim1Store]: treesize reduction 256, result has 58.7 percent of original size [2022-09-29 22:01:56,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 19951 treesize of output 17030 [2022-09-29 22:01:56,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:01:56,795 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 16209 treesize of output 15894 [2022-09-29 22:02:10,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-29 22:02:24,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:02:24,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-09-29 22:02:27,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-29 22:02:34,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 Received shutdown request... [2022-09-29 22:09:50,112 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-29 22:09:50,120 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 22:09:50,140 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-09-29 22:09:50,140 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 22:09:50,140 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-09-29 22:09:50,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-29 22:09:50,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:09:50,336 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1086 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 34 for 27ms.. [2022-09-29 22:09:50,339 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 22:09:50,340 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-09-29 22:09:50,341 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-29 22:09:50,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-29 22:09:50,343 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1523.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.09 10:09:50 BasicIcfg [2022-09-29 22:09:50,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-29 22:09:50,343 INFO L158 Benchmark]: Toolchain (without parser) took 862243.62ms. Allocated memory was 224.4MB in the beginning and 1.0GB in the end (delta: 809.5MB). Free memory was 178.5MB in the beginning and 473.8MB in the end (delta: -295.4MB). Peak memory consumption was 807.5MB. Max. memory is 8.0GB. [2022-09-29 22:09:50,344 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 224.4MB. Free memory is still 184.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 22:09:50,344 INFO L158 Benchmark]: Boogie Preprocessor took 108.58ms. Allocated memory is still 224.4MB. Free memory was 178.4MB in the beginning and 197.5MB in the end (delta: -19.2MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2022-09-29 22:09:50,344 INFO L158 Benchmark]: RCFGBuilder took 1088.50ms. Allocated memory is still 224.4MB. Free memory was 197.5MB in the beginning and 155.5MB in the end (delta: 42.0MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB. [2022-09-29 22:09:50,344 INFO L158 Benchmark]: TraceAbstraction took 861043.00ms. Allocated memory was 224.4MB in the beginning and 1.0GB in the end (delta: 809.5MB). Free memory was 155.0MB in the beginning and 473.8MB in the end (delta: -318.9MB). Peak memory consumption was 783.2MB. Max. memory is 8.0GB. [2022-09-29 22:09:50,345 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 224.4MB. Free memory is still 184.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 108.58ms. Allocated memory is still 224.4MB. Free memory was 178.4MB in the beginning and 197.5MB in the end (delta: -19.2MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * RCFGBuilder took 1088.50ms. Allocated memory is still 224.4MB. Free memory was 197.5MB in the beginning and 155.5MB in the end (delta: 42.0MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB. * TraceAbstraction took 861043.00ms. Allocated memory was 224.4MB in the beginning and 1.0GB in the end (delta: 809.5MB). Free memory was 155.0MB in the beginning and 473.8MB in the end (delta: -318.9MB). Peak memory consumption was 783.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 474, positive: 457, positive conditional: 457, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 457, Positive conditional cache size: 0, Positive unconditional cache size: 457, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1474, positive: 1431, positive conditional: 1431, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 1431, Positive cache size: 1431, Positive conditional cache size: 0, Positive unconditional cache size: 1431, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 60, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1712, positive: 1656, positive conditional: 1656, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 2140, Positive cache size: 2139, Positive conditional cache size: 0, Positive unconditional cache size: 2139, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 115, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2100, positive: 2031, positive conditional: 2031, positive unconditional: 0, negative: 69, negative conditional: 69, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 2305, Positive cache size: 2304, Positive conditional cache size: 0, Positive unconditional cache size: 2304, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 184, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1694, positive: 1637, positive conditional: 1637, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 2333, Positive cache size: 2332, Positive conditional cache size: 0, Positive unconditional cache size: 2332, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 241, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2815, positive: 2724, positive conditional: 2724, positive unconditional: 0, negative: 91, negative conditional: 91, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 2766, Positive cache size: 2765, Positive conditional cache size: 0, Positive unconditional cache size: 2765, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 332, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4348, positive: 4206, positive conditional: 4206, positive unconditional: 0, negative: 142, negative conditional: 142, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 2997, Positive cache size: 2996, Positive conditional cache size: 0, Positive unconditional cache size: 2996, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 474, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4146, positive: 4010, positive conditional: 4010, positive unconditional: 0, negative: 136, negative conditional: 136, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18763, positive: 18152, positive conditional: 18152, positive unconditional: 0, negative: 611, negative conditional: 611, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18153, positive: 18152, positive conditional: 0, positive unconditional: 18152, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3046, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18153, positive: 15107, positive conditional: 0, positive unconditional: 15107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3046, unknown conditional: 0, unknown unconditional: 3046] , Statistics on independence cache: Total cache size (in pairs): 3046, Positive cache size: 3045, Positive conditional cache size: 0, Positive unconditional cache size: 3045, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 610, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1523]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1086 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 34 for 27ms.. - 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: 860.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 188.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 817, 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.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 39.2s InterpolantComputationTime, 6693 NumberOfCodeBlocks, 6693 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 7826 ConstructedInterpolants, 323 QuantifiedInterpolants, 159957 SizeOfPredicates, 106 NumberOfNonLiveVariables, 2772 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 838/1254 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