/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.line1277.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:20:30,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:20:30,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:20:30,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:20:30,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:20:30,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:20:30,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:20:30,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:20:30,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:20:30,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:20:30,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:20:30,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:20:30,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:20:30,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:20:30,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:20:30,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:20:30,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:20:30,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:20:30,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:20:30,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:20:30,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:20:30,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:20:30,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:20:30,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:20:30,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:20:30,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:20:30,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:20:30,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:20:30,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:20:30,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:20:30,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:20:30,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:20:30,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:20:30,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:20:30,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:20:30,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:20:30,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:20:30,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:20:30,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:20:30,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:20:30,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:20:30,489 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:20:30,519 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:20:30,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:20:30,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:20:30,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:20:30,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:20:30,521 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:20:30,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:20:30,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:20:30,521 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:20:30,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:20:30,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:20:30,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:20:30,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:20:30,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:20:30,523 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:20:30,524 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:20:30,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:20:30,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:20:30,524 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:20:30,524 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:20:30,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:20:30,524 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:20:30,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:20:30,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:20:30,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:20:30,733 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:20:30,734 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:20:30,735 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.line1277.bpl [2022-10-03 15:20:30,735 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1277.bpl' [2022-10-03 15:20:30,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:20:30,803 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:20:30,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:20:30,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:20:30,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:20:30,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:20:30,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:20:30,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:20:30,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:20:30,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/1) ... [2022-10-03 15:20:30,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:20:30,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:20:30,958 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:20:30,964 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:20:30,989 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:20:30,990 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:20:30,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:20:30,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:20:30,991 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:20:31,118 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:20:31,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:20:32,026 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:20:32,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:20:32,051 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:20:32,053 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:20:32 BoogieIcfgContainer [2022-10-03 15:20:32,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:20:32,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:20:32,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:20:32,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:20:32,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:20:30" (1/2) ... [2022-10-03 15:20:32,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2851bbef and model type divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:20:32, skipping insertion in model container [2022-10-03 15:20:32,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1277.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:20:32" (2/2) ... [2022-10-03 15:20:32,065 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1277.bpl [2022-10-03 15:20:32,072 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:20:32,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:20:32,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:20:32,080 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:20:32,205 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:20:32,262 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:20:32,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:20:32,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:20:32,281 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:20:32,283 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:20:32,312 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:20:32,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:20:32,328 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;@6e972a78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:20:32,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:20:32,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:32,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1280815819, now seen corresponding path program 1 times [2022-10-03 15:20:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:32,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219768545] [2022-10-03 15:20:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:33,047 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:20:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:33,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219768545] [2022-10-03 15:20:33,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219768545] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:33,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:33,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:20:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800007823] [2022-10-03 15:20:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:33,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:20:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:20:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:20:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:33,080 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:33,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 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:20:33,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:33,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:20:33,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:33,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:33,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1702865445, now seen corresponding path program 1 times [2022-10-03 15:20:33,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:33,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393824734] [2022-10-03 15:20:33,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:33,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:33,883 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:20:33,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:33,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393824734] [2022-10-03 15:20:33,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393824734] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:33,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:20:33,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 15:20:33,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55269570] [2022-10-03 15:20:33,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:33,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 15:20:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:33,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 15:20:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 15:20:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:33,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:33,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 34.625) internal successors, (554), 17 states have internal predecessors, (554), 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:20:33,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:33,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:35,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:35,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:20:35,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:20:35,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1403769823, now seen corresponding path program 1 times [2022-10-03 15:20:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:35,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210265345] [2022-10-03 15:20:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:20:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210265345] [2022-10-03 15:20:35,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210265345] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:20:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515075167] [2022-10-03 15:20:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:35,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:20:35,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:20:35,867 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:20:35,878 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:20:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:36,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 2194 conjuncts, 164 conjunts are in the unsatisfiable core [2022-10-03 15:20:36,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:20:36,850 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:20:37,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:37,054 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 21 treesize of output 20 [2022-10-03 15:20:37,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:37,326 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 14 treesize of output 16 [2022-10-03 15:20:37,490 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:20:37,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:37,496 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:20:38,964 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:20:38,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:20:39,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:39,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:39,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-10-03 15:20:39,322 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 36 treesize of output 34 [2022-10-03 15:20:40,458 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 28 treesize of output 16 [2022-10-03 15:20:40,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:40,853 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:20:40,854 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2022-10-03 15:20:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-03 15:20:40,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:20:40,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515075167] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:40,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:20:40,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [11] total 61 [2022-10-03 15:20:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189512847] [2022-10-03 15:20:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:40,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-10-03 15:20:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:40,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-10-03 15:20:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3412, Unknown=0, NotChecked=0, Total=3660 [2022-10-03 15:20:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:40,938 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:40,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 16.192307692307693) internal successors, (842), 52 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:20:40,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:40,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:20:40,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:20:51,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:20:51,560 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:20:51,759 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:20:51,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:20:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:20:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1302362482, now seen corresponding path program 1 times [2022-10-03 15:20:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:20:51,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478363353] [2022-10-03 15:20:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:20:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:20:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:20:52,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478363353] [2022-10-03 15:20:52,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478363353] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:20:52,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930722504] [2022-10-03 15:20:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:20:52,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:20:52,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:20:52,129 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:20:52,130 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:20:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:20:52,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 222 conjunts are in the unsatisfiable core [2022-10-03 15:20:52,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:20:52,540 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:20:52,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:52,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:20:53,250 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:20:53,729 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:20:53,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:20:53,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:20:53,968 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 16 treesize of output 18 [2022-10-03 15:20:57,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:57,119 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 21 treesize of output 13 [2022-10-03 15:20:57,830 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:20:57,830 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 43 treesize of output 40 [2022-10-03 15:20:57,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:20:57,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-10-03 15:20:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:20:58,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:20:58,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930722504] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:20:58,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:20:58,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [11] total 74 [2022-10-03 15:20:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911149357] [2022-10-03 15:20:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:20:58,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-10-03 15:20:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:20:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-10-03 15:20:58,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=5106, Unknown=0, NotChecked=0, Total=5402 [2022-10-03 15:20:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:58,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:20:58,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 12.90625) internal successors, (826), 64 states have internal predecessors, (826), 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:20:58,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:20:58,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:20:58,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:20:58,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:16,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:21:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:21:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:21:16,410 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:21:16,603 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:21:16,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:21:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:21:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -358816608, now seen corresponding path program 1 times [2022-10-03 15:21:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:21:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722892387] [2022-10-03 15:21:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:21:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2022-10-03 15:21:17,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:21:17,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722892387] [2022-10-03 15:21:17,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722892387] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:21:17,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:21:17,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 15:21:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111197015] [2022-10-03 15:21:17,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:21:17,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 15:21:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:21:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 15:21:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-10-03 15:21:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:17,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:21:17,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 45.42857142857143) internal successors, (954), 21 states have internal predecessors, (954), 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:21:17,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:17,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 15:21:17,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:21:17,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:21:17,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-03 15:21:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:21:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:21:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:21:21,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:21:21,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:21:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:21:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 140462337, now seen corresponding path program 1 times [2022-10-03 15:21:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:21:21,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840126622] [2022-10-03 15:21:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:21:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 251 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-10-03 15:21:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:21:22,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840126622] [2022-10-03 15:21:22,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840126622] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:21:22,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276197442] [2022-10-03 15:21:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:21:22,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:21:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:21:22,525 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:21:22,526 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:21:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:21:22,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 3128 conjuncts, 203 conjunts are in the unsatisfiable core [2022-10-03 15:21:23,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:21:23,071 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:21:23,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:21:23,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:21:23,774 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:21:23,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:21:23,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-03 15:21:27,096 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 15:21:27,097 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 21 treesize of output 21 [2022-10-03 15:21:27,582 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:21:27,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2022-10-03 15:21:27,588 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 29 [2022-10-03 15:21:27,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:21:27,971 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 38 treesize of output 14 [2022-10-03 15:21:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 288 proven. 144 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-03 15:21:28,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:21:28,474 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_628) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_629 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_629) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:21:28,490 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_628) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_629 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_629) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:21:28,513 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_628) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_629 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_629) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:21:28,553 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_628) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_629 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_629) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:21:28,558 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_629 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_629) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_628) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-10-03 15:21:28,572 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_629 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_629) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_628) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) is different from false [2022-10-03 15:21:30,197 INFO L356 Elim1Store]: treesize reduction 13, result has 86.6 percent of original size [2022-10-03 15:21:30,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 141 [2022-10-03 15:21:30,206 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 42 treesize of output 36 [2022-10-03 15:21:30,278 INFO L356 Elim1Store]: treesize reduction 13, result has 86.6 percent of original size [2022-10-03 15:21:30,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 82 treesize of output 137 [2022-10-03 15:21:30,287 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 39 treesize of output 33 [2022-10-03 15:21:32,708 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 15:21:32,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-03 15:21:35,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_627 Int) (v_ArrVal_626 Int)) (or (= |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (< (select (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_626) |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~#q~1#1.base|) 16))))) is different from false [2022-10-03 15:21:46,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:21:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 109 proven. 103 refuted. 0 times theorem prover too weak. 216 trivial. 41 not checked. [2022-10-03 15:21:46,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276197442] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:21:46,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:21:46,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 60, 50] total 118 [2022-10-03 15:21:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199389310] [2022-10-03 15:21:46,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:21:46,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-10-03 15:21:46,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:21:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-10-03 15:21:46,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=11527, Unknown=12, NotChecked=1568, Total=13806 [2022-10-03 15:21:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:46,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:21:46,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 25.74576271186441) internal successors, (3038), 118 states have internal predecessors, (3038), 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:21:46,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:21:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-03 15:21:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-10-03 15:21:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:21:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:21:46,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:22:07,659 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:22:07,851 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:22:07,852 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:152) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:164) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:97) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:121) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:322) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-10-03 15:22:07,855 INFO L158 Benchmark]: Toolchain (without parser) took 97052.36ms. Allocated memory was 167.8MB in the beginning and 798.0MB in the end (delta: 630.2MB). Free memory was 121.3MB in the beginning and 200.3MB in the end (delta: -79.0MB). Peak memory consumption was 552.2MB. Max. memory is 8.0GB. [2022-10-03 15:22:07,855 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:22:07,855 INFO L158 Benchmark]: Boogie Preprocessor took 112.57ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 114.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:22:07,856 INFO L158 Benchmark]: RCFGBuilder took 1130.64ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 122.6MB in the end (delta: -7.8MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-10-03 15:22:07,856 INFO L158 Benchmark]: TraceAbstraction took 95798.36ms. Allocated memory was 167.8MB in the beginning and 798.0MB in the end (delta: 630.2MB). Free memory was 122.0MB in the beginning and 200.3MB in the end (delta: -78.2MB). Peak memory consumption was 552.2MB. Max. memory is 8.0GB. [2022-10-03 15:22:07,857 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.15ms. Allocated memory is still 167.8MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 112.57ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 114.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1130.64ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 122.6MB in the end (delta: -7.8MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 95798.36ms. Allocated memory was 167.8MB in the beginning and 798.0MB in the end (delta: 630.2MB). Free memory was 122.0MB in the beginning and 200.3MB in the end (delta: -78.2MB). Peak memory consumption was 552.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 15:22:07,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-10-03 15:22:08,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...