java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:28:56,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:28:56,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:28:56,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:28:56,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:28:56,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:28:56,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:28:56,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:28:56,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:28:56,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:28:56,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:28:56,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:28:56,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:28:56,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:28:56,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:28:56,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:28:56,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:28:56,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:28:56,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:28:56,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:28:56,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:28:56,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:28:56,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:28:56,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:28:56,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:28:56,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:28:56,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:28:56,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:28:56,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:28:56,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:28:56,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:28:56,666 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:28:56,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:28:56,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:28:56,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:28:56,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:28:56,670 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:28:56,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:28:56,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:28:56,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:28:56,686 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:28:56,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:28:56,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:28:56,687 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:28:56,687 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:28:56,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:28:56,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:28:56,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:28:56,779 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:28:56,780 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:28:56,781 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl [2018-07-25 13:28:56,781 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2018-07-25 13:28:56,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:28:56,878 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:28:56,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:28:56,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:28:56,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:28:56,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:28:56,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:28:56,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:28:56,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:28:56,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:56,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:28:56,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:28:56,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:28:56,982 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:28:56,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/1) ... [2018-07-25 13:28:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:28:57,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:28:57,793 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:28:57,794 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:28:57 BoogieIcfgContainer [2018-07-25 13:28:57,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:28:57,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:28:57,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:28:57,799 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:28:57,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:56" (1/2) ... [2018-07-25 13:28:57,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5639e652 and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:28:57, skipping insertion in model container [2018-07-25 13:28:57,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:28:57" (2/2) ... [2018-07-25 13:28:57,804 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2018-07-25 13:28:57,816 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:28:57,828 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:28:57,885 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:28:57,886 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:28:57,886 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:28:57,887 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:28:57,887 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:28:57,887 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:28:57,887 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:28:57,888 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:28:57,888 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:28:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-07-25 13:28:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:28:57,918 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,919 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:57,921 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2018-07-25 13:28:57,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:58,051 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:58,051 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:28:58,057 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:58,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:58,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,076 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-07-25 13:28:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,157 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-07-25 13:28:58,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:58,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-25 13:28:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,173 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:28:58,173 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:28:58,177 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:28:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:28:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:28:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-07-25 13:28:58,241 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-07-25 13:28:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,241 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-07-25 13:28:58,241 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-07-25 13:28:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:28:58,243 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,243 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:58,243 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash -509365433, now seen corresponding path program 1 times [2018-07-25 13:28:58,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:58,282 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:58,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:58,284 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:58,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:58,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,285 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-07-25 13:28:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,328 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-07-25 13:28:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:58,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-07-25 13:28:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,330 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:28:58,330 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:28:58,331 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:28:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:28:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:28:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-07-25 13:28:58,337 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-07-25 13:28:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,337 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-07-25 13:28:58,337 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-07-25 13:28:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:28:58,338 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,339 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:58,339 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1534589203, now seen corresponding path program 1 times [2018-07-25 13:28:58,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 13:28:58,381 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:58,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:58,382 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:58,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:58,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,384 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-07-25 13:28:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,475 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-07-25 13:28:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:58,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-25 13:28:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,480 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:28:58,480 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:28:58,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:28:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:28:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:28:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-07-25 13:28:58,497 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-07-25 13:28:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,498 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-07-25 13:28:58,498 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-07-25 13:28:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:28:58,500 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,500 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:58,501 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1374012501, now seen corresponding path program 1 times [2018-07-25 13:28:58,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-25 13:28:58,553 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:58,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:58,553 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:58,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:58,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,554 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-07-25 13:28:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,629 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-07-25 13:28:58,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:58,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-07-25 13:28:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,632 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:28:58,632 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:28:58,637 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:28:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:28:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:28:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-07-25 13:28:58,651 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2018-07-25 13:28:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,651 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-07-25 13:28:58,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-07-25 13:28:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:28:58,653 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,653 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:58,658 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1892306360, now seen corresponding path program 1 times [2018-07-25 13:28:58,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-25 13:28:58,715 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:58,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:58,716 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:58,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:58,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,717 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2018-07-25 13:28:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,782 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-07-25 13:28:58,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:58,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-25 13:28:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,786 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:28:58,786 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:28:58,787 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:28:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:28:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:28:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-07-25 13:28:58,798 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-07-25 13:28:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,799 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-07-25 13:28:58,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-07-25 13:28:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:28:58,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,800 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:58,801 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1711916507, now seen corresponding path program 1 times [2018-07-25 13:28:58,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 13:28:58,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:58,879 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:28:58,880 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:28:58,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:28:58,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:28:58,881 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-07-25 13:28:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,974 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-07-25 13:28:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:28:58,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-07-25 13:28:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,978 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:28:58,978 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:28:58,979 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:28:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:28:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2018-07-25 13:28:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:28:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2018-07-25 13:28:59,004 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 35 [2018-07-25 13:28:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,005 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2018-07-25 13:28:59,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:28:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2018-07-25 13:28:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:28:59,009 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,010 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:59,010 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1241307517, now seen corresponding path program 2 times [2018-07-25 13:28:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-25 13:28:59,064 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:59,064 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:59,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:59,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:59,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,066 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand 3 states. [2018-07-25 13:28:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,128 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2018-07-25 13:28:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:59,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-07-25 13:28:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,131 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:28:59,131 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:28:59,134 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:28:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-07-25 13:28:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:28:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2018-07-25 13:28:59,158 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 57 [2018-07-25 13:28:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,158 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2018-07-25 13:28:59,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2018-07-25 13:28:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:28:59,161 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,163 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:28:59,163 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash 400604847, now seen corresponding path program 3 times [2018-07-25 13:28:59,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-07-25 13:28:59,210 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:59,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:59,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:59,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:59,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,213 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 3 states. [2018-07-25 13:28:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,272 INFO L93 Difference]: Finished difference Result 178 states and 216 transitions. [2018-07-25 13:28:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:59,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-07-25 13:28:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,276 INFO L225 Difference]: With dead ends: 178 [2018-07-25 13:28:59,277 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:28:59,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:28:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-07-25 13:28:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:28:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2018-07-25 13:28:59,298 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 60 [2018-07-25 13:28:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,299 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2018-07-25 13:28:59,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2018-07-25 13:28:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:28:59,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,301 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 10, 8, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:59,301 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1876623431, now seen corresponding path program 1 times [2018-07-25 13:28:59,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-07-25 13:28:59,355 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:59,355 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:59,356 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:59,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:59,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,357 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 3 states. [2018-07-25 13:28:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,410 INFO L93 Difference]: Finished difference Result 192 states and 228 transitions. [2018-07-25 13:28:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:59,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-07-25 13:28:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,412 INFO L225 Difference]: With dead ends: 192 [2018-07-25 13:28:59,413 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:28:59,414 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:28:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:28:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:28:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-07-25 13:28:59,433 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 67 [2018-07-25 13:28:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,433 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-07-25 13:28:59,434 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-07-25 13:28:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:28:59,438 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,438 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:28:59,439 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,439 INFO L82 PathProgramCache]: Analyzing trace with hash 454555165, now seen corresponding path program 1 times [2018-07-25 13:28:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:28:59,512 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:59,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:59,513 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:59,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:59,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,514 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 3 states. [2018-07-25 13:28:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,565 INFO L93 Difference]: Finished difference Result 171 states and 201 transitions. [2018-07-25 13:28:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:59,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-07-25 13:28:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,567 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:28:59,567 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:28:59,568 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:28:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2018-07-25 13:28:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:28:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2018-07-25 13:28:59,596 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 69 [2018-07-25 13:28:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,596 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-07-25 13:28:59,596 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-07-25 13:28:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:28:59,598 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,598 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:59,598 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1272368871, now seen corresponding path program 1 times [2018-07-25 13:28:59,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 13:28:59,671 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:59,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:59,672 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:59,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:59,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,675 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand 3 states. [2018-07-25 13:28:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,718 INFO L93 Difference]: Finished difference Result 214 states and 250 transitions. [2018-07-25 13:28:59,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:59,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-07-25 13:28:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,722 INFO L225 Difference]: With dead ends: 214 [2018-07-25 13:28:59,722 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:28:59,724 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:28:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:28:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:28:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-07-25 13:28:59,751 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 76 [2018-07-25 13:28:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,752 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-07-25 13:28:59,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-07-25 13:28:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:28:59,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,759 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:59,759 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2095694573, now seen corresponding path program 1 times [2018-07-25 13:28:59,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-07-25 13:28:59,837 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:59,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:28:59,838 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:59,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:59,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,838 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 3 states. [2018-07-25 13:28:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,884 INFO L93 Difference]: Finished difference Result 184 states and 212 transitions. [2018-07-25 13:28:59,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:59,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-07-25 13:28:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,886 INFO L225 Difference]: With dead ends: 184 [2018-07-25 13:28:59,886 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:28:59,887 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:28:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2018-07-25 13:28:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:28:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2018-07-25 13:28:59,904 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 78 [2018-07-25 13:28:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,904 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2018-07-25 13:28:59,904 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-07-25 13:28:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:28:59,906 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,906 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:28:59,906 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1410442679, now seen corresponding path program 1 times [2018-07-25 13:28:59,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 254 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-07-25 13:28:59,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:59,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:28:59,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:28:59,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:28:59,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:28:59,994 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 4 states. [2018-07-25 13:29:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,076 INFO L93 Difference]: Finished difference Result 252 states and 298 transitions. [2018-07-25 13:29:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:00,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-07-25 13:29:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,078 INFO L225 Difference]: With dead ends: 252 [2018-07-25 13:29:00,078 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:29:00,079 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:29:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-07-25 13:29:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:29:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-07-25 13:29:00,096 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 85 [2018-07-25 13:29:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,097 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-07-25 13:29:00,097 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-07-25 13:29:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:29:00,098 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,099 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:00,099 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -308368087, now seen corresponding path program 2 times [2018-07-25 13:29:00,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-07-25 13:29:00,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:00,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:00,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:00,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:00,187 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 4 states. [2018-07-25 13:29:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,261 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2018-07-25 13:29:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:00,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-07-25 13:29:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,263 INFO L225 Difference]: With dead ends: 216 [2018-07-25 13:29:00,263 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:29:00,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:29:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-07-25 13:29:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:29:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-07-25 13:29:00,283 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 88 [2018-07-25 13:29:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,284 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-07-25 13:29:00,284 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-07-25 13:29:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:29:00,285 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,285 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 13, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:00,286 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -192629619, now seen corresponding path program 3 times [2018-07-25 13:29:00,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 321 proven. 18 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-07-25 13:29:00,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:00,408 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:00,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:00,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:00,408 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 5 states. [2018-07-25 13:29:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,506 INFO L93 Difference]: Finished difference Result 296 states and 338 transitions. [2018-07-25 13:29:00,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:00,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-07-25 13:29:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,509 INFO L225 Difference]: With dead ends: 296 [2018-07-25 13:29:00,509 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:29:00,512 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:29:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-07-25 13:29:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:29:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2018-07-25 13:29:00,533 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 95 [2018-07-25 13:29:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,534 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2018-07-25 13:29:00,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2018-07-25 13:29:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:29:00,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,535 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 13, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:29:00,535 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash -28246939, now seen corresponding path program 4 times [2018-07-25 13:29:00,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 348 proven. 16 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-07-25 13:29:00,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:00,681 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:00,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:00,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:00,682 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 5 states. [2018-07-25 13:29:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,779 INFO L93 Difference]: Finished difference Result 246 states and 270 transitions. [2018-07-25 13:29:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:00,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-07-25 13:29:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,781 INFO L225 Difference]: With dead ends: 246 [2018-07-25 13:29:00,782 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:29:00,783 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:29:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-07-25 13:29:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:29:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2018-07-25 13:29:00,807 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 98 [2018-07-25 13:29:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,808 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2018-07-25 13:29:00,808 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2018-07-25 13:29:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:29:00,809 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,810 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 10, 8, 6, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:00,810 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash -315487791, now seen corresponding path program 5 times [2018-07-25 13:29:00,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 388 proven. 42 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-07-25 13:29:00,940 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:29:00,940 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:29:00,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:29:00,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:00,941 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand 6 states. [2018-07-25 13:29:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,082 INFO L93 Difference]: Finished difference Result 336 states and 378 transitions. [2018-07-25 13:29:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:29:01,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-07-25 13:29:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,088 INFO L225 Difference]: With dead ends: 336 [2018-07-25 13:29:01,088 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:29:01,089 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:29:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-07-25 13:29:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:29:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2018-07-25 13:29:01,117 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 105 [2018-07-25 13:29:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,117 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2018-07-25 13:29:01,117 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:29:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2018-07-25 13:29:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:29:01,119 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,119 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 14, 12, 10, 8, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:29:01,120 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -783912799, now seen corresponding path program 6 times [2018-07-25 13:29:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 419 proven. 39 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-07-25 13:29:01,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:01,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:29:01,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:29:01,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:29:01,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:01,235 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand 6 states. [2018-07-25 13:29:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,446 INFO L93 Difference]: Finished difference Result 276 states and 300 transitions. [2018-07-25 13:29:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:29:01,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-07-25 13:29:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,449 INFO L225 Difference]: With dead ends: 276 [2018-07-25 13:29:01,449 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:29:01,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:29:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-07-25 13:29:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:29:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2018-07-25 13:29:01,471 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 108 [2018-07-25 13:29:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,471 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2018-07-25 13:29:01,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:29:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2018-07-25 13:29:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:29:01,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,472 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 15, 13, 11, 9, 7, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:01,473 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 767072789, now seen corresponding path program 7 times [2018-07-25 13:29:01,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 455 proven. 76 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-07-25 13:29:01,589 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:01,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:29:01,589 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:29:01,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:29:01,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:01,590 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand 7 states. [2018-07-25 13:29:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,713 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2018-07-25 13:29:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:29:01,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-07-25 13:29:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,715 INFO L225 Difference]: With dead ends: 354 [2018-07-25 13:29:01,715 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:29:01,715 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:29:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 119. [2018-07-25 13:29:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:29:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-07-25 13:29:01,737 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 115 [2018-07-25 13:29:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,737 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-07-25 13:29:01,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:29:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-07-25 13:29:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:29:01,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,739 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 15, 13, 11, 9, 7, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:29:01,739 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1131099683, now seen corresponding path program 8 times [2018-07-25 13:29:01,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 490 proven. 72 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-07-25 13:29:01,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:01,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:29:01,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:29:01,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:29:01,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:01,847 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 7 states. [2018-07-25 13:29:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,945 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-07-25 13:29:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:29:01,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-07-25 13:29:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,947 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:29:01,947 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:29:01,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:29:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:29:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:29:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:29:01,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2018-07-25 13:29:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,949 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:29:01,949 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:29:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:29:01,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:29:01,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:29:01,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:02,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:02,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:02,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:02,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:02,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:02,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:29:02,618 INFO L418 ceAbstractionStarter]: At program point L415(lines 415 432) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-07-25 13:29:02,618 INFO L422 ceAbstractionStarter]: For program point L382(lines 373 395) no Hoare annotation was computed. [2018-07-25 13:29:02,618 INFO L422 ceAbstractionStarter]: For program point L407(lines 404 420) no Hoare annotation was computed. [2018-07-25 13:29:02,621 INFO L418 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 0)) (.cse0 (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512))) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4560)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4384) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 1)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 12292) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) .cse1) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and .cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:02,622 INFO L418 ceAbstractionStarter]: At program point L296(lines 296 310) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4384) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 1)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 0)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) (and (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:02,623 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 526) the Hoare annotation is: true [2018-07-25 13:29:02,623 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 526) no Hoare annotation was computed. [2018-07-25 13:29:02,624 INFO L418 ceAbstractionStarter]: At program point L313(lines 313 333) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4384) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 1)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) (and (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:02,625 INFO L422 ceAbstractionStarter]: For program point L309(lines 309 320) no Hoare annotation was computed. [2018-07-25 13:29:02,625 INFO L422 ceAbstractionStarter]: For program point L499(lines 499 516) no Hoare annotation was computed. [2018-07-25 13:29:02,625 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 459) the Hoare annotation is: false [2018-07-25 13:29:02,625 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 526) no Hoare annotation was computed. [2018-07-25 13:29:02,629 INFO L422 ceAbstractionStarter]: For program point L351(lines 348 362) no Hoare annotation was computed. [2018-07-25 13:29:02,629 INFO L422 ceAbstractionStarter]: For program point L479(lines 479 496) no Hoare annotation was computed. [2018-07-25 13:29:02,630 INFO L418 ceAbstractionStarter]: At program point L525(lines 289 525) the Hoare annotation is: (let ((.cse0 (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512))) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4560)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4384) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 1)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 0)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:02,631 INFO L418 ceAbstractionStarter]: At program point L336(lines 336 358) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) (and (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:02,631 INFO L418 ceAbstractionStarter]: At program point L431(lines 431 458) the Hoare annotation is: false [2018-07-25 13:29:02,631 INFO L422 ceAbstractionStarter]: For program point L332(lines 332 349) no Hoare annotation was computed. [2018-07-25 13:29:02,632 INFO L418 ceAbstractionStarter]: At program point L460(lines 457 474) the Hoare annotation is: (or (and (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-25 13:29:02,633 INFO L418 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 0)) (.cse0 (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512))) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4560)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4384) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 1)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 12292) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) .cse1) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and .cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:02,634 INFO L418 ceAbstractionStarter]: At program point L394(lines 394 416) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-25 13:29:02,638 INFO L418 ceAbstractionStarter]: At program point L361(lines 361 391) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) (and (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:02,640 INFO L422 ceAbstractionStarter]: For program point L390(lines 390 405) no Hoare annotation was computed. [2018-07-25 13:29:02,640 INFO L422 ceAbstractionStarter]: For program point L357(lines 357 374) no Hoare annotation was computed. [2018-07-25 13:29:02,640 INFO L422 ceAbstractionStarter]: For program point L324(lines 319 337) no Hoare annotation was computed. [2018-07-25 13:29:02,641 INFO L418 ceAbstractionStarter]: At program point L419(lines 419 450) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4448) (and (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-25 13:29:02,670 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:02 BoogieIcfgContainer [2018-07-25 13:29:02,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:02,675 INFO L168 Benchmark]: Toolchain (without parser) took 5797.56 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 66.6 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 214.9 MB). Peak memory consumption was 281.4 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:02,682 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:02,683 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:02,683 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:02,684 INFO L168 Benchmark]: RCFGBuilder took 813.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:02,686 INFO L168 Benchmark]: TraceAbstraction took 4877.80 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 66.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 183.1 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:02,692 INFO L336 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 813.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4877.80 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 66.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 183.1 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 459]: 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 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((((((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~s__state~4 == 4560) || ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~s__state~4 == 4384 && ssl3_connect_~blastFlag~4 == 1)) || (ssl3_connect_~s__state~4 == 12292 && ssl3_connect_~blastFlag~4 == 0)) || (ssl3_connect_~s__state~4 == 4368 && ssl3_connect_~blastFlag~4 == 0)) || ssl3_connect_~s__state~4 == 4480) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~s__state~4 <= 4528) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4400)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~s__state~4 == 4384 && ssl3_connect_~blastFlag~4 == 1) || ssl3_connect_~s__state~4 == 4480) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416)) || ((ssl3_connect_~s__state~4 == 4560 || ssl3_connect_~s__state~4 <= 4528) && ((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((ssl3_connect_~s__state~4 == 4480 || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416)) || ((ssl3_connect_~s__state~4 == 4560 || ssl3_connect_~s__state~4 <= 4528) && ((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 == 4448 || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) && (ssl3_connect_~s__state~4 == 4560 || ssl3_connect_~s__state~4 <= 4528))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~s__state~4 == 4560) || ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~s__state~4 == 4384 && ssl3_connect_~blastFlag~4 == 1)) || (ssl3_connect_~s__state~4 == 4368 && ssl3_connect_~blastFlag~4 == 0)) || ssl3_connect_~s__state~4 == 4480) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~s__state~4 <= 4528) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4400)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~s__state~4 == 4560) || ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~s__state~4 == 4384 && ssl3_connect_~blastFlag~4 == 1)) || (ssl3_connect_~s__state~4 == 12292 && ssl3_connect_~blastFlag~4 == 0)) || (ssl3_connect_~s__state~4 == 4368 && ssl3_connect_~blastFlag~4 == 0)) || ssl3_connect_~s__state~4 == 4480) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~s__state~4 <= 4528) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4400)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 && (ssl3_connect_~s__state~4 == 4560 || ssl3_connect_~s__state~4 <= 4528)) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~s__state~4 == 4384 && ssl3_connect_~blastFlag~4 == 1) || ssl3_connect_~s__state~4 == 4480) || (ssl3_connect_~s__state~4 == 4368 && ssl3_connect_~blastFlag~4 == 0)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416)) || ((ssl3_connect_~s__state~4 == 4560 || ssl3_connect_~s__state~4 <= 4528) && ((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 == 4480 || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416)) || ((ssl3_connect_~s__state~4 == 4560 || ssl3_connect_~s__state~4 <= 4528) && ((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4448 || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) && (ssl3_connect_~s__state~4 == 4560 || ssl3_connect_~s__state~4 <= 4528))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. SAFE Result, 4.7s OverallTime, 20 OverallIterations, 17 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 311 SDtfs, 153 SDslu, 205 SDs, 0 SdLazy, 1300 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=17, 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.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 121 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 99 NumberOfFragments, 586 HoareAnnotationTreeSize, 14 FomulaSimplifications, 12174 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 1488 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 188852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 5706/6034 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-29-02-716.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-29-02-716.csv Received shutdown request...