java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:50:09,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:50:09,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:50:09,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:50:09,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:50:09,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:50:09,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:50:09,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:50:09,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:50:09,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:50:09,306 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:50:09,306 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:50:09,307 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:50:09,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:50:09,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:50:09,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:50:09,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:50:09,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:50:09,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:50:09,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:50:09,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:50:09,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:50:09,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:50:09,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:50:09,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:50:09,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:50:09,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:50:09,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:50:09,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:50:09,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:50:09,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:50:09,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:50:09,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:50:09,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:50:09,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:50:09,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:50:09,332 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:50:09,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:50:09,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:50:09,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:50:09,349 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:50:09,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:50:09,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:50:09,350 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:50:09,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:50:09,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:50:09,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:50:09,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:50:09,439 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:50:09,440 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:50:09,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl [2018-07-23 13:50:09,442 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl' [2018-07-23 13:50:09,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:50:09,503 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:50:09,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:50:09,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:50:09,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:50:09,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:50:09,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:50:09,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:50:09,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:50:09,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/1) ... [2018-07-23 13:50:09,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:50:09,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:50:09,776 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:50:09,780 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:09 BoogieIcfgContainer [2018-07-23 13:50:09,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:50:09,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:50:09,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:50:09,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:50:09,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:09" (1/2) ... [2018-07-23 13:50:09,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1157ffa4 and model type sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:50:09, skipping insertion in model container [2018-07-23 13:50:09,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:09" (2/2) ... [2018-07-23 13:50:09,794 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04.i_4.bpl [2018-07-23 13:50:09,804 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:50:09,814 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:50:09,862 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:50:09,863 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:50:09,863 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:50:09,863 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:50:09,863 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:50:09,864 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:50:09,864 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:50:09,864 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:50:09,864 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:50:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:50:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:50:09,886 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:09,886 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:50:09,887 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 13:50:09,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:09,956 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-23 13:50:09,959 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:09,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:50:09,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:09,962 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-23 13:50:09,962 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(<= ULTIMATE.start_main_~i~4 1)] [2018-07-23 13:50:09,962 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-23 13:50:09,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:50:09,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:50:09,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:09,978 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 13:50:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,013 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-07-23 13:50:10,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:50:10,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:50:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,025 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:50:10,025 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:50:10,029 INFO L575 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-23 13:50:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:50:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-07-23 13:50:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:50:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:50:10,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2018-07-23 13:50:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,069 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:50:10,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:50:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:50:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:50:10,070 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,070 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-07-23 13:50:10,071 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1808144116, now seen corresponding path program 1 times [2018-07-23 13:50:10,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,109 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-23 13:50:10,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:50:10,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,110 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-23 13:50:10,111 INFO L185 omatonBuilderFactory]: Interpolants [56#true, 57#false, 58#(<= ULTIMATE.start_main_~i~4 1), 59#(<= ULTIMATE.start_main_~i~4 2)] [2018-07-23 13:50:10,111 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-23 13:50:10,113 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:50:10,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:50:10,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:10,114 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2018-07-23 13:50:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,140 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:50:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:50:10,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-07-23 13:50:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,142 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:50:10,142 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:50:10,143 INFO L575 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-23 13:50:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:50:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-07-23 13:50:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:50:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:50:10,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-07-23 13:50:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,148 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:50:10,148 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:50:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:50:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:50:10,149 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,149 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2018-07-23 13:50:10,150 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1056230233, now seen corresponding path program 2 times [2018-07-23 13:50:10,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:50:10,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,189 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-23 13:50:10,189 INFO L185 omatonBuilderFactory]: Interpolants [112#(<= ULTIMATE.start_main_~i~4 1), 113#(<= ULTIMATE.start_main_~i~4 2), 114#(<= ULTIMATE.start_main_~i~4 3), 110#true, 111#false] [2018-07-23 13:50:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,190 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:50:10,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:50:10,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:10,191 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2018-07-23 13:50:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,216 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:50:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:50:10,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-23 13:50:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,217 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:50:10,218 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:50:10,218 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:50:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-07-23 13:50:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:50:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:50:10,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-07-23 13:50:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,224 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:50:10,224 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:50:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:50:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:50:10,225 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,225 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2018-07-23 13:50:10,225 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1222224364, now seen corresponding path program 3 times [2018-07-23 13:50:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:50:10,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,268 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-23 13:50:10,269 INFO L185 omatonBuilderFactory]: Interpolants [177#true, 178#false, 179#(<= ULTIMATE.start_main_~i~4 1), 180#(<= ULTIMATE.start_main_~i~4 2), 181#(<= ULTIMATE.start_main_~i~4 3), 182#(<= ULTIMATE.start_main_~i~4 4)] [2018-07-23 13:50:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,269 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:50:10,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:50:10,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:10,270 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-07-23 13:50:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,299 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 13:50:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:50:10,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-07-23 13:50:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,300 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:50:10,300 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:50:10,301 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:50:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-07-23 13:50:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:50:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:50:10,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-07-23 13:50:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,307 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:50:10,307 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:50:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:50:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:50:10,308 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,308 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2018-07-23 13:50:10,308 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1448944007, now seen corresponding path program 4 times [2018-07-23 13:50:10,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:50:10,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,361 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-23 13:50:10,361 INFO L185 omatonBuilderFactory]: Interpolants [257#true, 258#false, 259#(<= ULTIMATE.start_main_~i~4 1), 260#(<= ULTIMATE.start_main_~i~4 2), 261#(<= ULTIMATE.start_main_~i~4 3), 262#(<= ULTIMATE.start_main_~i~4 4), 263#(<= ULTIMATE.start_main_~i~4 5)] [2018-07-23 13:50:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,362 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:50:10,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:50:10,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:10,363 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-07-23 13:50:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,403 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:50:10,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:50:10,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-23 13:50:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,404 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:50:10,405 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:50:10,409 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:50:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-07-23 13:50:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:50:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:50:10,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-07-23 13:50:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,420 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:50:10,422 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:50:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:50:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:50:10,423 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,424 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1] [2018-07-23 13:50:10,424 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1071824180, now seen corresponding path program 5 times [2018-07-23 13:50:10,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,486 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:50:10,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,487 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-23 13:50:10,488 INFO L185 omatonBuilderFactory]: Interpolants [352#(<= ULTIMATE.start_main_~i~4 1), 353#(<= ULTIMATE.start_main_~i~4 2), 354#(<= ULTIMATE.start_main_~i~4 3), 355#(<= ULTIMATE.start_main_~i~4 4), 356#(<= ULTIMATE.start_main_~i~4 5), 357#(<= ULTIMATE.start_main_~i~4 6), 350#true, 351#false] [2018-07-23 13:50:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,488 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:50:10,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:50:10,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:10,489 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-07-23 13:50:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,556 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-23 13:50:10,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:50:10,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-07-23 13:50:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,561 INFO L225 Difference]: With dead ends: 26 [2018-07-23 13:50:10,562 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 13:50:10,563 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 13:50:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-07-23 13:50:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:50:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:50:10,574 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-07-23 13:50:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,575 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:50:10,575 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:50:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:50:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:50:10,579 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,579 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1] [2018-07-23 13:50:10,579 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1929504359, now seen corresponding path program 6 times [2018-07-23 13:50:10,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,685 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,686 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:50:10,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,688 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-23 13:50:10,689 INFO L185 omatonBuilderFactory]: Interpolants [464#(<= ULTIMATE.start_main_~i~4 7), 456#true, 457#false, 458#(<= ULTIMATE.start_main_~i~4 1), 459#(<= ULTIMATE.start_main_~i~4 2), 460#(<= ULTIMATE.start_main_~i~4 3), 461#(<= ULTIMATE.start_main_~i~4 4), 462#(<= ULTIMATE.start_main_~i~4 5), 463#(<= ULTIMATE.start_main_~i~4 6)] [2018-07-23 13:50:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:50:10,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:50:10,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:10,694 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-07-23 13:50:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,742 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:50:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:50:10,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 13:50:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,744 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:50:10,744 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:50:10,745 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:50:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-07-23 13:50:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:50:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 13:50:10,752 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-07-23 13:50:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,752 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 13:50:10,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:50:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 13:50:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:50:10,753 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,754 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2018-07-23 13:50:10,754 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1975694252, now seen corresponding path program 7 times [2018-07-23 13:50:10,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:10,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:50:10,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:10,829 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-23 13:50:10,830 INFO L185 omatonBuilderFactory]: Interpolants [576#false, 577#(<= ULTIMATE.start_main_~i~4 1), 578#(<= ULTIMATE.start_main_~i~4 2), 579#(<= ULTIMATE.start_main_~i~4 3), 580#(<= ULTIMATE.start_main_~i~4 4), 581#(<= ULTIMATE.start_main_~i~4 5), 582#(<= ULTIMATE.start_main_~i~4 6), 583#(<= ULTIMATE.start_main_~i~4 7), 584#(<= ULTIMATE.start_main_~i~4 8), 575#true] [2018-07-23 13:50:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:10,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:50:10,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:50:10,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:10,835 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-07-23 13:50:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:10,863 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:50:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:50:10,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-07-23 13:50:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:10,865 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:50:10,865 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:50:10,866 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:50:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:50:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:50:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:50:10,879 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-07-23 13:50:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:10,880 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:50:10,880 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:50:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:50:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:50:10,882 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:10,882 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1] [2018-07-23 13:50:10,883 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:50:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash 326599495, now seen corresponding path program 8 times [2018-07-23 13:50:10,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:50:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:50:10,943 INFO L423 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 13:50:10,963 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:50:10 BoogieIcfgContainer [2018-07-23 13:50:10,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:50:10,964 INFO L168 Benchmark]: Toolchain (without parser) took 1461.71 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:10,967 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-23 13:50:10,968 INFO L168 Benchmark]: Boogie Preprocessor took 47.21 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-23 13:50:10,968 INFO L168 Benchmark]: RCFGBuilder took 228.34 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-23 13:50:10,970 INFO L168 Benchmark]: TraceAbstraction took 1181.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:10,974 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.25 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 47.21 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 228.34 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 1181.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~i~4, main_~sn~4; [L12] havoc main_~i~4; [L13] main_~sn~4 := 0; [L14] main_~i~4 := 1; VAL [main_~i~4=1, main_~sn~4=0] [L17] assume true; VAL [main_~i~4=1, main_~sn~4=0] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=1, main_~sn~4=0] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=2, main_~sn~4=2] [L17] assume true; VAL [main_~i~4=2, main_~sn~4=2] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=2, main_~sn~4=2] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=3, main_~sn~4=4] [L17] assume true; VAL [main_~i~4=3, main_~sn~4=4] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=3, main_~sn~4=4] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=4, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=4, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=4, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=5, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=5, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=5, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=6, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=6, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=6, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=7, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=7, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=7, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=8, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=8, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=8, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=9, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=9, main_~sn~4=6] [L22] assume !(main_~i~4 <= 8); [L23] __VERIFIER_assert_#in~cond := (if main_~sn~4 == 16 || main_~sn~4 == 0 then 1 else 0); [L24] havoc __VERIFIER_assert_~cond; [L25] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L26] assume __VERIFIER_assert_~cond == 0; [L27] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] [L33] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 36 SDslu, 66 SDs, 0 SdLazy, 117 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/224 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 5292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-50-10-990.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-50-10-990.csv Received shutdown request...