java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:27:40,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:27:40,240 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:27:40,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:27:40,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:27:40,253 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:27:40,254 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:27:40,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:27:40,258 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:27:40,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:27:40,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:27:40,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:27:40,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:27:40,262 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:27:40,263 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:27:40,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:27:40,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:27:40,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:27:40,269 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:27:40,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:27:40,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:27:40,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:27:40,275 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:27:40,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:27:40,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:27:40,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:27:40,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:27:40,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:27:40,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:27:40,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:27:40,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:27:40,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:27:40,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:27:40,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:27:40,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:27:40,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:27:40,294 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:27:40,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:27:40,307 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:27:40,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:27:40,311 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:27:40,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:27:40,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:27:40,312 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:27:40,312 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:27:40,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:27:40,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:27:40,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:27:40,382 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:27:40,382 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:27:40,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl [2018-07-25 13:27:40,383 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl' [2018-07-25 13:27:40,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:27:40,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:27:40,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:27:40,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:27:40,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:27:40,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:27:40,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:27:40,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:27:40,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:27:40,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:27:40,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:27:40,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:27:40,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:27:40,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/1) ... [2018-07-25 13:27:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:27:40,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:27:40,753 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:27:40,755 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:27:40 BoogieIcfgContainer [2018-07-25 13:27:40,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:27:40,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:27:40,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:27:40,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:27:40,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:27:40" (1/2) ... [2018-07-25 13:27:40,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1b4eb0 and model type num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:27:40, skipping insertion in model container [2018-07-25 13:27:40,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:27:40" (2/2) ... [2018-07-25 13:27:40,766 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.i_3.bpl [2018-07-25 13:27:40,777 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:27:40,789 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:27:40,835 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:27:40,836 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:27:40,836 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:27:40,836 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:27:40,837 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:27:40,837 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:27:40,837 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:27:40,837 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:27:40,837 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:27:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:27:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:27:40,858 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:40,859 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:27:40,860 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:40,866 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 13:27:40,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:40,961 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-25 13:27:40,964 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:27:40,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:27:40,969 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:27:40,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:27:40,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:27:40,986 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:27:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:41,026 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 13:27:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:27:41,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 13:27:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:41,039 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:27:41,040 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:27:41,043 INFO L574 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-25 13:27:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:27:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:27:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:27:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:27:41,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:27:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,080 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:27:41,080 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:27:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:27:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:27:41,081 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,081 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:27:41,082 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 13:27:41,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,157 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-25 13:27:41,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:27:41,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:27:41,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:27:41,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:27:41,161 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 13:27:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:41,188 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:27:41,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:27:41,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:27:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:41,190 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:27:41,190 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:27:41,192 INFO L574 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-25 13:27:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:27:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:27:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:27:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:27:41,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:27:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,197 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:27:41,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:27:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:27:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:27:41,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,198 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:27:41,199 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,199 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 13:27:41,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,306 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-25 13:27:41,307 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:27:41,308 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:27:41,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:27:41,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:27:41,309 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 13:27:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:41,389 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:27:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:27:41,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 13:27:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:41,392 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:27:41,393 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:27:41,393 INFO L574 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-25 13:27:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:27:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:27:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:27:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:27:41,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:27:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,399 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:27:41,399 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:27:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:27:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:27:41,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,400 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 13:27:41,401 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 13:27:41,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,469 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-25 13:27:41,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:27:41,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:27:41,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:27:41,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:27:41,475 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 13:27:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:41,553 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:27:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:27:41,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 13:27:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:41,556 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:27:41,556 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:27:41,556 INFO L574 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-25 13:27:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:27:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:27:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:27:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:27:41,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 13:27:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,567 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:27:41,568 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:27:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:27:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:27:41,569 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,569 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 13:27:41,570 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 13:27:41,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,630 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-25 13:27:41,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:27:41,631 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:27:41,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:27:41,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:27:41,633 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 13:27:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:41,720 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:27:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:27:41,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:27:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:41,721 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:27:41,721 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:27:41,722 INFO L574 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-25 13:27:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:27:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:27:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:27:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:27:41,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 13:27:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,736 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:27:41,736 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:27:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:27:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:27:41,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,737 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 13:27:41,737 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,737 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 13:27:41,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,813 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-25 13:27:41,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:27:41,814 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:27:41,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:27:41,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:27:41,815 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 13:27:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:41,913 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:27:41,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:27:41,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:27:41,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:41,915 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:27:41,915 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:27:41,917 INFO L574 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-25 13:27:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:27:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:27:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:27:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:27:41,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 13:27:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,927 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:27:41,927 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:27:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:27:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:27:41,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,928 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 13:27:41,928 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,929 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 13:27:41,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,989 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-25 13:27:41,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:27:41,990 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:27:41,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:27:41,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:27:41,991 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 13:27:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:42,041 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:27:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:27:42,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:27:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:42,042 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:27:42,042 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:27:42,043 INFO L574 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-25 13:27:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:27:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:27:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:27:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:27:42,049 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 13:27:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:42,049 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:27:42,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:27:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:27:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:27:42,050 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:42,051 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 13:27:42,051 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 13:27:42,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:42,163 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-25 13:27:42,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:42,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:27:42,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:27:42,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:27:42,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:27:42,167 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 13:27:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:42,224 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:27:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:27:42,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:27:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:42,225 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:27:42,226 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:27:42,226 INFO L574 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-25 13:27:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:27:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:27:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:27:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:27:42,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 13:27:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:42,232 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:27:42,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:27:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:27:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:27:42,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:42,234 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 13:27:42,234 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 13:27:42,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:27:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:27:42,278 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 13:27:42,305 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:27:42 BoogieIcfgContainer [2018-07-25 13:27:42,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:27:42,307 INFO L168 Benchmark]: Toolchain (without parser) took 1868.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:27:42,309 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:27:42,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:27:42,311 INFO L168 Benchmark]: Boogie Preprocessor took 21.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:27:42,312 INFO L168 Benchmark]: RCFGBuilder took 250.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:27:42,313 INFO L168 Benchmark]: TraceAbstraction took 1548.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-07-25 13:27:42,318 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 250.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1548.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 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: 45]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 38, overapproximation of bitwiseAnd at line 39. Possible FailurePath: [L14] havoc main_#res; [L15] havoc main_~i~5, main_~bit~5, main_~x~4, main_~y~4, main_~c~4; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; [L20] main_~y~4 := 0; [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L29] assume !(main_~c~4 % 256 < 8); [L30] __VERIFIER_assert_#in~cond := (if main_~x~4 % 256 == main_~y~4 % 256 then 1 else 0); [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; [L34] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L45] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 1.4s 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/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, 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_1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-27-42-331.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-27-42-331.csv Received shutdown request...