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/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:03:58,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:03:58,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:03:58,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:03:58,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:03:58,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:03:58,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:03:58,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:03:58,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:03:58,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:03:58,863 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:03:58,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:03:58,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:03:58,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:03:58,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:03:58,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:03:58,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:03:58,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:03:58,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:03:58,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:03:58,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:03:58,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:03:58,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:03:58,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:03:58,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:03:58,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:03:58,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:03:58,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:03:58,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:03:58,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:03:58,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:03:58,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:03:58,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:03:58,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:03:58,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:03:58,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:03:58,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:03:58,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:03:58,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:03:58,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:03:58,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:03:58,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:03:58,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:03:58,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:03:58,935 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:03:58,935 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:03:58,936 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl [2019-08-05 11:03:58,936 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl' [2019-08-05 11:03:58,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:03:59,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:03:59,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:59,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:03:59,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:03:59,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:59,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:03:59,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:03:59,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:03:59,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/1) ... [2019-08-05 11:03:59,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:03:59,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:03:59,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:03:59,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:03:59,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (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 11:03:59,156 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:03:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:03:59,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:03:59,786 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:03:59,787 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:03:59,788 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:59 BoogieIcfgContainer [2019-08-05 11:03:59,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:03:59,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:03:59,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:03:59,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:03:59,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:58" (1/2) ... [2019-08-05 11:03:59,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5ce6eb and model type alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:03:59, skipping insertion in model container [2019-08-05 11:03:59,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:59" (2/2) ... [2019-08-05 11:03:59,796 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl [2019-08-05 11:03:59,806 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:03:59,814 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:03:59,831 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:03:59,857 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:03:59,858 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:03:59,858 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:03:59,858 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:03:59,858 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:03:59,859 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:03:59,859 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:03:59,859 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:03:59,859 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:03:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:03:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:03:59,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:59,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:03:59,884 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 149184785, now seen corresponding path program 1 times [2019-08-05 11:03:59,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:00,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:04:00,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:00,143 INFO L375 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 [2019-08-05 11:04:00,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:00,594 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:04:00,613 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 11:04:00,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:00,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:04:00,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:00,642 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 7 states. [2019-08-05 11:04:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:01,299 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:04:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:04:01,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:04:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:01,319 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:04:01,319 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:04:01,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:04:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-08-05 11:04:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:04:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:04:01,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2019-08-05 11:04:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:01,368 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:04:01,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:04:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:04:01,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:01,369 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:01,372 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1632710475, now seen corresponding path program 1 times [2019-08-05 11:04:01,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:01,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:01,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:01,672 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:04:01,717 INFO L375 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 [2019-08-05 11:04:01,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:01,834 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:04:01,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:01,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:01,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 11:04:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:02,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:02,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:04:02,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:04:02,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:04:02,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:02,036 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-08-05 11:04:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:02,382 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:04:02,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:02,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:04:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:02,384 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:04:02,384 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:04:02,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:04:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:04:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:04:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:04:02,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2019-08-05 11:04:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:02,388 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:04:02,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:04:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:04:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:04:02,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:02,389 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:02,390 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 271750501, now seen corresponding path program 1 times [2019-08-05 11:04:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:02,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:04:02,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:04:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:02,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:04:02,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:02,743 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2019-08-05 11:04:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:03,250 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:04:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:04:03,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:04:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:03,258 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:04:03,259 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:04:03,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:04:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:04:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:04:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:04:03,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-08-05 11:04:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:03,265 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:04:03,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:04:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:04:03,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:03,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:03,267 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:03,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:03,268 INFO L82 PathProgramCache]: Analyzing trace with hash 986193113, now seen corresponding path program 1 times [2019-08-05 11:04:03,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:03,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:04:03,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:03,530 INFO L375 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 [2019-08-05 11:04:03,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:03,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:03,583 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,594 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:21 [2019-08-05 11:04:03,722 INFO L375 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 17 treesize of output 9 [2019-08-05 11:04:03,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,743 INFO L375 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 [2019-08-05 11:04:03,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:03,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:03,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-08-05 11:04:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:04:03,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:03,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:04:03,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:03,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:03,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:03,807 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-08-05 11:04:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:04,147 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-08-05 11:04:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:04:04,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 11:04:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:04,150 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:04:04,151 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:04:04,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:04:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-08-05 11:04:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:04:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 11:04:04,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-08-05 11:04:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:04,155 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 11:04:04,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 11:04:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:04:04,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:04,157 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:04,157 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137965, now seen corresponding path program 2 times [2019-08-05 11:04:04,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:04,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:04:04,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:04,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:04,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:04,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:04,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:04:04,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:04,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:04,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:04,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2019-08-05 11:04:04,461 INFO L375 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 19 treesize of output 7 [2019-08-05 11:04:04,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:04,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:04,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:04,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-08-05 11:04:04,557 INFO L375 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 19 treesize of output 11 [2019-08-05 11:04:04,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:04,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:04,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:04,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:14 [2019-08-05 11:04:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:04,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:04,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:04,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:04:04,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:04:04,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:04,678 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2019-08-05 11:04:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:05,156 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-08-05 11:04:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:04:05,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 11:04:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:05,157 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:04:05,157 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:04:05,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:04:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:04:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:04:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:04:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-08-05 11:04:05,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-08-05 11:04:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:05,161 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-08-05 11:04:05,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:04:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-08-05 11:04:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:04:05,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:05,162 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:05,163 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:05,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2027916639, now seen corresponding path program 3 times [2019-08-05 11:04:05,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:05,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:04:05,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:04:05,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:05,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:04:05,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:04:05,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:04:05,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:04:05,253 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-08-05 11:04:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:05,277 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:04:05,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:04:05,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 11:04:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:05,278 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:04:05,278 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:04:05,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 11:04:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:04:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:04:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:04:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:04:05,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-08-05 11:04:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:05,279 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:04:05,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:04:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:04:05,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:04:05,285 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:04:05 BoogieIcfgContainer [2019-08-05 11:04:05,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:04:05,287 INFO L168 Benchmark]: Toolchain (without parser) took 6287.05 ms. Allocated memory was 132.6 MB in the beginning and 240.6 MB in the end (delta: 108.0 MB). Free memory was 109.4 MB in the beginning and 201.8 MB in the end (delta: -92.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:05,288 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory is still 111.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:04:05,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.10 ms. Allocated memory is still 132.6 MB. Free memory was 109.0 MB in the beginning and 107.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:05,289 INFO L168 Benchmark]: Boogie Preprocessor took 34.14 ms. Allocated memory is still 132.6 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:05,290 INFO L168 Benchmark]: RCFGBuilder took 709.48 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 80.4 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:05,291 INFO L168 Benchmark]: TraceAbstraction took 5495.49 ms. Allocated memory was 132.6 MB in the beginning and 240.6 MB in the end (delta: 108.0 MB). Free memory was 80.0 MB in the beginning and 201.8 MB in the end (delta: -121.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:04:05,294 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 0.22 ms. Allocated memory is still 132.6 MB. Free memory is still 111.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.10 ms. Allocated memory is still 132.6 MB. Free memory was 109.0 MB in the beginning and 107.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.14 ms. Allocated memory is still 132.6 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 709.48 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 80.4 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5495.49 ms. Allocated memory was 132.6 MB in the beginning and 240.6 MB in the end (delta: 108.0 MB). Free memory was 80.0 MB in the beginning and 201.8 MB in the end (delta: -121.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 29 SDtfs, 89 SDslu, 64 SDs, 0 SdLazy, 240 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=5, 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, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 74 ConstructedInterpolants, 12 QuantifiedInterpolants, 8060 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1378 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 30/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...