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/sum03.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:50:03,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:50:03,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:50:03,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:50:03,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:50:03,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:50:03,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:50:03,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:50:03,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:50:03,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:50:03,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:50:03,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:50:03,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:50:03,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:50:03,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:50:03,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:50:03,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:50:03,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:50:03,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:50:03,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:50:03,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:50:03,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:50:03,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:50:03,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:50:03,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:50:03,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:50:03,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:50:03,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:50:03,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:50:03,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:50:03,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:50:03,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:50:03,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:50:03,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:50:03,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:50:03,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:50:03,320 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:50:03,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:50:03,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:50:03,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:50:03,350 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:50:03,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:50:03,351 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:50:03,351 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:50:03,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:50:03,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:50:03,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:50:03,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:50:03,459 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:50:03,460 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:50:03,461 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl [2018-07-25 08:50:03,461 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl' [2018-07-25 08:50:03,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:50:03,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:50:03,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:03,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:50:03,522 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:50:03,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:03,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:50:03,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:50:03,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:50:03,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:50:03,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:50:03,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:50:03,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:50:03,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/1) ... [2018-07-25 08:50:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:50:03,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:50:03,853 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:50:03,853 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:03 BoogieIcfgContainer [2018-07-25 08:50:03,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:50:03,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:50:03,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:50:03,859 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:50:03,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:03" (1/2) ... [2018-07-25 08:50:03,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69809e59 and model type sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:50:03, skipping insertion in model container [2018-07-25 08:50:03,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:03" (2/2) ... [2018-07-25 08:50:03,863 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03.i_3.bpl [2018-07-25 08:50:03,873 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:50:03,882 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:50:03,931 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:50:03,932 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:50:03,933 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:50:03,933 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:50:03,933 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:50:03,934 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:50:03,934 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:50:03,934 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:50:03,934 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:50:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:50:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:50:03,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:03,963 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:50:03,964 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash 947037, now seen corresponding path program 1 times [2018-07-25 08:50:03,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,104 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 08:50:04,107 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:50:04,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:50:04,113 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:50:04,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:50:04,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:04,130 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-25 08:50:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,184 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-25 08:50:04,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:50:04,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 08:50:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,200 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:50:04,201 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:50:04,204 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 08:50:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:50:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-25 08:50:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:50:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:50:04,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 08:50:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,244 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:50:04,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:50:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:50:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:50:04,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,245 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 08:50:04,246 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash 910168357, now seen corresponding path program 1 times [2018-07-25 08:50:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,384 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 08:50:04,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:50:04,387 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:50:04,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:50:04,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:04,388 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 08:50:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,570 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:50:04,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:50:04,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:50:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,572 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:50:04,573 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:50:04,576 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:50:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:50:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:50:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:50:04,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 08:50:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,583 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:50:04,583 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:50:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:50:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:50:04,584 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,584 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 08:50:04,585 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1501471507, now seen corresponding path program 2 times [2018-07-25 08:50:04,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,760 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 08:50:04,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:50:04,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:50:04,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:50:04,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:04,762 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-07-25 08:50:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:04,884 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:50:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:50:04,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:50:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:04,886 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:50:04,887 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:50:04,888 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:50:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:50:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:50:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:50:04,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 08:50:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:04,897 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:50:04,898 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:50:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:50:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:50:04,898 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:04,899 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 08:50:04,899 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash 194959029, now seen corresponding path program 3 times [2018-07-25 08:50:04,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:05,050 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 08:50:05,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:05,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:50:05,051 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:50:05,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:50:05,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:05,054 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-07-25 08:50:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:05,215 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:50:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:50:05,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:50:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:05,217 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:50:05,217 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:50:05,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:50:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:50:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:50:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:50:05,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 08:50:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:05,224 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:50:05,225 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:50:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:50:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:50:05,226 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:05,226 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 08:50:05,226 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1622868355, now seen corresponding path program 4 times [2018-07-25 08:50:05,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:05,399 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 08:50:05,400 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:05,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:50:05,400 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:50:05,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:50:05,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:05,402 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-07-25 08:50:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:05,560 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:50:05,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:50:05,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-25 08:50:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:05,563 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:50:05,564 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:50:05,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:50:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:50:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:50:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:50:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:50:05,578 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 08:50:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:05,579 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:50:05,579 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:50:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:50:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:50:05,580 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:05,582 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 08:50:05,582 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash -503294907, now seen corresponding path program 5 times [2018-07-25 08:50:05,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:05,760 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 08:50:05,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:05,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:50:05,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:50:05,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:50:05,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:05,762 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 11 states. [2018-07-25 08:50:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:05,890 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:50:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:50:05,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-07-25 08:50:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:05,891 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:50:05,892 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:50:05,892 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:50:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:50:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:50:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:50:05,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 08:50:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:05,899 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:50:05,899 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:50:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:50:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:50:05,900 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:05,900 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 08:50:05,901 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1664964621, now seen corresponding path program 6 times [2018-07-25 08:50:05,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:06,154 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 08:50:06,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:06,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:50:06,156 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:50:06,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:50:06,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:50:06,157 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 12 states. [2018-07-25 08:50:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:06,342 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:50:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:50:06,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-07-25 08:50:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:06,343 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:50:06,343 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:50:06,344 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:50:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:50:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:50:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:50:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:50:06,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 08:50:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:06,351 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:50:06,352 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:50:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:50:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:50:06,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:06,353 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 08:50:06,353 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:06,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1991734827, now seen corresponding path program 7 times [2018-07-25 08:50:06,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:06,817 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 08:50:06,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:06,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:50:06,818 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:50:06,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:50:06,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:06,819 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-07-25 08:50:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:07,041 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:50:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:50:07,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-07-25 08:50:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:07,043 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:50:07,043 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:50:07,044 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:50:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:50:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:50:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:50:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:50:07,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 08:50:07,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:07,052 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:50:07,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:50:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:50:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:50:07,053 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:07,053 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 08:50:07,054 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:07,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1498311069, now seen corresponding path program 8 times [2018-07-25 08:50:07,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:07,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:07,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:50:07,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:50:07,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:50:07,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:07,464 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 16 states. [2018-07-25 08:50:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:07,711 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:50:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:50:07,711 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-07-25 08:50:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:07,712 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:50:07,712 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:50:07,713 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:50:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:50:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:50:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:50:07,721 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 08:50:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:07,721 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:50:07,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:50:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:50:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:50:07,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:07,722 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 08:50:07,723 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1062958949, now seen corresponding path program 9 times [2018-07-25 08:50:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:07,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:07,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:50:07,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:50:08,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:50:08,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:50:08,000 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2018-07-25 08:50:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:08,339 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:50:08,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:50:08,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 08:50:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:08,340 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:50:08,340 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:50:08,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:50:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:50:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:50:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:50:08,351 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 08:50:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:08,351 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:50:08,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:50:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:50:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:50:08,352 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:08,353 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 08:50:08,353 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash -698600659, now seen corresponding path program 10 times [2018-07-25 08:50:08,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:50:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:50:08,443 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 08:50:08,490 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:50:08 BoogieIcfgContainer [2018-07-25 08:50:08,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:50:08,491 INFO L168 Benchmark]: Toolchain (without parser) took 4972.08 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 7.0 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2018-07-25 08:50:08,494 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 08:50:08,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.25 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 08:50:08,495 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 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 08:50:08,497 INFO L168 Benchmark]: RCFGBuilder took 266.72 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 08:50:08,498 INFO L168 Benchmark]: TraceAbstraction took 4635.27 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -3.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB. [2018-07-25 08:50:08,504 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.21 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 44.25 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.03 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 266.72 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 4635.27 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -3.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_~sn~5, main_~loop1~5, main_~n1~5, main_~x~5; [L16] main_~sn~5 := 0; [L17] main_~loop1~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~n1~5 := main_#t~nondet1; [L20] havoc main_#t~nondet1; [L21] main_~x~5 := 0; VAL [main_~sn~5=0, main_~x~5=0] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L24] assume true; [L25] assume !false; [L34] assume !(main_~x~5 % 4294967296 < 10); [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L47] assume __VERIFIER_assert_~cond == 0; [L48] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 4.5s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 74 SDslu, 161 SDs, 0 SdLazy, 884 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=10, 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, 10 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 29523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-50-08-522.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-50-08-522.csv Received shutdown request...