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_31.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:00:06,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:00:06,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:00:06,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:00:06,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:00:06,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:00:06,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:00:06,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:00:06,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:00:06,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:00:06,953 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:00:06,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:00:06,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:00:06,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:00:06,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:00:06,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:00:06,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:00:06,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:00:06,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:00:06,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:00:06,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:00:06,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:00:06,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:00:06,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:00:06,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:00:06,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:00:06,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:00:06,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:00:06,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:00:06,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:00:06,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:00:06,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:00:06,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:00:06,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:00:06,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:00:06,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:00:06,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:00:06,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:00:06,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:00:06,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:00:06,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:00:07,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:00:07,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:00:07,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:00:07,029 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:00:07,030 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:00:07,031 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_31.bpl [2019-08-05 11:00:07,032 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_31.bpl' [2019-08-05 11:00:07,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:00:07,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:00:07,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:07,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:00:07,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:00:07,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:07,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:00:07,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:00:07,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:00:07,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/1) ... [2019-08-05 11:00:07,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:00:07,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:00:07,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:00:07,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:00:07,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (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:00:07,277 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:00:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:00:07,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:00:07,819 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:00:07,819 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:00:07,820 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:07 BoogieIcfgContainer [2019-08-05 11:00:07,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:00:07,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:00:07,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:00:07,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:00:07,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:07" (1/2) ... [2019-08-05 11:00:07,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8cdad and model type alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:00:07, skipping insertion in model container [2019-08-05 11:00:07,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:07" (2/2) ... [2019-08-05 11:00:07,830 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl [2019-08-05 11:00:07,839 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:00:07,847 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:00:07,864 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:00:07,893 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:00:07,893 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:00:07,894 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:00:07,894 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:00:07,894 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:00:07,895 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:00:07,895 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:00:07,895 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:00:07,895 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:00:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:00:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:00:07,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:07,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:00:07,919 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash 889560929, now seen corresponding path program 1 times [2019-08-05 11:00:07,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:08,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:00:08,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:08,185 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:00:08,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:08,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:08,237 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:00:08,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:00:08,411 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:00:08,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:08,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:00:08,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:00:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:00:08,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:08,435 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 11:00:08,647 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:00:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:09,098 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 11:00:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:00:09,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:00:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:09,109 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:00:09,110 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:00:09,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:00:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:00:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2019-08-05 11:00:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:00:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:00:09,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:00:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:09,146 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:00:09,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:00:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:00:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:00:09,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:09,147 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:00:09,148 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash 169626921, now seen corresponding path program 1 times [2019-08-05 11:00:09,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:09,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:00:09,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:09,309 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:00:09,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:09,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:09,353 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:00:09,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 11:00:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:00:09,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:09,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:00:09,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:00:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:00:09,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:00:09,392 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 11:00:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:09,500 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:00:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:00:09,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:00:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:09,501 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:00:09,502 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:00:09,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:00:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:00:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:00:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:00:09,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:00:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:09,506 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:00:09,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:00:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:00:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:00:09,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:09,507 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:00:09,508 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1917769187, now seen corresponding path program 1 times [2019-08-05 11:00:09,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:09,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:00:09,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:09,808 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:00:09,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:09,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:09,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:09,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-08-05 11:00:10,023 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 23 treesize of output 13 [2019-08-05 11:00:10,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:10,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:10,085 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:00:10,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-08-05 11:00:10,259 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:00:10,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:00:10,390 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:00:10,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:10,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:10,445 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 22 treesize of output 10 [2019-08-05 11:00:10,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:10,683 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-08-05 11:00:10,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:10,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:10,685 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:42 [2019-08-05 11:00:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:10,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:10,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:00:10,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:00:10,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:00:10,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:00:10,800 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 11:00:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:11,069 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 11:00:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:00:11,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:00:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:11,071 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:00:11,071 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:00:11,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:00:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:00:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:00:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:00:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:00:11,075 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:00:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:11,076 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:00:11,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:00:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:00:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:00:11,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:11,077 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:00:11,077 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:11,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1744693219, now seen corresponding path program 2 times [2019-08-05 11:00:11,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:11,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:00:11,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:11,153 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 11:00:11,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:11,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:00:11,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:00:11,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:00:11,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:00:11,155 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-08-05 11:00:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:11,163 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2019-08-05 11:00:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:00:11,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 11:00:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:11,164 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:00:11,164 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:00:11,164 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 11:00:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:00:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:00:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:00:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:00:11,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 11:00:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:11,166 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:00:11,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:00:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:00:11,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:00:11,172 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:00:11 BoogieIcfgContainer [2019-08-05 11:00:11,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:00:11,174 INFO L168 Benchmark]: Toolchain (without parser) took 4055.51 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 111.7 MB in the beginning and 171.1 MB in the end (delta: -59.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:11,175 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 ms. Allocated memory is still 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:00:11,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.23 ms. Allocated memory is still 134.7 MB. Free memory was 111.5 MB in the beginning and 109.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:11,177 INFO L168 Benchmark]: Boogie Preprocessor took 35.06 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 108.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:11,177 INFO L168 Benchmark]: RCFGBuilder took 619.26 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 88.0 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:11,178 INFO L168 Benchmark]: TraceAbstraction took 3349.29 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 87.8 MB in the beginning and 171.1 MB in the end (delta: -83.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:00:11,182 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.29 ms. Allocated memory is still 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.23 ms. Allocated memory is still 134.7 MB. Free memory was 111.5 MB in the beginning and 109.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.06 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 108.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 619.26 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 88.0 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3349.29 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 87.8 MB in the beginning and 171.1 MB in the end (delta: -83.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 221]: 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.2s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 9 SDslu, 26 SDs, 0 SdLazy, 63 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 4 QuantifiedInterpolants, 2607 SizeOfPredicates, 69 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 11/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...