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_CounterExp-16bit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:53:49,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:53:49,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:53:49,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:53:49,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:53:49,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:53:49,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:53:49,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:53:49,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:53:49,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:53:49,909 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:53:49,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:53:49,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:53:49,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:53:49,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:53:49,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:53:49,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:53:49,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:53:49,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:53:49,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:53:49,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:53:49,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:53:49,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:53:49,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:53:49,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:53:49,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:53:49,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:53:49,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:53:49,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:53:49,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:53:49,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:53:49,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:53:49,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:53:49,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:53:49,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:53:49,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:53:49,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:53:49,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:53:49,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:53:49,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:53:49,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:53:49,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:53:49,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:53:49,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:53:49,981 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:53:49,982 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:53:49,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-16bit.bpl [2019-08-05 10:53:49,983 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-16bit.bpl' [2019-08-05 10:53:50,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:53:50,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:53:50,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:50,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:53:50,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:53:50,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,060 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:53:50,060 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:53:50,060 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:53:50,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:50,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:53:50,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:53:50,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:53:50,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/1) ... [2019-08-05 10:53:50,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:53:50,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:53:50,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:53:50,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:53:50,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (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:53:50,180 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:53:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:53:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:53:51,817 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:53:51,817 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:53:51,818 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:51 BoogieIcfgContainer [2019-08-05 10:53:51,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:53:51,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:53:51,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:53:51,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:53:51,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:50" (1/2) ... [2019-08-05 10:53:51,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dc0614 and model type CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:53:51, skipping insertion in model container [2019-08-05 10:53:51,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:51" (2/2) ... [2019-08-05 10:53:51,834 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_CounterExp-16bit.bpl [2019-08-05 10:53:51,844 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:53:51,854 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:53:51,871 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:53:51,900 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:53:51,902 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:53:51,902 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:53:51,902 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:53:51,902 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:53:51,902 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:53:51,902 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:53:51,903 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:53:51,903 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:53:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:53:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:53:51,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:51,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:53:51,925 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash 35936, now seen corresponding path program 1 times [2019-08-05 10:53:51,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:51,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:53:51,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:52,046 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:53:52,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:53:52,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:53:52,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:53:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:53:52,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:53:52,068 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:53:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:52,127 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:53:52,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:53:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:52,140 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:52,140 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:53:52,142 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:53:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:53:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:53:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:53:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:53:52,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:53:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:52,180 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:53:52,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:53:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:53:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:53:52,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:52,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:53:52,183 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:52,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1177604, now seen corresponding path program 1 times [2019-08-05 10:53:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:52,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:53:52,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:52,360 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:53:52,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:52,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:53:52,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:53:52,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:53:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:53:52,365 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:53:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:52,535 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:53:52,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:53:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:52,536 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:52,536 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:53:52,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:53:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:53:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:53:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:53:52,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:53:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:52,540 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:53:52,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:53:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:53:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:53:52,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:52,541 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:53:52,541 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash 36569312, now seen corresponding path program 2 times [2019-08-05 10:53:52,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:52,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:53:52,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:52,875 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:53:52,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:52,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:53:52,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:53:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:53:52,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:52,878 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:53:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:53,105 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:53:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:53,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:53:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:53,106 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:53:53,106 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:53:53,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:53:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:53:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:53:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:53:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:53:53,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:53:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:53,109 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:53:53,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:53:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:53:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:53:53,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:53,110 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:53:53,110 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1133712260, now seen corresponding path program 3 times [2019-08-05 10:53:53,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:53,136 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:53:53,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:53,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:53,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:53:53,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:53:53,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:53:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:53:53,516 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:53:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:53,585 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:53:53,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:53:53,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:53:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:53,592 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:53:53,592 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:53:53,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:53:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:53:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:53:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:53:53,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:53:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:53,595 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:53:53,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:53:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:53:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:53:53,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:53,597 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:53:53,597 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 785405280, now seen corresponding path program 4 times [2019-08-05 10:53:53,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:53,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:53:53,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:54,021 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:53:54,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:54,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:53:54,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:53:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:53:54,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:54,023 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:53:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:54,179 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:53:54,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:54,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:53:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:54,181 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:53:54,181 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:53:54,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:53:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:53:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:53:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:53:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:53:54,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:53:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:54,185 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:53:54,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:53:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:53:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:53:54,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:54,186 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:53:54,186 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1422176508, now seen corresponding path program 5 times [2019-08-05 10:53:54,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:54,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:53:54,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:53:54,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:54,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:53:54,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:53:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:53:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:54,341 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:53:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:54,395 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:53:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:54,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:53:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:54,396 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:53:54,396 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:53:54,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:53:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:53:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:53:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:53:54,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:53:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:54,400 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:53:54,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:53:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:53:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:53:54,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:54,401 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:53:54,401 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1137735200, now seen corresponding path program 6 times [2019-08-05 10:53:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:54,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:53:54,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:53:54,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:54,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:53:54,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:53:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:53:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:53:54,654 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 10:53:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:54,761 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:53:54,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:54,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 10:53:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:54,762 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:53:54,763 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:53:54,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:53:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:53:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:53:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:53:54,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:53:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:54,766 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:53:54,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:53:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:53:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:53:54,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:54,767 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:53:54,767 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1855168096, now seen corresponding path program 7 times [2019-08-05 10:53:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:54,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:53:54,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:55,556 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:53:55,859 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:53:55,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:53:55,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:53:55,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:53:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:55,861 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:53:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:56,081 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:53:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:53:56,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:53:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:56,082 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:53:56,083 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:53:56,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:53:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:53:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:53:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:53:56,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-08-05 10:53:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:56,086 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:53:56,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:53:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:53:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:53:56,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:56,087 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:53:56,087 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 428500832, now seen corresponding path program 8 times [2019-08-05 10:53:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:56,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:53:56,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:56,269 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:53:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:53:56,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:53:56,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:53:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:53:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:53:56,732 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-08-05 10:53:57,194 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:53:57,540 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:53:57,911 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:53:58,281 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:53:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:58,540 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:53:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:53:58,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 10:53:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:58,541 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:53:58,541 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:53:58,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:53:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:53:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:53:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:53:58,546 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:53:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:58,546 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:53:58,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:53:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:53:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:53:58,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:58,547 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:53:58,547 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1777643616, now seen corresponding path program 9 times [2019-08-05 10:53:58,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:58,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 271 conjunts are in the unsatisfiable core [2019-08-05 10:53:58,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:59,352 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:53:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:53:59,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:53:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:53:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:59,354 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:53:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:59,687 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:53:59,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:53:59,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:53:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:59,689 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:53:59,689 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:53:59,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:53:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:53:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:53:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:53:59,694 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-08-05 10:53:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:59,694 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:53:59,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:53:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:53:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:53:59,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:59,695 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:53:59,696 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:59,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1143194208, now seen corresponding path program 10 times [2019-08-05 10:53:59,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:59,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:53:59,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:59,954 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:54:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 293 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:54:00,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:00,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:54:00,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:54:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:54:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:54:00,286 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-08-05 10:54:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:00,877 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:54:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:54:00,880 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-08-05 10:54:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:00,881 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:54:00,881 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:54:00,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:54:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:54:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:54:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:54:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:54:00,887 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-08-05 10:54:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:00,887 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:54:00,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:54:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:54:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:54:00,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:00,889 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:54:00,889 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1327551584, now seen corresponding path program 11 times [2019-08-05 10:54:00,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:00,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 536 conjunts are in the unsatisfiable core [2019-08-05 10:54:01,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:02,408 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:54:02,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:02,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:54:02,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:54:02,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:54:02,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:54:02,410 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:54:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:03,740 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:54:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:54:03,741 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:54:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:03,743 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:54:03,743 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:54:03,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:54:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:54:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:54:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:54:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:54:03,750 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 35 [2019-08-05 10:54:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:03,750 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:54:03,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:54:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:54:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:54:03,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:03,752 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:54:03,752 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1065678944, now seen corresponding path program 12 times [2019-08-05 10:54:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:03,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 800 conjunts are in the unsatisfiable core [2019-08-05 10:54:04,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:06,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:06,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:54:06,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:54:06,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:54:06,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:54:06,450 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:54:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:08,616 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:54:08,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:54:08,616 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:54:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:08,618 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:54:08,618 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:54:08,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:54:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:54:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:54:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:54:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:54:08,626 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 51 [2019-08-05 10:54:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:08,626 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:54:08,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:54:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:54:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:54:08,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:08,629 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:54:08,629 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash -887022496, now seen corresponding path program 13 times [2019-08-05 10:54:08,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:08,803 WARN L254 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 1065 conjunts are in the unsatisfiable core [2019-08-05 10:54:08,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:13,016 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:54:13,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:13,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:54:13,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:54:13,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:54:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:54:13,019 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:54:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:16,692 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:54:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:54:16,693 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:54:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:16,695 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:54:16,695 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:54:16,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:54:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:54:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:54:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:54:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:54:16,703 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 67 [2019-08-05 10:54:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:16,704 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:54:16,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:54:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:54:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:54:16,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:16,707 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:54:16,707 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2114633632, now seen corresponding path program 14 times [2019-08-05 10:54:16,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:16,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 1329 conjunts are in the unsatisfiable core [2019-08-05 10:54:17,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:23,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:23,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:54:23,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:54:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:54:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:54:23,166 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:54:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:28,083 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:54:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:54:28,084 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:54:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:28,086 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:54:28,086 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:54:28,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:54:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:54:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:54:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:54:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:54:28,099 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 83 [2019-08-05 10:54:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:28,100 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:54:28,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:54:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:54:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:54:28,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:28,102 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:54:28,102 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:28,102 INFO L82 PathProgramCache]: Analyzing trace with hash -201235360, now seen corresponding path program 15 times [2019-08-05 10:54:28,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:28,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 1593 conjunts are in the unsatisfiable core [2019-08-05 10:54:28,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:35,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:35,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:54:35,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:54:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:54:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:35,588 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:54:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:42,556 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:54:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:54:42,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:54:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:42,560 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:54:42,560 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:54:42,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:54:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:54:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:54:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:54:42,570 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 99 [2019-08-05 10:54:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:42,570 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:54:42,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:54:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:54:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:54:42,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:42,572 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:54:42,573 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1320843168, now seen corresponding path program 16 times [2019-08-05 10:54:42,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:42,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 1857 conjunts are in the unsatisfiable core [2019-08-05 10:54:43,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:52,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:52,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:54:52,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:54:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:54:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:52,087 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:55:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:01,530 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:55:01,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:55:01,531 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:55:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:01,532 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:55:01,532 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:55:01,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:55:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:55:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:55:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:55:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:55:01,541 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 115 [2019-08-05 10:55:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:01,541 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:55:01,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:55:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:55:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:55:01,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:01,544 INFO L399 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2019-08-05 10:55:01,546 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1237429344, now seen corresponding path program 17 times [2019-08-05 10:55:01,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:01,747 WARN L254 TraceCheckSpWp]: Trace formula consists of 2197 conjuncts, 2106 conjunts are in the unsatisfiable core [2019-08-05 10:55:01,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:13,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:13,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-08-05 10:55:13,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-08-05 10:55:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-08-05 10:55:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:55:13,187 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2019-08-05 10:55:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:25,505 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:55:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:55:25,505 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2019-08-05 10:55:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:25,507 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:55:25,507 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:55:25,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=644, Invalid=16648, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:55:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:55:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:55:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:55:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:55:25,515 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 131 [2019-08-05 10:55:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:25,516 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:55:25,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-08-05 10:55:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:55:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:55:25,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:25,518 INFO L399 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2019-08-05 10:55:25,518 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1299566688, now seen corresponding path program 18 times [2019-08-05 10:55:25,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:25,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 2469 conjuncts, 2386 conjunts are in the unsatisfiable core [2019-08-05 10:55:25,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:26,137 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:55:36,120 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:55:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:42,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:42,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2019-08-05 10:55:42,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-08-05 10:55:42,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-08-05 10:55:42,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:55:42,703 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2019-08-05 10:55:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:58,458 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:55:58,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-08-05 10:55:58,458 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2019-08-05 10:55:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:58,460 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:55:58,460 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:55:58,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:55:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:55:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:55:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:55:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:55:58,466 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 147 [2019-08-05 10:55:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:58,467 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:55:58,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-08-05 10:55:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:55:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:55:58,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:58,469 INFO L399 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2019-08-05 10:55:58,470 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1281487968, now seen corresponding path program 19 times [2019-08-05 10:55:58,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:58,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 2650 conjunts are in the unsatisfiable core [2019-08-05 10:55:58,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:17,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:17,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2019-08-05 10:56:17,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-08-05 10:56:17,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-08-05 10:56:17,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 10:56:17,619 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2019-08-05 10:56:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:37,079 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-08-05 10:56:37,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-08-05 10:56:37,080 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2019-08-05 10:56:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:37,082 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:56:37,082 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 10:56:37,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 10:56:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 10:56:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 10:56:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:56:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 10:56:37,088 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 163 [2019-08-05 10:56:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:37,088 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 10:56:37,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-08-05 10:56:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 10:56:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:56:37,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:37,091 INFO L399 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2019-08-05 10:56:37,091 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash -695855008, now seen corresponding path program 20 times [2019-08-05 10:56:37,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:37,405 WARN L254 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 2914 conjunts are in the unsatisfiable core [2019-08-05 10:56:37,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:59,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:59,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2019-08-05 10:56:59,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 179 states [2019-08-05 10:56:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2019-08-05 10:56:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2019-08-05 10:56:59,466 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2019-08-05 10:57:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:22,824 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-08-05 10:57:22,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-08-05 10:57:22,824 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2019-08-05 10:57:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:22,825 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:57:22,826 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:57:22,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2019-08-05 10:57:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:57:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:57:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:57:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 10:57:22,830 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 179 [2019-08-05 10:57:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:22,831 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 10:57:22,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 179 states. [2019-08-05 10:57:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 10:57:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:57:22,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:22,833 INFO L399 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2019-08-05 10:57:22,833 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:22,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2078424160, now seen corresponding path program 21 times [2019-08-05 10:57:22,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:23,124 WARN L254 TraceCheckSpWp]: Trace formula consists of 3285 conjuncts, 3178 conjunts are in the unsatisfiable core [2019-08-05 10:57:23,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:50,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:50,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2019-08-05 10:57:50,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 195 states [2019-08-05 10:57:50,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2019-08-05 10:57:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2019-08-05 10:57:50,176 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. Received shutdown request... [2019-08-05 10:58:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:58:01,384 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:58:01,390 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:58:01,391 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:58:01 BoogieIcfgContainer [2019-08-05 10:58:01,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:58:01,393 INFO L168 Benchmark]: Toolchain (without parser) took 251366.68 ms. Allocated memory was 135.3 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 111.3 MB in the beginning and 438.1 MB in the end (delta: -326.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-08-05 10:58:01,393 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 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:58:01,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.78 ms. Allocated memory is still 135.3 MB. Free memory was 111.3 MB in the beginning and 109.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:01,396 INFO L168 Benchmark]: Boogie Preprocessor took 32.44 ms. Allocated memory is still 135.3 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:01,397 INFO L168 Benchmark]: RCFGBuilder took 1718.23 ms. Allocated memory was 135.3 MB in the beginning and 168.8 MB in the end (delta: 33.6 MB). Free memory was 107.9 MB in the beginning and 128.9 MB in the end (delta: -21.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:01,398 INFO L168 Benchmark]: TraceAbstraction took 249568.00 ms. Allocated memory was 168.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 128.9 MB in the beginning and 438.1 MB in the end (delta: -309.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-08-05 10:58:01,400 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.23 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 112.6 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 35.78 ms. Allocated memory is still 135.3 MB. Free memory was 111.3 MB in the beginning and 109.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.44 ms. Allocated memory is still 135.3 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1718.23 ms. Allocated memory was 135.3 MB in the beginning and 168.8 MB in the end (delta: 33.6 MB). Free memory was 107.9 MB in the beginning and 128.9 MB in the end (delta: -21.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249568.00 ms. Allocated memory was 168.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 128.9 MB in the beginning and 438.1 MB in the end (delta: -309.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 166]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 166). Cancelled while BasicCegarLoop was constructing difference of abstraction (196states) and FLOYD_HOARE automaton (currently 77 states, 195 states before enhancement),while ReachableStatesComputation was computing reachable states (75 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.5s OverallTime, 22 OverallIterations, 192 TraceHistogramMax, 114.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 8 SDslu, 51 SDs, 0 SdLazy, 146850 SolverSat, 1181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 94.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1391 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 123.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 132.1s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1357 ConstructedInterpolants, 0 QuantifiedInterpolants, 2858880 SizeOfPredicates, 324 NumberOfNonLiveVariables, 22783 ConjunctsInSsa, 21157 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 15/84294 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown