java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i '../../../trunk/examples/cookify/bpl right.bpl' -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:46,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:46,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:46,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:46,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:46,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:46,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:46,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:46,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:46,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:46,867 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:46,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:46,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:46,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:46,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:46,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:46,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:46,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:46,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:46,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:46,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:46,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:46,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:46,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:46,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:46,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:46,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:46,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:46,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:46,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:46,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:46,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:46,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:46,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:46,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:46,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:46,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:46,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:46,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:46,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:46,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:46,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:46,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:46,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:46,981 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:46,982 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:46,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/cookify/bpl right.bpl [2019-08-05 11:21:46,983 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/cookify/bpl right.bpl' [2019-08-05 11:21:47,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:47,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:47,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:47,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:47,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:47,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,091 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:47,092 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:47,092 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:47,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:47,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:47,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:47,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:47,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... [2019-08-05 11:21:47,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:47,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:47,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:47,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:47,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:21:47,416 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTL given in one single declaration [2019-08-05 11:21:47,417 INFO L130 BoogieDeclarations]: Found specification of procedure encTL [2019-08-05 11:21:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure encTL [2019-08-05 11:21:47,417 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLR given in one single declaration [2019-08-05 11:21:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure encTLR [2019-08-05 11:21:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLR [2019-08-05 11:21:47,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encT given in one single declaration [2019-08-05 11:21:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure encT [2019-08-05 11:21:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure encT [2019-08-05 11:21:47,419 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRR given in one single declaration [2019-08-05 11:21:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRR [2019-08-05 11:21:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRR [2019-08-05 11:21:47,420 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRRR given in one single declaration [2019-08-05 11:21:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRRR [2019-08-05 11:21:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRRR [2019-08-05 11:21:47,421 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRL given in one single declaration [2019-08-05 11:21:47,421 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRL [2019-08-05 11:21:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRL [2019-08-05 11:21:47,421 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRRRL given in one single declaration [2019-08-05 11:21:47,421 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRRRL [2019-08-05 11:21:47,422 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRRRL [2019-08-05 11:21:47,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:47,422 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:47,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRRL given in one single declaration [2019-08-05 11:21:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRRL [2019-08-05 11:21:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRRL [2019-08-05 11:21:47,424 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLL given in one single declaration [2019-08-05 11:21:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure encTLL [2019-08-05 11:21:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLL [2019-08-05 11:21:52,684 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:52,685 INFO L283 CfgBuilder]: Removed 394 assume(true) statements. [2019-08-05 11:21:52,687 INFO L202 PluginConnector]: Adding new model bpl right.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:52 BoogieIcfgContainer [2019-08-05 11:21:52,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:52,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:52,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:52,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:52,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bpl right.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:47" (1/2) ... [2019-08-05 11:21:52,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb372b5 and model type bpl right.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:52, skipping insertion in model container [2019-08-05 11:21:52,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bpl right.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:52" (2/2) ... [2019-08-05 11:21:52,696 INFO L109 eAbstractionObserver]: Analyzing ICFG bpl right.bpl [2019-08-05 11:21:52,705 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:52,715 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:21:52,732 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:21:52,759 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:52,759 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:52,760 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:52,760 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:52,760 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:52,760 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:52,761 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:52,761 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:52,761 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2019-08-05 11:21:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:21:52,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:52,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:21:52,819 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1588105847, now seen corresponding path program 1 times [2019-08-05 11:21:52,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:52,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:52,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:52,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:52,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:21:52,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:53,003 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2019-08-05 11:21:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:53,158 INFO L93 Difference]: Finished difference Result 517 states and 896 transitions. [2019-08-05 11:21:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:53,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:21:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:53,179 INFO L225 Difference]: With dead ends: 517 [2019-08-05 11:21:53,180 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:21:53,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:21:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-08-05 11:21:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 11:21:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 321 transitions. [2019-08-05 11:21:53,235 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 321 transitions. Word has length 5 [2019-08-05 11:21:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:53,235 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 321 transitions. [2019-08-05 11:21:53,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 321 transitions. [2019-08-05 11:21:53,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:21:53,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:53,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:53,237 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1980964493, now seen corresponding path program 1 times [2019-08-05 11:21:53,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:53,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:53,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:53,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:53,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:21:53,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:53,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:53,388 INFO L87 Difference]: Start difference. First operand 183 states and 321 transitions. Second operand 4 states. [2019-08-05 11:21:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:53,717 INFO L93 Difference]: Finished difference Result 301 states and 529 transitions. [2019-08-05 11:21:53,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:53,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:21:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:53,731 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:21:53,731 INFO L226 Difference]: Without dead ends: 299 [2019-08-05 11:21:53,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-05 11:21:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 183. [2019-08-05 11:21:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 11:21:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 318 transitions. [2019-08-05 11:21:53,766 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 318 transitions. Word has length 9 [2019-08-05 11:21:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:53,767 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 318 transitions. [2019-08-05 11:21:53,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 318 transitions. [2019-08-05 11:21:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:21:53,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:53,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:53,769 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1007637766, now seen corresponding path program 1 times [2019-08-05 11:21:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:53,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:53,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:53,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:53,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:53,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:53,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:53,928 INFO L87 Difference]: Start difference. First operand 183 states and 318 transitions. Second operand 4 states. [2019-08-05 11:21:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:54,208 INFO L93 Difference]: Finished difference Result 312 states and 537 transitions. [2019-08-05 11:21:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:54,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-08-05 11:21:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:54,214 INFO L225 Difference]: With dead ends: 312 [2019-08-05 11:21:54,214 INFO L226 Difference]: Without dead ends: 312 [2019-08-05 11:21:54,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-08-05 11:21:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 189. [2019-08-05 11:21:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 11:21:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 324 transitions. [2019-08-05 11:21:54,229 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 324 transitions. Word has length 12 [2019-08-05 11:21:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:54,229 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 324 transitions. [2019-08-05 11:21:54,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 324 transitions. [2019-08-05 11:21:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:21:54,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:54,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:54,232 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash -522343703, now seen corresponding path program 1 times [2019-08-05 11:21:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:54,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:54,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:54,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:54,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:21:54,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:54,481 INFO L87 Difference]: Start difference. First operand 189 states and 324 transitions. Second operand 5 states. [2019-08-05 11:21:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:55,240 INFO L93 Difference]: Finished difference Result 364 states and 613 transitions. [2019-08-05 11:21:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:21:55,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-08-05 11:21:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:55,243 INFO L225 Difference]: With dead ends: 364 [2019-08-05 11:21:55,243 INFO L226 Difference]: Without dead ends: 364 [2019-08-05 11:21:55,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-08-05 11:21:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 192. [2019-08-05 11:21:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:21:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 327 transitions. [2019-08-05 11:21:55,254 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 327 transitions. Word has length 15 [2019-08-05 11:21:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:55,254 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 327 transitions. [2019-08-05 11:21:55,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 327 transitions. [2019-08-05 11:21:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:21:55,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:55,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:55,257 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:55,257 INFO L82 PathProgramCache]: Analyzing trace with hash 27325610, now seen corresponding path program 1 times [2019-08-05 11:21:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:55,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:55,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:55,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:55,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:21:55,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:55,520 INFO L87 Difference]: Start difference. First operand 192 states and 327 transitions. Second operand 6 states. [2019-08-05 11:21:56,077 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-08-05 11:21:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,567 INFO L93 Difference]: Finished difference Result 211 states and 327 transitions. [2019-08-05 11:21:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:21:56,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-08-05 11:21:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,570 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:21:56,570 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:21:56,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:21:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2019-08-05 11:21:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:21:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 235 transitions. [2019-08-05 11:21:56,577 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 235 transitions. Word has length 18 [2019-08-05 11:21:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,577 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 235 transitions. [2019-08-05 11:21:56,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 235 transitions. [2019-08-05 11:21:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:21:56,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:56,580 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1755261398, now seen corresponding path program 1 times [2019-08-05 11:21:56,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:56,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:56,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:56,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:56,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:56,652 INFO L87 Difference]: Start difference. First operand 144 states and 235 transitions. Second operand 4 states. [2019-08-05 11:21:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,800 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2019-08-05 11:21:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:56,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-08-05 11:21:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,805 INFO L225 Difference]: With dead ends: 192 [2019-08-05 11:21:56,805 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 11:21:56,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 11:21:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 112. [2019-08-05 11:21:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:21:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 175 transitions. [2019-08-05 11:21:56,813 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 175 transitions. Word has length 18 [2019-08-05 11:21:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,813 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 175 transitions. [2019-08-05 11:21:56,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 175 transitions. [2019-08-05 11:21:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:21:56,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:56,815 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 607171579, now seen corresponding path program 1 times [2019-08-05 11:21:56,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:56,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:56,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:56,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:56,887 INFO L87 Difference]: Start difference. First operand 112 states and 175 transitions. Second operand 4 states. [2019-08-05 11:21:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:57,157 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2019-08-05 11:21:57,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:57,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-08-05 11:21:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:57,158 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:21:57,158 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:21:57,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:21:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2019-08-05 11:21:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:21:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2019-08-05 11:21:57,162 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 20 [2019-08-05 11:21:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:57,162 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2019-08-05 11:21:57,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2019-08-05 11:21:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:21:57,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:57,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:57,164 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1849835111, now seen corresponding path program 1 times [2019-08-05 11:21:57,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:57,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:21:57,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:57,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:57,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 11:21:57,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:21:57,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:21:57,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:57,295 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand 8 states. [2019-08-05 11:21:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:58,072 INFO L93 Difference]: Finished difference Result 349 states and 508 transitions. [2019-08-05 11:21:58,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:21:58,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-05 11:21:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:58,080 INFO L225 Difference]: With dead ends: 349 [2019-08-05 11:21:58,081 INFO L226 Difference]: Without dead ends: 349 [2019-08-05 11:21:58,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-08-05 11:21:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 85. [2019-08-05 11:21:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:21:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2019-08-05 11:21:58,090 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 22 [2019-08-05 11:21:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:58,090 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2019-08-05 11:21:58,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:21:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2019-08-05 11:21:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:21:58,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:58,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:58,093 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:58,093 INFO L82 PathProgramCache]: Analyzing trace with hash -143997596, now seen corresponding path program 1 times [2019-08-05 11:21:58,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:58,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:58,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:58,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:58,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:58,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:58,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:58,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:58,155 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand 4 states. [2019-08-05 11:21:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:58,210 INFO L93 Difference]: Finished difference Result 173 states and 257 transitions. [2019-08-05 11:21:58,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:58,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-08-05 11:21:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:58,212 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:21:58,212 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:21:58,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:21:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 85. [2019-08-05 11:21:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:21:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2019-08-05 11:21:58,217 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 25 [2019-08-05 11:21:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:58,217 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2019-08-05 11:21:58,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2019-08-05 11:21:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:21:58,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:58,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:58,219 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash -570565715, now seen corresponding path program 1 times [2019-08-05 11:21:58,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:58,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:58,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:58,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:58,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 11:21:58,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:21:58,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:21:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:58,309 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand 7 states. [2019-08-05 11:21:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:58,822 INFO L93 Difference]: Finished difference Result 326 states and 475 transitions. [2019-08-05 11:21:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:21:58,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-08-05 11:21:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:58,829 INFO L225 Difference]: With dead ends: 326 [2019-08-05 11:21:58,829 INFO L226 Difference]: Without dead ends: 326 [2019-08-05 11:21:58,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-08-05 11:21:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 87. [2019-08-05 11:21:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:21:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2019-08-05 11:21:58,834 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 27 [2019-08-05 11:21:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:58,834 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2019-08-05 11:21:58,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:21:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2019-08-05 11:21:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:21:58,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:58,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:58,835 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1928793407, now seen corresponding path program 1 times [2019-08-05 11:21:58,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:58,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:21:58,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:58,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:58,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:58,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:58,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:58,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:58,887 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand 4 states. [2019-08-05 11:21:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:58,941 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2019-08-05 11:21:58,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:58,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 11:21:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:58,947 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:21:58,948 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:21:58,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:21:58,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2019-08-05 11:21:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:21:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2019-08-05 11:21:58,952 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 28 [2019-08-05 11:21:58,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:58,953 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2019-08-05 11:21:58,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2019-08-05 11:21:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:21:58,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:58,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:58,954 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash 552946323, now seen corresponding path program 1 times [2019-08-05 11:21:58,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:58,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:59,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:21:59,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:59,112 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand 6 states. [2019-08-05 11:21:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,498 INFO L93 Difference]: Finished difference Result 469 states and 663 transitions. [2019-08-05 11:21:59,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:21:59,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-08-05 11:21:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,502 INFO L225 Difference]: With dead ends: 469 [2019-08-05 11:21:59,502 INFO L226 Difference]: Without dead ends: 469 [2019-08-05 11:21:59,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-08-05 11:21:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 94. [2019-08-05 11:21:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:21:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2019-08-05 11:21:59,507 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 30 [2019-08-05 11:21:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,508 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2019-08-05 11:21:59,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2019-08-05 11:21:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:21:59,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:59,510 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2056312405, now seen corresponding path program 1 times [2019-08-05 11:21:59,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:59,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:59,552 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand 4 states. [2019-08-05 11:21:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,730 INFO L93 Difference]: Finished difference Result 96 states and 135 transitions. [2019-08-05 11:21:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:59,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-08-05 11:21:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,732 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:21:59,732 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:21:59,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:21:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-08-05 11:21:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:21:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2019-08-05 11:21:59,740 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 32 [2019-08-05 11:21:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,740 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2019-08-05 11:21:59,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2019-08-05 11:21:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:21:59,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:59,742 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1585161032, now seen corresponding path program 1 times [2019-08-05 11:21:59,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:22:00,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:22:00,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 11:22:00,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:22:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:22:00,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:22:00,444 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand 8 states. [2019-08-05 11:22:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:01,107 INFO L93 Difference]: Finished difference Result 246 states and 348 transitions. [2019-08-05 11:22:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:22:01,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-08-05 11:22:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:01,108 INFO L225 Difference]: With dead ends: 246 [2019-08-05 11:22:01,109 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:22:01,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:22:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:22:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:22:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:22:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:22:01,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-08-05 11:22:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:01,111 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:22:01,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:22:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:22:01,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:22:01,116 INFO L202 PluginConnector]: Adding new model bpl right.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:22:01 BoogieIcfgContainer [2019-08-05 11:22:01,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:22:01,118 INFO L168 Benchmark]: Toolchain (without parser) took 14066.89 ms. Allocated memory was 140.5 MB in the beginning and 306.2 MB in the end (delta: 165.7 MB). Free memory was 108.5 MB in the beginning and 241.6 MB in the end (delta: -133.1 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:01,119 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:22:01,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.25 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 100.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:01,120 INFO L168 Benchmark]: Boogie Preprocessor took 132.08 ms. Allocated memory is still 140.5 MB. Free memory was 100.4 MB in the beginning and 95.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:01,121 INFO L168 Benchmark]: RCFGBuilder took 5351.40 ms. Allocated memory was 140.5 MB in the beginning and 241.7 MB in the end (delta: 101.2 MB). Free memory was 95.3 MB in the beginning and 169.2 MB in the end (delta: -73.9 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:01,122 INFO L168 Benchmark]: TraceAbstraction took 8427.72 ms. Allocated memory was 241.7 MB in the beginning and 306.2 MB in the end (delta: 64.5 MB). Free memory was 169.2 MB in the beginning and 241.6 MB in the end (delta: -72.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:22:01,126 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 149.25 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 100.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.08 ms. Allocated memory is still 140.5 MB. Free memory was 100.4 MB in the beginning and 95.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5351.40 ms. Allocated memory was 140.5 MB in the beginning and 241.7 MB in the end (delta: 101.2 MB). Free memory was 95.3 MB in the beginning and 169.2 MB in the end (delta: -73.9 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8427.72 ms. Allocated memory was 241.7 MB in the beginning and 306.2 MB in the end (delta: 64.5 MB). Free memory was 169.2 MB in the beginning and 241.6 MB in the end (delta: -72.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 517 locations, 1 error locations. SAFE Result, 8.3s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4641 SDtfs, 4065 SDslu, 8033 SDs, 0 SdLazy, 1486 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=0, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1585 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 7109 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1350 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...