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-4bit_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:50:05,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:50:05,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:50:05,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:50:05,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:50:05,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:50:05,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:50:05,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:50:05,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:50:05,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:50:05,931 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:50:05,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:50:05,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:50:05,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:50:05,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:50:05,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:50:05,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:50:05,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:50:05,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:50:05,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:50:05,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:50:05,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:50:05,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:50:05,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:50:05,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:50:05,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:50:05,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:50:05,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:50:05,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:50:05,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:50:05,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:50:05,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:50:05,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:50:05,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:50:05,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:50:05,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:50:05,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:50:05,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:50:05,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:50:05,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:50:05,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:50:06,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:50:06,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:50:06,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:50:06,042 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:50:06,043 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:50:06,043 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-4bit_incorrect.bpl [2019-08-05 10:50:06,044 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-4bit_incorrect.bpl' [2019-08-05 10:50:06,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:50:06,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:50:06,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:50:06,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:50:06,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:50:06,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,116 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:50:06,116 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:50:06,116 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:50:06,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:50:06,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:50:06,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:50:06,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:50:06,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/1) ... [2019-08-05 10:50:06,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:50:06,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:50:06,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:50:06,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:50:06,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (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:50:06,211 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:50:06,211 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:50:06,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:50:06,814 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:50:06,815 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:50:06,816 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:50:06 BoogieIcfgContainer [2019-08-05 10:50:06,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:50:06,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:50:06,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:50:06,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:50:06,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:50:06" (1/2) ... [2019-08-05 10:50:06,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abc1e19 and model type CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:50:06, skipping insertion in model container [2019-08-05 10:50:06,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:50:06" (2/2) ... [2019-08-05 10:50:06,825 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_CounterExp-4bit_incorrect.bpl [2019-08-05 10:50:06,834 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:50:06,845 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:50:06,860 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:50:06,883 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:50:06,884 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:50:06,884 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:50:06,885 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:50:06,885 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:50:06,885 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:50:06,885 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:50:06,885 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:50:06,886 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:50:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:50:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:50:06,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:06,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:50:06,911 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:06,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash 31328, now seen corresponding path program 1 times [2019-08-05 10:50:06,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:06,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:50:06,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,016 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:50:07,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:50:07,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:50:07,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:50:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:50:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:50:07,040 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:50:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:07,075 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:50:07,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:50:07,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:50:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:07,091 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:50:07,091 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:50:07,093 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:50:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:50:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:50:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:50:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:50:07,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:50:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:07,121 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:50:07,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:50:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:50:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:50:07,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:07,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:50:07,122 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash 988484, now seen corresponding path program 1 times [2019-08-05 10:50:07,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:07,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:50:07,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,182 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:50:07,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:50:07,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:50:07,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:50:07,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:50:07,186 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:50:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:07,319 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:50:07,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:50:07,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:50:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:07,320 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:50:07,320 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:50:07,321 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:50:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:50:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:50:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:50:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:50:07,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:50:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:07,324 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:50:07,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:50:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:50:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:50:07,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:07,325 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:50:07,326 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash 30660320, now seen corresponding path program 2 times [2019-08-05 10:50:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:07,342 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:50:07,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,485 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:50:07,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:50:07,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:50:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:50:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:50:07,487 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:50:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:07,732 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:50:07,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:50:07,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:50:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:07,734 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:50:07,734 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:50:07,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:50:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:50:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:50:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:50:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:50:07,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:50:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:07,737 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:50:07,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:50:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:50:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:50:07,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:07,738 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:50:07,738 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:07,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:07,739 INFO L82 PathProgramCache]: Analyzing trace with hash 950487236, now seen corresponding path program 3 times [2019-08-05 10:50:07,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:07,755 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:50:07,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,920 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:50:07,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:50:07,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:50:07,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:50:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:50:07,922 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:50:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:07,954 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:50:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:50:07,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:50:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:07,956 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:50:07,956 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:50:07,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:50:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:50:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:50:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:50:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:50:07,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:50:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:07,959 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:50:07,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:50:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:50:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:50:07,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:07,960 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:50:07,960 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -599649440, now seen corresponding path program 4 times [2019-08-05 10:50:07,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:07,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:50:07,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:50:08,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:08,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:50:08,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:50:08,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:50:08,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:50:08,182 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 10:50:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:08,299 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:50:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:50:08,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:50:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:08,301 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:50:08,301 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:50:08,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:50:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:50:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:50:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:50:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:50:08,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:50:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:08,304 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:50:08,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:50:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:50:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:50:08,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:08,306 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:50:08,306 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1409246140, now seen corresponding path program 5 times [2019-08-05 10:50:08,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:08,325 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:50:08,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:08,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:08,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:50:08,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:50:08,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:50:08,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:50:08,594 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:50:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:08,648 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:50:08,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:50:08,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:50:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:08,650 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:50:08,650 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:50:08,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:50:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:50:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:50:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:50:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:50:08,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:50:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:08,654 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:50:08,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:50:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:50:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:50:08,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:08,655 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:50:08,656 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:08,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1370288188, now seen corresponding path program 6 times [2019-08-05 10:50:08,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:08,675 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:50:08,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:50:09,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:09,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:50:09,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:50:09,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:50:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:50:09,308 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 10:50:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:09,694 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:50:09,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:50:09,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:50:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:09,696 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:50:09,697 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:50:09,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:50:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:50:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:50:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:50:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:50:09,700 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:50:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:09,701 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:50:09,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:50:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:50:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:50:09,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:09,702 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:50:09,702 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1708565316, now seen corresponding path program 7 times [2019-08-05 10:50:09,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:50:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:50:09,761 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:50:09,786 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-4bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:50:09 BoogieIcfgContainer [2019-08-05 10:50:09,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:50:09,789 INFO L168 Benchmark]: Toolchain (without parser) took 3704.14 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 109.0 MB in the beginning and 60.3 MB in the end (delta: 48.8 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:09,790 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:50:09,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.42 ms. Allocated memory is still 139.5 MB. Free memory was 108.6 MB in the beginning and 106.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:09,792 INFO L168 Benchmark]: Boogie Preprocessor took 23.94 ms. Allocated memory is still 139.5 MB. Free memory was 106.9 MB in the beginning and 105.7 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:50:09,793 INFO L168 Benchmark]: RCFGBuilder took 672.66 ms. Allocated memory is still 139.5 MB. Free memory was 105.7 MB in the beginning and 86.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:09,794 INFO L168 Benchmark]: TraceAbstraction took 2968.67 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 86.3 MB in the beginning and 60.3 MB in the end (delta: 26.1 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:09,798 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.42 ms. Allocated memory is still 139.5 MB. Free memory was 108.6 MB in the beginning and 106.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.94 ms. Allocated memory is still 139.5 MB. Free memory was 106.9 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 672.66 ms. Allocated memory is still 139.5 MB. Free memory was 105.7 MB in the beginning and 86.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2968.67 ms. Allocated memory was 139.5 MB in the beginning and 177.7 MB in the end (delta: 38.3 MB). Free memory was 86.3 MB in the beginning and 60.3 MB in the end (delta: 26.1 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: assertion can be violated assertion can be violated We found a FailurePath: [L3] of := false; [L4] x0 := false; [L5] x1 := false; [L6] x2 := false; [L7] x3 := false; VAL [of=false, x0=false, x1=false, x2=false, x3=false] [L9] COND TRUE of == false [L10] COND FALSE !(x0 == true) [L14] x0 := true; [L16] COND FALSE !(of == true) [L25] COND FALSE !(of == true) [L34] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND FALSE !(x1 == true) [L21] x1 := true; [L22] of := false; [L25] COND FALSE !(of == true) [L34] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND TRUE x1 == true [L18] x1 := false; [L25] COND TRUE of == true [L26] COND FALSE !(x2 == true) [L30] x2 := true; [L31] of := false; [L34] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND FALSE !(x1 == true) [L21] x1 := true; [L22] of := false; [L25] COND FALSE !(of == true) [L34] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND TRUE x1 == true [L18] x1 := false; [L25] COND TRUE of == true [L26] COND TRUE x2 == true [L27] x2 := false; [L34] COND TRUE of == true [L35] COND FALSE !(x3 == true) [L39] x3 := true; [L40] of := false; VAL [of=false, x0=true, x1=false, x2=false, x3=true] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND FALSE !(x1 == true) [L21] x1 := true; [L22] of := false; [L25] COND FALSE !(of == true) [L34] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND TRUE x1 == true [L18] x1 := false; [L25] COND TRUE of == true [L26] COND FALSE !(x2 == true) [L30] x2 := true; [L31] of := false; [L34] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND FALSE !(x1 == true) [L21] x1 := true; [L22] of := false; [L25] COND FALSE !(of == true) [L34] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true] [L9] COND TRUE of == false [L10] COND TRUE x0 == true [L11] x0 := true; [L12] of := true; [L16] COND TRUE of == true [L17] COND TRUE x1 == true [L18] x1 := false; [L25] COND TRUE of == true [L26] COND TRUE x2 == true [L27] x2 := false; [L34] COND TRUE of == true [L35] COND TRUE x3 == true [L36] x3 := false; VAL [of=true, x0=true, x1=false, x2=false, x3=false] [L9] COND FALSE !(of == false) VAL [of=true, x0=true, x1=false, x2=false, x3=false] [L44] assert !x0 && !x1 && !x2 && !x3; VAL [of=true, x0=true, x1=false, x2=false, x3=false] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 2.9s OverallTime, 8 OverallIterations, 9 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 4 SDslu, 13 SDs, 0 SdLazy, 120 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1050 SizeOfPredicates, 22 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 3/63 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...