/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_1w1r.line1526.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:37:11,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:37:11,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:37:12,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:37:12,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:37:12,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:37:12,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:37:12,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:37:12,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:37:12,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:37:12,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:37:12,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:37:12,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:37:12,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:37:12,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:37:12,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:37:12,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:37:12,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:37:12,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:37:12,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:37:12,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:37:12,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:37:12,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:37:12,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:37:12,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:37:12,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:37:12,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:37:12,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:37:12,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:37:12,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:37:12,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:37:12,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:37:12,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:37:12,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:37:12,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:37:12,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:37:12,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:37:12,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:37:12,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:37:12,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:37:12,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:37:12,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:37:12,043 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:37:12,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:37:12,043 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:37:12,044 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:37:12,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:37:12,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:37:12,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:37:12,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:37:12,045 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:37:12,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:37:12,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:37:12,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:37:12,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:37:12,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:37:12,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:37:12,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:37:12,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:37:12,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:37:12,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:37:12,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:37:12,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:37:12,049 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:37:12,049 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:37:12,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:37:12,049 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 15:37:12,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:37:12,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:37:12,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:37:12,251 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:37:12,252 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:37:12,252 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_1w1r.line1526.bpl [2022-10-03 15:37:12,253 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1526.bpl' [2022-10-03 15:37:12,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:37:12,318 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:37:12,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:37:12,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:37:12,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:37:12,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:37:12,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:37:12,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:37:12,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:37:12,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/1) ... [2022-10-03 15:37:12,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:37:12,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:37:12,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 15:37:12,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 15:37:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:37:12,560 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:37:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:37:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:37:12,562 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:37:12,706 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:37:12,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:37:13,534 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:37:13,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:37:13,559 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:37:13,561 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:37:13 BoogieIcfgContainer [2022-10-03 15:37:13,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:37:13,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:37:13,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:37:13,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:37:13,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:37:12" (1/2) ... [2022-10-03 15:37:13,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b95f2ed and model type divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:37:13, skipping insertion in model container [2022-10-03 15:37:13,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:37:13" (2/2) ... [2022-10-03 15:37:13,594 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1526.bpl [2022-10-03 15:37:13,599 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:37:13,605 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:37:13,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:37:13,605 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:37:13,714 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:37:13,762 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:37:13,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:37:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:37:13,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 15:37:13,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 15:37:13,817 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:37:13,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:37:13,829 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;@1b4cd799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:37:13,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:37:14,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:37:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:37:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 607659717, now seen corresponding path program 1 times [2022-10-03 15:37:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:37:14,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489799354] [2022-10-03 15:37:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:37:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:37:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:37:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:37:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:37:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489799354] [2022-10-03 15:37:14,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489799354] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:37:14,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:37:14,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:37:14,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919781854] [2022-10-03 15:37:14,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:37:14,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:37:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:37:14,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:37:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:37:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:37:14,636 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:37:14,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 341.0) internal successors, (682), 2 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:37:14,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:37:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:37:14,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:37:14,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:37:14,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:37:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2087104356, now seen corresponding path program 1 times [2022-10-03 15:37:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:37:14,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892422917] [2022-10-03 15:37:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:37:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:37:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:37:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:37:15,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:37:15,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892422917] [2022-10-03 15:37:15,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892422917] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:37:15,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:37:15,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 15:37:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026047013] [2022-10-03 15:37:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:37:15,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 15:37:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:37:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 15:37:15,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 15:37:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:37:15,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:37:15,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 46.6875) internal successors, (747), 17 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:37:15,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:37:15,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:37:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:37:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:37:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:37:17,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:37:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:37:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2041967182, now seen corresponding path program 1 times [2022-10-03 15:37:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:37:17,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235164073] [2022-10-03 15:37:17,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:37:17,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:37:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:37:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 228 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:37:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:37:18,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235164073] [2022-10-03 15:37:18,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235164073] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:37:18,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127242086] [2022-10-03 15:37:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:37:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:37:18,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:37:18,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:37:18,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 15:37:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:37:18,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 2674 conjuncts, 312 conjunts are in the unsatisfiable core [2022-10-03 15:37:18,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:37:19,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-10-03 15:37:19,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:37:21,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:37:21,345 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-03 15:37:21,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 15:37:21,710 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 37 treesize of output 33 [2022-10-03 15:37:26,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:37:26,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:37:26,307 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-03 15:37:26,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2022-10-03 15:37:29,146 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:37:29,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 32 [2022-10-03 15:37:31,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:37:31,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:37:31,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:37:31,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-10-03 15:37:31,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-03 15:37:33,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:37:33,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2022-10-03 15:37:34,191 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-10-03 15:37:34,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2022-10-03 15:37:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 201 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:37:35,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:37:39,304 INFO L356 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-10-03 15:37:39,304 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 104 treesize of output 94 [2022-10-03 15:37:50,924 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 15:37:50,924 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 4 case distinctions, treesize of input 252 treesize of output 216 [2022-10-03 15:37:50,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:37:50,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 206 [2022-10-03 15:37:50,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:37:50,953 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 134 treesize of output 110 [2022-10-03 15:37:50,963 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 115 treesize of output 103 [2022-10-03 15:37:51,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-03 15:37:51,149 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 10 treesize of output 4 [2022-10-03 15:37:51,172 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:37:51,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2022-10-03 15:37:51,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:37:51,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:37:51,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 148 treesize of output 182 [2022-10-03 15:37:57,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:37:57,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 343 [2022-10-03 15:38:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 156 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:38:45,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127242086] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:38:45,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:38:45,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 114, 116] total 240 [2022-10-03 15:38:45,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518060556] [2022-10-03 15:38:45,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:38:45,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 240 states [2022-10-03 15:38:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:38:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 240 interpolants. [2022-10-03 15:38:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=55584, Unknown=134, NotChecked=0, Total=57360 [2022-10-03 15:38:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:45,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:38:45,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 240 states, 240 states have (on average 12.279166666666667) internal successors, (2947), 240 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:38:45,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:45,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:38:45,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:39:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:39:04,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 15:39:05,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 15:39:05,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:39:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:39:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1823079850, now seen corresponding path program 2 times [2022-10-03 15:39:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:39:05,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892485357] [2022-10-03 15:39:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:39:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 100 proven. 5 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-10-03 15:39:05,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:39:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892485357] [2022-10-03 15:39:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892485357] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:39:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582874156] [2022-10-03 15:39:05,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:39:05,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:39:05,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:39:05,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:39:05,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 15:39:06,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 15:39:06,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:39:06,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 218 conjunts are in the unsatisfiable core [2022-10-03 15:39:06,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:39:06,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:39:06,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:39:06,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:39:09,408 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-10-03 15:39:09,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 15:39:09,804 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:39:09,804 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 73 treesize of output 69 [2022-10-03 15:39:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:39:09,810 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 15:39:09,810 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 1 case distinctions, treesize of input 65 treesize of output 58 [2022-10-03 15:39:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-10-03 15:39:13,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:39:13,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582874156] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:39:13,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:39:13,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [11] total 71 [2022-10-03 15:39:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702112172] [2022-10-03 15:39:13,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:39:13,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-10-03 15:39:13,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:39:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-10-03 15:39:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4738, Unknown=3, NotChecked=0, Total=4970 [2022-10-03 15:39:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:13,422 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:39:13,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 13.365079365079366) internal successors, (842), 63 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:39:13,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:13,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:39:13,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-10-03 15:39:13,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-03 15:39:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:39:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-10-03 15:39:16,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 15:39:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:39:16,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:39:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:39:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -166730132, now seen corresponding path program 1 times [2022-10-03 15:39:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:39:16,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520652899] [2022-10-03 15:39:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:39:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:39:17,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:39:17,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520652899] [2022-10-03 15:39:17,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520652899] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:39:17,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:39:17,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-03 15:39:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386929141] [2022-10-03 15:39:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:39:17,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-03 15:39:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:39:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-03 15:39:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-10-03 15:39:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:17,393 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:39:17,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 53.93333333333333) internal successors, (809), 16 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:39:17,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:17,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-03 15:39:17,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:39:17,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-10-03 15:39:17,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-03 15:39:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:39:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-10-03 15:39:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:39:18,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:39:18,982 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:39:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:39:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -860847512, now seen corresponding path program 1 times [2022-10-03 15:39:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:39:18,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173067233] [2022-10-03 15:39:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:39:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 228 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:39:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:39:19,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173067233] [2022-10-03 15:39:19,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173067233] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:39:19,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39372603] [2022-10-03 15:39:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:39:19,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:39:19,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:39:19,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 15:39:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:20,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 3132 conjuncts, 250 conjunts are in the unsatisfiable core [2022-10-03 15:39:20,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:39:20,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:39:20,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:39:20,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:39:22,050 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-10-03 15:39:22,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 15:39:22,349 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 15:39:22,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2022-10-03 15:39:22,363 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:39:22,364 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 73 treesize of output 69 [2022-10-03 15:39:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-03 15:39:24,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:39:24,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39372603] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:39:24,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:39:24,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [14] total 74 [2022-10-03 15:39:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047963218] [2022-10-03 15:39:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:39:24,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-10-03 15:39:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:39:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-10-03 15:39:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=5095, Unknown=0, NotChecked=0, Total=5402 [2022-10-03 15:39:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:24,585 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:39:24,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 15.238095238095237) internal successors, (960), 63 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:39:24,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:24,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-03 15:39:24,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-10-03 15:39:24,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-10-03 15:39:24,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:39:24,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:33,700 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_36| Int) (v_ArrVal_293 Int) (v_ArrVal_295 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_36| v_ArrVal_293)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (let ((.cse3 (select (store .cse4 .cse2 v_ArrVal_295) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 .cse1) (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< |c_ULTIMATE.start_fifo_front_~self#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_36|)))))))) is different from false [2022-10-03 15:39:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:39:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-10-03 15:39:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-10-03 15:39:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:39:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-10-03 15:39:37,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-03 15:39:37,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:39:37,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:39:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:39:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1191793476, now seen corresponding path program 1 times [2022-10-03 15:39:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:39:37,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508286547] [2022-10-03 15:39:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:37,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:39:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 228 proven. 45 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-10-03 15:39:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:39:38,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508286547] [2022-10-03 15:39:38,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508286547] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:39:38,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910131825] [2022-10-03 15:39:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:38,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:39:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:39:38,247 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:39:38,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 15:39:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:38,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 3448 conjuncts, 203 conjunts are in the unsatisfiable core [2022-10-03 15:39:38,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:39:41,958 INFO L356 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-10-03 15:39:41,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 38 [2022-10-03 15:39:41,965 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 15:39:41,965 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 22 treesize of output 30 [2022-10-03 15:39:43,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-10-03 15:39:43,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-10-03 15:39:43,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:39:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-10-03 15:39:43,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:39:43,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910131825] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:39:43,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:39:43,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [14] total 68 [2022-10-03 15:39:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186752179] [2022-10-03 15:39:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:39:43,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-10-03 15:39:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:39:43,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-10-03 15:39:43,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4302, Unknown=0, NotChecked=0, Total=4556 [2022-10-03 15:39:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:43,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:39:43,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 20.1) internal successors, (1206), 60 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:39:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:39:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2022-10-03 15:39:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-10-03 15:39:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:39:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2022-10-03 15:39:43,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-03 15:39:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-10-03 15:39:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-10-03 15:39:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-03 15:39:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-10-03 15:39:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-10-03 15:39:55,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 15:39:55,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:39:55,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:39:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:39:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1961658148, now seen corresponding path program 1 times [2022-10-03 15:39:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:39:55,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347017117] [2022-10-03 15:39:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:39:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-10-03 15:39:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:39:55,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347017117] [2022-10-03 15:39:55,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347017117] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:39:55,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583684133] [2022-10-03 15:39:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:39:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:39:55,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:39:55,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-03 15:39:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:56,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 2732 conjuncts, 317 conjunts are in the unsatisfiable core [2022-10-03 15:39:56,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:39:56,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-03 15:39:57,578 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-03 15:39:57,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-03 15:39:57,788 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-10-03 15:40:06,225 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-10-03 15:40:06,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-10-03 15:40:33,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:33,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:33,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-10-03 15:40:33,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:40:34,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2022-10-03 15:40:34,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 15:40:34,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 15:40:34,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:34,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2022-10-03 15:40:35,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:35,270 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-10-03 15:40:35,270 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 68 treesize of output 61 [2022-10-03 15:40:35,277 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 27 treesize of output 15 [2022-10-03 15:40:35,286 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 15:40:35,288 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 1 case distinctions, treesize of input 32 treesize of output 25 [2022-10-03 15:40:35,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 9 [2022-10-03 15:40:35,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:35,921 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 30 treesize of output 28 [2022-10-03 15:40:35,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:40:36,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:36,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:40:36,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 11 [2022-10-03 15:40:36,750 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 18 treesize of output 20 [2022-10-03 15:40:37,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:40:37,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:37,043 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 31 treesize of output 30 [2022-10-03 15:40:37,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:40:37,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2022-10-03 15:40:37,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:37,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2022-10-03 15:40:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 8 proven. 164 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-10-03 15:40:38,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:40:38,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 116 [2022-10-03 15:40:39,620 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))) (let ((.cse0 (= |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| .cse6)) (.cse1 (= |c_pusherThread1of1ForFork0_~q~0#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|))) (or (and (or (not .cse0) (not .cse1)) (forall ((v_arrayElimCell_96 Int)) (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset|)))) (let ((.cse3 (+ (select (select .cse2 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse2 v_arrayElimCell_96) .cse3) .cse3))))) (and .cse0 .cse1 (let ((.cse4 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset|)))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse6) 12))) (< (select (select .cse4 |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|) .cse5) .cse5))))))) is different from false [2022-10-03 15:40:44,017 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1284))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ 12 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (< (select (select .cse4 v_arrayElimCell_96) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1284))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (or (< (select (select .cse1 v_arrayElimCell_96) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))) (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) is different from false [2022-10-03 15:40:44,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1284))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_96) .cse5) .cse5)))))) (and (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1284))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse1 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1) (< (select (select .cse0 v_arrayElimCell_96) .cse1) .cse1))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) (or .cse3 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) is different from false [2022-10-03 15:40:44,107 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1284))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_96) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1284))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 v_arrayElimCell_96) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0))) is different from false [2022-10-03 15:40:44,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_1284))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_96) .cse5) .cse5)))))) (and (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_1284))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 v_arrayElimCell_96) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))))) is different from false [2022-10-03 15:40:44,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_1284))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ 12 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (< (select (select .cse4 v_arrayElimCell_96) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_1284))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_96) .cse2) .cse2))))) (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) is different from false [2022-10-03 15:40:44,203 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse5 (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_1284))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse6 (+ (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse5 v_arrayElimCell_96) .cse6) .cse6)))))) (and (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_arrayElimCell_96 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse1 (let ((.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) v_ArrVal_1284))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 v_arrayElimCell_96) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0))) is different from false [2022-10-03 15:40:44,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:40:44,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 702 treesize of output 519 [2022-10-03 15:40:44,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:40:44,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 18917 treesize of output 17955 [2022-10-03 15:40:44,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:40:44,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 20436 treesize of output 18013 [2022-10-03 15:40:45,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:40:45,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 18516 treesize of output 17521 [2022-10-03 15:40:45,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:40:45,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 17724 treesize of output 17303 [2022-10-03 15:40:46,445 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-10-03 15:51:13,672 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-10-03 15:51:13,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:51:13,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-03 15:51:13,711 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:51:13,711 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:51:13,711 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:51:13,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:51:13,891 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1093 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 13ms.. [2022-10-03 15:51:13,905 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-10-03 15:51:13,907 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:51:13,908 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:51:13,908 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:51:13,910 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1526.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:51:13 BasicIcfg [2022-10-03 15:51:13,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:51:13,910 INFO L158 Benchmark]: Toolchain (without parser) took 841591.98ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 144.2MB in the beginning and 602.9MB in the end (delta: -458.7MB). Peak memory consumption was 943.5MB. Max. memory is 8.0GB. [2022-10-03 15:51:13,910 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:51:13,910 INFO L158 Benchmark]: Boogie Preprocessor took 114.54ms. Allocated memory is still 186.6MB. Free memory was 144.2MB in the beginning and 162.9MB in the end (delta: -18.7MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-10-03 15:51:13,911 INFO L158 Benchmark]: RCFGBuilder took 1120.78ms. Allocated memory is still 186.6MB. Free memory was 162.9MB in the beginning and 126.4MB in the end (delta: 36.5MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. [2022-10-03 15:51:13,911 INFO L158 Benchmark]: TraceAbstraction took 840335.07ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 158.6MB in the beginning and 602.9MB in the end (delta: -444.3MB). Peak memory consumption was 957.1MB. Max. memory is 8.0GB. [2022-10-03 15:51:13,911 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 114.54ms. Allocated memory is still 186.6MB. Free memory was 144.2MB in the beginning and 162.9MB in the end (delta: -18.7MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1120.78ms. Allocated memory is still 186.6MB. Free memory was 162.9MB in the beginning and 126.4MB in the end (delta: 36.5MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. * TraceAbstraction took 840335.07ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 158.6MB in the beginning and 602.9MB in the end (delta: -444.3MB). Peak memory consumption was 957.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 480, positive: 465, positive conditional: 465, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 465, Positive conditional cache size: 0, Positive unconditional cache size: 465, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 15, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1480, positive: 1437, positive conditional: 1437, 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: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 1439, Positive cache size: 1439, Positive conditional cache size: 0, Positive unconditional cache size: 1439, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 58, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5796, positive: 5615, positive conditional: 5615, positive unconditional: 0, negative: 181, negative conditional: 181, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 3866, Positive cache size: 3865, Positive conditional cache size: 0, Positive unconditional cache size: 3865, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 238, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2880, positive: 2789, positive conditional: 2789, 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: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 4953, Positive cache size: 4951, Positive conditional cache size: 0, Positive unconditional cache size: 4951, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 328, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7031, positive: 6784, positive conditional: 6784, positive unconditional: 0, negative: 247, negative conditional: 247, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 8290, Positive cache size: 8284, Positive conditional cache size: 0, Positive unconditional cache size: 8284, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 571, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11455, positive: 11078, positive conditional: 11078, positive unconditional: 0, negative: 377, negative conditional: 377, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 9341, Positive cache size: 9333, Positive conditional cache size: 0, Positive unconditional cache size: 9333, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 942, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 13181, positive: 12771, positive conditional: 12771, positive unconditional: 0, negative: 410, negative conditional: 410, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 12359, Positive cache size: 12350, Positive conditional cache size: 0, Positive unconditional cache size: 12350, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Independence queries for same thread: 1346, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9389, positive: 9088, positive conditional: 9088, positive unconditional: 0, negative: 301, negative conditional: 301, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51692, positive: 50027, positive conditional: 50027, positive unconditional: 0, negative: 1665, negative conditional: 1665, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50050, positive: 50027, positive conditional: 0, positive unconditional: 50027, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12908, positive: 12898, positive conditional: 0, positive unconditional: 12898, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 50050, positive: 37129, positive conditional: 0, positive unconditional: 37129, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 12908, unknown conditional: 0, unknown unconditional: 12908] , Statistics on independence cache: Total cache size (in pairs): 12908, Positive cache size: 12898, Positive conditional cache size: 0, Positive unconditional cache size: 12898, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Independence queries for same thread: 1642, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1526]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1093 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 13ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 840.1s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 51.2s, 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: 441, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 106.1s InterpolantComputationTime, 11766 NumberOfCodeBlocks, 11480 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 12830 ConstructedInterpolants, 1438 QuantifiedInterpolants, 165478 SizeOfPredicates, 487 NumberOfNonLiveVariables, 11212 ConjunctsInSsa, 983 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 2486/2699 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