java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:21:57,168 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:21:57,170 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:21:57,181 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:21:57,182 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:21:57,183 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:21:57,184 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:21:57,186 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:21:57,188 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:21:57,189 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:21:57,190 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:21:57,190 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:21:57,191 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:21:57,192 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:21:57,194 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:21:57,194 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:21:57,195 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:21:57,197 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:21:57,200 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:21:57,201 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:21:57,203 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:21:57,204 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:21:57,207 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:21:57,207 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:21:57,207 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:21:57,208 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:21:57,209 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:21:57,210 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:21:57,210 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:21:57,211 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:21:57,212 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:21:57,213 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:21:57,214 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:21:57,214 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:21:57,215 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:21:57,215 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:21:57,215 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:21:57,216 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:21:57,217 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 09:21:57,250 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:21:57,268 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:21:57,275 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:21:57,277 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:21:57,277 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:21:57,278 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl [2019-05-23 09:21:57,278 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2019-05-23 09:21:57,339 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:21:57,341 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:21:57,342 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,342 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:21:57,342 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:21:57,360 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,373 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,381 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,382 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,382 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:21:57,383 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:21:57,394 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,395 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,396 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,397 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,402 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,404 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,405 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,407 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,408 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:21:57,408 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:21:57,408 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:21:57,409 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (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:4096 -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:4096 -smt2 -in -t:12000 [2019-05-23 09:21:57,487 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 09:21:57,487 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 09:21:57,905 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 09:21:57,906 INFO L146 ILogger]: Removed 5 assume(true) statements. [2019-05-23 09:21:57,907 INFO L146 ILogger]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57 BoogieIcfgContainer [2019-05-23 09:21:57,907 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:21:57,909 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:21:57,909 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:21:57,912 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:21:57,912 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/2) ... [2019-05-23 09:21:57,913 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd7fc34 and model type string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:21:57, skipping insertion in model container [2019-05-23 09:21:57,914 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57" (2/2) ... [2019-05-23 09:21:57,915 INFO L146 ILogger]: Analyzing ICFG string.i_3.bpl [2019-05-23 09:21:57,925 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:21:57,934 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:21:57,950 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:21:57,976 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:21:57,977 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:21:57,977 INFO L146 ILogger]: Hoare is false [2019-05-23 09:21:57,977 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:21:57,977 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:21:57,977 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:21:57,978 INFO L146 ILogger]: Difference is false [2019-05-23 09:21:57,978 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:21:57,978 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:21:57,992 INFO L146 ILogger]: Start isEmpty. Operand 45 states. [2019-05-23 09:21:58,001 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 31 [2019-05-23 09:21:58,002 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,003 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,005 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,011 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,011 INFO L146 ILogger]: Analyzing trace with hash 1455146341, now seen corresponding path program 1 times [2019-05-23 09:21:58,062 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,094 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,097 INFO L146 ILogger]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,103 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,151 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,154 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:21:58,155 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:21:58,159 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:21:58,170 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:21:58,171 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,173 INFO L146 ILogger]: Start difference. First operand 45 states. Second operand 3 states. [2019-05-23 09:21:58,300 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,300 INFO L146 ILogger]: Finished difference Result 55 states and 56 transitions. [2019-05-23 09:21:58,301 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:21:58,302 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 30 [2019-05-23 09:21:58,302 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,313 INFO L146 ILogger]: With dead ends: 55 [2019-05-23 09:21:58,313 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 09:21:58,315 INFO L146 ILogger]: 0 DeclaredPredicates, 29 GetRequests, 28 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-05-23 09:21:58,331 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 09:21:58,347 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-05-23 09:21:58,348 INFO L146 ILogger]: Start removeUnreachable. Operand 45 states. [2019-05-23 09:21:58,349 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-05-23 09:21:58,350 INFO L146 ILogger]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 30 [2019-05-23 09:21:58,351 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,351 INFO L146 ILogger]: Abstraction has 45 states and 46 transitions. [2019-05-23 09:21:58,351 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:21:58,351 INFO L146 ILogger]: Start isEmpty. Operand 45 states and 46 transitions. [2019-05-23 09:21:58,353 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 45 [2019-05-23 09:21:58,353 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,353 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,354 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,354 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,354 INFO L146 ILogger]: Analyzing trace with hash 1840113885, now seen corresponding path program 1 times [2019-05-23 09:21:58,355 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,392 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,395 INFO L146 ILogger]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,398 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,462 INFO L146 ILogger]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-23 09:21:58,462 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,463 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:21:58,465 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:21:58,465 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:21:58,466 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:21:58,466 INFO L146 ILogger]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2019-05-23 09:21:58,856 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,856 INFO L146 ILogger]: Finished difference Result 62 states and 63 transitions. [2019-05-23 09:21:58,858 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:21:58,858 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 44 [2019-05-23 09:21:58,858 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,859 INFO L146 ILogger]: With dead ends: 62 [2019-05-23 09:21:58,860 INFO L146 ILogger]: Without dead ends: 62 [2019-05-23 09:21:58,862 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,863 INFO L146 ILogger]: Start minimizeSevpa. Operand 62 states. [2019-05-23 09:21:58,867 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-05-23 09:21:58,867 INFO L146 ILogger]: Start removeUnreachable. Operand 52 states. [2019-05-23 09:21:58,869 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-05-23 09:21:58,869 INFO L146 ILogger]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 44 [2019-05-23 09:21:58,869 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,869 INFO L146 ILogger]: Abstraction has 52 states and 53 transitions. [2019-05-23 09:21:58,870 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:21:58,870 INFO L146 ILogger]: Start isEmpty. Operand 52 states and 53 transitions. [2019-05-23 09:21:58,871 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 52 [2019-05-23 09:21:58,872 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,872 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,872 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,873 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,873 INFO L146 ILogger]: Analyzing trace with hash 1364263942, now seen corresponding path program 2 times [2019-05-23 09:21:58,874 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,908 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,911 INFO L146 ILogger]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,915 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,994 INFO L146 ILogger]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-23 09:21:58,994 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,995 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:21:58,995 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:21:58,995 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:21:58,996 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,996 INFO L146 ILogger]: Start difference. First operand 52 states and 53 transitions. Second operand 7 states. [2019-05-23 09:21:59,271 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,272 INFO L146 ILogger]: Finished difference Result 69 states and 70 transitions. [2019-05-23 09:21:59,272 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:21:59,272 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 51 [2019-05-23 09:21:59,273 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,275 INFO L146 ILogger]: With dead ends: 69 [2019-05-23 09:21:59,275 INFO L146 ILogger]: Without dead ends: 69 [2019-05-23 09:21:59,276 INFO L146 ILogger]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:21:59,276 INFO L146 ILogger]: Start minimizeSevpa. Operand 69 states. [2019-05-23 09:21:59,281 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 69 to 59. [2019-05-23 09:21:59,281 INFO L146 ILogger]: Start removeUnreachable. Operand 59 states. [2019-05-23 09:21:59,283 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-05-23 09:21:59,283 INFO L146 ILogger]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2019-05-23 09:21:59,283 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,283 INFO L146 ILogger]: Abstraction has 59 states and 60 transitions. [2019-05-23 09:21:59,284 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:21:59,284 INFO L146 ILogger]: Start isEmpty. Operand 59 states and 60 transitions. [2019-05-23 09:21:59,285 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 09:21:59,286 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,286 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,286 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,287 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,287 INFO L146 ILogger]: Analyzing trace with hash 52017341, now seen corresponding path program 3 times [2019-05-23 09:21:59,288 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,312 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,314 INFO L146 ILogger]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,317 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,445 INFO L146 ILogger]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-23 09:21:59,446 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,446 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:21:59,446 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:21:59,447 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:21:59,447 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:21:59,447 INFO L146 ILogger]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2019-05-23 09:21:59,922 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,923 INFO L146 ILogger]: Finished difference Result 76 states and 77 transitions. [2019-05-23 09:21:59,926 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:21:59,926 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 58 [2019-05-23 09:21:59,927 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,928 INFO L146 ILogger]: With dead ends: 76 [2019-05-23 09:21:59,928 INFO L146 ILogger]: Without dead ends: 76 [2019-05-23 09:21:59,929 INFO L146 ILogger]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:21:59,930 INFO L146 ILogger]: Start minimizeSevpa. Operand 76 states. [2019-05-23 09:21:59,934 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 76 to 66. [2019-05-23 09:21:59,935 INFO L146 ILogger]: Start removeUnreachable. Operand 66 states. [2019-05-23 09:21:59,936 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-05-23 09:21:59,936 INFO L146 ILogger]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 58 [2019-05-23 09:21:59,936 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,937 INFO L146 ILogger]: Abstraction has 66 states and 67 transitions. [2019-05-23 09:21:59,937 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:21:59,937 INFO L146 ILogger]: Start isEmpty. Operand 66 states and 67 transitions. [2019-05-23 09:21:59,939 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 66 [2019-05-23 09:21:59,939 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,940 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,940 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,940 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,940 INFO L146 ILogger]: Analyzing trace with hash -707422170, now seen corresponding path program 4 times [2019-05-23 09:21:59,942 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,986 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,989 INFO L146 ILogger]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,992 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,151 INFO L146 ILogger]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-23 09:22:00,152 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,152 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:00,152 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:00,153 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:00,153 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:00,153 INFO L146 ILogger]: Start difference. First operand 66 states and 67 transitions. Second operand 11 states. [2019-05-23 09:22:00,463 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,464 INFO L146 ILogger]: Finished difference Result 78 states and 79 transitions. [2019-05-23 09:22:00,464 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:00,464 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 65 [2019-05-23 09:22:00,465 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,465 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 09:22:00,466 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 09:22:00,466 INFO L146 ILogger]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:00,467 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 09:22:00,471 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 73. [2019-05-23 09:22:00,471 INFO L146 ILogger]: Start removeUnreachable. Operand 73 states. [2019-05-23 09:22:00,472 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-05-23 09:22:00,472 INFO L146 ILogger]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 65 [2019-05-23 09:22:00,473 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,473 INFO L146 ILogger]: Abstraction has 73 states and 74 transitions. [2019-05-23 09:22:00,473 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:00,473 INFO L146 ILogger]: Start isEmpty. Operand 73 states and 74 transitions. [2019-05-23 09:22:00,474 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 73 [2019-05-23 09:22:00,474 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,474 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:00,475 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,475 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,475 INFO L146 ILogger]: Analyzing trace with hash 1277968541, now seen corresponding path program 5 times [2019-05-23 09:22:00,476 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,498 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,501 INFO L146 ILogger]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,504 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,550 INFO L146 ILogger]: Checked inductivity of 76 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-05-23 09:22:00,550 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,550 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:22:00,551 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:22:00,551 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:22:00,552 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:00,552 INFO L146 ILogger]: Start difference. First operand 73 states and 74 transitions. Second operand 5 states. [2019-05-23 09:22:00,702 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,702 INFO L146 ILogger]: Finished difference Result 85 states and 86 transitions. [2019-05-23 09:22:00,702 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:22:00,702 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 72 [2019-05-23 09:22:00,703 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,704 INFO L146 ILogger]: With dead ends: 85 [2019-05-23 09:22:00,704 INFO L146 ILogger]: Without dead ends: 85 [2019-05-23 09:22:00,704 INFO L146 ILogger]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:00,705 INFO L146 ILogger]: Start minimizeSevpa. Operand 85 states. [2019-05-23 09:22:00,709 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 85 to 80. [2019-05-23 09:22:00,709 INFO L146 ILogger]: Start removeUnreachable. Operand 80 states. [2019-05-23 09:22:00,710 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-05-23 09:22:00,710 INFO L146 ILogger]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 72 [2019-05-23 09:22:00,710 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,710 INFO L146 ILogger]: Abstraction has 80 states and 81 transitions. [2019-05-23 09:22:00,711 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:22:00,711 INFO L146 ILogger]: Start isEmpty. Operand 80 states and 81 transitions. [2019-05-23 09:22:00,712 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 80 [2019-05-23 09:22:00,712 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,712 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:00,713 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,713 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,713 INFO L146 ILogger]: Analyzing trace with hash -1121604178, now seen corresponding path program 6 times [2019-05-23 09:22:00,714 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,738 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,741 INFO L146 ILogger]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,743 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,058 INFO L146 ILogger]: Checked inductivity of 84 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-05-23 09:22:01,059 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,059 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:22:01,060 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:22:01,060 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:22:01,060 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:01,060 INFO L146 ILogger]: Start difference. First operand 80 states and 81 transitions. Second operand 7 states. [2019-05-23 09:22:01,492 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,492 INFO L146 ILogger]: Finished difference Result 92 states and 93 transitions. [2019-05-23 09:22:01,495 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:22:01,495 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 79 [2019-05-23 09:22:01,496 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,496 INFO L146 ILogger]: With dead ends: 92 [2019-05-23 09:22:01,497 INFO L146 ILogger]: Without dead ends: 92 [2019-05-23 09:22:01,497 INFO L146 ILogger]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:01,498 INFO L146 ILogger]: Start minimizeSevpa. Operand 92 states. [2019-05-23 09:22:01,508 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 92 to 87. [2019-05-23 09:22:01,508 INFO L146 ILogger]: Start removeUnreachable. Operand 87 states. [2019-05-23 09:22:01,509 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-05-23 09:22:01,509 INFO L146 ILogger]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 79 [2019-05-23 09:22:01,510 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,510 INFO L146 ILogger]: Abstraction has 87 states and 88 transitions. [2019-05-23 09:22:01,510 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:22:01,510 INFO L146 ILogger]: Start isEmpty. Operand 87 states and 88 transitions. [2019-05-23 09:22:01,511 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 87 [2019-05-23 09:22:01,511 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,512 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:01,514 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,514 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,515 INFO L146 ILogger]: Analyzing trace with hash -1206150275, now seen corresponding path program 7 times [2019-05-23 09:22:01,516 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,558 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,564 INFO L146 ILogger]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,571 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,664 INFO L146 ILogger]: Checked inductivity of 99 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-05-23 09:22:01,664 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,665 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:01,665 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:01,665 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:01,666 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:01,666 INFO L146 ILogger]: Start difference. First operand 87 states and 88 transitions. Second operand 9 states. [2019-05-23 09:22:01,835 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,836 INFO L146 ILogger]: Finished difference Result 99 states and 100 transitions. [2019-05-23 09:22:01,836 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:01,836 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 86 [2019-05-23 09:22:01,837 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,838 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 09:22:01,839 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 09:22:01,840 INFO L146 ILogger]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:01,840 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 09:22:01,845 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 94. [2019-05-23 09:22:01,845 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 09:22:01,846 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-05-23 09:22:01,847 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 86 [2019-05-23 09:22:01,847 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,847 INFO L146 ILogger]: Abstraction has 94 states and 95 transitions. [2019-05-23 09:22:01,847 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:01,848 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 95 transitions. [2019-05-23 09:22:01,849 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 94 [2019-05-23 09:22:01,849 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,849 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:01,850 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,850 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,850 INFO L146 ILogger]: Analyzing trace with hash -450603314, now seen corresponding path program 8 times [2019-05-23 09:22:01,851 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,878 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,880 INFO L146 ILogger]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,885 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,988 INFO L146 ILogger]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-05-23 09:22:01,989 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,989 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:01,990 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:01,990 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:01,990 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:01,990 INFO L146 ILogger]: Start difference. First operand 94 states and 95 transitions. Second operand 11 states. [2019-05-23 09:22:02,237 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,238 INFO L146 ILogger]: Finished difference Result 101 states and 102 transitions. [2019-05-23 09:22:02,241 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:02,241 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 93 [2019-05-23 09:22:02,242 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,242 INFO L146 ILogger]: With dead ends: 101 [2019-05-23 09:22:02,242 INFO L146 ILogger]: Without dead ends: 101 [2019-05-23 09:22:02,243 INFO L146 ILogger]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:02,243 INFO L146 ILogger]: Start minimizeSevpa. Operand 101 states. [2019-05-23 09:22:02,247 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-05-23 09:22:02,247 INFO L146 ILogger]: Start removeUnreachable. Operand 101 states. [2019-05-23 09:22:02,248 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-05-23 09:22:02,248 INFO L146 ILogger]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 93 [2019-05-23 09:22:02,248 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,249 INFO L146 ILogger]: Abstraction has 101 states and 102 transitions. [2019-05-23 09:22:02,249 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:02,249 INFO L146 ILogger]: Start isEmpty. Operand 101 states and 102 transitions. [2019-05-23 09:22:02,250 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 101 [2019-05-23 09:22:02,250 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,251 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,251 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,251 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,251 INFO L146 ILogger]: Analyzing trace with hash -652054947, now seen corresponding path program 9 times [2019-05-23 09:22:02,252 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,293 INFO L146 ILogger]: Conjunction of SSA is sat [2019-05-23 09:22:02,380 INFO L146 ILogger]: Conjunction of SSA is sat [2019-05-23 09:22:02,409 INFO L146 ILogger]: Counterexample might be feasible [2019-05-23 09:22:02,444 INFO L146 ILogger]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:22:02 BoogieIcfgContainer [2019-05-23 09:22:02,444 INFO L146 ILogger]: ------------------------ END TraceAbstraction---------------------------- [2019-05-23 09:22:02,447 INFO L146 ILogger]: Toolchain (without parser) took 5105.38 ms. Allocated memory was 141.6 MB in the beginning and 235.4 MB in the end (delta: 93.8 MB). Free memory was 110.9 MB in the beginning and 175.4 MB in the end (delta: -64.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-05-23 09:22:02,448 INFO L146 ILogger]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-23 09:22:02,449 INFO L146 ILogger]: Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 141.6 MB. Free memory was 110.9 MB in the beginning and 109.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-23 09:22:02,450 INFO L146 ILogger]: Boogie Preprocessor took 24.92 ms. Allocated memory is still 141.6 MB. Free memory was 109.2 MB in the beginning and 107.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-05-23 09:22:02,450 INFO L146 ILogger]: RCFGBuilder took 499.85 ms. Allocated memory is still 141.6 MB. Free memory was 107.9 MB in the beginning and 94.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-05-23 09:22:02,452 INFO L146 ILogger]: TraceAbstraction took 4535.62 ms. Allocated memory was 141.6 MB in the beginning and 235.4 MB in the end (delta: 93.8 MB). Free memory was 94.8 MB in the beginning and 175.4 MB in the end (delta: -80.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2019-05-23 09:22:02,456 INFO L146 ILogger]: ####################### 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 141.6 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 141.6 MB. Free memory was 110.9 MB in the beginning and 109.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.92 ms. Allocated memory is still 141.6 MB. Free memory was 109.2 MB in the beginning and 107.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 499.85 ms. Allocated memory is still 141.6 MB. Free memory was 107.9 MB in the beginning and 94.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4535.62 ms. Allocated memory was 141.6 MB in the beginning and 235.4 MB in the end (delta: 93.8 MB). Free memory was 94.8 MB in the beginning and 175.4 MB in the end (delta: -80.5 MB). Peak memory consumption was 13.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; VAL [main_~found~5=0] [L32] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L45] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=0] [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=0] [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=0] [L48] havoc main_#t~nondet1; VAL [main_~found~5=0, main_~i~5=0] [L49] main_#t~post0 := main_~i~5; VAL [main_#t~post0=0, main_~found~5=0, main_~i~5=0] [L50] main_~i~5 := main_#t~post0 + 1; VAL [main_#t~post0=0, main_~found~5=0, main_~i~5=1] [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=1] [L45] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=1] [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=1] [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=1] [L48] havoc main_#t~nondet1; VAL [main_~found~5=0, main_~i~5=1] [L49] main_#t~post0 := main_~i~5; VAL [main_#t~post0=1, main_~found~5=0, main_~i~5=1] [L50] main_~i~5 := main_#t~post0 + 1; VAL [main_#t~post0=1, main_~found~5=0, main_~i~5=2] [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=2] [L45] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=2] [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=2] [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=2] [L48] havoc main_#t~nondet1; VAL [main_~found~5=0, main_~i~5=2] [L49] main_#t~post0 := main_~i~5; VAL [main_#t~post0=2, main_~found~5=0, main_~i~5=2] [L50] main_~i~5 := main_#t~post0 + 1; VAL [main_#t~post0=2, main_~found~5=0, main_~i~5=3] [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=3] [L45] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=3] [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=3] [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=3] [L48] havoc main_#t~nondet1; VAL [main_~found~5=0, main_~i~5=3] [L49] main_#t~post0 := main_~i~5; VAL [main_#t~post0=3, main_~found~5=0, main_~i~5=3] [L50] main_~i~5 := main_#t~post0 + 1; VAL [main_#t~post0=3, main_~found~5=0, main_~i~5=4] [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=4] [L45] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=4] [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=4] [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; VAL [main_#t~nondet1=0, main_~found~5=0, main_~i~5=4] [L48] havoc main_#t~nondet1; VAL [main_~found~5=0, main_~i~5=4] [L49] main_#t~post0 := main_~i~5; VAL [main_#t~post0=4, main_~found~5=0, main_~i~5=4] [L50] main_~i~5 := main_#t~post0 + 1; VAL [main_#t~post0=4, main_~found~5=0, main_~i~5=5] [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=5] [L40] assume !(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=5] [L41] assume !!(main_~string_A~5[4] == 0); VAL [main_~found~5=0, main_~i~5=5] [L42] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L80] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=0] [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; VAL [main_#t~nondet3=0, main_~found~5=0, main_~i~5=0] [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; VAL [main_#t~nondet3=0, main_~found~5=0, main_~i~5=0] [L83] havoc main_#t~nondet3; VAL [main_~found~5=0, main_~i~5=0] [L84] main_#t~post2 := main_~i~5; VAL [main_#t~post2=0, main_~found~5=0, main_~i~5=0] [L85] main_~i~5 := main_#t~post2 + 1; VAL [main_#t~post2=0, main_~found~5=0, main_~i~5=1] [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=1] [L80] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=1] [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; VAL [main_#t~nondet3=0, main_~found~5=0, main_~i~5=1] [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; VAL [main_#t~nondet3=0, main_~found~5=0, main_~i~5=1] [L83] havoc main_#t~nondet3; VAL [main_~found~5=0, main_~i~5=1] [L84] main_#t~post2 := main_~i~5; VAL [main_#t~post2=1, main_~found~5=0, main_~i~5=1] [L85] main_~i~5 := main_#t~post2 + 1; VAL [main_#t~post2=1, main_~found~5=0, main_~i~5=2] [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=2] [L80] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=2] [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; VAL [main_#t~nondet3=1, main_~found~5=0, main_~i~5=2] [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; VAL [main_#t~nondet3=1, main_~found~5=0, main_~i~5=2] [L83] havoc main_#t~nondet3; VAL [main_~found~5=0, main_~i~5=2] [L84] main_#t~post2 := main_~i~5; VAL [main_#t~post2=2, main_~found~5=0, main_~i~5=2] [L85] main_~i~5 := main_#t~post2 + 1; VAL [main_#t~post2=2, main_~found~5=0, main_~i~5=3] [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=3] [L80] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=3] [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; VAL [main_#t~nondet3=1, main_~found~5=0, main_~i~5=3] [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; VAL [main_#t~nondet3=1, main_~found~5=0, main_~i~5=3] [L83] havoc main_#t~nondet3; VAL [main_~found~5=0, main_~i~5=3] [L84] main_#t~post2 := main_~i~5; VAL [main_#t~post2=3, main_~found~5=0, main_~i~5=3] [L85] main_~i~5 := main_#t~post2 + 1; VAL [main_#t~post2=3, main_~found~5=0, main_~i~5=4] [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=4] [L80] assume !!(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=4] [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; VAL [main_#t~nondet3=0, main_~found~5=0, main_~i~5=4] [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; VAL [main_#t~nondet3=0, main_~found~5=0, main_~i~5=4] [L83] havoc main_#t~nondet3; VAL [main_~found~5=0, main_~i~5=4] [L84] main_#t~post2 := main_~i~5; VAL [main_#t~post2=4, main_~found~5=0, main_~i~5=4] [L85] main_~i~5 := main_#t~post2 + 1; VAL [main_#t~post2=4, main_~found~5=0, main_~i~5=5] [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=5] [L59] assume !(main_~i~5 < 5); VAL [main_~found~5=0, main_~i~5=5] [L60] assume !!(main_~string_B~5[4] == 0); VAL [main_~found~5=0, main_~i~5=5] [L61] main_~nc_A~5 := 0; VAL [main_~found~5=0, main_~i~5=5, main_~nc_A~5=0] [L63] assume !(main_~string_A~5[main_~nc_A~5] != 0); VAL [main_~found~5=0, main_~i~5=5, main_~nc_A~5=0] [L64] main_~nc_B~5 := 0; VAL [main_~found~5=0, main_~i~5=5, main_~nc_A~5=0, main_~nc_B~5=0] [L66] assume !(main_~string_B~5[main_~nc_B~5] != 0); VAL [main_~found~5=0, main_~i~5=5, main_~nc_A~5=0, main_~nc_B~5=0] [L67] assume !!(main_~nc_B~5 >= main_~nc_A~5); VAL [main_~found~5=0, main_~i~5=5, main_~nc_A~5=0, main_~nc_B~5=0] [L68] main_~j~5 := 0; VAL [main_~found~5=0, main_~i~5=5, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L69] main_~i~5 := main_~j~5; VAL [main_~found~5=0, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L71] assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5); VAL [main_~found~5=0, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L72] main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5); VAL [main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L73] __VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L74] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L75] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 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] [L76] assume __VERIFIER_assert_~cond == 0; 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] [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, 45 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 334 SDtfs, 242 SDslu, 938 SDs, 0 SdLazy, 463 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 609 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=9, 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, 9 MinimizatonAttempts, 60 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 569 ConstructedInterpolants, 0 QuantifiedInterpolants, 60367 SizeOfPredicates, 49 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 304/464 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...