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/toy/4BitCounter-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:39:41,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:39:41,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:39:41,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:39:41,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:39:41,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:39:41,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:39:41,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:39:41,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:39:41,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:39:41,923 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:39:41,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:39:41,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:39:41,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:39:41,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:39:41,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:39:41,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:39:41,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:39:41,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:39:41,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:39:41,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:39:41,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:39:41,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:39:41,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:39:41,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:39:41,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:39:41,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:39:41,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:39:41,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:39:41,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:39:41,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:39:41,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:39:41,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:39:41,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:39:41,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:39:41,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:39:41,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:39:41,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:39:41,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:39:41,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:39:41,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:39:42,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:39:42,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:39:42,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:39:42,027 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:39:42,027 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:39:42,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/4BitCounter-incorrect.bpl [2019-08-05 10:39:42,028 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/4BitCounter-incorrect.bpl' [2019-08-05 10:39:42,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:39:42,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:39:42,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:42,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:39:42,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:39:42,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,106 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:39:42,107 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:39:42,108 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:39:42,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:42,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:39:42,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:39:42,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:39:42,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/1) ... [2019-08-05 10:39:42,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:39:42,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:39:42,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:39:42,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:39:42,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (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:39:42,222 INFO L124 BoogieDeclarations]: Specification and implementation of procedure FourBitCounter given in one single declaration [2019-08-05 10:39:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure FourBitCounter [2019-08-05 10:39:42,222 INFO L138 BoogieDeclarations]: Found implementation of procedure FourBitCounter [2019-08-05 10:39:42,703 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:39:42,704 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:39:42,706 INFO L202 PluginConnector]: Adding new model 4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:42 BoogieIcfgContainer [2019-08-05 10:39:42,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:39:42,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:39:42,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:39:42,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:39:42,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:42" (1/2) ... [2019-08-05 10:39:42,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1191a1 and model type 4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:39:42, skipping insertion in model container [2019-08-05 10:39:42,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:42" (2/2) ... [2019-08-05 10:39:42,714 INFO L109 eAbstractionObserver]: Analyzing ICFG 4BitCounter-incorrect.bpl [2019-08-05 10:39:42,722 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:39:42,730 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:39:42,743 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:39:42,768 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:39:42,769 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:39:42,769 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:39:42,769 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:39:42,769 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:39:42,770 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:39:42,770 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:39:42,770 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:39:42,770 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:39:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:39:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:39:42,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:39:42,797 INFO L418 AbstractCegarLoop]: === Iteration 1 === [FourBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash 30656, now seen corresponding path program 1 times [2019-08-05 10:39:42,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,929 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:39:42,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:42,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:39:42,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:39:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:39:42,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:42,954 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:39:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,018 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:39:43,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:39:43,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:39:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,030 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:39:43,030 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:39:43,033 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:39:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:39:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:39:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:39:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:39:43,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:39:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,064 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:39:43,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:39:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:39:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:39:43,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:39:43,065 INFO L418 AbstractCegarLoop]: === Iteration 2 === [FourBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,066 INFO L82 PathProgramCache]: Analyzing trace with hash 961865, now seen corresponding path program 1 times [2019-08-05 10:39:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,187 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:39:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:39:43,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:39:43,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:39:43,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:43,190 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:39:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,229 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:39:43,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:39:43,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:39:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,231 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:39:43,231 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:39:43,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:39:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:39:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:39:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:39:43,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:39:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,235 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:39:43,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:39:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:39:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:39:43,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,236 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:39:43,236 INFO L418 AbstractCegarLoop]: === Iteration 3 === [FourBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash 29829344, now seen corresponding path program 2 times [2019-08-05 10:39:43,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:43,516 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:39:43,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:39:43,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:39:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:39:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:43,518 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:39:43,728 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:39:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,760 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:39:43,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:39:43,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:39:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,761 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:39:43,761 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:39:43,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:39:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:39:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:39:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:39:43,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:39:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,764 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:39:43,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:39:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:39:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:39:43,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,765 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:39:43,766 INFO L418 AbstractCegarLoop]: === Iteration 4 === [FourBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 924721193, now seen corresponding path program 3 times [2019-08-05 10:39:43,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:44,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:39:44,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:39:44,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:39:44,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:44,030 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:39:44,191 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 10:39:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,303 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:39:44,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:39:44,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:39:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,305 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:39:44,305 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:39:44,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:39:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:39:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:39:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:39:44,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:39:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,310 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:39:44,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:39:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:39:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:39:44,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,311 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:39:44,311 INFO L418 AbstractCegarLoop]: === Iteration 5 === [FourBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1398402560, now seen corresponding path program 4 times [2019-08-05 10:39:44,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:44,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:44,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:44,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:44,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:44,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:44,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:44,689 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:39:44,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:39:44,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:39:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:39:44,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:44,691 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:39:45,305 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:39:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:45,405 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:39:45,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:39:45,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:39:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:45,405 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:39:45,406 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:39:45,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:39:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:39:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:39:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:39:45,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:39:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:45,410 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:39:45,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:39:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:39:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:39:45,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:45,411 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:39:45,412 INFO L418 AbstractCegarLoop]: === Iteration 6 === [FourBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash 460272416, now seen corresponding path program 5 times [2019-08-05 10:39:45,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:45,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:39:45,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:45,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:39:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:45,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:45,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:39:45,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:39:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:39:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:45,786 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:39:46,094 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2019-08-05 10:39:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:46,196 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:39:46,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:39:46,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:39:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:46,197 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:39:46,198 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:39:46,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:39:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:39:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:39:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:39:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:39:46,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:39:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:46,202 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:39:46,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:39:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:39:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:39:46,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:46,203 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:39:46,203 INFO L418 AbstractCegarLoop]: === Iteration 7 === [FourBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash -59470784, now seen corresponding path program 6 times [2019-08-05 10:39:46,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:39:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:39:46,314 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:39:46,335 INFO L202 PluginConnector]: Adding new model 4BitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:39:46 BoogieIcfgContainer [2019-08-05 10:39:46,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:39:46,338 INFO L168 Benchmark]: Toolchain (without parser) took 4269.11 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 109.0 MB in the beginning and 143.3 MB in the end (delta: -34.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:46,338 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:39:46,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.83 ms. Allocated memory is still 139.5 MB. Free memory was 109.0 MB in the beginning and 106.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:46,340 INFO L168 Benchmark]: Boogie Preprocessor took 29.27 ms. Allocated memory is still 139.5 MB. Free memory was 106.9 MB in the beginning and 106.0 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. [2019-08-05 10:39:46,341 INFO L168 Benchmark]: RCFGBuilder took 565.92 ms. Allocated memory is still 139.5 MB. Free memory was 106.0 MB in the beginning and 91.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:46,342 INFO L168 Benchmark]: TraceAbstraction took 3628.11 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 91.1 MB in the beginning and 143.3 MB in the end (delta: -52.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:46,353 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.22 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 39.83 ms. Allocated memory is still 139.5 MB. Free memory was 109.0 MB in the beginning and 106.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.27 ms. Allocated memory is still 139.5 MB. Free memory was 106.9 MB in the beginning and 106.0 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 565.92 ms. Allocated memory is still 139.5 MB. Free memory was 106.0 MB in the beginning and 91.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3628.11 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 91.1 MB in the beginning and 143.3 MB in the end (delta: -52.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 56]: assertion can be violated assertion can be violated We found a FailurePath: [L27] x0 := 0; [L28] x1 := 0; [L29] x2 := 0; [L30] x3 := 0; VAL [x0=0, x1=0, x2=0, x3=0] [L32] COND TRUE x3 == 0 [L34] COND TRUE x0 == 0 [L34] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0] [L32] COND TRUE x3 == 0 [L34] COND FALSE !(x0 == 0) [L37] x0 := 0; [L38] COND TRUE x1 == 0 [L38] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0] [L32] COND TRUE x3 == 0 [L34] COND TRUE x0 == 0 [L34] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0] [L32] COND TRUE x3 == 0 [L34] COND FALSE !(x0 == 0) [L37] x0 := 0; [L38] COND FALSE !(x1 == 0) [L41] x1 := 0; [L42] COND TRUE x2 == 0 [L42] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0] [L32] COND TRUE x3 == 0 [L34] COND TRUE x0 == 0 [L34] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0] [L32] COND TRUE x3 == 0 [L34] COND FALSE !(x0 == 0) [L37] x0 := 0; [L38] COND TRUE x1 == 0 [L38] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0] [L32] COND TRUE x3 == 0 [L34] COND TRUE x0 == 0 [L34] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0] [L32] COND TRUE x3 == 0 [L34] COND FALSE !(x0 == 0) [L37] x0 := 0; [L38] COND FALSE !(x1 == 0) [L41] x1 := 0; [L42] COND FALSE !(x2 == 0) [L45] x2 := 0; [L46] COND TRUE x3 == 0 [L46] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1] [L32] COND FALSE !(x3 == 0) VAL [x0=0, x1=0, x2=0, x3=1] [L56] assert x3 == 0; VAL [x0=0, x1=0, x2=0, x3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 3.5s OverallTime, 7 OverallIterations, 8 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 8 SDslu, 12 SDs, 0 SdLazy, 79 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=6, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 2290 SizeOfPredicates, 13 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 3/41 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...