java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:47:53,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:47:53,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:47:53,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:47:53,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:47:53,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:47:53,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:47:53,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:47:53,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:47:53,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:47:53,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:47:53,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:47:53,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:47:53,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:47:53,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:47:53,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:47:53,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:47:53,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:47:53,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:47:53,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:47:53,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:47:53,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:47:53,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:47:53,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:47:53,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:47:53,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:47:53,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:47:53,050 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:47:53,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:47:53,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:47:53,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:47:53,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:47:53,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:47:53,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:47:53,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:47:53,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:47:53,056 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:47:53,069 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:47:53,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:47:53,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:47:53,071 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:47:53,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:47:53,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:47:53,072 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:47:53,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:47:53,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:47:53,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:47:53,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:47:53,140 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:47:53,141 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:47:53,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl [2018-07-23 13:47:53,143 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl' [2018-07-23 13:47:53,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:47:53,206 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:47:53,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:47:53,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:47:53,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:47:53,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:47:53,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:47:53,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:47:53,259 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:47:53,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/1) ... [2018-07-23 13:47:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:47:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:47:53,520 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:47:53,521 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:47:53 BoogieIcfgContainer [2018-07-23 13:47:53,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:47:53,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:47:53,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:47:53,528 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:47:53,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:47:53" (1/2) ... [2018-07-23 13:47:53,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5053ac92 and model type num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:47:53, skipping insertion in model container [2018-07-23 13:47:53,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:47:53" (2/2) ... [2018-07-23 13:47:53,533 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.i_3.bpl [2018-07-23 13:47:53,544 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:47:53,552 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:47:53,600 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:47:53,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:47:53,601 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:47:53,601 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:47:53,602 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:47:53,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:47:53,602 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:47:53,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:47:53,603 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:47:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:47:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:47:53,629 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:53,630 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:47:53,631 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 13:47:53,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,763 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:47:53,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:47:53,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,766 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0))] [2018-07-23 13:47:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,767 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:47:53,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:47:53,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:47:53,784 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 13:47:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:53,818 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 13:47:53,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:47:53,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:47:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:53,830 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:47:53,830 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:47:53,834 INFO L575 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 [2018-07-23 13:47:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:47:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:47:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:47:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:47:53,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:47:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:53,887 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:47:53,887 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:47:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:47:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:47:53,888 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:53,888 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:47:53,889 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:53,889 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-23 13:47:53,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,943 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:53,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:47:53,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,944 INFO L185 omatonBuilderFactory]: Interpolants [48#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0)), 49#(<= 1 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 1) 256)))), 46#true, 47#false] [2018-07-23 13:47:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:53,947 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:47:53,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:47:53,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:47:53,948 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 13:47:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:53,975 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:47:53,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:47:53,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:47:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:53,977 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:47:53,977 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:47:53,979 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:47:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:47:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:47:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:47:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:47:53,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:47:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:53,983 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:47:53,983 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:47:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:47:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:47:53,984 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:53,984 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:47:53,985 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-23 13:47:53,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:54,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:47:54,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,049 INFO L185 omatonBuilderFactory]: Interpolants [90#true, 91#false, 92#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0)), 93#(<= 1 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 1) 256)))), 94#(<= 2 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 2) 256)) ULTIMATE.start_main_~c~5))] [2018-07-23 13:47:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,049 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:47:54,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:47:54,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:47:54,050 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 13:47:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:54,092 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:47:54,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:47:54,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 13:47:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:54,096 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:47:54,096 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:47:54,097 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:47:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:47:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:47:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:47:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:47:54,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:47:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:54,102 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:47:54,102 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:47:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:47:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:47:54,103 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:54,103 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:47:54,103 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-23 13:47:54,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,181 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:54,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:47:54,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,182 INFO L185 omatonBuilderFactory]: Interpolants [144#false, 145#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0)), 146#(<= 1 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 1) 256)))), 147#(<= 2 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 2) 256)) ULTIMATE.start_main_~c~5)), 148#(<= 3 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 3) 256)))), 143#true] [2018-07-23 13:47:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,183 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:47:54,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:47:54,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:47:54,184 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 13:47:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:54,265 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:47:54,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:47:54,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 13:47:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:54,267 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:47:54,267 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:47:54,267 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:47:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:47:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:47:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:47:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:47:54,272 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:47:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:54,273 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:47:54,273 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:47:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:47:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:47:54,274 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:54,274 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:47:54,274 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-23 13:47:54,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,398 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:54,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:47:54,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,401 INFO L185 omatonBuilderFactory]: Interpolants [208#(<= 1 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 1) 256)))), 209#(<= 2 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 2) 256)) ULTIMATE.start_main_~c~5)), 210#(<= 3 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 3) 256)))), 211#(<= 4 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 4) 256)) ULTIMATE.start_main_~c~5)), 205#true, 206#false, 207#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0))] [2018-07-23 13:47:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,402 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:47:54,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:47:54,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:47:54,404 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 13:47:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:54,476 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:47:54,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:47:54,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:47:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:54,477 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:47:54,478 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:47:54,478 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:47:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:47:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:47:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:47:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:47:54,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:47:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:54,484 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:47:54,484 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:47:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:47:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:47:54,485 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:54,486 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:47:54,486 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-23 13:47:54,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:54,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:47:54,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,595 INFO L185 omatonBuilderFactory]: Interpolants [276#true, 277#false, 278#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0)), 279#(<= 1 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 1) 256)))), 280#(<= 2 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 2) 256)) ULTIMATE.start_main_~c~5)), 281#(<= 3 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 3) 256)))), 282#(<= 4 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 4) 256)) ULTIMATE.start_main_~c~5)), 283#(<= 5 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 5) 256)) ULTIMATE.start_main_~c~5))] [2018-07-23 13:47:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,596 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:47:54,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:47:54,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:47:54,598 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-23 13:47:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:54,643 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:47:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:47:54,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:47:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:54,644 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:47:54,645 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:47:54,645 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:47:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:47:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:47:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:47:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:47:54,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 13:47:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:54,652 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:47:54,652 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:47:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:47:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:47:54,653 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:54,653 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 13:47:54,653 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-23 13:47:54,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,767 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:54,767 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:47:54,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,772 INFO L185 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0)), 359#(<= 1 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 1) 256)))), 360#(<= 2 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 2) 256)) ULTIMATE.start_main_~c~5)), 361#(<= 3 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 3) 256)))), 362#(<= 4 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 4) 256)) ULTIMATE.start_main_~c~5)), 363#(<= 5 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 5) 256)) ULTIMATE.start_main_~c~5)), 364#(<= 6 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 6) 256)) ULTIMATE.start_main_~c~5))] [2018-07-23 13:47:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,772 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:47:54,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:47:54,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:47:54,774 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-23 13:47:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:54,850 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:47:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:47:54,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:47:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:54,854 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:47:54,854 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:47:54,855 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:47:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:47:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:47:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:47:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:47:54,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 13:47:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:54,872 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:47:54,872 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:47:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:47:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:47:54,873 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:54,873 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:47:54,874 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-23 13:47:54,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:47:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:47:54,972 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:47:54,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:47:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,974 INFO L185 omatonBuilderFactory]: Interpolants [448#(<= 1 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 1) 256)))), 449#(<= 2 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 2) 256)) ULTIMATE.start_main_~c~5)), 450#(<= 3 (+ ULTIMATE.start_main_~c~5 (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 3) 256)))), 451#(<= 4 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 4) 256)) ULTIMATE.start_main_~c~5)), 452#(<= 5 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 5) 256)) ULTIMATE.start_main_~c~5)), 453#(<= 6 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 6) 256)) ULTIMATE.start_main_~c~5)), 454#(<= 7 (+ (* 256 (div (+ (- ULTIMATE.start_main_~c~5) 7) 256)) ULTIMATE.start_main_~c~5)), 445#true, 446#false, 447#(and (<= 0 ULTIMATE.start_main_~c~5) (<= ULTIMATE.start_main_~c~5 0))] [2018-07-23 13:47:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:47:54,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:47:54,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:47:54,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:47:54,978 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-23 13:47:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:47:55,079 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:47:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:47:55,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:47:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:47:55,080 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:47:55,081 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:47:55,082 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:47:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:47:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:47:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:47:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:47:55,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 13:47:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:47:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:47:55,098 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:47:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:47:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:47:55,099 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:47:55,100 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 13:47:55,102 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:47:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-23 13:47:55,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:47:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:47:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:47:55,148 INFO L423 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 13:47:55,171 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:47:55 BoogieIcfgContainer [2018-07-23 13:47:55,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:47:55,173 INFO L168 Benchmark]: Toolchain (without parser) took 1968.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:47:55,175 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:47:55,176 INFO L168 Benchmark]: Boogie Preprocessor took 51.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:47:55,177 INFO L168 Benchmark]: RCFGBuilder took 263.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:47:55,178 INFO L168 Benchmark]: TraceAbstraction took 1648.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:47:55,182 INFO L336 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 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 263.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1648.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 39, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~x~5, main_~y~5, main_~c~5; [L17] main_~x~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] havoc main_~y~5; [L20] havoc main_~c~5; [L21] main_~y~5 := 0; [L22] main_~c~5 := 0; VAL [main_~c~5=0, main_~y~5=0] [L25] assume true; VAL [main_~c~5=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L30] assume !(main_~c~5 % 256 < 8); [L31] __VERIFIER_assert_#in~cond := (if main_~x~5 % 256 == main_~y~5 % 256 then 1 else 0); [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; [L35] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 1.5s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 205 SDs, 0 SdLazy, 276 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/168 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 9936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-47-55-195.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-47-55-195.csv Received shutdown request...