java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:41:01,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:41:01,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:41:01,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:41:01,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:41:01,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:41:01,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:41:01,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:41:01,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:41:01,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:41:01,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:41:01,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:41:01,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:41:01,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:41:01,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:41:01,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:41:01,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:41:01,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:41:01,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:41:01,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:41:01,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:41:01,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:41:01,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:41:01,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:41:01,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:41:01,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:41:01,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:41:01,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:41:01,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:41:01,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:41:01,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:41:01,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:41:01,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:41:01,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:41:01,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:41:01,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:41:01,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:41:01,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:41:01,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:41:01,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:41:01,896 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:41:01,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:41:01,897 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:41:01,897 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:41:01,897 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:41:01,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:41:01,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:41:02,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:41:02,003 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:41:02,004 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:41:02,005 INFO L418 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 [2018-07-23 13:41:02,005 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-07-23 13:41:02,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:41:02,074 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:41:02,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:41:02,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:41:02,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:41:02,107 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,109 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,123 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,123 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,128 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,132 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,133 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:41:02,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:41:02,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:41:02,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:41:02,139 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 23.07 01:41:02" (1/1) ... [2018-07-23 13:41:02,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-23 13:41:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:41:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:41:02,375 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:41:02,377 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:41:02 BoogieIcfgContainer [2018-07-23 13:41:02,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:41:02,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:41:02,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:41:02,384 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:41:02,384 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 23.07 01:41:02" (1/2) ... [2018-07-23 13:41:02,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e777c4 and model type interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:41:02, skipping insertion in model container [2018-07-23 13:41:02,386 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 23.07 01:41:02" (2/2) ... [2018-07-23 13:41:02,389 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-07-23 13:41:02,400 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:41:02,413 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:41:02,470 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:41:02,471 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:41:02,471 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:41:02,471 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:41:02,472 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:41:02,472 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:41:02,472 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:41:02,472 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:41:02,472 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:41:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:41:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:41:02,502 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,503 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:41:02,504 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,510 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-07-23 13:41:02,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,605 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:41:02,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:41:02,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,609 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(<= ULTIMATE.start_main_~i~5 0)] [2018-07-23 13:41:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,612 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:41:02,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:41:02,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:41:02,629 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 13:41:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:02,658 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-23 13:41:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:41:02,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:41:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:02,671 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:41:02,671 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 13:41:02,681 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:41:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 13:41:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 13:41:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 13:41:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 13:41:02,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 13:41:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,731 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 13:41:02,731 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:41:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 13:41:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:41:02,733 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,734 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:41:02,734 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,735 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-07-23 13:41:02,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:02,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:41:02,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,770 INFO L185 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(<= ULTIMATE.start_main_~i~5 0), 40#(<= ULTIMATE.start_main_~i~5 1)] [2018-07-23 13:41:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,776 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:41:02,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:41:02,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:41:02,779 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-23 13:41:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:02,807 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 13:41:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:41:02,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:41:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:02,809 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:41:02,809 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:41:02,810 INFO L575 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 [2018-07-23 13:41:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:41:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:41:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:41:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:41:02,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 13:41:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,814 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:41:02,814 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:41:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:41:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:41:02,815 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,815 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:41:02,815 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-07-23 13:41:02,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:02,867 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:41:02,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,868 INFO L185 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(<= ULTIMATE.start_main_~i~5 0), 72#(<= ULTIMATE.start_main_~i~5 1), 73#(<= ULTIMATE.start_main_~i~5 2)] [2018-07-23 13:41:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,869 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:41:02,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:41:02,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:41:02,870 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-23 13:41:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:02,886 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:41:02,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:41:02,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:41:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:02,887 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:41:02,888 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:41:02,888 INFO L575 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 [2018-07-23 13:41:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:41:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:41:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:41:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:41:02,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 13:41:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,891 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:41:02,892 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:41:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:41:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:41:02,892 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,892 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 13:41:02,893 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-07-23 13:41:02,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:02,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:41:02,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,928 INFO L185 omatonBuilderFactory]: Interpolants [106#true, 107#false, 108#(<= ULTIMATE.start_main_~i~5 0), 109#(<= ULTIMATE.start_main_~i~5 1), 110#(<= ULTIMATE.start_main_~i~5 2), 111#(<= ULTIMATE.start_main_~i~5 3)] [2018-07-23 13:41:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:02,928 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:41:02,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:41:02,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:41:02,929 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 13:41:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:02,972 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 13:41:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:41:02,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:41:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:02,974 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:41:02,974 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:41:02,978 INFO L575 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 [2018-07-23 13:41:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:41:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:41:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:41:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:41:02,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 13:41:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:02,982 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:41:02,982 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:41:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:41:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:41:02,986 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:02,986 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 13:41:02,986 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-07-23 13:41:02,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:41:03,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,044 INFO L185 omatonBuilderFactory]: Interpolants [148#true, 149#false, 150#(<= ULTIMATE.start_main_~i~5 0), 151#(<= ULTIMATE.start_main_~i~5 1), 152#(<= ULTIMATE.start_main_~i~5 2), 153#(<= ULTIMATE.start_main_~i~5 3), 154#(<= ULTIMATE.start_main_~i~5 4)] [2018-07-23 13:41:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,044 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:41:03,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:41:03,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:41:03,045 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 13:41:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,063 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:41:03,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:41:03,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:41:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,064 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:41:03,065 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:41:03,065 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:41:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:41:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:41:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:41:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:41:03,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 13:41:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,069 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:41:03,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:41:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:41:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:41:03,070 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,070 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 13:41:03,070 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,070 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-07-23 13:41:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:41:03,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,135 INFO L185 omatonBuilderFactory]: Interpolants [195#true, 196#false, 197#(<= ULTIMATE.start_main_~i~5 0), 198#(<= ULTIMATE.start_main_~i~5 1), 199#(<= ULTIMATE.start_main_~i~5 2), 200#(<= ULTIMATE.start_main_~i~5 3), 201#(<= ULTIMATE.start_main_~i~5 4), 202#(<= ULTIMATE.start_main_~i~5 5)] [2018-07-23 13:41:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,135 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:41:03,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:41:03,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:41:03,140 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 13:41:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,174 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:41:03,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:41:03,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:41:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,175 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:41:03,176 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:41:03,176 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:41:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:41:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:41:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:41:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:41:03,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 13:41:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:41:03,180 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:41:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:41:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:41:03,181 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,181 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 13:41:03,181 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-07-23 13:41:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:41:03,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,266 INFO L185 omatonBuilderFactory]: Interpolants [247#true, 248#false, 249#(<= ULTIMATE.start_main_~i~5 0), 250#(<= ULTIMATE.start_main_~i~5 1), 251#(<= ULTIMATE.start_main_~i~5 2), 252#(<= ULTIMATE.start_main_~i~5 3), 253#(<= ULTIMATE.start_main_~i~5 4), 254#(<= ULTIMATE.start_main_~i~5 5), 255#(<= ULTIMATE.start_main_~i~5 6)] [2018-07-23 13:41:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,266 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:41:03,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:41:03,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:41:03,267 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 13:41:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,295 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:41:03,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:41:03,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:41:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,296 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:41:03,297 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:41:03,297 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:41:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:41:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:41:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:41:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:41:03,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 13:41:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,302 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:41:03,302 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:41:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:41:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:41:03,303 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,303 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 13:41:03,304 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-07-23 13:41:03,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,378 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:41:03,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,381 INFO L185 omatonBuilderFactory]: Interpolants [304#true, 305#false, 306#(<= ULTIMATE.start_main_~i~5 0), 307#(<= ULTIMATE.start_main_~i~5 1), 308#(<= ULTIMATE.start_main_~i~5 2), 309#(<= ULTIMATE.start_main_~i~5 3), 310#(<= ULTIMATE.start_main_~i~5 4), 311#(<= ULTIMATE.start_main_~i~5 5), 312#(<= ULTIMATE.start_main_~i~5 6), 313#(<= ULTIMATE.start_main_~i~5 7)] [2018-07-23 13:41:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,384 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:41:03,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:41:03,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:41:03,386 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-23 13:41:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,413 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:41:03,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:41:03,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 13:41:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,415 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:41:03,415 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:41:03,416 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:41:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:41:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:41:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:41:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:41:03,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 13:41:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,420 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:41:03,420 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:41:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:41:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:41:03,421 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,421 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 13:41:03,422 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-07-23 13:41:03,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:41:03,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,461 INFO L185 omatonBuilderFactory]: Interpolants [368#(<= ULTIMATE.start_main_~i~5 0), 369#(<= ULTIMATE.start_main_~i~5 1), 370#(<= ULTIMATE.start_main_~i~5 2), 371#(<= ULTIMATE.start_main_~i~5 3), 372#(<= ULTIMATE.start_main_~i~5 4), 373#(<= ULTIMATE.start_main_~i~5 5), 374#(<= ULTIMATE.start_main_~i~5 6), 375#(<= ULTIMATE.start_main_~i~5 7), 376#(<= ULTIMATE.start_main_~i~5 8), 366#true, 367#false] [2018-07-23 13:41:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,462 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:41:03,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:41:03,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:41:03,463 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-23 13:41:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,480 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:41:03,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:41:03,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 13:41:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,482 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:41:03,482 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:41:03,482 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:41:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:41:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:41:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:41:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:41:03,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 13:41:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,487 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:41:03,487 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:41:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:41:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:41:03,488 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,488 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 13:41:03,488 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-07-23 13:41:03,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:41:03,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,576 INFO L185 omatonBuilderFactory]: Interpolants [433#true, 434#false, 435#(<= ULTIMATE.start_main_~i~5 0), 436#(<= ULTIMATE.start_main_~i~5 1), 437#(<= ULTIMATE.start_main_~i~5 2), 438#(<= ULTIMATE.start_main_~i~5 3), 439#(<= ULTIMATE.start_main_~i~5 4), 440#(<= ULTIMATE.start_main_~i~5 5), 441#(<= ULTIMATE.start_main_~i~5 6), 442#(<= ULTIMATE.start_main_~i~5 7), 443#(<= ULTIMATE.start_main_~i~5 8), 444#(<= ULTIMATE.start_main_~i~5 9)] [2018-07-23 13:41:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,578 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:41:03,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:41:03,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:03,579 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-23 13:41:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,611 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:41:03,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:41:03,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 13:41:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,617 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:41:03,617 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:41:03,618 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:41:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:41:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:41:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:41:03,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 13:41:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,622 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:41:03,622 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:41:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:41:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:41:03,623 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,623 INFO L357 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 13:41:03,624 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-07-23 13:41:03,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,707 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:41:03,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,708 INFO L185 omatonBuilderFactory]: Interpolants [512#(<= ULTIMATE.start_main_~i~5 5), 513#(<= ULTIMATE.start_main_~i~5 6), 514#(<= ULTIMATE.start_main_~i~5 7), 515#(<= ULTIMATE.start_main_~i~5 8), 516#(<= ULTIMATE.start_main_~i~5 9), 517#(<= ULTIMATE.start_main_~i~5 10), 505#true, 506#false, 507#(<= ULTIMATE.start_main_~i~5 0), 508#(<= ULTIMATE.start_main_~i~5 1), 509#(<= ULTIMATE.start_main_~i~5 2), 510#(<= ULTIMATE.start_main_~i~5 3), 511#(<= ULTIMATE.start_main_~i~5 4)] [2018-07-23 13:41:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:41:03,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:41:03,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:41:03,709 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-23 13:41:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,740 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:41:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:41:03,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 13:41:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,742 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:41:03,742 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:41:03,743 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:41:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:41:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:41:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:41:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:41:03,747 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 13:41:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,747 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:41:03,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:41:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:41:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:41:03,748 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,749 INFO L357 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 13:41:03,753 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-07-23 13:41:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:41:03,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,832 INFO L185 omatonBuilderFactory]: Interpolants [582#true, 583#false, 584#(<= ULTIMATE.start_main_~i~5 0), 585#(<= ULTIMATE.start_main_~i~5 1), 586#(<= ULTIMATE.start_main_~i~5 2), 587#(<= ULTIMATE.start_main_~i~5 3), 588#(<= ULTIMATE.start_main_~i~5 4), 589#(<= ULTIMATE.start_main_~i~5 5), 590#(<= ULTIMATE.start_main_~i~5 6), 591#(<= ULTIMATE.start_main_~i~5 7), 592#(<= ULTIMATE.start_main_~i~5 8), 593#(<= ULTIMATE.start_main_~i~5 9), 594#(<= ULTIMATE.start_main_~i~5 10), 595#(<= ULTIMATE.start_main_~i~5 11)] [2018-07-23 13:41:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,833 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:41:03,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:41:03,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:41:03,834 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-23 13:41:03,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,858 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:41:03,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:41:03,860 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-23 13:41:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,862 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:41:03,862 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:41:03,863 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:41:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:41:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:41:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:41:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:41:03,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-23 13:41:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,868 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:41:03,871 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:41:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:41:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:41:03,873 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,873 INFO L357 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-23 13:41:03,873 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,877 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-07-23 13:41:03,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:03,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:41:03,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,924 INFO L185 omatonBuilderFactory]: Interpolants [672#(<= ULTIMATE.start_main_~i~5 6), 673#(<= ULTIMATE.start_main_~i~5 7), 674#(<= ULTIMATE.start_main_~i~5 8), 675#(<= ULTIMATE.start_main_~i~5 9), 676#(<= ULTIMATE.start_main_~i~5 10), 677#(<= ULTIMATE.start_main_~i~5 11), 678#(<= ULTIMATE.start_main_~i~5 12), 664#true, 665#false, 666#(<= ULTIMATE.start_main_~i~5 0), 667#(<= ULTIMATE.start_main_~i~5 1), 668#(<= ULTIMATE.start_main_~i~5 2), 669#(<= ULTIMATE.start_main_~i~5 3), 670#(<= ULTIMATE.start_main_~i~5 4), 671#(<= ULTIMATE.start_main_~i~5 5)] [2018-07-23 13:41:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:03,924 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:41:03,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:41:03,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:41:03,925 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-23 13:41:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:03,940 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:41:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:41:03,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-23 13:41:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:03,941 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:41:03,941 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:41:03,942 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:41:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:41:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:41:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:41:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:41:03,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-23 13:41:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:03,946 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:41:03,947 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:41:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:41:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:41:03,947 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:03,948 INFO L357 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-23 13:41:03,948 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:03,948 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-07-23 13:41:03,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:04,024 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:41:04,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,025 INFO L185 omatonBuilderFactory]: Interpolants [751#true, 752#false, 753#(<= ULTIMATE.start_main_~i~5 0), 754#(<= ULTIMATE.start_main_~i~5 1), 755#(<= ULTIMATE.start_main_~i~5 2), 756#(<= ULTIMATE.start_main_~i~5 3), 757#(<= ULTIMATE.start_main_~i~5 4), 758#(<= ULTIMATE.start_main_~i~5 5), 759#(<= ULTIMATE.start_main_~i~5 6), 760#(<= ULTIMATE.start_main_~i~5 7), 761#(<= ULTIMATE.start_main_~i~5 8), 762#(<= ULTIMATE.start_main_~i~5 9), 763#(<= ULTIMATE.start_main_~i~5 10), 764#(<= ULTIMATE.start_main_~i~5 11), 765#(<= ULTIMATE.start_main_~i~5 12), 766#(<= ULTIMATE.start_main_~i~5 13)] [2018-07-23 13:41:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,027 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:41:04,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:41:04,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:41:04,028 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-23 13:41:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:04,048 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 13:41:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:41:04,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-23 13:41:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:04,050 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:41:04,050 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:41:04,050 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:41:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:41:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:41:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:41:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 13:41:04,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-23 13:41:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:04,057 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 13:41:04,058 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:41:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 13:41:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:41:04,059 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:04,059 INFO L357 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-23 13:41:04,059 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-07-23 13:41:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,112 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:04,112 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:41:04,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,113 INFO L185 omatonBuilderFactory]: Interpolants [843#true, 844#false, 845#(<= ULTIMATE.start_main_~i~5 0), 846#(<= ULTIMATE.start_main_~i~5 1), 847#(<= ULTIMATE.start_main_~i~5 2), 848#(<= ULTIMATE.start_main_~i~5 3), 849#(<= ULTIMATE.start_main_~i~5 4), 850#(<= ULTIMATE.start_main_~i~5 5), 851#(<= ULTIMATE.start_main_~i~5 6), 852#(<= ULTIMATE.start_main_~i~5 7), 853#(<= ULTIMATE.start_main_~i~5 8), 854#(<= ULTIMATE.start_main_~i~5 9), 855#(<= ULTIMATE.start_main_~i~5 10), 856#(<= ULTIMATE.start_main_~i~5 11), 857#(<= ULTIMATE.start_main_~i~5 12), 858#(<= ULTIMATE.start_main_~i~5 13), 859#(<= ULTIMATE.start_main_~i~5 14)] [2018-07-23 13:41:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,114 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:41:04,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:41:04,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:41:04,115 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-23 13:41:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:04,131 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:41:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:41:04,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-23 13:41:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:04,133 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:41:04,133 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:41:04,134 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:41:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:41:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:41:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:41:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:41:04,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-23 13:41:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:04,142 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:41:04,142 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:41:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:41:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:41:04,145 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:04,145 INFO L357 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-23 13:41:04,145 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-07-23 13:41:04,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:04,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:41:04,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,228 INFO L185 omatonBuilderFactory]: Interpolants [940#true, 941#false, 942#(<= ULTIMATE.start_main_~i~5 0), 943#(<= ULTIMATE.start_main_~i~5 1), 944#(<= ULTIMATE.start_main_~i~5 2), 945#(<= ULTIMATE.start_main_~i~5 3), 946#(<= ULTIMATE.start_main_~i~5 4), 947#(<= ULTIMATE.start_main_~i~5 5), 948#(<= ULTIMATE.start_main_~i~5 6), 949#(<= ULTIMATE.start_main_~i~5 7), 950#(<= ULTIMATE.start_main_~i~5 8), 951#(<= ULTIMATE.start_main_~i~5 9), 952#(<= ULTIMATE.start_main_~i~5 10), 953#(<= ULTIMATE.start_main_~i~5 11), 954#(<= ULTIMATE.start_main_~i~5 12), 955#(<= ULTIMATE.start_main_~i~5 13), 956#(<= ULTIMATE.start_main_~i~5 14), 957#(<= ULTIMATE.start_main_~i~5 15)] [2018-07-23 13:41:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:04,229 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:41:04,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:41:04,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:41:04,230 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-23 13:41:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:04,252 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:41:04,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:41:04,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-23 13:41:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:04,257 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:41:04,264 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:41:04,265 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:41:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:41:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:41:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:41:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:41:04,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-23 13:41:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:04,274 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:41:04,274 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:41:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:41:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:41:04,275 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:04,275 INFO L357 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-23 13:41:04,275 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-07-23 13:41:04,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:41:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:41:04,313 INFO L423 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 13:41:04,341 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:41:04 BoogieIcfgContainer [2018-07-23 13:41:04,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:41:04,342 INFO L168 Benchmark]: Toolchain (without parser) took 2268.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:04,345 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:04,346 INFO L168 Benchmark]: Boogie Preprocessor took 61.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:04,347 INFO L168 Benchmark]: RCFGBuilder took 240.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:04,348 INFO L168 Benchmark]: TraceAbstraction took 1962.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:04,354 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 240.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1962.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.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_~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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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, 6 locations, 1 error locations. UNSAFE Result, 1.8s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 0 SDslu, 117 SDs, 0 SdLazy, 269 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/680 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 5048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-41-04-371.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-41-04-371.csv Received shutdown request...