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/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:24:44,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:24:44,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:24:44,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:24:44,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:24:44,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:24:44,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:24:44,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:24:44,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:24:44,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:24:44,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:24:44,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:24:44,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:24:44,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:24:44,855 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:24:44,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:24:44,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:24:44,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:24:44,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:24:44,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:24:44,877 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:24:44,878 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:24:44,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:24:44,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:24:44,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:24:44,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:24:44,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:24:44,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:24:44,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:24:44,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:24:44,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:24:44,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:24:44,892 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:24:44,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:24:44,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:24:44,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:24:44,896 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:24:44,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:24:44,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:24:44,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:24:44,911 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:24:44,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:24:44,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:24:44,911 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:24:44,912 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:24:44,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:24:44,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:24:44,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:24:44,978 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:24:44,979 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:24:44,980 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2018-07-25 13:24:44,980 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2018-07-25 13:24:45,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:24:45,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:24:45,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:24:45,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:24:45,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:24:45,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:24:45,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:24:45,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:24:45,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:24:45,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:24:45,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:24:45,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:24:45,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:24:45,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/1) ... [2018-07-25 13:24:45,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:24:45,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:24:45,563 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:24:45,564 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:24:45 BoogieIcfgContainer [2018-07-25 13:24:45,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:24:45,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:24:45,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:24:45,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:24:45,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:45" (1/2) ... [2018-07-25 13:24:45,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56743e47 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:24:45, skipping insertion in model container [2018-07-25 13:24:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:24:45" (2/2) ... [2018-07-25 13:24:45,576 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2018-07-25 13:24:45,586 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:24:45,600 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:24:45,648 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:24:45,648 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:24:45,649 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:24:45,649 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:24:45,649 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:24:45,649 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:24:45,649 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:24:45,649 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:24:45,650 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:24:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-07-25 13:24:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:24:45,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:45,672 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:45,673 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash 148998227, now seen corresponding path program 1 times [2018-07-25 13:24:45,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:45,836 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:24:45,838 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:24:45,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:24:45,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:24:45,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:24:45,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:24:45,858 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2018-07-25 13:24:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:45,936 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2018-07-25 13:24:45,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:24:45,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-25 13:24:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:45,949 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:24:45,950 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:24:45,953 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:24:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:24:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-07-25 13:24:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:24:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-07-25 13:24:46,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2018-07-25 13:24:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:46,003 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-07-25 13:24:46,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:24:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-07-25 13:24:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:24:46,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:46,005 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:46,005 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:46,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1453301261, now seen corresponding path program 1 times [2018-07-25 13:24:46,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:46,062 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:46,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:24:46,064 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:24:46,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:24:46,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:24:46,066 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 5 states. [2018-07-25 13:24:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:46,221 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-07-25 13:24:46,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:24:46,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-25 13:24:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:46,222 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:24:46,223 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:24:46,224 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:24:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:24:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-07-25 13:24:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:24:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-07-25 13:24:46,232 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2018-07-25 13:24:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:46,232 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-07-25 13:24:46,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:24:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2018-07-25 13:24:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:24:46,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:46,233 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:46,234 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash 758066503, now seen corresponding path program 2 times [2018-07-25 13:24:46,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:46,282 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:46,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:24:46,282 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:24:46,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:24:46,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:24:46,283 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 6 states. [2018-07-25 13:24:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:46,396 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2018-07-25 13:24:46,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:24:46,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-07-25 13:24:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:46,402 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:24:46,403 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:24:46,403 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:24:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:24:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2018-07-25 13:24:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:24:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-07-25 13:24:46,421 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2018-07-25 13:24:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:46,422 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-07-25 13:24:46,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:24:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-07-25 13:24:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:24:46,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:46,423 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:46,423 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1642605055, now seen corresponding path program 3 times [2018-07-25 13:24:46,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:46,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:46,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:24:46,476 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:24:46,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:24:46,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:46,477 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 7 states. [2018-07-25 13:24:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:46,581 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-07-25 13:24:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:24:46,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-07-25 13:24:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:46,583 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:24:46,583 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:24:46,584 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:24:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:24:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 19. [2018-07-25 13:24:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:24:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-07-25 13:24:46,601 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2018-07-25 13:24:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:46,602 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-07-25 13:24:46,602 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:24:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-07-25 13:24:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:24:46,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:46,603 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:46,605 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:46,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2004432955, now seen corresponding path program 4 times [2018-07-25 13:24:46,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:46,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:46,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:24:46,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:24:46,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:24:46,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:24:46,671 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 8 states. [2018-07-25 13:24:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:46,839 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-07-25 13:24:46,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:24:46,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:24:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:46,841 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:24:46,841 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:24:46,842 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:24:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:24:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 21. [2018-07-25 13:24:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:24:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-07-25 13:24:46,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2018-07-25 13:24:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:46,854 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-07-25 13:24:46,854 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:24:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-07-25 13:24:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:24:46,855 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:46,856 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:46,856 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2114647029, now seen corresponding path program 5 times [2018-07-25 13:24:46,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:46,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:46,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:24:46,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:24:46,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:24:46,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:24:46,906 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 9 states. [2018-07-25 13:24:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:47,058 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2018-07-25 13:24:47,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:24:47,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-25 13:24:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:47,063 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:24:47,063 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:24:47,064 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:24:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:24:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 23. [2018-07-25 13:24:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:24:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-07-25 13:24:47,086 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2018-07-25 13:24:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:47,086 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-07-25 13:24:47,086 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:24:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-07-25 13:24:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:24:47,089 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:47,090 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:47,090 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash 656189743, now seen corresponding path program 6 times [2018-07-25 13:24:47,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:47,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:47,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:24:47,157 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:24:47,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:24:47,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:24:47,158 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 10 states. [2018-07-25 13:24:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:47,330 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2018-07-25 13:24:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:24:47,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-07-25 13:24:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:47,333 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:24:47,333 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:24:47,334 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:24:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:24:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 25. [2018-07-25 13:24:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:24:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-07-25 13:24:47,348 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2018-07-25 13:24:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:47,349 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-07-25 13:24:47,349 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:24:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-07-25 13:24:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:24:47,350 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:47,350 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:47,351 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash -761923607, now seen corresponding path program 7 times [2018-07-25 13:24:47,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:47,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:47,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:24:47,400 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:24:47,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:24:47,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:24:47,403 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 11 states. [2018-07-25 13:24:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:47,566 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2018-07-25 13:24:47,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:24:47,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-07-25 13:24:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:47,568 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:24:47,568 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:24:47,569 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:24:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:24:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 27. [2018-07-25 13:24:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:24:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-07-25 13:24:47,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2018-07-25 13:24:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:47,583 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-07-25 13:24:47,583 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:24:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-07-25 13:24:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:24:47,584 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:47,584 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:47,585 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2064220125, now seen corresponding path program 8 times [2018-07-25 13:24:47,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:47,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:47,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:24:47,633 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:24:47,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:24:47,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:24:47,635 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2018-07-25 13:24:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:47,823 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2018-07-25 13:24:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:24:47,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-07-25 13:24:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:47,825 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:24:47,825 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:24:47,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:24:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:24:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 29. [2018-07-25 13:24:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:24:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-07-25 13:24:47,842 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2018-07-25 13:24:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:47,843 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-07-25 13:24:47,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:24:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-07-25 13:24:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:24:47,844 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:47,844 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:47,844 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash 559276509, now seen corresponding path program 9 times [2018-07-25 13:24:47,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:47,899 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:47,899 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:24:47,900 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:24:47,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:24:47,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:24:47,901 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2018-07-25 13:24:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:48,133 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2018-07-25 13:24:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:24:48,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-07-25 13:24:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:48,135 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:24:48,135 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:24:48,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:24:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:24:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 31. [2018-07-25 13:24:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:24:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-07-25 13:24:48,154 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2018-07-25 13:24:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:48,154 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-07-25 13:24:48,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:24:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-07-25 13:24:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:24:48,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:48,156 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:48,156 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 593739031, now seen corresponding path program 10 times [2018-07-25 13:24:48,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:48,216 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:48,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:24:48,217 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:24:48,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:24:48,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:24:48,218 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 14 states. [2018-07-25 13:24:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:48,520 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2018-07-25 13:24:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:24:48,521 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-07-25 13:24:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:48,522 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:24:48,522 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:24:48,523 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:24:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:24:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 33. [2018-07-25 13:24:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:24:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-07-25 13:24:48,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2018-07-25 13:24:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:48,550 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-07-25 13:24:48,551 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:24:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-07-25 13:24:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:24:48,552 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:48,552 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:48,552 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash -647515695, now seen corresponding path program 11 times [2018-07-25 13:24:48,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:48,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:48,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:24:48,625 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:24:48,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:24:48,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:24:48,627 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 15 states. [2018-07-25 13:24:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:48,966 INFO L93 Difference]: Finished difference Result 109 states and 148 transitions. [2018-07-25 13:24:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:24:48,967 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-07-25 13:24:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:48,968 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:24:48,968 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:24:48,969 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:24:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:24:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 35. [2018-07-25 13:24:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:24:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-07-25 13:24:48,995 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 30 [2018-07-25 13:24:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:48,996 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-07-25 13:24:48,996 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:24:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-07-25 13:24:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:24:48,999 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:49,000 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:49,000 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash 507600907, now seen corresponding path program 12 times [2018-07-25 13:24:49,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:49,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:49,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:24:49,121 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:24:49,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:24:49,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:24:49,122 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2018-07-25 13:24:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:49,544 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2018-07-25 13:24:49,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:24:49,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-07-25 13:24:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:49,546 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:24:49,546 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:24:49,547 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:24:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:24:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 37. [2018-07-25 13:24:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:24:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-07-25 13:24:49,575 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 32 [2018-07-25 13:24:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:49,576 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-07-25 13:24:49,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:24:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-07-25 13:24:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:24:49,579 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:49,579 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:49,579 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1821874235, now seen corresponding path program 13 times [2018-07-25 13:24:49,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:49,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:49,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:24:49,681 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:24:49,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:24:49,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:24:49,682 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 17 states. [2018-07-25 13:24:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:50,217 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2018-07-25 13:24:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:24:50,217 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-07-25 13:24:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:50,219 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:24:50,219 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:24:50,220 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:24:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:24:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 39. [2018-07-25 13:24:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:24:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-07-25 13:24:50,252 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 34 [2018-07-25 13:24:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:50,252 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-07-25 13:24:50,254 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:24:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-07-25 13:24:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:24:50,255 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:50,255 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:50,256 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1525442815, now seen corresponding path program 14 times [2018-07-25 13:24:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:50,338 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:50,338 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:24:50,338 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:24:50,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:24:50,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:24:50,339 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 18 states. [2018-07-25 13:24:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:50,764 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2018-07-25 13:24:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:24:50,765 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-07-25 13:24:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:50,766 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:24:50,766 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:24:50,767 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:24:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:24:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 41. [2018-07-25 13:24:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:24:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-07-25 13:24:50,798 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 36 [2018-07-25 13:24:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:50,799 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-07-25 13:24:50,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:24:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-07-25 13:24:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:24:50,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:50,800 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:50,800 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1366623161, now seen corresponding path program 15 times [2018-07-25 13:24:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:50,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:50,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:24:50,885 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:24:50,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:24:50,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:24:50,886 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 19 states. [2018-07-25 13:24:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:51,338 INFO L93 Difference]: Finished difference Result 141 states and 192 transitions. [2018-07-25 13:24:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:24:51,338 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-07-25 13:24:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:51,339 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:24:51,339 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:24:51,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:24:51,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:24:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 43. [2018-07-25 13:24:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:24:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-07-25 13:24:51,365 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 38 [2018-07-25 13:24:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:51,366 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-07-25 13:24:51,366 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:24:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-07-25 13:24:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:24:51,366 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:51,367 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:51,367 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:51,367 INFO L82 PathProgramCache]: Analyzing trace with hash -935208973, now seen corresponding path program 16 times [2018-07-25 13:24:51,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:51,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:51,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:24:51,445 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:24:51,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:24:51,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:24:51,446 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 20 states. [2018-07-25 13:24:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:51,934 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2018-07-25 13:24:51,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:24:51,935 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-07-25 13:24:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:51,936 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:24:51,936 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:24:51,937 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:24:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:24:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 45. [2018-07-25 13:24:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:24:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-07-25 13:24:51,962 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 40 [2018-07-25 13:24:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:51,963 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-07-25 13:24:51,963 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:24:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-07-25 13:24:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:24:51,964 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:51,964 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:51,964 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:51,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1087732307, now seen corresponding path program 17 times [2018-07-25 13:24:51,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:52,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:52,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:24:52,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:24:52,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:24:52,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:24:52,041 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 21 states. [2018-07-25 13:24:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:52,642 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2018-07-25 13:24:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:24:52,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-07-25 13:24:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:52,644 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:24:52,644 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:24:52,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:24:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:24:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 47. [2018-07-25 13:24:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:24:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-07-25 13:24:52,679 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 42 [2018-07-25 13:24:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:52,680 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-07-25 13:24:52,680 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:24:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-07-25 13:24:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:24:52,681 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:52,681 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:52,681 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1633768217, now seen corresponding path program 18 times [2018-07-25 13:24:52,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:52,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:52,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:24:52,782 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:24:52,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:24:52,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:24:52,783 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 22 states. [2018-07-25 13:24:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:53,487 INFO L93 Difference]: Finished difference Result 165 states and 225 transitions. [2018-07-25 13:24:53,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:24:53,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-07-25 13:24:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:53,489 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:24:53,489 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:24:53,490 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:24:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:24:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 49. [2018-07-25 13:24:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:24:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-07-25 13:24:53,523 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 44 [2018-07-25 13:24:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:53,523 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-07-25 13:24:53,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:24:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-07-25 13:24:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:24:53,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:53,524 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:53,525 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1906699681, now seen corresponding path program 19 times [2018-07-25 13:24:53,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:53,634 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:53,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:24:53,636 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:24:53,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:24:53,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:24:53,637 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 23 states. [2018-07-25 13:24:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:54,361 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2018-07-25 13:24:54,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:24:54,361 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-07-25 13:24:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:54,362 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:24:54,362 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:24:54,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:24:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:24:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 51. [2018-07-25 13:24:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:24:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-07-25 13:24:54,399 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 46 [2018-07-25 13:24:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:54,400 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-07-25 13:24:54,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:24:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-07-25 13:24:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:24:54,401 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:54,401 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:54,401 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:54,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1612716069, now seen corresponding path program 20 times [2018-07-25 13:24:54,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-07-25 13:24:54,432 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:24:54,432 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:24:54,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:24:54,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:24:54,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:24:54,433 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 3 states. [2018-07-25 13:24:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:54,481 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-07-25 13:24:54,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:24:54,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-07-25 13:24:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:54,482 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:24:54,482 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:24:54,483 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:24:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:24:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:24:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:24:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-07-25 13:24:54,527 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 48 [2018-07-25 13:24:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:54,528 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-07-25 13:24:54,528 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:24:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-07-25 13:24:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:24:54,528 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:54,529 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:54,529 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1320571243, now seen corresponding path program 1 times [2018-07-25 13:24:54,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-07-25 13:24:54,573 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:24:54,573 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:24:54,573 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:24:54,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:24:54,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:24:54,574 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-07-25 13:24:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:54,585 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-07-25 13:24:54,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:24:54,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-07-25 13:24:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:54,586 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:24:54,586 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:24:54,590 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:24:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:24:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:24:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:24:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:24:54,591 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-07-25 13:24:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:54,591 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:24:54,591 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:24:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:24:54,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:24:54,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:24:54,906 WARN L169 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 15 [2018-07-25 13:24:55,138 WARN L169 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 15 [2018-07-25 13:24:55,148 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 3 176) the Hoare annotation is: false [2018-07-25 13:24:55,149 INFO L418 ceAbstractionStarter]: At program point L155(lines 155 174) the Hoare annotation is: false [2018-07-25 13:24:55,149 INFO L418 ceAbstractionStarter]: At program point L114(lines 97 114) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 0) (= ULTIMATE.start_main_~nodecount~4 5) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4) (< ULTIMATE.start_main_~i~4 (+ ULTIMATE.start_main_~source~4 1)) (<= 20 ULTIMATE.start_main_~edgecount~4)) [2018-07-25 13:24:55,149 INFO L418 ceAbstractionStarter]: At program point L133(lines 133 164) the Hoare annotation is: false [2018-07-25 13:24:55,150 INFO L418 ceAbstractionStarter]: At program point L100(lines 100 107) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 0) (= ULTIMATE.start_main_~nodecount~4 5) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4) (< ULTIMATE.start_main_~i~4 (+ ULTIMATE.start_main_~source~4 1)) (<= 20 ULTIMATE.start_main_~edgecount~4)) [2018-07-25 13:24:55,150 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 3 176) the Hoare annotation is: true [2018-07-25 13:24:55,150 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 176) no Hoare annotation was computed. [2018-07-25 13:24:55,150 INFO L418 ceAbstractionStarter]: At program point L117(lines 117 124) the Hoare annotation is: false [2018-07-25 13:24:55,151 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 175) the Hoare annotation is: false [2018-07-25 13:24:55,151 INFO L418 ceAbstractionStarter]: At program point L144(lines 123 144) the Hoare annotation is: false [2018-07-25 13:24:55,151 INFO L418 ceAbstractionStarter]: At program point L173(lines 127 173) the Hoare annotation is: false [2018-07-25 13:24:55,151 INFO L418 ceAbstractionStarter]: At program point L163(lines 106 163) the Hoare annotation is: false [2018-07-25 13:24:55,151 INFO L418 ceAbstractionStarter]: At program point L130(lines 130 145) the Hoare annotation is: false [2018-07-25 13:24:55,164 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:24:55 BoogieIcfgContainer [2018-07-25 13:24:55,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:24:55,166 INFO L168 Benchmark]: Toolchain (without parser) took 10099.62 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 188.2 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 246.7 MB). Peak memory consumption was 434.9 MB. Max. memory is 7.1 GB. [2018-07-25 13:24:55,167 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:24:55,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.71 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:24:55,168 INFO L168 Benchmark]: Boogie Preprocessor took 27.84 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:24:55,169 INFO L168 Benchmark]: RCFGBuilder took 422.83 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:24:55,169 INFO L168 Benchmark]: TraceAbstraction took 9598.55 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 188.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 236.1 MB). Peak memory consumption was 424.4 MB. Max. memory is 7.1 GB. [2018-07-25 13:24:55,173 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.20 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 45.71 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 27.84 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 422.83 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9598.55 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 188.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 236.1 MB). Peak memory consumption was 424.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 117]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((main_~i~4 <= 0 && main_~nodecount~4 == 5) && main_~source~4 <= main_~i~4) && main_~i~4 < main_~source~4 + 1) && 20 <= main_~edgecount~4 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((main_~i~4 <= 0 && main_~nodecount~4 == 5) && main_~source~4 <= main_~i~4) && main_~i~4 < main_~source~4 + 1) && 20 <= main_~edgecount~4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. SAFE Result, 9.5s OverallTime, 22 OverallIterations, 21 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 2366 SDslu, 846 SDs, 0 SdLazy, 1218 SolverSat, 2071 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=21, 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.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1260 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 14 NumberOfFragments, 46 HoareAnnotationTreeSize, 12 FomulaSimplifications, 374288734941734764 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 638 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 82698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 842/3502 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/eureka_01.i_6.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-24-55-186.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_01.i_6.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-24-55-186.csv Received shutdown request...