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/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:33:10,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:33:10,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:33:10,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:33:10,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:33:10,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:33:10,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:33:10,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:33:10,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:33:10,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:33:10,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:33:10,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:33:10,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:33:10,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:33:10,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:33:10,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:33:10,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:33:10,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:33:10,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:33:10,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:33:10,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:33:10,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:33:10,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:33:10,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:33:10,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:33:10,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:33:10,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:33:10,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:33:10,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:33:10,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:33:10,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:33:10,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:33:10,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:33:10,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:33:10,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:33:10,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:33:10,487 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:33:10,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:33:10,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:33:10,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:33:10,497 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:33:10,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:33:10,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:33:10,498 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:33:10,498 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:33:10,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:33:10,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:33:10,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:33:10,572 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:33:10,573 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:33:10,573 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-07-25 13:33:10,574 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-07-25 13:33:10,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:33:10,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:33:10,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:33:10,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:33:10,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:33:10,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,654 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:33:10,655 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:33:10,655 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:33:10,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:33:10,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:33:10,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:33:10,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:33:10,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:33:10,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:33:10,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:33:10,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:33:10,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/1) ... [2018-07-25 13:33:10,764 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:33:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:33:10,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:33:10,912 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:33:10,913 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:33:10 BoogieIcfgContainer [2018-07-25 13:33:10,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:33:10,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:33:10,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:33:10,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:33:10,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:10" (1/2) ... [2018-07-25 13:33:10,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22be42 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:33:10, skipping insertion in model container [2018-07-25 13:33:10,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:33:10" (2/2) ... [2018-07-25 13:33:10,923 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-07-25 13:33:10,933 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:33:10,941 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:33:10,991 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:33:10,992 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:33:10,993 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:33:10,993 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:33:10,993 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:33:10,993 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:33:10,994 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:33:10,994 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:33:10,994 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:33:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:33:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:33:11,023 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,024 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:33:11,026 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-07-25 13:33:11,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:11,123 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:33:11,126 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:33:11,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:33:11,131 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:33:11,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:33:11,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:33:11,146 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:33:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,175 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-25 13:33:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:33:11,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:33:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,189 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:33:11,190 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:33:11,194 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:33:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:33:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:33:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:33:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:33:11,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:33:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,228 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:33:11,229 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:33:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:33:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:33:11,229 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,230 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:33:11,230 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash 945112, now seen corresponding path program 1 times [2018-07-25 13:33:11,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:11,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:11,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:33:11,264 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:33:11,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:33:11,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:33:11,265 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:33:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,279 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:33:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:33:11,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:33:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,280 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:33:11,281 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:33:11,283 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:33:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:33:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:33:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:33:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:33:11,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:33:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,286 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:33:11,287 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:33:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:33:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:33:11,287 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,287 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:33:11,288 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29306144, now seen corresponding path program 2 times [2018-07-25 13:33:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:11,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:11,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:33:11,350 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:33:11,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:33:11,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:33:11,351 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:33:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,362 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:33:11,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:33:11,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:33:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,364 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:33:11,364 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:33:11,364 INFO L574 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-25 13:33:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:33:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:33:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:33:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:33:11,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:33:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,368 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:33:11,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:33:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:33:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:33:11,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,369 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:33:11,369 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash 908498136, now seen corresponding path program 3 times [2018-07-25 13:33:11,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:11,439 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:33:11,439 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:11,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:33:11,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:33:11,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:33:11,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:33:11,441 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:33:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,454 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:33:11,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:33:11,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:33:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,459 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:33:11,459 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:33:11,460 INFO L574 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-25 13:33:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:33:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:33:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:33:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:33:11,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:33:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,466 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:33:11,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:33:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:33:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:33:11,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,467 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:33:11,467 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1901321184, now seen corresponding path program 4 times [2018-07-25 13:33:11,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:11,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:11,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:33:11,610 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:33:11,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:33:11,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:33:11,610 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:33:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,638 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:33:11,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:33:11,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:33:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,639 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:33:11,639 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:33:11,642 INFO L574 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-25 13:33:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:33:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:33:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:33:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:33:11,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:33:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,646 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:33:11,646 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:33:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:33:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:33:11,647 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,647 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:33:11,647 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1188593112, now seen corresponding path program 5 times [2018-07-25 13:33:11,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:11,822 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-25 13:33:11,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:11,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:33:11,823 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:33:11,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:33:11,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:33:11,824 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:33:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,841 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:33:11,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:33:11,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:33:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,843 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:33:11,843 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:33:11,844 INFO L574 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-25 13:33:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:33:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:33:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:33:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:33:11,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:33:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,853 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:33:11,854 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:33:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:33:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:33:11,854 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,855 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:33:11,855 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1808311520, now seen corresponding path program 6 times [2018-07-25 13:33:11,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:12,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:12,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:33:12,156 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:33:12,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:33:12,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:33:12,159 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:33:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:12,178 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:33:12,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:33:12,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:33:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:12,181 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:33:12,181 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:33:12,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:33:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:33:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:33:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:33:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:33:12,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:33:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:12,185 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:33:12,186 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:33:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:33:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:33:12,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:12,187 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:33:12,188 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:12,188 INFO L82 PathProgramCache]: Analyzing trace with hash -223074600, now seen corresponding path program 7 times [2018-07-25 13:33:12,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:12,660 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:12,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:33:12,661 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:33:12,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:33:12,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:33:12,662 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:33:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:12,683 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:33:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:33:12,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:33:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:12,686 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:33:12,687 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:33:12,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:33:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:33:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:33:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:33:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:33:12,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:33:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:12,695 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:33:12,696 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:33:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:33:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:33:12,697 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:12,697 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:33:12,697 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1674629664, now seen corresponding path program 8 times [2018-07-25 13:33:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:13,610 WARN L169 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 3 [2018-07-25 13:33:13,933 WARN L169 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 3 [2018-07-25 13:33:14,254 WARN L169 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 3 [2018-07-25 13:33:14,514 WARN L169 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 3 [2018-07-25 13:33:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:14,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:14,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:33:14,526 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:33:14,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:33:14,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:33:14,529 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:33:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:14,550 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:33:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:33:14,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:33:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:14,552 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:33:14,552 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:33:14,554 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:33:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:33:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:33:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:33:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:33:14,559 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:33:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:14,561 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:33:14,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:33:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:33:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:33:14,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:14,562 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:33:14,565 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash 373919704, now seen corresponding path program 9 times [2018-07-25 13:33:14,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:15,101 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 3 [2018-07-25 13:33:16,846 WARN L169 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 300 DAG size of output: 3 [2018-07-25 13:33:18,026 WARN L169 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 339 DAG size of output: 3 [2018-07-25 13:33:18,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:33:18,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:33:18,773 WARN L169 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 3 [2018-07-25 13:33:19,577 WARN L169 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 3 [2018-07-25 13:33:20,015 WARN L169 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 3 [2018-07-25 13:33:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:20,021 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:20,022 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:33:20,022 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:33:20,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:33:20,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:33:20,023 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:33:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:20,039 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:33:20,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:33:20,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:33:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:20,041 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:33:20,041 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:33:20,041 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:33:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:33:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:33:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:33:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:33:20,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:33:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:20,049 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:33:20,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:33:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:33:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:33:20,050 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:20,050 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:33:20,050 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1293383392, now seen corresponding path program 10 times [2018-07-25 13:33:20,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,056 WARN L169 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 3 [2018-07-25 13:33:25,860 WARN L169 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 588 DAG size of output: 3 [2018-07-25 13:33:29,817 WARN L169 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 675 DAG size of output: 3 [2018-07-25 13:33:30,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:33:30,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:33:30,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:33:31,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:33:32,749 WARN L169 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 729 DAG size of output: 3 [2018-07-25 13:33:35,231 WARN L169 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 715 DAG size of output: 3 [2018-07-25 13:33:37,144 WARN L169 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 735 DAG size of output: 3 [2018-07-25 13:33:37,740 WARN L169 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 3 [2018-07-25 13:33:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:37,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:37,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:33:37,745 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:33:37,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:33:37,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:33:37,746 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 13:33:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:37,753 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:33:37,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:33:37,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 13:33:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:37,754 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:33:37,754 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:33:37,755 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:33:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:33:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:33:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:33:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:33:37,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:33:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:37,758 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:33:37,758 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:33:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:33:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:33:37,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:37,759 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:33:37,759 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1440171816, now seen corresponding path program 11 times [2018-07-25 13:33:37,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:40,471 WARN L169 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 521 DAG size of output: 3 [2018-07-25 13:34:16,677 WARN L169 SmtUtils]: Spent 33.50 s on a formula simplification. DAG size of input: 1164 DAG size of output: 3 [2018-07-25 13:34:31,998 WARN L169 SmtUtils]: Spent 14.16 s on a formula simplification. DAG size of input: 1347 DAG size of output: 3 [2018-07-25 13:34:46,895 WARN L169 SmtUtils]: Spent 13.87 s on a formula simplification. DAG size of input: 1481 DAG size of output: 3 [2018-07-25 13:34:58,108 WARN L169 SmtUtils]: Spent 10.32 s on a formula simplification. DAG size of input: 1507 DAG size of output: 3 [2018-07-25 13:35:00,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:35:06,025 WARN L169 SmtUtils]: Spent 7.12 s on a formula simplification. DAG size of input: 1666 DAG size of output: 3 [2018-07-25 13:35:06,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:35:11,595 WARN L169 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 1235 DAG size of output: 3 [2018-07-25 13:35:14,152 WARN L169 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 796 DAG size of output: 3 [2018-07-25 13:35:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:14,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:14,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:35:14,157 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:35:14,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:35:14,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:35:14,158 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 13:35:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:14,166 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:35:14,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:35:14,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 13:35:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:14,167 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:35:14,167 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:35:14,168 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:35:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:35:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:35:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:35:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:35:14,172 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:35:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:14,172 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:35:14,172 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:35:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:35:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:35:14,173 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:14,173 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 13:35:14,174 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1695645664, now seen corresponding path program 12 times [2018-07-25 13:35:14,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:21,565 WARN L169 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 1029 DAG size of output: 3 [2018-07-25 13:35:28,355 WARN L169 SmtUtils]: Spent 6.31 s on a formula simplification. DAG size of input: 1032 DAG size of output: 3 [2018-07-25 13:35:35,490 WARN L169 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 1033 DAG size of output: 3 Received shutdown request... [2018-07-25 13:37:42,141 WARN L177 SmtUtils]: Removed 5 from assertion stack [2018-07-25 13:37:42,142 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:37:42,145 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:37:42,146 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:37:42 BoogieIcfgContainer [2018-07-25 13:37:42,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:37:42,147 INFO L168 Benchmark]: Toolchain (without parser) took 271531.21 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -417.0 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-25 13:37:42,148 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 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:37:42,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.03 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:37:42,149 INFO L168 Benchmark]: Boogie Preprocessor took 21.40 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:37:42,150 INFO L168 Benchmark]: RCFGBuilder took 233.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 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:37:42,151 INFO L168 Benchmark]: TraceAbstraction took 271231.49 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -427.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-25 13:37:42,155 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.13 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 40.03 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 21.40 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 233.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 271231.49 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -427.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 2316. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 271.1s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 60 SDs, 0 SdLazy, 150 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 122.2s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 0/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-37-42-174.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-37-42-174.csv Completed graceful shutdown