java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/heapseparator/speedup-poc05-04.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:53:44,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:53:44,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:53:44,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:53:44,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:53:44,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:53:44,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:53:44,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:53:44,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:53:44,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:53:44,274 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:53:44,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:53:44,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:53:44,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:53:44,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:53:44,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:53:44,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:53:44,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:53:44,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:53:44,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:53:44,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:53:44,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:53:44,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:53:44,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:53:44,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:53:44,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:53:44,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:53:44,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:53:44,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:53:44,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:53:44,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:53:44,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:53:44,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:53:44,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:53:44,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:53:44,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:53:44,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:53:44,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:53:44,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:53:44,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:53:44,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:53:44,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:53:44,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:53:44,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:53:44,373 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:53:44,374 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:53:44,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc05-04.bpl [2019-08-05 09:53:44,378 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc05-04.bpl' [2019-08-05 09:53:44,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:53:44,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:53:44,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:53:44,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:53:44,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:53:44,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:53:44,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:53:44,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:53:44,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:53:44,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... [2019-08-05 09:53:44,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:53:44,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:53:44,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:53:44,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:53:44,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 09:53:44,599 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-08-05 09:53:44,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 09:53:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 09:53:45,247 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 09:53:45,248 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 09:53:45,249 INFO L202 PluginConnector]: Adding new model speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:53:45 BoogieIcfgContainer [2019-08-05 09:53:45,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:53:45,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:53:45,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:53:45,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:53:45,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:44" (1/2) ... [2019-08-05 09:53:45,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31839f27 and model type speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:53:45, skipping insertion in model container [2019-08-05 09:53:45,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:53:45" (2/2) ... [2019-08-05 09:53:45,258 INFO L109 eAbstractionObserver]: Analyzing ICFG speedup-poc05-04.bpl [2019-08-05 09:53:45,268 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:53:45,276 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 09:53:45,294 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 09:53:45,321 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:53:45,322 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:53:45,322 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:53:45,322 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:53:45,322 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:53:45,323 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:53:45,323 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:53:45,323 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:53:45,323 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:53:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 09:53:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 09:53:45,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:45,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 09:53:45,360 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-08-05 09:53:45,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:53:45,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:45,525 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_68|], 1=[|v_#valid_42|]} [2019-08-05 09:53:45,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:45,772 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 12 [2019-08-05 09:53:45,773 INFO L341 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2019-08-05 09:53:45,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2019-08-05 09:53:45,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:53:45,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:53:45,841 INFO L375 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 [2019-08-05 09:53:45,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 09:53:45,959 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 09:53:45,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:53:45,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 09:53:45,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:24, output treesize:25 [2019-08-05 09:53:46,109 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-08-05 09:53:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:46,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:53:46,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 09:53:46,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:53:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:53:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:53:46,135 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 09:53:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:46,390 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 09:53:46,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:53:46,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 09:53:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:46,403 INFO L225 Difference]: With dead ends: 18 [2019-08-05 09:53:46,403 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 09:53:46,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:53:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 09:53:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-08-05 09:53:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 09:53:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 09:53:46,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 2 [2019-08-05 09:53:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:46,441 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 09:53:46,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:53:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 09:53:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 09:53:46,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:46,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 09:53:46,444 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:46,444 INFO L82 PathProgramCache]: Analyzing trace with hash 30944, now seen corresponding path program 1 times [2019-08-05 09:53:46,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:46,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:53:46,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:46,486 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_69|], 2=[|v_#valid_43|]} [2019-08-05 09:53:46,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:46,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:46,677 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-08-05 09:53:46,677 INFO L341 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2019-08-05 09:53:46,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2019-08-05 09:53:46,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:53:46,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:53:46,772 INFO L375 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 14 treesize of output 12 [2019-08-05 09:53:46,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 09:53:46,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:53:46,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 09:53:46,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:29 [2019-08-05 09:53:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:46,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:53:46,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 09:53:46,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:53:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:53:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:53:46,918 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 3 states. [2019-08-05 09:53:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:46,971 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 09:53:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:53:46,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 09:53:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:46,973 INFO L225 Difference]: With dead ends: 15 [2019-08-05 09:53:46,973 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 09:53:46,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:53:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 09:53:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2019-08-05 09:53:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 09:53:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 09:53:46,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 3 [2019-08-05 09:53:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:46,977 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 09:53:46,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:53:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 09:53:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 09:53:46,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:46,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 09:53:46,978 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 31500, now seen corresponding path program 1 times [2019-08-05 09:53:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:47,163 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 09:53:47,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:47,192 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_74|], 21=[|v_#valid_47|]} [2019-08-05 09:53:47,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:47,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:47,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:47,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:47,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:47,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:53:47,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-08-05 09:53:47,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:53:47,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:53:47,821 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2019-08-05 09:53:47,821 INFO L341 Elim1Store]: treesize reduction 93, result has 30.1 percent of original size [2019-08-05 09:53:47,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 78 [2019-08-05 09:53:47,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 09:53:47,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:53:47,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:53:47,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:65 [2019-08-05 09:53:47,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:47,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:47,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:47,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:47,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 09:53:48,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 09:53:48,840 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_44, v_prenex_223, v_prenex_161, v_prenex_65], 10=[v_prenex_66, v_prenex_67, |v_#valid_48|, v_prenex_27, v_prenex_119, v_prenex_219, v_prenex_97, v_prenex_84, v_prenex_62, v_prenex_41, v_prenex_232, v_prenex_156, v_prenex_178, v_prenex_236, v_prenex_158, v_prenex_106, |v_#valid_44|, v_prenex_186, v_prenex_152, v_prenex_174], 14=[v_prenex_122, v_prenex_11, v_prenex_54], 16=[v_prenex_88, v_prenex_55, v_prenex_12, v_prenex_209, v_prenex_73, v_prenex_110, v_prenex_165, v_prenex_143, v_prenex_101, v_prenex_126, v_prenex_203, v_prenex_192, v_prenex_150, v_prenex_230], 18=[v_prenex_4], 21=[v_prenex_177, v_prenex_115, v_prenex_26, |v_#memory_int_75|, v_prenex_93, v_prenex_80, v_prenex_182, |v_#memory_int_71|, v_prenex_170], 22=[v_prenex_146, v_prenex_109, v_prenex_164], 24=[v_prenex_33, v_prenex_201, v_prenex_5, v_prenex_217, |v_#valid_46|, v_prenex_19], 27=[v_prenex_188, v_prenex_225, v_prenex_205, v_prenex_139, v_prenex_72, v_prenex_87], 28=[v_prenex_18, v_prenex_32], 32=[v_prenex_130], 33=[v_prenex_212], 34=[v_prenex_46], 52=[v_prenex_103], 55=[v_prenex_100, v_prenex_132, v_prenex_196], 58=[v_prenex_48, v_prenex_129, v_prenex_195], 61=[v_prenex_45]} [2019-08-05 09:53:48,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-08-05 09:53:48,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:54:09,366 WARN L188 SmtUtils]: Spent 20.37 s on a formula simplification that was a NOOP. DAG size: 1848 [2019-08-05 09:54:09,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:54:09,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-08-05 09:54:09,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 09:54:28,902 WARN L188 SmtUtils]: Spent 19.42 s on a formula simplification that was a NOOP. DAG size: 1839 [2019-08-05 09:54:28,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:54:29,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-08-05 09:54:29,013 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 09:54:47,593 WARN L188 SmtUtils]: Spent 18.58 s on a formula simplification that was a NOOP. DAG size: 1830 [2019-08-05 09:54:47,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:54:47,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-08-05 09:54:47,707 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:06,986 WARN L188 SmtUtils]: Spent 19.28 s on a formula simplification that was a NOOP. DAG size: 1821 [2019-08-05 09:55:06,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:07,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:07,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:07,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:07,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:07,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 87 [2019-08-05 09:55:07,152 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:29,228 WARN L188 SmtUtils]: Spent 22.07 s on a formula simplification that was a NOOP. DAG size: 1820 [2019-08-05 09:55:29,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:29,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:29,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:29,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:29,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 09:55:29,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2019-08-05 09:55:29,345 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:50,362 WARN L188 SmtUtils]: Spent 21.01 s on a formula simplification that was a NOOP. DAG size: 1809 [2019-08-05 09:55:50,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:50,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:50,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 108 [2019-08-05 09:55:50,546 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:11,500 WARN L188 SmtUtils]: Spent 20.95 s on a formula simplification that was a NOOP. DAG size: 1806 [2019-08-05 09:56:11,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:11,656 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:11,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 108 [2019-08-05 09:56:11,658 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:33,913 WARN L188 SmtUtils]: Spent 22.25 s on a formula simplification that was a NOOP. DAG size: 1803 [2019-08-05 09:56:33,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:34,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:34,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 108 [2019-08-05 09:56:34,130 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:56,341 WARN L188 SmtUtils]: Spent 22.21 s on a formula simplification that was a NOOP. DAG size: 1800 [2019-08-05 09:56:56,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:56,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-08-05 09:56:56,450 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-05 09:57:42,912 WARN L188 SmtUtils]: Spent 46.46 s on a formula simplification. DAG size of input: 1796 DAG size of output: 1790 [2019-08-05 09:57:42,914 INFO L567 ElimStorePlain]: treesize reduction 12, result has 99.8 percent of original size [2019-08-05 09:57:43,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:57:43,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 108 [2019-08-05 09:57:43,046 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-08-05 09:58:07,803 WARN L188 SmtUtils]: Spent 24.75 s on a formula simplification that was a NOOP. DAG size: 1787 [2019-08-05 09:58:07,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:58:07,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:58:07,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 108 [2019-08-05 09:58:07,979 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. Received shutdown request... [2019-08-05 09:58:30,627 WARN L196 SmtUtils]: Removed 8 from assertion stack [2019-08-05 09:58:30,628 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 09:58:30,628 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 09:58:30,632 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 09:58:30,633 INFO L202 PluginConnector]: Adding new model speedup-poc05-04.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:58:30 BoogieIcfgContainer [2019-08-05 09:58:30,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:58:30,635 INFO L168 Benchmark]: Toolchain (without parser) took 286208.28 ms. Allocated memory was 141.0 MB in the beginning and 161.5 MB in the end (delta: 20.4 MB). Free memory was 110.5 MB in the beginning and 87.5 MB in the end (delta: 23.0 MB). Peak memory consumption was 339.4 MB. Max. memory is 7.1 GB. [2019-08-05 09:58:30,635 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.78 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 09:58:30,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.90 ms. Allocated memory is still 141.0 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:58:30,637 INFO L168 Benchmark]: Boogie Preprocessor took 29.10 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:58:30,637 INFO L168 Benchmark]: RCFGBuilder took 723.36 ms. Allocated memory is still 141.0 MB. Free memory was 106.7 MB in the beginning and 86.9 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:58:30,638 INFO L168 Benchmark]: TraceAbstraction took 285382.34 ms. Allocated memory was 141.0 MB in the beginning and 161.5 MB in the end (delta: 20.4 MB). Free memory was 86.5 MB in the beginning and 87.5 MB in the end (delta: -1.0 MB). Peak memory consumption was 315.4 MB. Max. memory is 7.1 GB. [2019-08-05 09:58:30,642 INFO L335 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 1.78 ms. Allocated memory is still 141.0 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.90 ms. Allocated memory is still 141.0 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.10 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 723.36 ms. Allocated memory is still 141.0 MB. Free memory was 106.7 MB in the beginning and 86.9 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 285382.34 ms. Allocated memory was 141.0 MB in the beginning and 161.5 MB in the end (delta: 20.4 MB). Free memory was 86.5 MB in the beginning and 87.5 MB in the end (delta: -1.0 MB). Peak memory consumption was 315.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 4 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 1784 for 22644ms.. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 4 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 1784 for 22644ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 4 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 1784 for 22644ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 59). Cancelled while BasicCegarLoop was analyzing trace of length 4 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 1784 for 22644ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 4 error locations. TIMEOUT Result, 285.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 11 SDslu, 0 SDs, 0 SdLazy, 31 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 3 QuantifiedInterpolants, 121 SizeOfPredicates, 8 NumberOfNonLiveVariables, 27 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown