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/programs/scalable/CTR_8bitCounter-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:52:33,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:52:33,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:52:33,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:52:33,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:52:33,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:52:33,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:52:33,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:52:33,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:52:33,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:52:33,835 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:52:33,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:52:33,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:52:33,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:52:33,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:52:33,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:52:33,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:52:33,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:52:33,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:52:33,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:52:33,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:52:33,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:52:33,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:52:33,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:52:33,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:52:33,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:52:33,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:52:33,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:52:33,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:52:33,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:52:33,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:52:33,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:52:33,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:52:33,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:52:33,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:52:33,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:52:33,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:52:33,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:52:33,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:52:33,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:52:33,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:52:33,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:52:33,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:52:33,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:52:33,913 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:52:33,913 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:52:33,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_8bitCounter-incorrect.bpl [2019-08-05 10:52:33,914 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_8bitCounter-incorrect.bpl' [2019-08-05 10:52:33,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:52:33,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:52:33,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:33,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:52:33,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:52:33,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:33,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:33,991 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:52:33,991 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:52:33,992 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:52:33,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:33,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:52:33,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:52:33,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:52:34,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:34,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:34,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:34,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:34,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:34,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:34,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/1) ... [2019-08-05 10:52:34,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:52:34,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:52:34,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:52:34,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:52:34,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (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 10:52:34,101 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Counter given in one single declaration [2019-08-05 10:52:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure Counter [2019-08-05 10:52:34,101 INFO L138 BoogieDeclarations]: Found implementation of procedure Counter [2019-08-05 10:52:34,840 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:52:34,841 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:52:34,842 INFO L202 PluginConnector]: Adding new model CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:34 BoogieIcfgContainer [2019-08-05 10:52:34,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:52:34,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:52:34,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:52:34,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:52:34,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:33" (1/2) ... [2019-08-05 10:52:34,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377d4270 and model type CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:52:34, skipping insertion in model container [2019-08-05 10:52:34,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:34" (2/2) ... [2019-08-05 10:52:34,853 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_8bitCounter-incorrect.bpl [2019-08-05 10:52:34,864 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:52:34,873 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:52:34,889 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:52:34,916 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:52:34,917 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:52:34,917 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:52:34,917 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:52:34,917 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:52:34,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:52:34,918 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:52:34,918 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:52:34,918 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:52:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:52:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:52:34,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:34,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:52:34,944 INFO L418 AbstractCegarLoop]: === Iteration 1 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 31296, now seen corresponding path program 1 times [2019-08-05 10:52:35,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:35,086 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 10:52:35,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:52:35,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:52:35,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:52:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:52:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:52:35,111 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:52:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:35,173 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:35,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:52:35,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:52:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:35,185 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:35,186 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:52:35,188 INFO L628 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 [2019-08-05 10:52:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:52:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:52:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:52:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:52:35,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:52:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:35,216 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:52:35,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:52:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:52:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:52:35,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:35,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:52:35,218 INFO L418 AbstractCegarLoop]: === Iteration 2 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:35,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash 989413, now seen corresponding path program 1 times [2019-08-05 10:52:35,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:35,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:35,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:52:35,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:52:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:52:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:52:35,454 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:52:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:35,563 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:52:35,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:52:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:35,565 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:35,565 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:52:35,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:52:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:52:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:52:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:52:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:52:35,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:52:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:35,570 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:52:35,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:52:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:52:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:52:35,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:35,572 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:52:35,572 INFO L418 AbstractCegarLoop]: === Iteration 3 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash 30691040, now seen corresponding path program 2 times [2019-08-05 10:52:35,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:35,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:35,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:52:35,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:52:35,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:52:35,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:35,784 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:52:36,031 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:36,136 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:52:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:36,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:52:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:36,138 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:52:36,138 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:52:36,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:52:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:52:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:52:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:52:36,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:52:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:36,143 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:52:36,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:52:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:52:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:52:36,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:36,144 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:52:36,144 INFO L418 AbstractCegarLoop]: === Iteration 4 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 951441477, now seen corresponding path program 3 times [2019-08-05 10:52:36,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:36,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:52:36,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:36,550 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-08-05 10:52:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:36,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:36,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:52:36,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:52:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:52:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:36,649 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:52:36,784 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-08-05 10:52:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:36,940 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:52:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:36,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:52:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:36,941 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:52:36,941 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:52:36,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:52:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:52:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:52:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:52:36,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:52:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:36,945 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:52:36,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:52:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:52:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:52:36,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:36,947 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:52:36,947 INFO L418 AbstractCegarLoop]: === Iteration 5 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash -570066048, now seen corresponding path program 4 times [2019-08-05 10:52:36,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:37,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:52:37,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:37,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:37,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:37,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:37,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:52:37,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:52:37,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:52:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:37,371 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:52:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:37,580 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:52:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:52:37,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:52:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:37,582 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:52:37,582 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:52:37,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:52:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:52:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:52:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:52:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:52:37,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:52:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:37,586 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:52:37,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:52:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:52:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:52:37,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:37,587 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:52:37,587 INFO L418 AbstractCegarLoop]: === Iteration 6 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1922957344, now seen corresponding path program 5 times [2019-08-05 10:52:37,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:37,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:52:37,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:38,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:38,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:52:38,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:52:38,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:52:38,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:52:38,049 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:52:38,347 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-08-05 10:52:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:38,491 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:52:38,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:52:38,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:52:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:38,493 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:52:38,493 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:52:38,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:52:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:52:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:52:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:52:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:52:38,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:52:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:38,497 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:52:38,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:52:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:52:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:52:38,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:38,498 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:52:38,499 INFO L418 AbstractCegarLoop]: === Iteration 7 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:38,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1126685888, now seen corresponding path program 6 times [2019-08-05 10:52:38,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:38,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:52:38,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:38,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:38,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:38,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:38,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:38,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:38,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:38,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:52:38,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:52:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:52:38,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:52:38,858 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:52:39,135 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:39,561 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:52:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:52:39,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:52:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:39,563 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:52:39,563 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:52:39,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:52:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:52:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:52:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:52:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:52:39,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-08-05 10:52:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:39,568 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:52:39,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:52:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:52:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:52:39,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:39,568 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:52:39,569 INFO L418 AbstractCegarLoop]: === Iteration 8 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1581801984, now seen corresponding path program 7 times [2019-08-05 10:52:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:39,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:52:39,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:39,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:39,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:40,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:40,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:40,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:40,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:40,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:40,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:40,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:40,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:52:40,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:52:40,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:52:40,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:52:40,366 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:52:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:41,078 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:52:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:52:41,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:52:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:41,079 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:52:41,079 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:52:41,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:52:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:52:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:52:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:52:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:52:41,083 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:52:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:41,083 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:52:41,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:52:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:52:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:52:41,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:41,084 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:52:41,084 INFO L418 AbstractCegarLoop]: === Iteration 9 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1006321856, now seen corresponding path program 8 times [2019-08-05 10:52:41,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:41,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:52:41,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:41,406 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-08-05 10:52:41,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,716 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-08-05 10:52:41,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:41,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:42,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:42,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:52:42,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:52:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:52:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:52:42,833 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:52:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:44,384 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:52:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:52:44,384 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:52:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:44,386 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:52:44,387 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:52:44,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:52:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:52:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:52:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:52:44,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2019-08-05 10:52:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:44,392 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:52:44,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:52:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:52:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:52:44,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:44,393 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:52:44,393 INFO L418 AbstractCegarLoop]: === Iteration 10 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash -866172800, now seen corresponding path program 9 times [2019-08-05 10:52:44,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:44,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:52:44,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:45,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 16 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:45,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:45,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:52:45,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:52:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:52:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:52:45,494 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:52:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:46,115 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:52:46,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:52:46,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:52:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:46,117 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:52:46,117 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:52:46,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:52:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:52:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:52:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:52:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:52:46,123 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 23 [2019-08-05 10:52:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:46,124 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:52:46,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:52:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:52:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:52:46,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:46,125 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:52:46,125 INFO L418 AbstractCegarLoop]: === Iteration 11 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 890708416, now seen corresponding path program 10 times [2019-08-05 10:52:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:46,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:52:46,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:46,398 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:52:46,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:46,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:47,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,160 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-08-05 10:52:48,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:48,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:49,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:49,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:49,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:49,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:49,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:49,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:49,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:52:49,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:52:49,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:52:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:52:49,158 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:52:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:52,121 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:52:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:52:52,122 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:52:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:52,123 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:52:52,123 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:52:52,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:52:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:52:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:52:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:52:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:52:52,129 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-08-05 10:52:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:52,130 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:52:52,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:52:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:52:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:52:52,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:52,131 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:52:52,131 INFO L418 AbstractCegarLoop]: === Iteration 12 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash -924908480, now seen corresponding path program 11 times [2019-08-05 10:52:52,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:52,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:52:52,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:52,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:52,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,173 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:52:53,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:53,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:54,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:54,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:52:54,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:52:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:52:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:54,521 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:52:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:57,740 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:52:57,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:52:57,740 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:52:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:57,742 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:52:57,742 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:52:57,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:52:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:52:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:52:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:52:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:52:57,749 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-08-05 10:52:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:57,749 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:52:57,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:52:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:52:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:52:57,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:57,751 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:52:57,751 INFO L418 AbstractCegarLoop]: === Iteration 13 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 836527808, now seen corresponding path program 12 times [2019-08-05 10:52:57,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:57,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:52:57,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:58,090 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:58,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:58,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:52:59,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:00,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:01,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:02,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:02,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:02,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:02,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:02,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:02,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 8 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:02,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:02,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:53:02,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:53:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:53:02,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1715, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:53:02,091 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:53:02,334 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-08-05 10:53:02,688 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-08-05 10:53:02,939 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-08-05 10:53:03,176 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-08-05 10:53:03,414 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-08-05 10:53:03,639 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-08-05 10:53:03,830 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-08-05 10:53:04,023 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-08-05 10:53:04,253 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-08-05 10:53:04,500 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-08-05 10:53:04,693 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-08-05 10:53:04,892 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-08-05 10:53:05,103 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2019-08-05 10:53:05,334 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2019-08-05 10:53:06,744 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-08-05 10:53:07,761 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 16 [2019-08-05 10:53:07,924 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 16 [2019-08-05 10:53:08,139 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-08-05 10:53:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:08,197 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:53:08,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:53:08,197 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:53:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:08,199 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:53:08,199 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:53:08,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=355, Invalid=5345, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:53:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:53:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:53:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:53:08,207 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 43 [2019-08-05 10:53:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:08,207 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:53:08,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:53:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:53:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:53:08,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:08,210 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:53:08,210 INFO L418 AbstractCegarLoop]: === Iteration 14 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash -451572160, now seen corresponding path program 13 times [2019-08-05 10:53:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:08,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:53:08,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:08,691 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:53:08,856 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:53:09,077 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 10:53:09,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:09,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:10,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:11,518 WARN L188 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:53:11,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:11,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:11,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:12,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:13,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,376 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-08-05 10:53:14,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:15,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:16,903 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-08-05 10:53:17,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:17,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:18,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:18,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:18,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:18,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:18,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:18,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:18,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:18,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:53:18,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:53:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:53:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:53:18,184 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:53:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:30,434 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:53:30,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:53:30,437 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:53:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:30,438 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:53:30,438 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:53:30,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:53:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:53:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:53:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:53:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:53:30,450 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 67 [2019-08-05 10:53:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:30,451 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:53:30,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:53:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:53:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:53:30,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:30,453 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:53:30,453 INFO L418 AbstractCegarLoop]: === Iteration 15 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash -190572480, now seen corresponding path program 14 times [2019-08-05 10:53:30,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:31,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:53:31,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:31,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:31,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:32,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:33,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:34,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:35,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:36,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,349 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-08-05 10:53:37,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:37,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:38,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:38,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:38,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:38,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:39,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:39,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:39,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:39,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:39,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:40,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:41,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:42,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:43,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:43,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:43,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:43,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:43,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 32 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:44,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:44,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:53:44,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:53:44,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:53:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=9475, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:53:44,197 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:53:44,467 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:44,723 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:44,979 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:45,225 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:45,474 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:45,727 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:45,983 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:46,247 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:46,499 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:46,751 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:47,022 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:47,302 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:47,637 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:47,979 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:48,254 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-08-05 10:53:48,521 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-08-05 10:53:48,795 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-08-05 10:53:49,071 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-08-05 10:53:49,335 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:49,599 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:49,859 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:50,123 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-08-05 10:53:50,396 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:50,665 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:50,936 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:51,226 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:51,488 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:51,750 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:52,014 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:52,280 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-08-05 10:53:52,549 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:52,837 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-08-05 10:53:53,128 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-08-05 10:53:53,397 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-08-05 10:53:53,693 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2019-08-05 10:53:53,937 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2019-08-05 10:53:54,167 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2019-08-05 10:53:54,405 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2019-08-05 10:53:54,661 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-08-05 10:53:54,933 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-08-05 10:53:55,199 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-08-05 10:53:55,448 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-08-05 10:53:58,066 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 19 [2019-08-05 10:53:59,156 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 19 [2019-08-05 10:54:00,040 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 19 [2019-08-05 10:54:00,275 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 19 [2019-08-05 10:54:00,510 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-08-05 10:54:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:00,617 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:54:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:54:00,617 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:54:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:00,619 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:54:00,619 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:54:00,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4559 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=811, Invalid=25921, Unknown=0, NotChecked=0, Total=26732 [2019-08-05 10:54:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:54:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:54:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:54:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:54:00,632 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 99 [2019-08-05 10:54:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:00,632 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:54:00,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:54:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:54:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:54:00,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:00,635 INFO L399 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2019-08-05 10:54:00,635 INFO L418 AbstractCegarLoop]: === Iteration 16 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1752522176, now seen corresponding path program 15 times [2019-08-05 10:54:00,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:54:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:54:03,031 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:54:03,129 INFO L202 PluginConnector]: Adding new model CTR_8bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:54:03 BoogieIcfgContainer [2019-08-05 10:54:03,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:54:03,135 INFO L168 Benchmark]: Toolchain (without parser) took 89179.22 ms. Allocated memory was 134.7 MB in the beginning and 672.1 MB in the end (delta: 537.4 MB). Free memory was 112.3 MB in the beginning and 67.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 582.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:03,136 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:54:03,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.82 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:03,137 INFO L168 Benchmark]: Boogie Preprocessor took 33.95 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:03,139 INFO L168 Benchmark]: RCFGBuilder took 813.18 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 82.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:03,140 INFO L168 Benchmark]: TraceAbstraction took 88285.97 ms. Allocated memory was 134.7 MB in the beginning and 672.1 MB in the end (delta: 537.4 MB). Free memory was 82.2 MB in the beginning and 67.3 MB in the end (delta: 14.9 MB). Peak memory consumption was 552.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:03,143 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.20 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.82 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.95 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.18 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 82.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88285.97 ms. Allocated memory was 134.7 MB in the beginning and 672.1 MB in the end (delta: 537.4 MB). Free memory was 82.2 MB in the beginning and 67.3 MB in the end (delta: 14.9 MB). Peak memory consumption was 552.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49]: assertion can be violated assertion can be violated We found a FailurePath: [L6] x0 := 0; [L7] x1 := 0; [L8] x2 := 0; [L9] x3 := 0; [L10] x4 := 0; [L11] x5 := 0; [L12] x6 := 0; [L13] x7 := 0; VAL [x0=0, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=0, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND TRUE x4 == 0 [L28] x4 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=1, x5=0, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND FALSE !(x4 == 0) [L30] x4 := 0; [L31] COND TRUE x5 == 0 [L31] x5 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=0, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND TRUE x4 == 0 [L28] x4 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=1, x5=1, x6=0, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND FALSE !(x4 == 0) [L30] x4 := 0; [L31] COND FALSE !(x5 == 0) [L33] x5 := 0; [L34] COND TRUE x6 == 0 [L34] x6 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=0, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND TRUE x4 == 0 [L28] x4 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=1, x5=0, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND FALSE !(x4 == 0) [L30] x4 := 0; [L31] COND TRUE x5 == 0 [L31] x5 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=0, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND TRUE x4 == 0 [L28] x4 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND TRUE x3 == 0 [L25] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND TRUE x2 == 0 [L22] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND TRUE x1 == 0 [L19] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND TRUE x0 == 0 [L16] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=1, x4=1, x5=1, x6=1, x7=0] [L15] COND TRUE x7 == 0 [L16] COND FALSE !(x0 == 0) [L18] x0 := 0; [L19] COND FALSE !(x1 == 0) [L21] x1 := 0; [L22] COND FALSE !(x2 == 0) [L24] x2 := 0; [L25] COND FALSE !(x3 == 0) [L27] x3 := 0; [L28] COND FALSE !(x4 == 0) [L30] x4 := 0; [L31] COND FALSE !(x5 == 0) [L33] x5 := 0; [L34] COND FALSE !(x6 == 0) [L36] x6 := 0; [L37] COND TRUE x7 == 0 [L37] x7 := 1; VAL [x0=0, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0, x7=1] [L15] COND FALSE !(x7 == 0) VAL [x0=0, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0, x7=1] [L49] assert x0 == 0 && x1 == 0 && x2 == 0 && x3 == 0 && x4 == 0 && x5 == 0 && x6 == 0 && x7 == 0; VAL [x0=0, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0, x7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 88.2s OverallTime, 16 OverallIterations, 128 TraceHistogramMax, 46.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 32 SDslu, 162 SDs, 0 SdLazy, 11778 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8567 ImplicationChecksByTransitivity, 67.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 37.2s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 1471202 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1284 ConjunctsInSsa, 457 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 59/8885 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...