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/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:47:29,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:47:29,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:47:29,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:47:29,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:47:29,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:47:29,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:47:29,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:47:29,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:47:29,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:47:29,780 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:47:29,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:47:29,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:47:29,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:47:29,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:47:29,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:47:29,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:47:29,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:47:29,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:47:29,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:47:29,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:47:29,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:47:29,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:47:29,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:47:29,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:47:29,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:47:29,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:47:29,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:47:29,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:47:29,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:47:29,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:47:29,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:47:29,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:47:29,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:47:29,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:47:29,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:47:29,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:47:29,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:47:29,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:47:29,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:47:29,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:47:29,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:47:29,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:47:29,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:47:29,851 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:47:29,852 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:47:29,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2019-08-05 10:47:29,853 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl' [2019-08-05 10:47:29,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:47:29,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:47:29,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:29,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:47:29,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:47:29,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:29,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:47:29,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:47:29,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:47:29,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/1) ... [2019-08-05 10:47:29,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:47:29,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:47:29,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:47:29,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:47:29,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (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-05 10:47:30,018 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:47:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:47:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:47:30,284 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:47:30,285 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:47:30,286 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:30 BoogieIcfgContainer [2019-08-05 10:47:30,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:47:30,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:47:30,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:47:30,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:47:30,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:29" (1/2) ... [2019-08-05 10:47:30,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f64d3ff and model type interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:47:30, skipping insertion in model container [2019-08-05 10:47:30,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:30" (2/2) ... [2019-08-05 10:47:30,294 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2019-08-05 10:47:30,303 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:47:30,311 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:47:30,327 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:47:30,353 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:47:30,354 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:47:30,354 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:47:30,354 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:47:30,354 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:47:30,355 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:47:30,355 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:47:30,355 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:47:30,355 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:47:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:47:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:47:30,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:30,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:47:30,381 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:47:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:30,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:47:30,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:30,518 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-05 10:47:30,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:47:30,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:47:30,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:47:30,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:47:30,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:47:30,541 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:47:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:30,571 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:47:30,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:47:30,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:47:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:30,583 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:47:30,584 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:47:30,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:47:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:47:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:47:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:47:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:47:30,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:47:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:30,619 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:47:30,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:47:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:47:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:47:30,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:30,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:47:30,620 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:47:30,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:30,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:47:30,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:30,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:30,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:47:30,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:47:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:47:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:47:30,700 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:47:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:30,787 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:47:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:47:30,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:47:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:30,789 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:47:30,789 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:47:30,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 10:47:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:47:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:47:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:47:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:47:30,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:47:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:30,793 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:47:30,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:47:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:47:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:47:30,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:30,795 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:47:30,795 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:47:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:30,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:47:30,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:30,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:30,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:47:30,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:47:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:47:30,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:47:30,926 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:47:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:30,989 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:47:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:47:30,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:47:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:30,991 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:47:30,991 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:47:30,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-05 10:47:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:47:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:47:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:47:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:47:30,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:47:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:30,994 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:47:30,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:47:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:47:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:47:30,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:30,995 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:47:30,996 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:47:30,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:31,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:31,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:47:31,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:47:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:47:31,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:31,115 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:47:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,164 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:47:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:47:31,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:47:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,165 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:47:31,166 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:47:31,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:47:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:47:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:47:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:47:31,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:47:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,169 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:47:31,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:47:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:47:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:47:31,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,182 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:47:31,182 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:47:31,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:31,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:31,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:47:31,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:47:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:47:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:31,362 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:47:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,499 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:47:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:47:31,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:47:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,500 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:47:31,500 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:47:31,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:47:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:47:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:47:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:47:31,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:47:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,504 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:47:31,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:47:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:47:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:47:31,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,505 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:47:31,505 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:47:31,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:31,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:31,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:47:31,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:47:31,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:47:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:31,707 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:47:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,738 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:47:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:47:31,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:47:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,739 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:47:31,739 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:47:31,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:47:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:47:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:47:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:47:31,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:47:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,742 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:47:31,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:47:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:47:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:47:31,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,743 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:47:31,744 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:47:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:32,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:32,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:47:32,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:47:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:47:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:32,016 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:47:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:32,050 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:47:32,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:47:32,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:47:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:32,051 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:47:32,052 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:47:32,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:47:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:47:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:47:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:47:32,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:47:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:32,055 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:47:32,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:47:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:47:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:47:32,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:32,056 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:47:32,057 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:32,057 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:47:32,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:32,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:32,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:47:32,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:47:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:47:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:32,223 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:47:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:32,270 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:47:32,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:47:32,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:47:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:32,272 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:47:32,272 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:47:32,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:47:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:47:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:47:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:47:32,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:47:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:32,276 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:47:32,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:47:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:47:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:47:32,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:32,277 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:47:32,277 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:32,278 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:47:32,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:32,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:47:32,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:47:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:47:32,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:32,744 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:47:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:32,778 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:47:32,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:47:32,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:47:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:32,779 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:47:32,779 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:47:32,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:47:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:47:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:47:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:47:32,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:47:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:32,782 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:47:32,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:47:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:47:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:47:32,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:32,783 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:47:32,783 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:47:32,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:32,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:32,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:47:32,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:47:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:47:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:32,944 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:47:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:33,021 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:47:33,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:47:33,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:47:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:33,023 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:47:33,023 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:47:33,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:47:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:47:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:47:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:47:33,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:47:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:33,027 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:47:33,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:47:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:47:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:47:33,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:33,028 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:47:33,028 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:47:33,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:33,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:47:33,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:33,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:33,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:47:33,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:47:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:47:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:47:33,191 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:47:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:33,262 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:47:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:47:33,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:47:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:33,263 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:47:33,263 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:47:33,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:47:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:47:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:47:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:47:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:47:33,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:47:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:33,265 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:47:33,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:47:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:47:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:47:33,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:33,266 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:47:33,267 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:47:33,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:33,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:47:33,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:33,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:33,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:47:33,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:47:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:47:33,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:33,631 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:47:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:33,659 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:47:33,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:47:33,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:47:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:33,661 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:47:33,661 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:47:33,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:47:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:47:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:47:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:47:33,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:47:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:33,665 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:47:33,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:47:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:47:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:47:33,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:33,666 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:47:33,667 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:33,667 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:47:33,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:33,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:47:33,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:34,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:34,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:47:34,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:47:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:47:34,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:34,082 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:47:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:34,116 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:47:34,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:47:34,116 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:47:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:34,118 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:47:34,118 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:47:34,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:47:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:47:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:47:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:47:34,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:47:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:34,123 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:47:34,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:47:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:47:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:47:34,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:34,124 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:47:34,124 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:47:34,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:34,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:47:34,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:34,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:34,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:47:34,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:47:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:47:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:34,388 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:47:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:34,430 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:47:34,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:47:34,430 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:47:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:34,431 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:47:34,431 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:47:34,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:47:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:47:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:47:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:47:34,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:47:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:34,434 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:47:34,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:47:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:47:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:47:34,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:34,435 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:47:34,435 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:47:34,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:34,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:47:34,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:34,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:34,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:47:34,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:47:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:47:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:34,675 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:47:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:34,709 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:47:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:47:34,716 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:47:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:34,717 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:47:34,717 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:47:34,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:47:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:47:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:47:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:47:34,721 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:47:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:34,721 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:47:34,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:47:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:47:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:47:34,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:34,722 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:47:34,723 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:47:34,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:34,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:47:34,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:35,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:35,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:47:35,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:47:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:47:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:35,184 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:47:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:35,485 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:47:35,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:47:35,485 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:47:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:35,486 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:47:35,486 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:47:35,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:47:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:47:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:47:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:47:35,490 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:47:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:35,491 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:47:35,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:47:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:47:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:47:35,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:35,492 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:47:35,492 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:35,492 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:47:35,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:47:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:47:35,536 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:47:35,563 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:47:35 BoogieIcfgContainer [2019-08-05 10:47:35,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:47:35,566 INFO L168 Benchmark]: Toolchain (without parser) took 5677.54 ms. Allocated memory was 134.2 MB in the beginning and 232.3 MB in the end (delta: 98.0 MB). Free memory was 110.5 MB in the beginning and 183.6 MB in the end (delta: -73.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:35,567 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:47:35,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.24 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:35,569 INFO L168 Benchmark]: Boogie Preprocessor took 23.70 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:35,570 INFO L168 Benchmark]: RCFGBuilder took 335.68 ms. Allocated memory is still 134.2 MB. Free memory was 107.4 MB in the beginning and 97.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:35,570 INFO L168 Benchmark]: TraceAbstraction took 5276.34 ms. Allocated memory was 134.2 MB in the beginning and 232.3 MB in the end (delta: 98.0 MB). Free memory was 97.4 MB in the beginning and 183.6 MB in the end (delta: -86.2 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:35,575 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.16 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.24 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.70 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.68 ms. Allocated memory is still 134.2 MB. Free memory was 107.4 MB in the beginning and 97.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5276.34 ms. Allocated memory was 134.2 MB in the beginning and 232.3 MB in the end (delta: 98.0 MB). Free memory was 97.4 MB in the beginning and 183.6 MB in the end (delta: -86.2 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 61]: assertion can be violated assertion can be violated We found a FailurePath: [L18] havoc main_#res; [L19] havoc main_#t~nondet0, main_~yy~5, main_~z~5, main_#t~nondet1, main_~xx~5, main_~x~5, main_~y~5, main_~zz~5, main_~i~5; [L20] main_~x~5 := main_#t~nondet0; [L21] havoc main_#t~nondet0; [L22] main_~y~5 := main_#t~nondet1; [L23] havoc main_#t~nondet1; [L24] havoc main_~xx~5; [L25] havoc main_~yy~5; [L26] havoc main_~zz~5; [L27] main_~z~5 := 0; [L28] main_~i~5 := 0; VAL [main_~i~5=0, main_~x~5=-65537, main_~y~5=-65537, main_~z~5=0] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15, main_~x~5=-65537, main_~y~5=-65537] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537] [L35] assume main_~i~5 < 4294967296 && !(main_~i~5 < 16); [L36] assume main_~x~5 < -65536; [L37] main_~xx~5 := main_~x~5 % 65536; [L38] assume main_~y~5 < -65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] havoc main_~xx~5; [L41] havoc main_~xx~5; [L42] havoc main_~xx~5; [L43] havoc main_~xx~5; [L44] havoc main_~yy~5; [L45] havoc main_~yy~5; [L46] havoc main_~yy~5; [L47] havoc main_~yy~5; [L48] havoc main_~zz~5; [L49] assume (((main_~zz~5 < 4294967296 && 0 <= main_~zz~5) && -4294967296 <= main_~z~5) && main_~z~5 < 0) && !(main_~z~5 + 4294967296 == main_~zz~5); [L50] __VERIFIER_assert_#in~cond := 0; [L51] havoc __VERIFIER_assert_~cond; [L52] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L53] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 5.2s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 0 SDslu, 60 SDs, 0 SdLazy, 212 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=16, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 5048 SizeOfPredicates, 16 NumberOfNonLiveVariables, 896 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...