/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.line1133.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:14:04,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:14:04,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:14:04,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:14:04,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:14:04,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:14:04,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:14:04,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:14:04,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:14:04,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:14:04,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:14:04,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:14:04,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:14:04,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:14:04,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:14:04,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:14:04,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:14:04,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:14:04,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:14:04,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:14:04,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:14:04,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:14:04,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:14:04,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:14:04,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:14:04,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:14:04,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:14:04,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:14:04,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:14:04,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:14:04,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:14:04,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:14:04,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:14:04,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:14:04,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:14:04,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:14:04,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:14:04,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:14:04,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:14:04,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:14:04,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:14:04,557 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:14:04,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:14:04,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:14:04,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:14:04,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:14:04,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:14:04,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:14:04,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:14:04,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:14:04,590 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:14:04,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:14:04,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:14:04,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:14:04,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:14:04,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:14:04,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:14:04,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:14:04,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:14:04,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:14:04,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:14:04,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:14:04,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:14:04,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:14:04,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:14:04,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:14:04,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:14:04,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:14:04,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:14:04,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:14:04,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:14:04,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:14:04,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:14:04,593 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:14:04,594 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:14:04,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:14:04,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:14:04,594 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:14:04,594 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:14:04,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:14:04,595 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:14:04,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:14:04,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:14:04,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:14:04,848 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:14:04,851 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:14:04,853 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.line1133.bpl [2022-10-03 15:14:04,853 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1133.bpl' [2022-10-03 15:14:04,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:14:04,945 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:14:04,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:14:04,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:14:04,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:14:04,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:04,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:05,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:05,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:05,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:05,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:05,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:05,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:14:05,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:14:05,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:14:05,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:14:05,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/1) ... [2022-10-03 15:14:05,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:14:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:14:05,119 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:14:05,133 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:14:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:14:05,198 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:14:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:14:05,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:14:05,200 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:14:05,405 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:14:05,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:14:06,416 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:14:06,436 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:14:06,436 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:14:06,440 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:14:06 BoogieIcfgContainer [2022-10-03 15:14:06,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:14:06,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:14:06,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:14:06,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:14:06,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:14:04" (1/2) ... [2022-10-03 15:14:06,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f277a1b and model type divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:14:06, skipping insertion in model container [2022-10-03 15:14:06,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:14:06" (2/2) ... [2022-10-03 15:14:06,457 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1133.bpl [2022-10-03 15:14:06,464 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:14:06,470 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:14:06,471 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:14:06,471 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:14:06,596 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:14:06,656 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:14:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:14:06,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:14:06,663 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:14:06,670 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:14:06,694 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:14:06,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:14:06,714 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;@2070c633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:14:06,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:14:07,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:14:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:14:07,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2095045766, now seen corresponding path program 1 times [2022-10-03 15:14:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:14:07,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683275762] [2022-10-03 15:14:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:14:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:14:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:14:07,650 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:14:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:14:07,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683275762] [2022-10-03 15:14:07,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683275762] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:14:07,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:14:07,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:14:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397610059] [2022-10-03 15:14:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:14:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:14:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:14:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:14:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:14:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:07,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:14:07,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 188.0) internal successors, (376), 2 states have internal predecessors, (376), 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:14:07,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:07,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:14:07,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:14:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:14:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2034029446, now seen corresponding path program 1 times [2022-10-03 15:14:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:14:07,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873974826] [2022-10-03 15:14:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:14:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:14:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:14:10,175 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:14:10,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:14:10,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873974826] [2022-10-03 15:14:10,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873974826] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:14:10,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:14:10,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-10-03 15:14:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892595658] [2022-10-03 15:14:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:14:10,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-03 15:14:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:14:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-03 15:14:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1920, Unknown=0, NotChecked=0, Total=2070 [2022-10-03 15:14:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:10,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:14:10,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 9.866666666666667) internal successors, (444), 46 states have internal predecessors, (444), 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:14:10,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:10,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:14:21,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:14:21,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:14:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:14:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2055890134, now seen corresponding path program 1 times [2022-10-03 15:14:21,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:14:21,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008233111] [2022-10-03 15:14:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:14:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:14:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:14:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9990 backedges. 4090 proven. 4938 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2022-10-03 15:14:27,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:14:27,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008233111] [2022-10-03 15:14:27,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008233111] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:14:27,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444639636] [2022-10-03 15:14:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:14:27,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:14:27,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:14:27,360 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:14:27,363 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:14:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:14:28,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 8382 conjuncts, 162 conjunts are in the unsatisfiable core [2022-10-03 15:14:28,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:14:31,297 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:14:31,301 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:14:33,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:14:33,180 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:14:33,180 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 59 treesize of output 40 [2022-10-03 15:14:33,191 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 15:14:33,191 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 24 treesize of output 32 [2022-10-03 15:14:33,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:14:33,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-10-03 15:14:34,829 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:14:34,842 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:14:35,124 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:14:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9990 backedges. 6347 proven. 352 refuted. 0 times theorem prover too weak. 3291 trivial. 0 not checked. [2022-10-03 15:14:35,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:14:35,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-03 15:14:36,926 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (and (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) .cse1) (forall ((v_ArrVal_585 (Array Int Int))) (let ((.cse2 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_585) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)))))) (not (<= 0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse1)))) is different from false [2022-10-03 15:14:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9990 backedges. 6474 proven. 0 refuted. 0 times theorem prover too weak. 3516 trivial. 0 not checked. [2022-10-03 15:14:39,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444639636] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 15:14:39,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 15:14:39,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [51, 50] total 133 [2022-10-03 15:14:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244015502] [2022-10-03 15:14:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:14:39,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-03 15:14:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:14:39,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-03 15:14:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=16493, Unknown=125, NotChecked=260, Total=17556 [2022-10-03 15:14:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:39,269 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:14:39,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 42.68421052631579) internal successors, (1622), 38 states have internal predecessors, (1622), 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:14:39,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:39,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:14:39,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:14:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:14:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:14:52,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 15:14:53,025 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:14:53,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:14:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:14:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1812384862, now seen corresponding path program 1 times [2022-10-03 15:14:53,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:14:53,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814608878] [2022-10-03 15:14:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:14:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:14:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:15:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12242 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 12032 trivial. 0 not checked. [2022-10-03 15:15:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:15:00,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814608878] [2022-10-03 15:15:00,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814608878] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:15:00,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:15:00,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-10-03 15:15:00,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266386298] [2022-10-03 15:15:00,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:15:00,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-10-03 15:15:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:15:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-10-03 15:15:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=5158, Unknown=0, NotChecked=0, Total=5402 [2022-10-03 15:15:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:00,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:15:00,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 15.95945945945946) internal successors, (1181), 74 states have internal predecessors, (1181), 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:15:00,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:00,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:15:00,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:15:00,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:26,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:26,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:15:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:15:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-10-03 15:15:26,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:15:26,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:15:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:15:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1215407014, now seen corresponding path program 2 times [2022-10-03 15:15:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:15:26,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341032861] [2022-10-03 15:15:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:15:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:15:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:15:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 12378 trivial. 0 not checked. [2022-10-03 15:15:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:15:34,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341032861] [2022-10-03 15:15:34,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341032861] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:15:34,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:15:34,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-10-03 15:15:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864537351] [2022-10-03 15:15:34,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:15:34,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-10-03 15:15:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:15:34,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-10-03 15:15:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=4752, Unknown=0, NotChecked=0, Total=4970 [2022-10-03 15:15:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:34,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:15:34,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 16.774647887323944) internal successors, (1191), 71 states have internal predecessors, (1191), 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:15:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:15:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:15:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-10-03 15:15:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:15:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:15:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:15:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:15:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:15:57,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:15:57,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:15:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:15:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2011811928, now seen corresponding path program 3 times [2022-10-03 15:15:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:15:57,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115079436] [2022-10-03 15:15:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:15:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:15:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:16:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13152 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 12516 trivial. 0 not checked. [2022-10-03 15:16:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:16:06,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115079436] [2022-10-03 15:16:06,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115079436] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:16:06,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:16:06,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 15:16:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113552663] [2022-10-03 15:16:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:16:06,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 15:16:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:16:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 15:16:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=5030, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 15:16:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:06,513 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:16:06,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 17.84931506849315) internal successors, (1303), 73 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 15:16:06,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:06,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:16:06,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:16:06,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:16:06,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:16:06,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:16:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:16:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:16:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-10-03 15:16:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:16:31,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 15:16:31,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:16:31,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:16:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1289477314, now seen corresponding path program 4 times [2022-10-03 15:16:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:16:31,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2160072] [2022-10-03 15:16:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:16:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:16:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:16:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 12436 trivial. 0 not checked. [2022-10-03 15:16:38,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:16:38,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2160072] [2022-10-03 15:16:38,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2160072] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:16:38,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:16:38,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 15:16:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708012951] [2022-10-03 15:16:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:16:38,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 15:16:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:16:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 15:16:38,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3592, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 15:16:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:38,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:16:38,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 18.612903225806452) internal successors, (1154), 62 states have internal predecessors, (1154), 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:16:38,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:38,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-10-03 15:16:38,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:16:38,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-10-03 15:16:38,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2022-10-03 15:16:38,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:16:38,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:16:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-03 15:16:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:16:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:16:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:16:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:16:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:16:59,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-03 15:16:59,260 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:16:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:16:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 942179766, now seen corresponding path program 1 times [2022-10-03 15:16:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:16:59,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308520361] [2022-10-03 15:16:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:16:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:17:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:17:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12214 backedges. 1271 proven. 0 refuted. 0 times theorem prover too weak. 10943 trivial. 0 not checked. [2022-10-03 15:17:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:17:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308520361] [2022-10-03 15:17:05,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308520361] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:17:05,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:17:05,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 15:17:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793505632] [2022-10-03 15:17:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:17:05,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 15:17:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:17:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 15:17:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5033, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 15:17:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:05,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:17:05,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 17.041095890410958) internal successors, (1244), 73 states have internal predecessors, (1244), 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:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-03 15:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:17:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-03 15:17:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:17:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:17:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:17:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:17:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:17:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:17:29,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 15:17:29,141 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:17:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:17:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1718348392, now seen corresponding path program 1 times [2022-10-03 15:17:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:17:29,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951679589] [2022-10-03 15:17:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:17:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:17:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:17:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14214 backedges. 1642 proven. 0 refuted. 0 times theorem prover too weak. 12572 trivial. 0 not checked. [2022-10-03 15:17:36,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:17:36,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951679589] [2022-10-03 15:17:36,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951679589] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:17:36,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:17:36,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-10-03 15:17:36,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388193086] [2022-10-03 15:17:36,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:17:36,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-10-03 15:17:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:17:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-10-03 15:17:36,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=6069, Unknown=0, NotChecked=0, Total=6320 [2022-10-03 15:17:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:36,250 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:17:36,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 15.9) internal successors, (1272), 80 states have internal predecessors, (1272), 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:17:36,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-10-03 15:17:36,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-03 15:18:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 15:18:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-10-03 15:18:05,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-03 15:18:05,259 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:18:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:18:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash 47318358, now seen corresponding path program 1 times [2022-10-03 15:18:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:18:05,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273438638] [2022-10-03 15:18:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:18:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:18:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:18:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:18:08,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:18:08,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273438638] [2022-10-03 15:18:08,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273438638] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:18:08,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769147509] [2022-10-03 15:18:08,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:18:08,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:18:08,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:18:08,348 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:18:08,349 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:18:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:18:08,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 199 conjunts are in the unsatisfiable core [2022-10-03 15:18:08,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:18:09,401 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:18:10,475 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:18:10,482 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:18:12,271 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:18:12,271 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:18:12,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:18:12,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-10-03 15:18:12,972 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:18:12,978 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 34 treesize of output 32 [2022-10-03 15:18:19,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:18:19,295 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 39 treesize of output 38 [2022-10-03 15:18:19,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:18:19,311 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:18:23,798 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 15 treesize of output 7 [2022-10-03 15:18:23,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-10-03 15:18:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 15:18:24,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:18:26,467 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 0) (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-10-03 15:18:26,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 0) (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-10-03 15:18:26,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 0) (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-10-03 15:18:26,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse0 0)))) is different from false [2022-10-03 15:18:26,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse0 0))))) is different from false [2022-10-03 15:18:26,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse0 0))))) is different from false [2022-10-03 15:18:27,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#in~self#1.base|) |c_ULTIMATE.start_fifo_pop_#in~self#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 0) (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 15:18:27,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 0) (< (+ 19 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-10-03 15:18:28,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int))) (let ((.cse1 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_2850))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_2851) .cse2 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ 19 .cse0) (select |c_#length| (select (select (store .cse1 .cse2 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse0 0)))))) is different from false [2022-10-03 15:18:28,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int))) (let ((.cse1 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_2850))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_2851) .cse2 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ 19 .cse0) (select |c_#length| (select (select (store .cse1 .cse2 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse0 0)))))) is different from false [2022-10-03 15:18:28,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_2850))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_2851) .cse2 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 0) (< (+ 19 .cse0) (select |c_#length| (select (select (store .cse1 .cse2 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-10-03 15:18:28,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_2850))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_2851) .cse2 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< (+ 19 .cse0) (select |c_#length| (select (select (store .cse1 .cse2 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< .cse0 0)))))) is different from false [2022-10-03 15:18:28,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2849 Int) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2850 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_2850))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_2851) .cse2 v_ArrVal_2852) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse0 0) (< (+ 19 .cse0) (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_2849) (select (select (store .cse1 .cse2 v_ArrVal_2853) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-10-03 15:18:31,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:18:31,718 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 113 treesize of output 89 [2022-10-03 15:18:31,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:18:31,731 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 81 treesize of output 73 [2022-10-03 15:18:31,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:18:31,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 399 treesize of output 362 [2022-10-03 15:18:31,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:18:31,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1891 treesize of output 1818 [2022-10-03 15:18:31,779 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 1570 treesize of output 1506 [2022-10-03 15:18:31,791 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 1739 treesize of output 1699 [2022-10-03 15:18:31,804 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 1592 treesize of output 1492 [2022-10-03 15:18:31,826 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 1599 treesize of output 1519 Received shutdown request... [2022-10-03 15:26:50,036 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:26:50,043 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:26:50,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:26:50,047 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-10-03 15:26:50,050 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:26:50,070 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:26:50,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:26:50,251 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 823 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 42ms.. [2022-10-03 15:26:50,254 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-10-03 15:26:50,256 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:26:50,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:26:50,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:26:50,263 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1133.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:26:50 BasicIcfg [2022-10-03 15:26:50,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:26:50,264 INFO L158 Benchmark]: Toolchain (without parser) took 765319.04ms. Allocated memory was 197.1MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 146.9MB in the beginning and 983.5MB in the end (delta: -836.6MB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-10-03 15:26:50,264 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:26:50,264 INFO L158 Benchmark]: Boogie Preprocessor took 129.46ms. Allocated memory is still 197.1MB. Free memory was 146.9MB in the beginning and 140.4MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:26:50,265 INFO L158 Benchmark]: RCFGBuilder took 1359.69ms. Allocated memory was 197.1MB in the beginning and 287.3MB in the end (delta: 90.2MB). Free memory was 140.4MB in the beginning and 189.0MB in the end (delta: -48.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-10-03 15:26:50,265 INFO L158 Benchmark]: TraceAbstraction took 763820.40ms. Allocated memory was 287.3MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 188.5MB in the beginning and 983.5MB in the end (delta: -795.0MB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-10-03 15:26:50,269 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 197.1MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 129.46ms. Allocated memory is still 197.1MB. Free memory was 146.9MB in the beginning and 140.4MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1359.69ms. Allocated memory was 197.1MB in the beginning and 287.3MB in the end (delta: 90.2MB). Free memory was 140.4MB in the beginning and 189.0MB in the end (delta: -48.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 763820.40ms. Allocated memory was 287.3MB in the beginning and 4.7GB in the end (delta: 4.4GB). Free memory was 188.5MB in the beginning and 983.5MB in the end (delta: -795.0MB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 160, positive: 152, positive conditional: 152, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 605, positive: 584, positive conditional: 584, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 586, Positive conditional cache size: 0, Positive unconditional cache size: 586, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 29, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 15308, positive: 14844, positive conditional: 14844, positive unconditional: 0, negative: 464, negative conditional: 464, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 13508, Positive cache size: 13476, Positive conditional cache size: 0, Positive unconditional cache size: 13476, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Independence queries for same thread: 461, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31366, positive: 30368, positive conditional: 30368, positive unconditional: 0, negative: 998, negative conditional: 998, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 26624, Positive cache size: 26503, Positive conditional cache size: 0, Positive unconditional cache size: 26503, Negative cache size: 121, Negative conditional cache size: 0, Negative unconditional cache size: 121, Independence queries for same thread: 1314, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31408, positive: 30414, positive conditional: 30414, positive unconditional: 0, negative: 994, negative conditional: 994, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 26777, Positive cache size: 26655, Positive conditional cache size: 0, Positive unconditional cache size: 26655, Negative cache size: 122, Negative conditional cache size: 0, Negative unconditional cache size: 122, Independence queries for same thread: 2163, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31677, positive: 30662, positive conditional: 30662, positive unconditional: 0, negative: 1015, negative conditional: 1015, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 31606, Positive cache size: 31467, Positive conditional cache size: 0, Positive unconditional cache size: 31467, Negative cache size: 139, Negative conditional cache size: 0, Negative unconditional cache size: 139, Independence queries for same thread: 3032, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 32342, positive: 31315, positive conditional: 31315, positive unconditional: 0, negative: 1027, negative conditional: 1027, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 32163, Positive cache size: 32021, Positive conditional cache size: 0, Positive unconditional cache size: 32021, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Independence queries for same thread: 3909, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31065, positive: 30079, positive conditional: 30079, positive unconditional: 0, negative: 986, negative conditional: 986, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 32414, Positive cache size: 32272, Positive conditional cache size: 0, Positive unconditional cache size: 32272, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Independence queries for same thread: 4750, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31646, positive: 30641, positive conditional: 30641, positive unconditional: 0, negative: 1005, negative conditional: 1005, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 32636, Positive cache size: 32494, Positive conditional cache size: 0, Positive unconditional cache size: 32494, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Independence queries for same thread: 5610, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3215, positive: 3107, positive conditional: 3107, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 208792, positive: 202166, positive conditional: 202166, positive unconditional: 0, negative: 6626, negative conditional: 6626, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203074, positive: 202166, positive conditional: 0, positive unconditional: 202166, negative: 908, negative conditional: 0, negative unconditional: 908, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32655, positive: 32513, positive conditional: 0, positive unconditional: 32513, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 203074, positive: 169653, positive conditional: 0, positive unconditional: 169653, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 32655, unknown conditional: 0, unknown unconditional: 32655] , Statistics on independence cache: Total cache size (in pairs): 32655, Positive cache size: 32513, Positive conditional cache size: 0, Positive unconditional cache size: 32513, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Independence queries for same thread: 5718, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1133]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 823 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 42ms.. - 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: 763.6s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 171.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 845, 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.7s SsaConstructionTime, 11.3s SatisfiabilityAnalysisTime, 53.6s InterpolantComputationTime, 31311 NumberOfCodeBlocks, 31311 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 34654 ConstructedInterpolants, 22 QuantifiedInterpolants, 148107 SizeOfPredicates, 97 NumberOfNonLiveVariables, 8382 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 101738/107028 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