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_39.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:57:51,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:57:51,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:57:51,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:57:51,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:57:51,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:57:51,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:57:51,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:57:51,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:57:51,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:57:51,638 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:57:51,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:57:51,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:57:51,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:57:51,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:57:51,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:57:51,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:57:51,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:57:51,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:57:51,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:57:51,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:57:51,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:57:51,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:57:51,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:57:51,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:57:51,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:57:51,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:57:51,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:57:51,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:57:51,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:57:51,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:57:51,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:57:51,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:57:51,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:57:51,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:57:51,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:57:51,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:57:51,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:57:51,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:57:51,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:57:51,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:57:51,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:57:51,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:57:51,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:57:51,721 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:57:51,722 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:57:51,722 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_39.bpl [2019-08-05 10:57:51,723 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_39.bpl' [2019-08-05 10:57:51,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:57:51,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:57:51,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:51,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:57:51,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:57:51,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:51,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:57:51,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:57:51,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:57:51,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/1) ... [2019-08-05 10:57:51,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:57:51,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:57:51,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:57:51,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:57:51,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (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 10:57:51,981 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:57:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:57:51,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:57:52,561 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:57:52,561 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:57:52,562 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:52 BoogieIcfgContainer [2019-08-05 10:57:52,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:57:52,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:57:52,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:57:52,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:57:52,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:51" (1/2) ... [2019-08-05 10:57:52,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20aa167a and model type alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:57:52, skipping insertion in model container [2019-08-05 10:57:52,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:52" (2/2) ... [2019-08-05 10:57:52,574 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl [2019-08-05 10:57:52,585 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:57:52,593 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:57:52,607 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:57:52,638 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:57:52,639 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:57:52,639 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:57:52,639 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:57:52,639 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:57:52,639 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:57:52,640 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:57:52,640 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:57:52,640 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:57:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:57:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:57:52,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:52,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:57:52,666 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:52,671 INFO L82 PathProgramCache]: Analyzing trace with hash 889539725, now seen corresponding path program 1 times [2019-08-05 10:57:52,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:52,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:57:52,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:52,912 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 10:57:52,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:52,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:52,976 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 10:57:52,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:53,130 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 10:57:53,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:53,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:57:53,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:53,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:53,150 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 10:57:53,447 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-08-05 10:57:53,676 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-08-05 10:57:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:53,801 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:57:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:57:53,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:57:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:53,811 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:57:53,811 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:57:53,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:57:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:57:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:57:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:57:53,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:57:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:53,844 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:57:53,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:57:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:57:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:57:53,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:53,845 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:57:53,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 149228673, now seen corresponding path program 1 times [2019-08-05 10:57:53,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:53,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:57:53,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:54,032 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 10:57:54,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:54,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:54,067 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 10:57:54,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 10:57:54,121 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 10:57:54,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:54,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:57:54,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:54,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:54,124 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 10:57:54,306 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-08-05 10:57:54,656 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-08-05 10:57:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:54,730 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:57:54,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:57:54,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:57:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:54,732 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:57:54,732 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:57:54,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:57:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:57:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:57:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:57:54,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:57:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:54,737 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:57:54,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:57:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:57:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:57:54,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:54,738 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:57:54,738 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:54,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 775146019, now seen corresponding path program 1 times [2019-08-05 10:57:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:54,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:57:54,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:55,036 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 10:57:55,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:55,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:55,078 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 10:57:55,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:55,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:55,092 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 10:57:55,093 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:55,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:55,124 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 10:57:55,125 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:21 [2019-08-05 10:57:55,400 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 10:57:55,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:55,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:55,426 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 10:57:55,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:55,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:55,445 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 10:57:55,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-08-05 10:57:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:55,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:55,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:57:55,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:57:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:57:55,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:55,522 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 10:57:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:55,748 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:57:55,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:57:55,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:57:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:55,750 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:57:55,750 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:57:55,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:57:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:57:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:57:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:57:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:57:55,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:57:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:55,755 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:57:55,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:57:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:57:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:57:55,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:55,756 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:57:55,756 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1886026903, now seen corresponding path program 2 times [2019-08-05 10:57:55,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:55,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:57:55,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:57:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:55,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:57:55,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:57:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:57:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:57:55,877 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-08-05 10:57:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:55,923 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:57:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:57:55,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 10:57:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:55,925 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:57:55,925 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:57:55,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 10:57:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:57:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:57:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:57:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:57:55,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 10:57:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:55,928 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:57:55,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:57:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:57:55,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:57:55,936 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:57:55 BoogieIcfgContainer [2019-08-05 10:57:55,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:57:55,939 INFO L168 Benchmark]: Toolchain (without parser) took 4156.85 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 110.5 MB in the beginning and 50.4 MB in the end (delta: 60.1 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:55,940 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:57:55,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 133.7 MB. Free memory was 110.5 MB in the beginning and 108.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:55,951 INFO L168 Benchmark]: Boogie Preprocessor took 54.80 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:55,952 INFO L168 Benchmark]: RCFGBuilder took 666.52 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 84.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:55,953 INFO L168 Benchmark]: TraceAbstraction took 3371.89 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 84.6 MB in the beginning and 50.4 MB in the end (delta: 34.1 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:55,960 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.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 133.7 MB. Free memory was 110.5 MB in the beginning and 108.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.80 ms. Allocated memory is still 133.7 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 666.52 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 84.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3371.89 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 84.6 MB in the beginning and 50.4 MB in the end (delta: 34.1 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 219]: 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, 8 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 16 SDslu, 25 SDs, 0 SdLazy, 73 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=3, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 2 QuantifiedInterpolants, 1932 SizeOfPredicates, 61 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...