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_4bitCounter-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:53:11,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:53:11,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:53:11,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:53:11,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:53:11,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:53:11,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:53:11,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:53:11,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:53:11,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:53:11,906 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:53:11,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:53:11,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:53:11,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:53:11,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:53:11,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:53:11,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:53:11,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:53:11,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:53:11,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:53:11,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:53:11,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:53:11,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:53:11,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:53:11,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:53:11,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:53:11,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:53:11,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:53:11,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:53:11,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:53:11,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:53:11,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:53:11,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:53:11,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:53:11,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:53:11,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:53:11,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:53:11,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:53:11,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:53:11,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:53:11,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:53:11,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:53:11,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:53:12,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:53:12,002 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:53:12,002 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:53:12,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_4bitCounter-incorrect.bpl [2019-08-05 10:53:12,003 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_4bitCounter-incorrect.bpl' [2019-08-05 10:53:12,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:53:12,040 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:53:12,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:12,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:53:12,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:53:12,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,075 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:53:12,076 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:53:12,076 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:53:12,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:12,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:53:12,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:53:12,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:53:12,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... [2019-08-05 10:53:12,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:53:12,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:53:12,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:53:12,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:53:12,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:53:12,168 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Counter given in one single declaration [2019-08-05 10:53:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure Counter [2019-08-05 10:53:12,168 INFO L138 BoogieDeclarations]: Found implementation of procedure Counter [2019-08-05 10:53:12,672 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:53:12,672 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:53:12,674 INFO L202 PluginConnector]: Adding new model CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:12 BoogieIcfgContainer [2019-08-05 10:53:12,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:53:12,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:53:12,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:53:12,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:53:12,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:12" (1/2) ... [2019-08-05 10:53:12,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecac4e6 and model type CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:53:12, skipping insertion in model container [2019-08-05 10:53:12,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:12" (2/2) ... [2019-08-05 10:53:12,682 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_4bitCounter-incorrect.bpl [2019-08-05 10:53:12,691 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:53:12,699 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:53:12,718 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:53:12,741 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:53:12,742 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:53:12,742 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:53:12,743 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:53:12,743 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:53:12,743 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:53:12,743 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:53:12,743 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:53:12,744 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:53:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:53:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:53:12,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:12,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:53:12,769 INFO L418 AbstractCegarLoop]: === Iteration 1 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:12,775 INFO L82 PathProgramCache]: Analyzing trace with hash 30656, now seen corresponding path program 1 times [2019-08-05 10:53:12,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:12,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:53:12,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:12,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:53:12,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:53:12,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:53:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:53:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:53:12,927 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:53:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:12,967 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:53:12,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:53:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:12,980 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:12,980 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:53:12,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:53:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:53:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:53:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:53:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:53:13,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:53:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:13,013 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:53:13,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:53:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:53:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:53:13,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:13,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:53:13,015 INFO L418 AbstractCegarLoop]: === Iteration 2 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:13,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash 961865, now seen corresponding path program 1 times [2019-08-05 10:53:13,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:13,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:53:13,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:13,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:13,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:53:13,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:53:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:53:13,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:53:13,134 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:53:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:13,180 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:13,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:53:13,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:53:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:13,181 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:13,181 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:53:13,182 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:53:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:53:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:53:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:53:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:53:13,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:53:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:13,185 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:53:13,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:53:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:53:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:53:13,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:13,186 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:53:13,186 INFO L418 AbstractCegarLoop]: === Iteration 3 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 29829344, now seen corresponding path program 2 times [2019-08-05 10:53:13,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:13,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:53:13,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:13,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:53:13,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:53:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:53:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:13,379 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:53:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:13,513 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:53:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:13,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:53:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:13,514 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:53:13,514 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:53:13,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:53:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:53:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:53:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:53:13,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:53:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:13,517 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:53:13,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:53:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:53:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:53:13,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:13,518 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:53:13,518 INFO L418 AbstractCegarLoop]: === Iteration 4 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 924721193, now seen corresponding path program 3 times [2019-08-05 10:53:13,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:13,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:53:13,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:13,751 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:53:13,844 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:53:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:13,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:53:13,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:53:13,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:53:13,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:53:13,846 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:53:14,020 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 10:53:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:14,098 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:53:14,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:14,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:53:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:14,099 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:53:14,099 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:53:14,100 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:53:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:53:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:53:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:53:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:53:14,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:53:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:14,103 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:53:14,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:53:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:53:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:53:14,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:14,105 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:53:14,105 INFO L418 AbstractCegarLoop]: === Iteration 5 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1398402560, now seen corresponding path program 4 times [2019-08-05 10:53:14,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:14,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:53:14,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:14,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:53:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:14,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:14,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:53:14,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:53:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:53:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:14,417 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:53:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:14,782 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:53:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:14,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:53:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:14,784 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:53:14,784 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:53:14,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:53:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:53:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:53:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:53:14,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:53:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:14,787 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:53:14,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:53:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:53:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:53:14,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:14,788 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:53:14,789 INFO L418 AbstractCegarLoop]: === Iteration 6 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash 460272416, now seen corresponding path program 5 times [2019-08-05 10:53:14,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:14,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:53:14,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:15,026 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:53:15,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:53:15,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:53:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:53:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:53:15,027 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:53:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:15,210 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:53:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:15,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:53:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:15,212 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:53:15,212 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:53:15,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:53:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:53:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:53:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:53:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:53:15,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:53:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:15,217 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:53:15,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:53:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:53:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:53:15,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:15,218 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:53:15,218 INFO L418 AbstractCegarLoop]: === Iteration 7 === [CounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:15,219 INFO L82 PathProgramCache]: Analyzing trace with hash -59470784, now seen corresponding path program 6 times [2019-08-05 10:53:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:53:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:53:15,309 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:53:15,336 INFO L202 PluginConnector]: Adding new model CTR_4bitCounter-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:53:15 BoogieIcfgContainer [2019-08-05 10:53:15,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:53:15,338 INFO L168 Benchmark]: Toolchain (without parser) took 3298.10 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 111.0 MB in the beginning and 63.5 MB in the end (delta: 47.5 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:15,339 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 112.2 MB in the beginning and 112.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:53:15,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 134.7 MB. Free memory was 111.0 MB in the beginning and 109.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:15,341 INFO L168 Benchmark]: Boogie Preprocessor took 22.74 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:15,342 INFO L168 Benchmark]: RCFGBuilder took 571.87 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 93.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:15,343 INFO L168 Benchmark]: TraceAbstraction took 2661.09 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 92.8 MB in the beginning and 63.5 MB in the end (delta: 29.3 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:15,348 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 112.2 MB in the beginning and 112.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 134.7 MB. Free memory was 111.0 MB in the beginning and 109.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.74 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 571.87 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 93.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2661.09 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 92.8 MB in the beginning and 63.5 MB in the end (delta: 29.3 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: assertion can be violated assertion can be violated We found a FailurePath: [L6] x0 := 0; [L7] x1 := 0; [L8] x2 := 0; [L9] x3 := 0; VAL [x0=0, x1=0, x2=0, x3=0] [L11] COND TRUE x3 == 0 [L12] COND TRUE x0 == 0 [L12] x0 := 1; VAL [x0=1, x1=0, x2=0, x3=0] [L11] COND TRUE x3 == 0 [L12] COND FALSE !(x0 == 0) [L14] x0 := 0; [L15] COND TRUE x1 == 0 [L15] x1 := 1; VAL [x0=0, x1=1, x2=0, x3=0] [L11] COND TRUE x3 == 0 [L12] COND TRUE x0 == 0 [L12] x0 := 1; VAL [x0=1, x1=1, x2=0, x3=0] [L11] COND TRUE x3 == 0 [L12] COND FALSE !(x0 == 0) [L14] x0 := 0; [L15] COND FALSE !(x1 == 0) [L17] x1 := 0; [L18] COND TRUE x2 == 0 [L18] x2 := 1; VAL [x0=0, x1=0, x2=1, x3=0] [L11] COND TRUE x3 == 0 [L12] COND TRUE x0 == 0 [L12] x0 := 1; VAL [x0=1, x1=0, x2=1, x3=0] [L11] COND TRUE x3 == 0 [L12] COND FALSE !(x0 == 0) [L14] x0 := 0; [L15] COND TRUE x1 == 0 [L15] x1 := 1; VAL [x0=0, x1=1, x2=1, x3=0] [L11] COND TRUE x3 == 0 [L12] COND TRUE x0 == 0 [L12] x0 := 1; VAL [x0=1, x1=1, x2=1, x3=0] [L11] COND TRUE x3 == 0 [L12] COND FALSE !(x0 == 0) [L14] x0 := 0; [L15] COND FALSE !(x1 == 0) [L17] x1 := 0; [L18] COND FALSE !(x2 == 0) [L20] x2 := 0; [L21] COND TRUE x3 == 0 [L21] x3 := 1; VAL [x0=0, x1=0, x2=0, x3=1] [L11] COND FALSE !(x3 == 0) VAL [x0=0, x1=0, x2=0, x3=1] [L29] assert x0 == 0 && x1 == 0 && x2 == 0 && 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, 2.6s OverallTime, 7 OverallIterations, 8 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 6 SDslu, 6 SDs, 0 SdLazy, 92 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s 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.0s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 1242 SizeOfPredicates, 12 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 50 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...