java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:32,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:32,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:32,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:32,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:32,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:32,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:32,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:32,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:32,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:32,377 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:32,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:32,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:32,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:32,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:32,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:32,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:32,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:32,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:32,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:32,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:32,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:32,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:32,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:32,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:32,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:32,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:32,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:32,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:32,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:32,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:32,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:32,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:32,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:32,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:32,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:32,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:32,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:32,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:32,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:32,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:32,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:32,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:32,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:32,504 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:32,504 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:32,505 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl [2019-08-04 21:38:32,505 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2019-08-04 21:38:32,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:32,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:32,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:32,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:32,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:32,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:32,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:32,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:32,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:32,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:32,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:32,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:32,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:32,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:38:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:32,975 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:32,975 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-08-04 21:38:32,976 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:32 BoogieIcfgContainer [2019-08-04 21:38:32,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:32,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:32,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:32,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:32,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/2) ... [2019-08-04 21:38:32,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45aec8d and model type string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:32, skipping insertion in model container [2019-08-04 21:38:32,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:32" (2/2) ... [2019-08-04 21:38:32,985 INFO L109 eAbstractionObserver]: Analyzing ICFG string.i_3.bpl [2019-08-04 21:38:32,994 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:33,002 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:33,018 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:33,045 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:33,045 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:33,046 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:33,046 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:33,046 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:33,046 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:33,046 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:33,047 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:33,047 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-04 21:38:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:38:33,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:38:33,070 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,076 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-08-04 21:38:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:33,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:33,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:33,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:33,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:33,297 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-04 21:38:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,382 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-04 21:38:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:33,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-04 21:38:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,398 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:38:33,398 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:33,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:38:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-04 21:38:33,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-04 21:38:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,435 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-04 21:38:33,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-04 21:38:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:33,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:38:33,436 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-08-04 21:38:33,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-04 21:38:33,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:33,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:33,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:33,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:33,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:33,541 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-04 21:38:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,600 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-04 21:38:33,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:33,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-04 21:38:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,602 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:38:33,602 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:38:33,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:38:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:38:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-04 21:38:33,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-04 21:38:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,606 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-04 21:38:33,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-04 21:38:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:33,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-04 21:38:33,608 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-08-04 21:38:33,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-04 21:38:33,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:33,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:33,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:33,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:33,729 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-04 21:38:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,793 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-04 21:38:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:33,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-04 21:38:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,796 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:38:33,796 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:38:33,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:38:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:38:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:38:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-04 21:38:33,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-04 21:38:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,800 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-04 21:38:33,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-04 21:38:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:33,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,802 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-04 21:38:33,802 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,803 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-08-04 21:38:33,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-04 21:38:34,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:34,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:34,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:34,006 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-04 21:38:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,115 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-04 21:38:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:34,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-04 21:38:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,116 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:38:34,116 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:38:34,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:38:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:38:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:38:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-04 21:38:34,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-04 21:38:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,120 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-04 21:38:34,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-04 21:38:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:34,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,121 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-04 21:38:34,121 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-08-04 21:38:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-04 21:38:34,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:34,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:34,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:34,397 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-04 21:38:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,471 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-04 21:38:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:34,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-04 21:38:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,473 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:38:34,473 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:38:34,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:38:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:38:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:38:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-04 21:38:34,477 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-04 21:38:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,478 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-04 21:38:34,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-04 21:38:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:34,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,479 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-04 21:38:34,479 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,480 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-08-04 21:38:34,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:34,616 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:38:34,636 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:34 BoogieIcfgContainer [2019-08-04 21:38:34,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:34,639 INFO L168 Benchmark]: Toolchain (without parser) took 2076.52 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 109.8 MB in the beginning and 123.8 MB in the end (delta: -14.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:34,640 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 132.6 MB. Free memory is still 111.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:38:34,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.28 ms. Allocated memory is still 132.6 MB. Free memory was 109.8 MB in the beginning and 108.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:34,642 INFO L168 Benchmark]: Boogie Preprocessor took 21.01 ms. Allocated memory is still 132.6 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:34,643 INFO L168 Benchmark]: RCFGBuilder took 350.70 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 96.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:34,645 INFO L168 Benchmark]: TraceAbstraction took 1658.12 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 96.3 MB in the beginning and 123.8 MB in the end (delta: -27.5 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:34,650 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 132.6 MB. Free memory is still 111.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.28 ms. Allocated memory is still 132.6 MB. Free memory was 109.8 MB in the beginning and 108.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.01 ms. Allocated memory is still 132.6 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 350.70 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 96.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1658.12 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 96.3 MB in the beginning and 123.8 MB in the end (delta: -27.5 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 89]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 72. Possible FailurePath: [L23] havoc main_#res; [L24] havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5; [L25] havoc main_~string_A~5; [L26] havoc main_~string_B~5; [L27] havoc main_~i~5; [L28] havoc main_~j~5; [L29] havoc main_~nc_A~5; [L30] havoc main_~nc_B~5; [L31] main_~found~5 := 0; [L32] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=1] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=2] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=3] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=4] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=5] [L40] assume !(main_~i~5 < 5); [L41] assume !!(main_~string_A~5[4] == 0); [L42] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=1] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=2] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=3] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=4] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=5] [L59] assume !(main_~i~5 < 5); [L60] assume !!(main_~string_B~5[4] == 0); [L61] main_~nc_A~5 := 0; [L63] assume !(main_~string_A~5[main_~nc_A~5] != 0); [L64] main_~nc_B~5 := 0; [L66] assume !(main_~string_B~5[main_~nc_B~5] != 0); [L67] assume !!(main_~nc_B~5 >= main_~nc_A~5); [L68] main_~j~5 := 0; [L69] main_~i~5 := main_~j~5; [L71] assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5); [L72] main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5); [L73] __VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0); [L74] havoc __VERIFIER_assert_~cond; [L75] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L76] assume __VERIFIER_assert_~cond == 0; [L77] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L89] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 1.5s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 8 SDslu, 0 SDs, 0 SdLazy, 40 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=5, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 295 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 20/40 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 Received shutdown request...