java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 03:05:11,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 03:05:11,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 03:05:11,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 03:05:11,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 03:05:11,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 03:05:11,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 03:05:11,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 03:05:11,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 03:05:11,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 03:05:11,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 03:05:11,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 03:05:11,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 03:05:11,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 03:05:11,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 03:05:11,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 03:05:11,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 03:05:11,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 03:05:11,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 03:05:11,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 03:05:11,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 03:05:11,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 03:05:11,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 03:05:11,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 03:05:11,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 03:05:11,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 03:05:11,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 03:05:11,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 03:05:11,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 03:05:11,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 03:05:11,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 03:05:11,058 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-12 03:05:11,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 03:05:11,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 03:05:11,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 03:05:11,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 03:05:11,081 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 03:05:11,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 03:05:11,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 03:05:11,081 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 03:05:11,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 03:05:11,081 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 03:05:11,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 03:05:11,082 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 03:05:11,082 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 03:05:11,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 03:05:11,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 03:05:11,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 03:05:11,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 03:05:11,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 03:05:11,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 03:05:11,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 03:05:11,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 03:05:11,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 03:05:11,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 03:05:11,122 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 03:05:11,125 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 03:05:11,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 03:05:11,127 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 03:05:11,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-04-12 03:05:11,419 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG566f00950 [2018-04-12 03:05:11,504 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 03:05:11,504 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 03:05:11,505 INFO L168 CDTParser]: Scanning standard_strcpy_false-valid-deref_ground.i [2018-04-12 03:05:11,505 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 03:05:11,506 INFO L215 ultiparseSymbolTable]: [2018-04-12 03:05:11,506 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 03:05:11,506 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_false-valid-deref_ground.i [2018-04-12 03:05:11,506 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_false-valid-deref_ground.i [2018-04-12 03:05:11,506 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 03:05:11,506 INFO L233 ultiparseSymbolTable]: [2018-04-12 03:05:11,517 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG566f00950 [2018-04-12 03:05:11,520 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 03:05:11,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 03:05:11,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 03:05:11,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 03:05:11,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 03:05:11,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13db35ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11, skipping insertion in model container [2018-04-12 03:05:11,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,540 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 03:05:11,549 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 03:05:11,659 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 03:05:11,674 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 03:05:11,678 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-12 03:05:11,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11 WrapperNode [2018-04-12 03:05:11,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 03:05:11,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 03:05:11,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 03:05:11,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 03:05:11,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... [2018-04-12 03:05:11,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 03:05:11,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 03:05:11,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 03:05:11,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 03:05:11,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 03:05:11,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 03:05:11,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 03:05:11,744 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-12 03:05:11,744 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 03:05:11,744 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 03:05:11,744 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-12 03:05:11,744 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 03:05:11,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 03:05:11,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 03:05:11,925 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 03:05:11,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 03:05:11 BoogieIcfgContainer [2018-04-12 03:05:11,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 03:05:11,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 03:05:11,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 03:05:11,929 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 03:05:11,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 03:05:11" (1/3) ... [2018-04-12 03:05:11,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cf8d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 03:05:11, skipping insertion in model container [2018-04-12 03:05:11,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 03:05:11" (2/3) ... [2018-04-12 03:05:11,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cf8d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 03:05:11, skipping insertion in model container [2018-04-12 03:05:11,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 03:05:11" (3/3) ... [2018-04-12 03:05:11,931 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-04-12 03:05:11,937 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 03:05:11,942 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-04-12 03:05:11,964 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 03:05:11,965 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 03:05:11,965 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 03:05:11,965 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 03:05:11,965 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 03:05:11,965 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 03:05:11,965 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 03:05:11,965 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 03:05:11,965 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 03:05:11,966 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 03:05:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-04-12 03:05:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-12 03:05:11,984 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:11,985 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:11,985 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:11,989 INFO L82 PathProgramCache]: Analyzing trace with hash -42208474, now seen corresponding path program 1 times [2018-04-12 03:05:12,019 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 03:05:12,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 03:05:12,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,072 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 37#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-04-12 03:05:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 03:05:12,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 03:05:12,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 03:05:12,085 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-04-12 03:05:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,134 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-12 03:05:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 03:05:12,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-12 03:05:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,140 INFO L225 Difference]: With dead ends: 49 [2018-04-12 03:05:12,140 INFO L226 Difference]: Without dead ends: 40 [2018-04-12 03:05:12,141 INFO L567 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-04-12 03:05:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-12 03:05:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-04-12 03:05:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-12 03:05:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-04-12 03:05:12,164 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-04-12 03:05:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,164 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-04-12 03:05:12,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 03:05:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-04-12 03:05:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 03:05:12,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,164 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,164 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash 619915766, now seen corresponding path program 1 times [2018-04-12 03:05:12,165 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 03:05:12,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 03:05:12,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,193 INFO L182 omatonBuilderFactory]: Interpolants [118#true, 119#false, 120#(<= main_~i~0 0), 121#(and (= main_~x~0 0) (<= main_~i~0 0))] [2018-04-12 03:05:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 03:05:12,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 03:05:12,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-12 03:05:12,194 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-04-12 03:05:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,246 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-04-12 03:05:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 03:05:12,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 03:05:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,248 INFO L225 Difference]: With dead ends: 34 [2018-04-12 03:05:12,248 INFO L226 Difference]: Without dead ends: 31 [2018-04-12 03:05:12,248 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-12 03:05:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-12 03:05:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-12 03:05:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-12 03:05:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-12 03:05:12,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 12 [2018-04-12 03:05:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,251 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-12 03:05:12,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 03:05:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-12 03:05:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 03:05:12,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,252 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,252 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash 621575575, now seen corresponding path program 1 times [2018-04-12 03:05:12,252 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:12,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-12 03:05:12,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,301 INFO L182 omatonBuilderFactory]: Interpolants [187#true, 188#false, 189#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 190#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-12 03:05:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 03:05:12,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 03:05:12,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 03:05:12,302 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 4 states. [2018-04-12 03:05:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,353 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-04-12 03:05:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 03:05:12,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 03:05:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,354 INFO L225 Difference]: With dead ends: 45 [2018-04-12 03:05:12,354 INFO L226 Difference]: Without dead ends: 45 [2018-04-12 03:05:12,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 03:05:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-12 03:05:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-04-12 03:05:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-12 03:05:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-12 03:05:12,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-04-12 03:05:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,359 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-12 03:05:12,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 03:05:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-12 03:05:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 03:05:12,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,360 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,360 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1962704421, now seen corresponding path program 1 times [2018-04-12 03:05:12,361 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:12,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-12 03:05:12,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,404 INFO L182 omatonBuilderFactory]: Interpolants [272#true, 273#false, 274#(<= main_~i~0 0), 275#(<= main_~i~0 1), 276#(and (= main_~x~0 0) (<= main_~i~0 1)), 277#(= main_~x~0 0)] [2018-04-12 03:05:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 03:05:12,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 03:05:12,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-12 03:05:12,405 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 6 states. [2018-04-12 03:05:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,461 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-04-12 03:05:12,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 03:05:12,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-12 03:05:12,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,462 INFO L225 Difference]: With dead ends: 57 [2018-04-12 03:05:12,462 INFO L226 Difference]: Without dead ends: 57 [2018-04-12 03:05:12,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-12 03:05:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-12 03:05:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2018-04-12 03:05:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-12 03:05:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-04-12 03:05:12,467 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-04-12 03:05:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,468 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-04-12 03:05:12,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 03:05:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-04-12 03:05:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 03:05:12,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,469 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,469 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1964364230, now seen corresponding path program 2 times [2018-04-12 03:05:12,470 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:12,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-12 03:05:12,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,514 INFO L182 omatonBuilderFactory]: Interpolants [375#true, 376#false, 377#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 378#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 379#(and (<= 2 main_~i~0) (<= main_~i~0 2))] [2018-04-12 03:05:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 03:05:12,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 03:05:12,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 03:05:12,515 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 5 states. [2018-04-12 03:05:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,553 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-12 03:05:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 03:05:12,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-12 03:05:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,555 INFO L225 Difference]: With dead ends: 71 [2018-04-12 03:05:12,555 INFO L226 Difference]: Without dead ends: 71 [2018-04-12 03:05:12,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 03:05:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-12 03:05:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-04-12 03:05:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-12 03:05:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-04-12 03:05:12,559 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-04-12 03:05:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,559 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-04-12 03:05:12,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 03:05:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-04-12 03:05:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 03:05:12,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,560 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,560 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1777648375, now seen corresponding path program 3 times [2018-04-12 03:05:12,561 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:12,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 03:05:12,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,613 INFO L182 omatonBuilderFactory]: Interpolants [496#true, 497#false, 498#(<= main_~i~0 0), 499#(<= main_~i~0 1), 500#(<= main_~i~0 2), 501#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 502#(and (<= main_~i~0 3) (<= 1 main_~i~0))] [2018-04-12 03:05:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 03:05:12,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 03:05:12,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-12 03:05:12,614 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-04-12 03:05:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,675 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-04-12 03:05:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 03:05:12,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-12 03:05:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,676 INFO L225 Difference]: With dead ends: 89 [2018-04-12 03:05:12,676 INFO L226 Difference]: Without dead ends: 89 [2018-04-12 03:05:12,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-12 03:05:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-12 03:05:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-04-12 03:05:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 03:05:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-12 03:05:12,679 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-04-12 03:05:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,680 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-12 03:05:12,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 03:05:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-12 03:05:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 03:05:12,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,681 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,681 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash -788155134, now seen corresponding path program 1 times [2018-04-12 03:05:12,682 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:12,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 03:05:12,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,714 INFO L182 omatonBuilderFactory]: Interpolants [648#true, 649#false, 650#(<= main_~i~0 0), 651#(<= main_~i~0 1), 652#(<= main_~i~0 (+ main_~x~0 1)), 653#(<= main_~i~0 main_~x~0)] [2018-04-12 03:05:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 03:05:12,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 03:05:12,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 03:05:12,715 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-04-12 03:05:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,759 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-12 03:05:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 03:05:12,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-12 03:05:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,760 INFO L225 Difference]: With dead ends: 59 [2018-04-12 03:05:12,760 INFO L226 Difference]: Without dead ends: 50 [2018-04-12 03:05:12,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-12 03:05:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-12 03:05:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-12 03:05:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 03:05:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-04-12 03:05:12,762 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-04-12 03:05:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,762 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-04-12 03:05:12,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 03:05:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-04-12 03:05:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 03:05:12,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,763 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,763 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1667360870, now seen corresponding path program 4 times [2018-04-12 03:05:12,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:12,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 03:05:12,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,820 INFO L182 omatonBuilderFactory]: Interpolants [768#false, 769#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 770#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 771#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 772#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 773#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 767#true] [2018-04-12 03:05:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 03:05:12,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 03:05:12,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 03:05:12,821 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-04-12 03:05:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,888 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-04-12 03:05:12,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 03:05:12,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-12 03:05:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,889 INFO L225 Difference]: With dead ends: 94 [2018-04-12 03:05:12,889 INFO L226 Difference]: Without dead ends: 94 [2018-04-12 03:05:12,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 03:05:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-12 03:05:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-04-12 03:05:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-12 03:05:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-04-12 03:05:12,894 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-04-12 03:05:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,894 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-04-12 03:05:12,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 03:05:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-04-12 03:05:12,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 03:05:12,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,895 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,895 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1804493581, now seen corresponding path program 2 times [2018-04-12 03:05:12,896 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-12 03:05:12,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:12,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-12 03:05:12,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:12,938 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (<= 1 main_~x~0) (<= main_~x~0 99998)), 923#true, 924#false, 925#(<= main_~i~0 99999), 926#(and (<= main_~i~0 99999) (<= 0 main_~x~0)), 927#(and (<= 1 main_~x~0) (<= main_~i~0 99999))] [2018-04-12 03:05:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-12 03:05:12,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 03:05:12,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 03:05:12,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-12 03:05:12,939 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-04-12 03:05:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:12,979 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-12 03:05:12,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 03:05:12,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-12 03:05:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:12,980 INFO L225 Difference]: With dead ends: 55 [2018-04-12 03:05:12,980 INFO L226 Difference]: Without dead ends: 38 [2018-04-12 03:05:12,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-12 03:05:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-12 03:05:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-04-12 03:05:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-12 03:05:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-04-12 03:05:12,983 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-04-12 03:05:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:12,983 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-04-12 03:05:12,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 03:05:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-04-12 03:05:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 03:05:12,984 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:12,984 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:12,984 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash 651022423, now seen corresponding path program 5 times [2018-04-12 03:05:12,985 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:12,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:13,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 03:05:13,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,051 INFO L182 omatonBuilderFactory]: Interpolants [1024#true, 1025#false, 1026#(<= main_~i~0 0), 1027#(<= main_~i~0 1), 1028#(<= main_~i~0 2), 1029#(<= main_~i~0 3), 1030#(<= main_~i~0 4), 1031#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1032#(and (<= 1 main_~i~0) (<= main_~i~0 5))] [2018-04-12 03:05:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 03:05:13,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 03:05:13,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-12 03:05:13,052 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 9 states. [2018-04-12 03:05:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:13,150 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-04-12 03:05:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 03:05:13,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 03:05:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:13,151 INFO L225 Difference]: With dead ends: 43 [2018-04-12 03:05:13,151 INFO L226 Difference]: Without dead ends: 43 [2018-04-12 03:05:13,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-04-12 03:05:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-12 03:05:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-12 03:05:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-12 03:05:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-04-12 03:05:13,155 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-04-12 03:05:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:13,155 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-04-12 03:05:13,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 03:05:13,155 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-04-12 03:05:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-12 03:05:13,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:13,156 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:13,156 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1728432378, now seen corresponding path program 6 times [2018-04-12 03:05:13,157 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:13,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:13,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 03:05:13,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,225 INFO L182 omatonBuilderFactory]: Interpolants [1136#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1137#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1138#(and (<= 2 main_~i~0) (<= main_~i~0 6)), 1129#true, 1130#false, 1131#(<= main_~i~0 0), 1132#(<= main_~i~0 1), 1133#(<= main_~i~0 2), 1134#(<= main_~i~0 3), 1135#(<= main_~i~0 4)] [2018-04-12 03:05:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 03:05:13,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 03:05:13,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-12 03:05:13,226 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 10 states. [2018-04-12 03:05:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:13,347 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-04-12 03:05:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 03:05:13,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-12 03:05:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:13,348 INFO L225 Difference]: With dead ends: 48 [2018-04-12 03:05:13,348 INFO L226 Difference]: Without dead ends: 48 [2018-04-12 03:05:13,349 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-04-12 03:05:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-12 03:05:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-12 03:05:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-12 03:05:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-04-12 03:05:13,351 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-04-12 03:05:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:13,352 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-04-12 03:05:13,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 03:05:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-04-12 03:05:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 03:05:13,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:13,353 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:13,353 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash -616716873, now seen corresponding path program 7 times [2018-04-12 03:05:13,354 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:13,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:13,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 03:05:13,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,417 INFO L182 omatonBuilderFactory]: Interpolants [1248#false, 1249#(<= main_~i~0 0), 1250#(<= main_~i~0 1), 1251#(<= main_~i~0 2), 1252#(<= main_~i~0 3), 1253#(<= main_~i~0 4), 1254#(<= main_~i~0 5), 1255#(<= main_~i~0 6), 1256#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1257#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1247#true] [2018-04-12 03:05:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 03:05:13,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 03:05:13,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-12 03:05:13,418 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-04-12 03:05:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:13,540 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-12 03:05:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 03:05:13,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-12 03:05:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:13,541 INFO L225 Difference]: With dead ends: 53 [2018-04-12 03:05:13,541 INFO L226 Difference]: Without dead ends: 53 [2018-04-12 03:05:13,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-12 03:05:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-12 03:05:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-12 03:05:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-12 03:05:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-04-12 03:05:13,544 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-04-12 03:05:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:13,544 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-04-12 03:05:13,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 03:05:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-04-12 03:05:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 03:05:13,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:13,545 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:13,545 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1845018022, now seen corresponding path program 8 times [2018-04-12 03:05:13,546 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:13,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:13,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 03:05:13,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,648 INFO L182 omatonBuilderFactory]: Interpolants [1378#true, 1379#false, 1380#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1381#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 1382#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1383#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1384#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1385#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1386#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1387#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1388#(and (<= 8 main_~i~0) (<= main_~i~0 8))] [2018-04-12 03:05:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 03:05:13,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 03:05:13,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 03:05:13,649 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-04-12 03:05:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:13,756 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-04-12 03:05:13,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 03:05:13,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-12 03:05:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:13,756 INFO L225 Difference]: With dead ends: 58 [2018-04-12 03:05:13,756 INFO L226 Difference]: Without dead ends: 58 [2018-04-12 03:05:13,756 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 03:05:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-12 03:05:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-12 03:05:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-12 03:05:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-04-12 03:05:13,758 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-04-12 03:05:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:13,758 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-04-12 03:05:13,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 03:05:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-04-12 03:05:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 03:05:13,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:13,759 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:13,759 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:13,759 INFO L82 PathProgramCache]: Analyzing trace with hash 795493143, now seen corresponding path program 9 times [2018-04-12 03:05:13,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:13,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:13,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 03:05:13,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:13,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-04-12 03:05:13,831 INFO L182 omatonBuilderFactory]: Interpolants [1505#true, 1506#false, 1507#(<= main_~i~0 0), 1508#(<= main_~i~0 1), 1509#(<= main_~i~0 2), 1510#(<= main_~i~0 3), 1511#(<= main_~i~0 4), 1512#(<= main_~i~0 5), 1513#(<= main_~i~0 6), 1514#(<= main_~i~0 7), 1515#(<= main_~i~0 8), 1516#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1517#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-04-12 03:05:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:13,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 03:05:13,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 03:05:13,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-12 03:05:13,832 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2018-04-12 03:05:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:13,926 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-04-12 03:05:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 03:05:13,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-04-12 03:05:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:13,927 INFO L225 Difference]: With dead ends: 63 [2018-04-12 03:05:13,927 INFO L226 Difference]: Without dead ends: 63 [2018-04-12 03:05:13,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-04-12 03:05:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-04-12 03:05:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-04-12 03:05:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-12 03:05:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-04-12 03:05:13,930 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-04-12 03:05:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:13,930 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-04-12 03:05:13,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 03:05:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-04-12 03:05:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 03:05:13,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:13,931 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:13,931 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1643609158, now seen corresponding path program 10 times [2018-04-12 03:05:13,932 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:13,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:14,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-12 03:05:14,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,008 INFO L182 omatonBuilderFactory]: Interpolants [1664#(<= main_~i~0 0), 1665#(<= main_~i~0 1), 1666#(<= main_~i~0 2), 1667#(<= main_~i~0 3), 1668#(<= main_~i~0 4), 1669#(<= main_~i~0 5), 1670#(<= main_~i~0 6), 1671#(<= main_~i~0 7), 1672#(<= main_~i~0 8), 1673#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1674#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 1675#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 1662#true, 1663#false] [2018-04-12 03:05:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 03:05:14,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 03:05:14,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-12 03:05:14,009 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-04-12 03:05:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:14,138 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-04-12 03:05:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 03:05:14,138 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-12 03:05:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:14,138 INFO L225 Difference]: With dead ends: 68 [2018-04-12 03:05:14,138 INFO L226 Difference]: Without dead ends: 68 [2018-04-12 03:05:14,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-12 03:05:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-12 03:05:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-12 03:05:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-12 03:05:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-04-12 03:05:14,141 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-04-12 03:05:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:14,141 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-04-12 03:05:14,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 03:05:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-04-12 03:05:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 03:05:14,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:14,142 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:14,142 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1408870519, now seen corresponding path program 11 times [2018-04-12 03:05:14,142 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:14,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:14,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 03:05:14,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,244 INFO L182 omatonBuilderFactory]: Interpolants [1832#true, 1833#false, 1834#(<= main_~i~0 0), 1835#(<= main_~i~0 1), 1836#(<= main_~i~0 2), 1837#(<= main_~i~0 3), 1838#(<= main_~i~0 4), 1839#(<= main_~i~0 5), 1840#(<= main_~i~0 6), 1841#(<= main_~i~0 7), 1842#(<= main_~i~0 8), 1843#(<= main_~i~0 9), 1844#(<= main_~i~0 10), 1845#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 1846#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-04-12 03:05:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 03:05:14,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 03:05:14,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-04-12 03:05:14,245 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 15 states. [2018-04-12 03:05:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:14,453 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-04-12 03:05:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 03:05:14,453 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-04-12 03:05:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:14,453 INFO L225 Difference]: With dead ends: 73 [2018-04-12 03:05:14,453 INFO L226 Difference]: Without dead ends: 73 [2018-04-12 03:05:14,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-04-12 03:05:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-12 03:05:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-12 03:05:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-12 03:05:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-04-12 03:05:14,456 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-04-12 03:05:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:14,456 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-04-12 03:05:14,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 03:05:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-04-12 03:05:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 03:05:14,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:14,457 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:14,457 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:14,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1139772698, now seen corresponding path program 12 times [2018-04-12 03:05:14,458 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:14,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:14,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 03:05:14,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,558 INFO L182 omatonBuilderFactory]: Interpolants [2016#false, 2017#(<= main_~i~0 0), 2018#(<= main_~i~0 1), 2019#(<= main_~i~0 2), 2020#(<= main_~i~0 3), 2021#(<= main_~i~0 4), 2022#(<= main_~i~0 5), 2023#(<= main_~i~0 6), 2024#(<= main_~i~0 7), 2025#(<= main_~i~0 8), 2026#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2027#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2028#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2029#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 2030#(and (<= 4 main_~i~0) (<= main_~i~0 12)), 2015#true] [2018-04-12 03:05:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 03:05:14,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 03:05:14,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-12 03:05:14,559 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 16 states. [2018-04-12 03:05:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:14,721 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-04-12 03:05:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 03:05:14,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-12 03:05:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:14,722 INFO L225 Difference]: With dead ends: 78 [2018-04-12 03:05:14,722 INFO L226 Difference]: Without dead ends: 78 [2018-04-12 03:05:14,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-04-12 03:05:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-12 03:05:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-12 03:05:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-12 03:05:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-04-12 03:05:14,723 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-04-12 03:05:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:14,724 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-04-12 03:05:14,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 03:05:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-04-12 03:05:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 03:05:14,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:14,724 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:14,724 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1645336023, now seen corresponding path program 13 times [2018-04-12 03:05:14,725 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:14,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:14,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 03:05:14,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,836 INFO L182 omatonBuilderFactory]: Interpolants [2211#true, 2212#false, 2213#(<= main_~i~0 0), 2214#(<= main_~i~0 1), 2215#(<= main_~i~0 2), 2216#(<= main_~i~0 3), 2217#(<= main_~i~0 4), 2218#(<= main_~i~0 5), 2219#(<= main_~i~0 6), 2220#(<= main_~i~0 7), 2221#(<= main_~i~0 8), 2222#(<= main_~i~0 9), 2223#(<= main_~i~0 10), 2224#(<= main_~i~0 11), 2225#(<= main_~i~0 12), 2226#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2227#(and (<= 1 main_~i~0) (<= main_~i~0 13))] [2018-04-12 03:05:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:14,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 03:05:14,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 03:05:14,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-12 03:05:14,837 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-04-12 03:05:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:15,005 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-04-12 03:05:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 03:05:15,005 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-12 03:05:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:15,006 INFO L225 Difference]: With dead ends: 83 [2018-04-12 03:05:15,006 INFO L226 Difference]: Without dead ends: 83 [2018-04-12 03:05:15,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-04-12 03:05:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-12 03:05:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-12 03:05:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-12 03:05:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-04-12 03:05:15,008 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-04-12 03:05:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:15,008 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-04-12 03:05:15,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 03:05:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-04-12 03:05:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-12 03:05:15,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:15,008 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:15,008 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash 719167878, now seen corresponding path program 14 times [2018-04-12 03:05:15,009 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:15,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:15,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 03:05:15,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,151 INFO L182 omatonBuilderFactory]: Interpolants [2432#(<= main_~i~0 10), 2433#(<= main_~i~0 11), 2434#(<= main_~i~0 12), 2435#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2436#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 2437#(and (<= 2 main_~i~0) (<= main_~i~0 14)), 2420#true, 2421#false, 2422#(<= main_~i~0 0), 2423#(<= main_~i~0 1), 2424#(<= main_~i~0 2), 2425#(<= main_~i~0 3), 2426#(<= main_~i~0 4), 2427#(<= main_~i~0 5), 2428#(<= main_~i~0 6), 2429#(<= main_~i~0 7), 2430#(<= main_~i~0 8), 2431#(<= main_~i~0 9)] [2018-04-12 03:05:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 03:05:15,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 03:05:15,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-12 03:05:15,152 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-04-12 03:05:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:15,316 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-04-12 03:05:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 03:05:15,316 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-12 03:05:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:15,316 INFO L225 Difference]: With dead ends: 88 [2018-04-12 03:05:15,316 INFO L226 Difference]: Without dead ends: 88 [2018-04-12 03:05:15,317 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-12 03:05:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-12 03:05:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-12 03:05:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-12 03:05:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-04-12 03:05:15,318 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-04-12 03:05:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:15,318 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-04-12 03:05:15,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 03:05:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-04-12 03:05:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-12 03:05:15,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:15,319 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:15,319 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1151808713, now seen corresponding path program 15 times [2018-04-12 03:05:15,320 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:15,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:15,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 03:05:15,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,501 INFO L182 omatonBuilderFactory]: Interpolants [2656#(<= main_~i~0 12), 2657#(<= main_~i~0 13), 2658#(<= main_~i~0 14), 2659#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 2660#(and (<= 1 main_~i~0) (<= main_~i~0 15)), 2642#true, 2643#false, 2644#(<= main_~i~0 0), 2645#(<= main_~i~0 1), 2646#(<= main_~i~0 2), 2647#(<= main_~i~0 3), 2648#(<= main_~i~0 4), 2649#(<= main_~i~0 5), 2650#(<= main_~i~0 6), 2651#(<= main_~i~0 7), 2652#(<= main_~i~0 8), 2653#(<= main_~i~0 9), 2654#(<= main_~i~0 10), 2655#(<= main_~i~0 11)] [2018-04-12 03:05:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 03:05:15,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 03:05:15,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-04-12 03:05:15,502 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 19 states. [2018-04-12 03:05:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:15,666 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-04-12 03:05:15,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 03:05:15,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-04-12 03:05:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:15,666 INFO L225 Difference]: With dead ends: 93 [2018-04-12 03:05:15,666 INFO L226 Difference]: Without dead ends: 93 [2018-04-12 03:05:15,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 03:05:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-12 03:05:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-04-12 03:05:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-12 03:05:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-04-12 03:05:15,668 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-04-12 03:05:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:15,668 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-04-12 03:05:15,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 03:05:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-04-12 03:05:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-12 03:05:15,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:15,669 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:15,669 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1685653542, now seen corresponding path program 16 times [2018-04-12 03:05:15,670 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:15,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:15,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 03:05:15,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,836 INFO L182 omatonBuilderFactory]: Interpolants [2880#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 2881#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 2882#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 2883#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 2884#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 2885#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 2886#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 2887#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 2888#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 2889#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 2890#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 2891#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 2892#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 2893#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 2894#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 2895#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 2877#true, 2878#false, 2879#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-04-12 03:05:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:15,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 03:05:15,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 03:05:15,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 03:05:15,837 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-04-12 03:05:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:16,163 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-04-12 03:05:16,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 03:05:16,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-12 03:05:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:16,163 INFO L225 Difference]: With dead ends: 98 [2018-04-12 03:05:16,163 INFO L226 Difference]: Without dead ends: 98 [2018-04-12 03:05:16,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 03:05:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-12 03:05:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-04-12 03:05:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-12 03:05:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-04-12 03:05:16,165 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-04-12 03:05:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:16,166 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-04-12 03:05:16,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 03:05:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-04-12 03:05:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-12 03:05:16,167 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:16,167 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:16,167 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1777633431, now seen corresponding path program 17 times [2018-04-12 03:05:16,167 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:16,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:16,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:16,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 03:05:16,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:16,324 INFO L182 omatonBuilderFactory]: Interpolants [3104#(<= main_~i~0 10), 3105#(<= main_~i~0 11), 3106#(<= main_~i~0 12), 3107#(<= main_~i~0 13), 3108#(<= main_~i~0 14), 3109#(<= main_~i~0 15), 3110#(<= main_~i~0 16), 3111#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3112#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3092#true, 3093#false, 3094#(<= main_~i~0 0), 3095#(<= main_~i~0 1), 3096#(<= main_~i~0 2), 3097#(<= main_~i~0 3), 3098#(<= main_~i~0 4), 3099#(<= main_~i~0 5), 3100#(<= main_~i~0 6), 3101#(<= main_~i~0 7), 3102#(<= main_~i~0 8), 3103#(<= main_~i~0 9)] [2018-04-12 03:05:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:16,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 03:05:16,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 03:05:16,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-04-12 03:05:16,324 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 21 states. [2018-04-12 03:05:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:16,515 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-04-12 03:05:16,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 03:05:16,520 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-04-12 03:05:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:16,521 INFO L225 Difference]: With dead ends: 103 [2018-04-12 03:05:16,521 INFO L226 Difference]: Without dead ends: 103 [2018-04-12 03:05:16,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 03:05:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-12 03:05:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-12 03:05:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-12 03:05:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-04-12 03:05:16,524 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-04-12 03:05:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:16,524 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-04-12 03:05:16,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 03:05:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-04-12 03:05:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-12 03:05:16,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:16,525 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:16,525 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash -964909370, now seen corresponding path program 18 times [2018-04-12 03:05:16,526 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:16,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:16,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:16,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 03:05:16,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:16,675 INFO L182 omatonBuilderFactory]: Interpolants [3360#(<= main_~i~0 5), 3361#(<= main_~i~0 6), 3362#(<= main_~i~0 7), 3363#(<= main_~i~0 8), 3364#(<= main_~i~0 9), 3365#(<= main_~i~0 10), 3366#(<= main_~i~0 11), 3367#(<= main_~i~0 12), 3368#(<= main_~i~0 13), 3369#(<= main_~i~0 14), 3370#(<= main_~i~0 15), 3371#(<= main_~i~0 16), 3372#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3373#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3374#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 3353#true, 3354#false, 3355#(<= main_~i~0 0), 3356#(<= main_~i~0 1), 3357#(<= main_~i~0 2), 3358#(<= main_~i~0 3), 3359#(<= main_~i~0 4)] [2018-04-12 03:05:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:16,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 03:05:16,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 03:05:16,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-04-12 03:05:16,676 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 22 states. [2018-04-12 03:05:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:16,949 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-04-12 03:05:16,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 03:05:16,950 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-04-12 03:05:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:16,950 INFO L225 Difference]: With dead ends: 108 [2018-04-12 03:05:16,950 INFO L226 Difference]: Without dead ends: 108 [2018-04-12 03:05:16,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 03:05:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-12 03:05:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-12 03:05:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-12 03:05:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-04-12 03:05:16,952 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-04-12 03:05:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:16,953 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-04-12 03:05:16,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 03:05:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-04-12 03:05:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-12 03:05:16,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:16,953 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:16,953 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2138370569, now seen corresponding path program 19 times [2018-04-12 03:05:16,954 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:16,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:17,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:17,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 03:05:17,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:17,155 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 3649#(and (<= 1 main_~i~0) (<= main_~i~0 19)), 3627#true, 3628#false, 3629#(<= main_~i~0 0), 3630#(<= main_~i~0 1), 3631#(<= main_~i~0 2), 3632#(<= main_~i~0 3), 3633#(<= main_~i~0 4), 3634#(<= main_~i~0 5), 3635#(<= main_~i~0 6), 3636#(<= main_~i~0 7), 3637#(<= main_~i~0 8), 3638#(<= main_~i~0 9), 3639#(<= main_~i~0 10), 3640#(<= main_~i~0 11), 3641#(<= main_~i~0 12), 3642#(<= main_~i~0 13), 3643#(<= main_~i~0 14), 3644#(<= main_~i~0 15), 3645#(<= main_~i~0 16), 3646#(<= main_~i~0 17), 3647#(<= main_~i~0 18)] [2018-04-12 03:05:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:17,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 03:05:17,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 03:05:17,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-12 03:05:17,156 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-04-12 03:05:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:17,410 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-04-12 03:05:17,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 03:05:17,410 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-12 03:05:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:17,411 INFO L225 Difference]: With dead ends: 113 [2018-04-12 03:05:17,411 INFO L226 Difference]: Without dead ends: 113 [2018-04-12 03:05:17,411 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 03:05:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-12 03:05:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-04-12 03:05:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-12 03:05:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-04-12 03:05:17,413 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-04-12 03:05:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:17,413 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-04-12 03:05:17,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 03:05:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-04-12 03:05:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-12 03:05:17,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:17,413 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:17,413 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash -167608986, now seen corresponding path program 20 times [2018-04-12 03:05:17,414 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:17,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:17,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:17,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 03:05:17,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:17,624 INFO L182 omatonBuilderFactory]: Interpolants [3936#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 3937#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 3914#true, 3915#false, 3916#(<= main_~i~0 0), 3917#(<= main_~i~0 1), 3918#(<= main_~i~0 2), 3919#(<= main_~i~0 3), 3920#(<= main_~i~0 4), 3921#(<= main_~i~0 5), 3922#(<= main_~i~0 6), 3923#(<= main_~i~0 7), 3924#(<= main_~i~0 8), 3925#(<= main_~i~0 9), 3926#(<= main_~i~0 10), 3927#(<= main_~i~0 11), 3928#(<= main_~i~0 12), 3929#(<= main_~i~0 13), 3930#(<= main_~i~0 14), 3931#(<= main_~i~0 15), 3932#(<= main_~i~0 16), 3933#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3934#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3935#(and (<= 2 main_~i~0) (<= main_~i~0 18))] [2018-04-12 03:05:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:17,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 03:05:17,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 03:05:17,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-12 03:05:17,626 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-04-12 03:05:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:17,971 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-04-12 03:05:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 03:05:17,972 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-12 03:05:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:17,972 INFO L225 Difference]: With dead ends: 118 [2018-04-12 03:05:17,972 INFO L226 Difference]: Without dead ends: 118 [2018-04-12 03:05:17,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 03:05:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-12 03:05:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-04-12 03:05:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 03:05:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-04-12 03:05:17,974 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-04-12 03:05:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:17,974 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-04-12 03:05:17,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 03:05:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-04-12 03:05:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-12 03:05:17,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:17,975 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:17,975 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2051169111, now seen corresponding path program 21 times [2018-04-12 03:05:17,975 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:17,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:18,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:18,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 03:05:18,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:18,197 INFO L182 omatonBuilderFactory]: Interpolants [4224#(<= main_~i~0 8), 4225#(<= main_~i~0 9), 4226#(<= main_~i~0 10), 4227#(<= main_~i~0 11), 4228#(<= main_~i~0 12), 4229#(<= main_~i~0 13), 4230#(<= main_~i~0 14), 4231#(<= main_~i~0 15), 4232#(<= main_~i~0 16), 4233#(<= main_~i~0 17), 4234#(<= main_~i~0 18), 4235#(<= main_~i~0 19), 4236#(<= main_~i~0 20), 4237#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4238#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4214#true, 4215#false, 4216#(<= main_~i~0 0), 4217#(<= main_~i~0 1), 4218#(<= main_~i~0 2), 4219#(<= main_~i~0 3), 4220#(<= main_~i~0 4), 4221#(<= main_~i~0 5), 4222#(<= main_~i~0 6), 4223#(<= main_~i~0 7)] [2018-04-12 03:05:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:18,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 03:05:18,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 03:05:18,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-12 03:05:18,198 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-04-12 03:05:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:18,540 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-04-12 03:05:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 03:05:18,540 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-12 03:05:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:18,541 INFO L225 Difference]: With dead ends: 123 [2018-04-12 03:05:18,541 INFO L226 Difference]: Without dead ends: 123 [2018-04-12 03:05:18,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 03:05:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-12 03:05:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-12 03:05:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 03:05:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-04-12 03:05:18,544 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-04-12 03:05:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:18,544 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-04-12 03:05:18,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 03:05:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-04-12 03:05:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-12 03:05:18,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:18,545 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:18,545 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2141490182, now seen corresponding path program 22 times [2018-04-12 03:05:18,546 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:18,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:18,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:18,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-12 03:05:18,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:18,785 INFO L182 omatonBuilderFactory]: Interpolants [4544#(<= main_~i~0 15), 4545#(<= main_~i~0 16), 4546#(<= main_~i~0 17), 4547#(<= main_~i~0 18), 4548#(<= main_~i~0 19), 4549#(<= main_~i~0 20), 4550#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4551#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4552#(and (<= 2 main_~i~0) (<= main_~i~0 22)), 4527#true, 4528#false, 4529#(<= main_~i~0 0), 4530#(<= main_~i~0 1), 4531#(<= main_~i~0 2), 4532#(<= main_~i~0 3), 4533#(<= main_~i~0 4), 4534#(<= main_~i~0 5), 4535#(<= main_~i~0 6), 4536#(<= main_~i~0 7), 4537#(<= main_~i~0 8), 4538#(<= main_~i~0 9), 4539#(<= main_~i~0 10), 4540#(<= main_~i~0 11), 4541#(<= main_~i~0 12), 4542#(<= main_~i~0 13), 4543#(<= main_~i~0 14)] [2018-04-12 03:05:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:18,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 03:05:18,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 03:05:18,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-12 03:05:18,786 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-04-12 03:05:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:19,097 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-04-12 03:05:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 03:05:19,097 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-12 03:05:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:19,098 INFO L225 Difference]: With dead ends: 128 [2018-04-12 03:05:19,098 INFO L226 Difference]: Without dead ends: 128 [2018-04-12 03:05:19,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 03:05:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-12 03:05:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-12 03:05:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-12 03:05:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-04-12 03:05:19,101 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-04-12 03:05:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:19,101 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-04-12 03:05:19,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 03:05:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-04-12 03:05:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-12 03:05:19,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:19,101 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:19,101 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:19,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1698664265, now seen corresponding path program 23 times [2018-04-12 03:05:19,102 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:19,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:19,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:19,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 03:05:19,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:19,338 INFO L182 omatonBuilderFactory]: Interpolants [4864#(<= main_~i~0 9), 4865#(<= main_~i~0 10), 4866#(<= main_~i~0 11), 4867#(<= main_~i~0 12), 4868#(<= main_~i~0 13), 4869#(<= main_~i~0 14), 4870#(<= main_~i~0 15), 4871#(<= main_~i~0 16), 4872#(<= main_~i~0 17), 4873#(<= main_~i~0 18), 4874#(<= main_~i~0 19), 4875#(<= main_~i~0 20), 4876#(<= main_~i~0 21), 4877#(<= main_~i~0 22), 4878#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 4879#(and (<= 1 main_~i~0) (<= main_~i~0 23)), 4853#true, 4854#false, 4855#(<= main_~i~0 0), 4856#(<= main_~i~0 1), 4857#(<= main_~i~0 2), 4858#(<= main_~i~0 3), 4859#(<= main_~i~0 4), 4860#(<= main_~i~0 5), 4861#(<= main_~i~0 6), 4862#(<= main_~i~0 7), 4863#(<= main_~i~0 8)] [2018-04-12 03:05:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:19,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 03:05:19,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 03:05:19,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-04-12 03:05:19,339 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 27 states. [2018-04-12 03:05:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:19,640 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-04-12 03:05:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 03:05:19,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-04-12 03:05:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:19,641 INFO L225 Difference]: With dead ends: 133 [2018-04-12 03:05:19,641 INFO L226 Difference]: Without dead ends: 133 [2018-04-12 03:05:19,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 03:05:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-12 03:05:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-04-12 03:05:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-12 03:05:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-04-12 03:05:19,644 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-04-12 03:05:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:19,644 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-04-12 03:05:19,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 03:05:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-04-12 03:05:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-12 03:05:19,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:19,645 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:19,645 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2004669094, now seen corresponding path program 24 times [2018-04-12 03:05:19,646 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:19,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:19,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:19,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-12 03:05:19,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:19,859 INFO L182 omatonBuilderFactory]: Interpolants [5192#true, 5193#false, 5194#(<= main_~i~0 0), 5195#(<= main_~i~0 1), 5196#(<= main_~i~0 2), 5197#(<= main_~i~0 3), 5198#(<= main_~i~0 4), 5199#(<= main_~i~0 5), 5200#(<= main_~i~0 6), 5201#(<= main_~i~0 7), 5202#(<= main_~i~0 8), 5203#(<= main_~i~0 9), 5204#(<= main_~i~0 10), 5205#(<= main_~i~0 11), 5206#(<= main_~i~0 12), 5207#(<= main_~i~0 13), 5208#(<= main_~i~0 14), 5209#(<= main_~i~0 15), 5210#(<= main_~i~0 16), 5211#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5212#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5213#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 5214#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 5215#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 5216#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 5217#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 5218#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 5219#(and (<= 8 main_~i~0) (<= main_~i~0 24))] [2018-04-12 03:05:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:19,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 03:05:19,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 03:05:19,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-04-12 03:05:19,859 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 28 states. [2018-04-12 03:05:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:20,351 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-04-12 03:05:20,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 03:05:20,352 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 127 [2018-04-12 03:05:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:20,352 INFO L225 Difference]: With dead ends: 138 [2018-04-12 03:05:20,352 INFO L226 Difference]: Without dead ends: 138 [2018-04-12 03:05:20,353 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 03:05:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-12 03:05:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-04-12 03:05:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-12 03:05:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-04-12 03:05:20,355 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-04-12 03:05:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:20,355 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-04-12 03:05:20,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 03:05:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-04-12 03:05:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-12 03:05:20,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:20,356 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:20,356 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460887, now seen corresponding path program 25 times [2018-04-12 03:05:20,356 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:20,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:20,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:20,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 03:05:20,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:20,618 INFO L182 omatonBuilderFactory]: Interpolants [5568#(<= main_~i~0 22), 5569#(<= main_~i~0 23), 5570#(<= main_~i~0 24), 5571#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5572#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 5544#true, 5545#false, 5546#(<= main_~i~0 0), 5547#(<= main_~i~0 1), 5548#(<= main_~i~0 2), 5549#(<= main_~i~0 3), 5550#(<= main_~i~0 4), 5551#(<= main_~i~0 5), 5552#(<= main_~i~0 6), 5553#(<= main_~i~0 7), 5554#(<= main_~i~0 8), 5555#(<= main_~i~0 9), 5556#(<= main_~i~0 10), 5557#(<= main_~i~0 11), 5558#(<= main_~i~0 12), 5559#(<= main_~i~0 13), 5560#(<= main_~i~0 14), 5561#(<= main_~i~0 15), 5562#(<= main_~i~0 16), 5563#(<= main_~i~0 17), 5564#(<= main_~i~0 18), 5565#(<= main_~i~0 19), 5566#(<= main_~i~0 20), 5567#(<= main_~i~0 21)] [2018-04-12 03:05:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:20,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 03:05:20,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 03:05:20,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-12 03:05:20,619 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-04-12 03:05:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:20,938 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-04-12 03:05:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 03:05:20,938 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-12 03:05:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:20,939 INFO L225 Difference]: With dead ends: 143 [2018-04-12 03:05:20,939 INFO L226 Difference]: Without dead ends: 143 [2018-04-12 03:05:20,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 03:05:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-12 03:05:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-04-12 03:05:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-12 03:05:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-04-12 03:05:20,941 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-04-12 03:05:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:20,941 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-04-12 03:05:20,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 03:05:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-04-12 03:05:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-12 03:05:20,950 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:20,951 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:20,951 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash 421876038, now seen corresponding path program 26 times [2018-04-12 03:05:20,952 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:20,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:21,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:21,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-12 03:05:21,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:21,242 INFO L182 omatonBuilderFactory]: Interpolants [5909#true, 5910#false, 5911#(<= main_~i~0 0), 5912#(<= main_~i~0 1), 5913#(<= main_~i~0 2), 5914#(<= main_~i~0 3), 5915#(<= main_~i~0 4), 5916#(<= main_~i~0 5), 5917#(<= main_~i~0 6), 5918#(<= main_~i~0 7), 5919#(<= main_~i~0 8), 5920#(<= main_~i~0 9), 5921#(<= main_~i~0 10), 5922#(<= main_~i~0 11), 5923#(<= main_~i~0 12), 5924#(<= main_~i~0 13), 5925#(<= main_~i~0 14), 5926#(<= main_~i~0 15), 5927#(<= main_~i~0 16), 5928#(<= main_~i~0 17), 5929#(<= main_~i~0 18), 5930#(<= main_~i~0 19), 5931#(<= main_~i~0 20), 5932#(<= main_~i~0 21), 5933#(<= main_~i~0 22), 5934#(<= main_~i~0 23), 5935#(<= main_~i~0 24), 5936#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5937#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 5938#(and (<= 2 main_~i~0) (<= main_~i~0 26))] [2018-04-12 03:05:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:21,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 03:05:21,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 03:05:21,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-12 03:05:21,243 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-04-12 03:05:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:21,616 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-04-12 03:05:21,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 03:05:21,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-12 03:05:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:21,616 INFO L225 Difference]: With dead ends: 148 [2018-04-12 03:05:21,617 INFO L226 Difference]: Without dead ends: 148 [2018-04-12 03:05:21,617 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 03:05:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-12 03:05:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-04-12 03:05:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-12 03:05:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-04-12 03:05:21,619 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-04-12 03:05:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:21,619 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-04-12 03:05:21,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 03:05:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-04-12 03:05:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-12 03:05:21,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:21,620 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:21,620 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:21,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1993804937, now seen corresponding path program 27 times [2018-04-12 03:05:21,620 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:21,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:21,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:21,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 03:05:21,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:21,924 INFO L182 omatonBuilderFactory]: Interpolants [6287#true, 6288#false, 6289#(<= main_~i~0 0), 6290#(<= main_~i~0 1), 6291#(<= main_~i~0 2), 6292#(<= main_~i~0 3), 6293#(<= main_~i~0 4), 6294#(<= main_~i~0 5), 6295#(<= main_~i~0 6), 6296#(<= main_~i~0 7), 6297#(<= main_~i~0 8), 6298#(<= main_~i~0 9), 6299#(<= main_~i~0 10), 6300#(<= main_~i~0 11), 6301#(<= main_~i~0 12), 6302#(<= main_~i~0 13), 6303#(<= main_~i~0 14), 6304#(<= main_~i~0 15), 6305#(<= main_~i~0 16), 6306#(<= main_~i~0 17), 6307#(<= main_~i~0 18), 6308#(<= main_~i~0 19), 6309#(<= main_~i~0 20), 6310#(<= main_~i~0 21), 6311#(<= main_~i~0 22), 6312#(<= main_~i~0 23), 6313#(<= main_~i~0 24), 6314#(<= main_~i~0 25), 6315#(<= main_~i~0 26), 6316#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 6317#(and (<= 1 main_~i~0) (<= main_~i~0 27))] [2018-04-12 03:05:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:21,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 03:05:21,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 03:05:21,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-12 03:05:21,925 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-04-12 03:05:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:22,289 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-04-12 03:05:22,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 03:05:22,290 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-12 03:05:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:22,290 INFO L225 Difference]: With dead ends: 153 [2018-04-12 03:05:22,290 INFO L226 Difference]: Without dead ends: 153 [2018-04-12 03:05:22,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 03:05:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-12 03:05:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-12 03:05:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-12 03:05:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-04-12 03:05:22,292 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-04-12 03:05:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:22,293 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-04-12 03:05:22,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 03:05:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-04-12 03:05:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-12 03:05:22,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:22,293 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:22,293 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1740113894, now seen corresponding path program 28 times [2018-04-12 03:05:22,294 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:22,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:22,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:22,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-12 03:05:22,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:22,618 INFO L182 omatonBuilderFactory]: Interpolants [6678#true, 6679#false, 6680#(<= main_~i~0 0), 6681#(<= main_~i~0 1), 6682#(<= main_~i~0 2), 6683#(<= main_~i~0 3), 6684#(<= main_~i~0 4), 6685#(<= main_~i~0 5), 6686#(<= main_~i~0 6), 6687#(<= main_~i~0 7), 6688#(<= main_~i~0 8), 6689#(<= main_~i~0 9), 6690#(<= main_~i~0 10), 6691#(<= main_~i~0 11), 6692#(<= main_~i~0 12), 6693#(<= main_~i~0 13), 6694#(<= main_~i~0 14), 6695#(<= main_~i~0 15), 6696#(<= main_~i~0 16), 6697#(<= main_~i~0 17), 6698#(<= main_~i~0 18), 6699#(<= main_~i~0 19), 6700#(<= main_~i~0 20), 6701#(<= main_~i~0 21), 6702#(<= main_~i~0 22), 6703#(<= main_~i~0 23), 6704#(<= main_~i~0 24), 6705#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 6706#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 6707#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 6708#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 6709#(and (<= 4 main_~i~0) (<= main_~i~0 28))] [2018-04-12 03:05:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:22,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 03:05:22,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 03:05:22,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-04-12 03:05:22,619 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 32 states. [2018-04-12 03:05:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:23,141 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-04-12 03:05:23,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 03:05:23,141 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2018-04-12 03:05:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:23,142 INFO L225 Difference]: With dead ends: 158 [2018-04-12 03:05:23,142 INFO L226 Difference]: Without dead ends: 158 [2018-04-12 03:05:23,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 03:05:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-12 03:05:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-04-12 03:05:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-12 03:05:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-04-12 03:05:23,145 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-04-12 03:05:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:23,146 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-04-12 03:05:23,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 03:05:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-04-12 03:05:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-12 03:05:23,147 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:23,147 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:23,147 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:23,147 INFO L82 PathProgramCache]: Analyzing trace with hash 685727959, now seen corresponding path program 29 times [2018-04-12 03:05:23,148 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:23,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:23,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:23,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 03:05:23,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:23,487 INFO L182 omatonBuilderFactory]: Interpolants [7104#(<= main_~i~0 20), 7105#(<= main_~i~0 21), 7106#(<= main_~i~0 22), 7107#(<= main_~i~0 23), 7108#(<= main_~i~0 24), 7109#(<= main_~i~0 25), 7110#(<= main_~i~0 26), 7111#(<= main_~i~0 27), 7112#(<= main_~i~0 28), 7113#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7114#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7082#true, 7083#false, 7084#(<= main_~i~0 0), 7085#(<= main_~i~0 1), 7086#(<= main_~i~0 2), 7087#(<= main_~i~0 3), 7088#(<= main_~i~0 4), 7089#(<= main_~i~0 5), 7090#(<= main_~i~0 6), 7091#(<= main_~i~0 7), 7092#(<= main_~i~0 8), 7093#(<= main_~i~0 9), 7094#(<= main_~i~0 10), 7095#(<= main_~i~0 11), 7096#(<= main_~i~0 12), 7097#(<= main_~i~0 13), 7098#(<= main_~i~0 14), 7099#(<= main_~i~0 15), 7100#(<= main_~i~0 16), 7101#(<= main_~i~0 17), 7102#(<= main_~i~0 18), 7103#(<= main_~i~0 19)] [2018-04-12 03:05:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:23,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 03:05:23,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 03:05:23,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 03:05:23,488 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 33 states. [2018-04-12 03:05:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:23,872 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-04-12 03:05:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 03:05:23,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-04-12 03:05:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:23,873 INFO L225 Difference]: With dead ends: 163 [2018-04-12 03:05:23,873 INFO L226 Difference]: Without dead ends: 163 [2018-04-12 03:05:23,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 03:05:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-12 03:05:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-12 03:05:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-12 03:05:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-04-12 03:05:23,876 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-04-12 03:05:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:23,876 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-04-12 03:05:23,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 03:05:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-04-12 03:05:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-12 03:05:23,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:23,877 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:23,877 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash -842074490, now seen corresponding path program 30 times [2018-04-12 03:05:23,877 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:23,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:24,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:24,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-12 03:05:24,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:24,165 INFO L182 omatonBuilderFactory]: Interpolants [7499#true, 7500#false, 7501#(<= main_~i~0 0), 7502#(<= main_~i~0 1), 7503#(<= main_~i~0 2), 7504#(<= main_~i~0 3), 7505#(<= main_~i~0 4), 7506#(<= main_~i~0 5), 7507#(<= main_~i~0 6), 7508#(<= main_~i~0 7), 7509#(<= main_~i~0 8), 7510#(<= main_~i~0 9), 7511#(<= main_~i~0 10), 7512#(<= main_~i~0 11), 7513#(<= main_~i~0 12), 7514#(<= main_~i~0 13), 7515#(<= main_~i~0 14), 7516#(<= main_~i~0 15), 7517#(<= main_~i~0 16), 7518#(<= main_~i~0 17), 7519#(<= main_~i~0 18), 7520#(<= main_~i~0 19), 7521#(<= main_~i~0 20), 7522#(<= main_~i~0 21), 7523#(<= main_~i~0 22), 7524#(<= main_~i~0 23), 7525#(<= main_~i~0 24), 7526#(<= main_~i~0 25), 7527#(<= main_~i~0 26), 7528#(<= main_~i~0 27), 7529#(<= main_~i~0 28), 7530#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7531#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7532#(and (<= 2 main_~i~0) (<= main_~i~0 30))] [2018-04-12 03:05:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:24,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 03:05:24,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 03:05:24,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 03:05:24,166 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 34 states. [2018-04-12 03:05:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:24,719 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-04-12 03:05:24,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 03:05:24,720 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 157 [2018-04-12 03:05:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:24,720 INFO L225 Difference]: With dead ends: 168 [2018-04-12 03:05:24,720 INFO L226 Difference]: Without dead ends: 168 [2018-04-12 03:05:24,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 03:05:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-12 03:05:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-12 03:05:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 03:05:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-04-12 03:05:24,723 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-04-12 03:05:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:24,723 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-04-12 03:05:24,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 03:05:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-04-12 03:05:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-12 03:05:24,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:24,724 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:24,724 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1391760951, now seen corresponding path program 31 times [2018-04-12 03:05:24,724 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:24,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:25,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:25,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 03:05:25,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:25,153 INFO L182 omatonBuilderFactory]: Interpolants [7936#(<= main_~i~0 5), 7937#(<= main_~i~0 6), 7938#(<= main_~i~0 7), 7939#(<= main_~i~0 8), 7940#(<= main_~i~0 9), 7941#(<= main_~i~0 10), 7942#(<= main_~i~0 11), 7943#(<= main_~i~0 12), 7944#(<= main_~i~0 13), 7945#(<= main_~i~0 14), 7946#(<= main_~i~0 15), 7947#(<= main_~i~0 16), 7948#(<= main_~i~0 17), 7949#(<= main_~i~0 18), 7950#(<= main_~i~0 19), 7951#(<= main_~i~0 20), 7952#(<= main_~i~0 21), 7953#(<= main_~i~0 22), 7954#(<= main_~i~0 23), 7955#(<= main_~i~0 24), 7956#(<= main_~i~0 25), 7957#(<= main_~i~0 26), 7958#(<= main_~i~0 27), 7959#(<= main_~i~0 28), 7960#(<= main_~i~0 29), 7961#(<= main_~i~0 30), 7962#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 7963#(and (<= 1 main_~i~0) (<= main_~i~0 31)), 7929#true, 7930#false, 7931#(<= main_~i~0 0), 7932#(<= main_~i~0 1), 7933#(<= main_~i~0 2), 7934#(<= main_~i~0 3), 7935#(<= main_~i~0 4)] [2018-04-12 03:05:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:25,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 03:05:25,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 03:05:25,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 03:05:25,155 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-04-12 03:05:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:25,586 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-04-12 03:05:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 03:05:25,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-12 03:05:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:25,587 INFO L225 Difference]: With dead ends: 173 [2018-04-12 03:05:25,587 INFO L226 Difference]: Without dead ends: 173 [2018-04-12 03:05:25,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 03:05:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-12 03:05:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-04-12 03:05:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-12 03:05:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-04-12 03:05:25,590 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-04-12 03:05:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:25,591 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-04-12 03:05:25,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 03:05:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-04-12 03:05:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-12 03:05:25,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:25,591 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:25,592 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1115415258, now seen corresponding path program 32 times [2018-04-12 03:05:25,592 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:25,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:26,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:26,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 03:05:26,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:26,224 INFO L182 omatonBuilderFactory]: Interpolants [8384#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 8385#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 8386#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 8387#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 8388#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 8389#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 8390#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 8391#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 8392#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 8393#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 8394#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 8395#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 8396#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 8397#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 8398#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 8399#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 8400#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 8401#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 8402#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 8403#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 8404#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 8405#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 8406#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 8372#true, 8373#false, 8374#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 8375#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 8376#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 8377#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 8378#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 8379#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 8380#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 8381#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 8382#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 8383#(and (<= main_~i~0 9) (<= 9 main_~i~0))] [2018-04-12 03:05:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:26,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 03:05:26,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 03:05:26,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 03:05:26,225 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-04-12 03:05:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:27,309 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-04-12 03:05:27,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 03:05:27,309 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-12 03:05:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:27,309 INFO L225 Difference]: With dead ends: 178 [2018-04-12 03:05:27,310 INFO L226 Difference]: Without dead ends: 178 [2018-04-12 03:05:27,310 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 03:05:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-12 03:05:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-04-12 03:05:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-12 03:05:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-04-12 03:05:27,311 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-04-12 03:05:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:27,312 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-04-12 03:05:27,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 03:05:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-04-12 03:05:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-12 03:05:27,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:27,312 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:27,313 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash -712076393, now seen corresponding path program 33 times [2018-04-12 03:05:27,313 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:27,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:27,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:27,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-12 03:05:27,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:27,638 INFO L182 omatonBuilderFactory]: Interpolants [8768#(<= main_~i~0 3), 8769#(<= main_~i~0 4), 8770#(<= main_~i~0 5), 8771#(<= main_~i~0 6), 8772#(<= main_~i~0 7), 8773#(<= main_~i~0 8), 8774#(<= main_~i~0 9), 8775#(<= main_~i~0 10), 8776#(<= main_~i~0 11), 8777#(<= main_~i~0 12), 8778#(<= main_~i~0 13), 8779#(<= main_~i~0 14), 8780#(<= main_~i~0 15), 8781#(<= main_~i~0 16), 8782#(<= main_~i~0 17), 8783#(<= main_~i~0 18), 8784#(<= main_~i~0 19), 8785#(<= main_~i~0 20), 8786#(<= main_~i~0 21), 8787#(<= main_~i~0 22), 8788#(<= main_~i~0 23), 8789#(<= main_~i~0 24), 8790#(<= main_~i~0 25), 8791#(<= main_~i~0 26), 8792#(<= main_~i~0 27), 8793#(<= main_~i~0 28), 8794#(<= main_~i~0 29), 8795#(<= main_~i~0 30), 8796#(<= main_~i~0 31), 8797#(<= main_~i~0 32), 8798#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 8799#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 8763#true, 8764#false, 8765#(<= main_~i~0 0), 8766#(<= main_~i~0 1), 8767#(<= main_~i~0 2)] [2018-04-12 03:05:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:27,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 03:05:27,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 03:05:27,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 03:05:27,639 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-04-12 03:05:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:28,168 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-04-12 03:05:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 03:05:28,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-12 03:05:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:28,169 INFO L225 Difference]: With dead ends: 183 [2018-04-12 03:05:28,169 INFO L226 Difference]: Without dead ends: 183 [2018-04-12 03:05:28,170 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 03:05:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-12 03:05:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-12 03:05:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-12 03:05:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-04-12 03:05:28,171 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-04-12 03:05:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:28,171 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-04-12 03:05:28,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 03:05:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-04-12 03:05:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-12 03:05:28,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:28,172 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:28,172 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:28,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1349614534, now seen corresponding path program 34 times [2018-04-12 03:05:28,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:28,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:28,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:28,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-12 03:05:28,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:28,632 INFO L182 omatonBuilderFactory]: Interpolants [9232#true, 9233#false, 9234#(<= main_~i~0 0), 9235#(<= main_~i~0 1), 9236#(<= main_~i~0 2), 9237#(<= main_~i~0 3), 9238#(<= main_~i~0 4), 9239#(<= main_~i~0 5), 9240#(<= main_~i~0 6), 9241#(<= main_~i~0 7), 9242#(<= main_~i~0 8), 9243#(<= main_~i~0 9), 9244#(<= main_~i~0 10), 9245#(<= main_~i~0 11), 9246#(<= main_~i~0 12), 9247#(<= main_~i~0 13), 9248#(<= main_~i~0 14), 9249#(<= main_~i~0 15), 9250#(<= main_~i~0 16), 9251#(<= main_~i~0 17), 9252#(<= main_~i~0 18), 9253#(<= main_~i~0 19), 9254#(<= main_~i~0 20), 9255#(<= main_~i~0 21), 9256#(<= main_~i~0 22), 9257#(<= main_~i~0 23), 9258#(<= main_~i~0 24), 9259#(<= main_~i~0 25), 9260#(<= main_~i~0 26), 9261#(<= main_~i~0 27), 9262#(<= main_~i~0 28), 9263#(<= main_~i~0 29), 9264#(<= main_~i~0 30), 9265#(<= main_~i~0 31), 9266#(<= main_~i~0 32), 9267#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 9268#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 9269#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-04-12 03:05:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:28,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 03:05:28,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 03:05:28,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 03:05:28,632 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-04-12 03:05:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:29,251 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-04-12 03:05:29,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 03:05:29,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-12 03:05:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:29,252 INFO L225 Difference]: With dead ends: 188 [2018-04-12 03:05:29,252 INFO L226 Difference]: Without dead ends: 188 [2018-04-12 03:05:29,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 03:05:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-12 03:05:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-04-12 03:05:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-12 03:05:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-04-12 03:05:29,254 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-04-12 03:05:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:29,255 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-04-12 03:05:29,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 03:05:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-04-12 03:05:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-12 03:05:29,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:29,255 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:29,255 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2024580873, now seen corresponding path program 35 times [2018-04-12 03:05:29,256 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:29,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:29,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:29,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-12 03:05:29,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:29,654 INFO L182 omatonBuilderFactory]: Interpolants [9728#(<= main_~i~0 12), 9729#(<= main_~i~0 13), 9730#(<= main_~i~0 14), 9731#(<= main_~i~0 15), 9732#(<= main_~i~0 16), 9733#(<= main_~i~0 17), 9734#(<= main_~i~0 18), 9735#(<= main_~i~0 19), 9736#(<= main_~i~0 20), 9737#(<= main_~i~0 21), 9738#(<= main_~i~0 22), 9739#(<= main_~i~0 23), 9740#(<= main_~i~0 24), 9741#(<= main_~i~0 25), 9742#(<= main_~i~0 26), 9743#(<= main_~i~0 27), 9744#(<= main_~i~0 28), 9745#(<= main_~i~0 29), 9746#(<= main_~i~0 30), 9747#(<= main_~i~0 31), 9748#(<= main_~i~0 32), 9749#(<= main_~i~0 33), 9750#(<= main_~i~0 34), 9751#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 9752#(and (<= 1 main_~i~0) (<= main_~i~0 35)), 9714#true, 9715#false, 9716#(<= main_~i~0 0), 9717#(<= main_~i~0 1), 9718#(<= main_~i~0 2), 9719#(<= main_~i~0 3), 9720#(<= main_~i~0 4), 9721#(<= main_~i~0 5), 9722#(<= main_~i~0 6), 9723#(<= main_~i~0 7), 9724#(<= main_~i~0 8), 9725#(<= main_~i~0 9), 9726#(<= main_~i~0 10), 9727#(<= main_~i~0 11)] [2018-04-12 03:05:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:29,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 03:05:29,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 03:05:29,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 03:05:29,655 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 39 states. [2018-04-12 03:05:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:30,208 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-04-12 03:05:30,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 03:05:30,208 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-04-12 03:05:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:30,209 INFO L225 Difference]: With dead ends: 193 [2018-04-12 03:05:30,209 INFO L226 Difference]: Without dead ends: 193 [2018-04-12 03:05:30,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 03:05:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-12 03:05:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-04-12 03:05:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-12 03:05:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-04-12 03:05:30,211 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-04-12 03:05:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:30,211 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-04-12 03:05:30,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 03:05:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-04-12 03:05:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-12 03:05:30,211 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:30,211 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:30,211 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -407825818, now seen corresponding path program 36 times [2018-04-12 03:05:30,212 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:30,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:30,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:30,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-12 03:05:30,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:30,704 INFO L182 omatonBuilderFactory]: Interpolants [10240#(<= main_~i~0 29), 10241#(<= main_~i~0 30), 10242#(<= main_~i~0 31), 10243#(<= main_~i~0 32), 10244#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 10245#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 10246#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 10247#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 10248#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 10209#true, 10210#false, 10211#(<= main_~i~0 0), 10212#(<= main_~i~0 1), 10213#(<= main_~i~0 2), 10214#(<= main_~i~0 3), 10215#(<= main_~i~0 4), 10216#(<= main_~i~0 5), 10217#(<= main_~i~0 6), 10218#(<= main_~i~0 7), 10219#(<= main_~i~0 8), 10220#(<= main_~i~0 9), 10221#(<= main_~i~0 10), 10222#(<= main_~i~0 11), 10223#(<= main_~i~0 12), 10224#(<= main_~i~0 13), 10225#(<= main_~i~0 14), 10226#(<= main_~i~0 15), 10227#(<= main_~i~0 16), 10228#(<= main_~i~0 17), 10229#(<= main_~i~0 18), 10230#(<= main_~i~0 19), 10231#(<= main_~i~0 20), 10232#(<= main_~i~0 21), 10233#(<= main_~i~0 22), 10234#(<= main_~i~0 23), 10235#(<= main_~i~0 24), 10236#(<= main_~i~0 25), 10237#(<= main_~i~0 26), 10238#(<= main_~i~0 27), 10239#(<= main_~i~0 28)] [2018-04-12 03:05:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:30,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 03:05:30,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 03:05:30,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 03:05:30,704 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 40 states. [2018-04-12 03:05:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:31,414 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-04-12 03:05:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 03:05:31,414 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 187 [2018-04-12 03:05:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:31,415 INFO L225 Difference]: With dead ends: 198 [2018-04-12 03:05:31,415 INFO L226 Difference]: Without dead ends: 198 [2018-04-12 03:05:31,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 03:05:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-12 03:05:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-04-12 03:05:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-12 03:05:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-04-12 03:05:31,417 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-04-12 03:05:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:31,417 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-04-12 03:05:31,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 03:05:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-04-12 03:05:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-12 03:05:31,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:31,418 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:31,418 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1486297513, now seen corresponding path program 37 times [2018-04-12 03:05:31,418 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:31,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:31,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:31,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-12 03:05:31,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:31,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-04-12 03:05:31,832 INFO L182 omatonBuilderFactory]: Interpolants [10752#(<= main_~i~0 33), 10753#(<= main_~i~0 34), 10754#(<= main_~i~0 35), 10755#(<= main_~i~0 36), 10756#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 10757#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 10717#true, 10718#false, 10719#(<= main_~i~0 0), 10720#(<= main_~i~0 1), 10721#(<= main_~i~0 2), 10722#(<= main_~i~0 3), 10723#(<= main_~i~0 4), 10724#(<= main_~i~0 5), 10725#(<= main_~i~0 6), 10726#(<= main_~i~0 7), 10727#(<= main_~i~0 8), 10728#(<= main_~i~0 9), 10729#(<= main_~i~0 10), 10730#(<= main_~i~0 11), 10731#(<= main_~i~0 12), 10732#(<= main_~i~0 13), 10733#(<= main_~i~0 14), 10734#(<= main_~i~0 15), 10735#(<= main_~i~0 16), 10736#(<= main_~i~0 17), 10737#(<= main_~i~0 18), 10738#(<= main_~i~0 19), 10739#(<= main_~i~0 20), 10740#(<= main_~i~0 21), 10741#(<= main_~i~0 22), 10742#(<= main_~i~0 23), 10743#(<= main_~i~0 24), 10744#(<= main_~i~0 25), 10745#(<= main_~i~0 26), 10746#(<= main_~i~0 27), 10747#(<= main_~i~0 28), 10748#(<= main_~i~0 29), 10749#(<= main_~i~0 30), 10750#(<= main_~i~0 31), 10751#(<= main_~i~0 32)] [2018-04-12 03:05:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:31,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 03:05:31,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 03:05:31,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 03:05:31,832 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-04-12 03:05:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:32,437 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-04-12 03:05:32,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 03:05:32,438 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-12 03:05:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:32,438 INFO L225 Difference]: With dead ends: 203 [2018-04-12 03:05:32,438 INFO L226 Difference]: Without dead ends: 203 [2018-04-12 03:05:32,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 03:05:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-12 03:05:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-04-12 03:05:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-12 03:05:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-04-12 03:05:32,441 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-04-12 03:05:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:32,442 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-04-12 03:05:32,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 03:05:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-04-12 03:05:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-12 03:05:32,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:32,442 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:32,442 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:32,442 INFO L82 PathProgramCache]: Analyzing trace with hash -874716922, now seen corresponding path program 38 times [2018-04-12 03:05:32,443 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:32,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:32,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:32,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-12 03:05:32,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:32,874 INFO L182 omatonBuilderFactory]: Interpolants [11264#(<= main_~i~0 24), 11265#(<= main_~i~0 25), 11266#(<= main_~i~0 26), 11267#(<= main_~i~0 27), 11268#(<= main_~i~0 28), 11269#(<= main_~i~0 29), 11270#(<= main_~i~0 30), 11271#(<= main_~i~0 31), 11272#(<= main_~i~0 32), 11273#(<= main_~i~0 33), 11274#(<= main_~i~0 34), 11275#(<= main_~i~0 35), 11276#(<= main_~i~0 36), 11277#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 11278#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 11279#(and (<= 2 main_~i~0) (<= main_~i~0 38)), 11238#true, 11239#false, 11240#(<= main_~i~0 0), 11241#(<= main_~i~0 1), 11242#(<= main_~i~0 2), 11243#(<= main_~i~0 3), 11244#(<= main_~i~0 4), 11245#(<= main_~i~0 5), 11246#(<= main_~i~0 6), 11247#(<= main_~i~0 7), 11248#(<= main_~i~0 8), 11249#(<= main_~i~0 9), 11250#(<= main_~i~0 10), 11251#(<= main_~i~0 11), 11252#(<= main_~i~0 12), 11253#(<= main_~i~0 13), 11254#(<= main_~i~0 14), 11255#(<= main_~i~0 15), 11256#(<= main_~i~0 16), 11257#(<= main_~i~0 17), 11258#(<= main_~i~0 18), 11259#(<= main_~i~0 19), 11260#(<= main_~i~0 20), 11261#(<= main_~i~0 21), 11262#(<= main_~i~0 22), 11263#(<= main_~i~0 23)] [2018-04-12 03:05:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:32,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 03:05:32,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 03:05:32,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 03:05:32,876 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-04-12 03:05:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:33,564 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-04-12 03:05:33,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 03:05:33,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-12 03:05:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:33,565 INFO L225 Difference]: With dead ends: 208 [2018-04-12 03:05:33,565 INFO L226 Difference]: Without dead ends: 208 [2018-04-12 03:05:33,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 03:05:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-12 03:05:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-04-12 03:05:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-12 03:05:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-04-12 03:05:33,568 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-04-12 03:05:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:33,568 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-04-12 03:05:33,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 03:05:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-04-12 03:05:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-12 03:05:33,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:33,569 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:33,569 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093175, now seen corresponding path program 39 times [2018-04-12 03:05:33,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:33,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:34,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:34,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-12 03:05:34,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:34,052 INFO L182 omatonBuilderFactory]: Interpolants [11776#(<= main_~i~0 2), 11777#(<= main_~i~0 3), 11778#(<= main_~i~0 4), 11779#(<= main_~i~0 5), 11780#(<= main_~i~0 6), 11781#(<= main_~i~0 7), 11782#(<= main_~i~0 8), 11783#(<= main_~i~0 9), 11784#(<= main_~i~0 10), 11785#(<= main_~i~0 11), 11786#(<= main_~i~0 12), 11787#(<= main_~i~0 13), 11788#(<= main_~i~0 14), 11789#(<= main_~i~0 15), 11790#(<= main_~i~0 16), 11791#(<= main_~i~0 17), 11792#(<= main_~i~0 18), 11793#(<= main_~i~0 19), 11794#(<= main_~i~0 20), 11795#(<= main_~i~0 21), 11796#(<= main_~i~0 22), 11797#(<= main_~i~0 23), 11798#(<= main_~i~0 24), 11799#(<= main_~i~0 25), 11800#(<= main_~i~0 26), 11801#(<= main_~i~0 27), 11802#(<= main_~i~0 28), 11803#(<= main_~i~0 29), 11804#(<= main_~i~0 30), 11805#(<= main_~i~0 31), 11806#(<= main_~i~0 32), 11807#(<= main_~i~0 33), 11808#(<= main_~i~0 34), 11809#(<= main_~i~0 35), 11810#(<= main_~i~0 36), 11811#(<= main_~i~0 37), 11812#(<= main_~i~0 38), 11813#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 11814#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 11772#true, 11773#false, 11774#(<= main_~i~0 0), 11775#(<= main_~i~0 1)] [2018-04-12 03:05:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:34,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 03:05:34,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 03:05:34,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 03:05:34,052 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-04-12 03:05:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:34,668 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-04-12 03:05:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 03:05:34,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-12 03:05:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:34,669 INFO L225 Difference]: With dead ends: 213 [2018-04-12 03:05:34,669 INFO L226 Difference]: Without dead ends: 213 [2018-04-12 03:05:34,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-04-12 03:05:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-12 03:05:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-04-12 03:05:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 03:05:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-04-12 03:05:34,672 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-04-12 03:05:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:34,672 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-04-12 03:05:34,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 03:05:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-04-12 03:05:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-12 03:05:34,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:34,673 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:34,673 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash -854661210, now seen corresponding path program 40 times [2018-04-12 03:05:34,673 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:34,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:35,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:35,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-12 03:05:35,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:35,118 INFO L182 omatonBuilderFactory]: Interpolants [12352#(<= main_~i~0 31), 12353#(<= main_~i~0 32), 12354#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 12355#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 12356#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 12357#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 12358#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 12359#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 12360#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 12361#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 12362#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 12319#true, 12320#false, 12321#(<= main_~i~0 0), 12322#(<= main_~i~0 1), 12323#(<= main_~i~0 2), 12324#(<= main_~i~0 3), 12325#(<= main_~i~0 4), 12326#(<= main_~i~0 5), 12327#(<= main_~i~0 6), 12328#(<= main_~i~0 7), 12329#(<= main_~i~0 8), 12330#(<= main_~i~0 9), 12331#(<= main_~i~0 10), 12332#(<= main_~i~0 11), 12333#(<= main_~i~0 12), 12334#(<= main_~i~0 13), 12335#(<= main_~i~0 14), 12336#(<= main_~i~0 15), 12337#(<= main_~i~0 16), 12338#(<= main_~i~0 17), 12339#(<= main_~i~0 18), 12340#(<= main_~i~0 19), 12341#(<= main_~i~0 20), 12342#(<= main_~i~0 21), 12343#(<= main_~i~0 22), 12344#(<= main_~i~0 23), 12345#(<= main_~i~0 24), 12346#(<= main_~i~0 25), 12347#(<= main_~i~0 26), 12348#(<= main_~i~0 27), 12349#(<= main_~i~0 28), 12350#(<= main_~i~0 29), 12351#(<= main_~i~0 30)] [2018-04-12 03:05:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 03:05:35,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 03:05:35,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 03:05:35,118 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-04-12 03:05:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:36,103 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-04-12 03:05:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 03:05:36,103 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-12 03:05:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:36,104 INFO L225 Difference]: With dead ends: 218 [2018-04-12 03:05:36,104 INFO L226 Difference]: Without dead ends: 218 [2018-04-12 03:05:36,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-04-12 03:05:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-12 03:05:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-04-12 03:05:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-12 03:05:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-04-12 03:05:36,106 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-04-12 03:05:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:36,106 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-04-12 03:05:36,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 03:05:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-04-12 03:05:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-12 03:05:36,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:36,107 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:36,107 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2040420631, now seen corresponding path program 41 times [2018-04-12 03:05:36,108 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:36,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:36,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:36,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-12 03:05:36,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:36,610 INFO L182 omatonBuilderFactory]: Interpolants [12879#true, 12880#false, 12881#(<= main_~i~0 0), 12882#(<= main_~i~0 1), 12883#(<= main_~i~0 2), 12884#(<= main_~i~0 3), 12885#(<= main_~i~0 4), 12886#(<= main_~i~0 5), 12887#(<= main_~i~0 6), 12888#(<= main_~i~0 7), 12889#(<= main_~i~0 8), 12890#(<= main_~i~0 9), 12891#(<= main_~i~0 10), 12892#(<= main_~i~0 11), 12893#(<= main_~i~0 12), 12894#(<= main_~i~0 13), 12895#(<= main_~i~0 14), 12896#(<= main_~i~0 15), 12897#(<= main_~i~0 16), 12898#(<= main_~i~0 17), 12899#(<= main_~i~0 18), 12900#(<= main_~i~0 19), 12901#(<= main_~i~0 20), 12902#(<= main_~i~0 21), 12903#(<= main_~i~0 22), 12904#(<= main_~i~0 23), 12905#(<= main_~i~0 24), 12906#(<= main_~i~0 25), 12907#(<= main_~i~0 26), 12908#(<= main_~i~0 27), 12909#(<= main_~i~0 28), 12910#(<= main_~i~0 29), 12911#(<= main_~i~0 30), 12912#(<= main_~i~0 31), 12913#(<= main_~i~0 32), 12914#(<= main_~i~0 33), 12915#(<= main_~i~0 34), 12916#(<= main_~i~0 35), 12917#(<= main_~i~0 36), 12918#(<= main_~i~0 37), 12919#(<= main_~i~0 38), 12920#(<= main_~i~0 39), 12921#(<= main_~i~0 40), 12922#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 12923#(and (<= 1 main_~i~0) (<= main_~i~0 41))] [2018-04-12 03:05:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:36,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-12 03:05:36,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-12 03:05:36,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 03:05:36,611 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 45 states. [2018-04-12 03:05:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:37,313 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-04-12 03:05:37,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 03:05:37,313 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-04-12 03:05:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:37,314 INFO L225 Difference]: With dead ends: 223 [2018-04-12 03:05:37,314 INFO L226 Difference]: Without dead ends: 223 [2018-04-12 03:05:37,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-04-12 03:05:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-12 03:05:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-04-12 03:05:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-12 03:05:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-04-12 03:05:37,316 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-04-12 03:05:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:37,316 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-04-12 03:05:37,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-12 03:05:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-04-12 03:05:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-12 03:05:37,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:37,317 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:37,317 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash -488561082, now seen corresponding path program 42 times [2018-04-12 03:05:37,318 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:37,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:37,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:37,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-12 03:05:37,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:37,873 INFO L182 omatonBuilderFactory]: Interpolants [13452#true, 13453#false, 13454#(<= main_~i~0 0), 13455#(<= main_~i~0 1), 13456#(<= main_~i~0 2), 13457#(<= main_~i~0 3), 13458#(<= main_~i~0 4), 13459#(<= main_~i~0 5), 13460#(<= main_~i~0 6), 13461#(<= main_~i~0 7), 13462#(<= main_~i~0 8), 13463#(<= main_~i~0 9), 13464#(<= main_~i~0 10), 13465#(<= main_~i~0 11), 13466#(<= main_~i~0 12), 13467#(<= main_~i~0 13), 13468#(<= main_~i~0 14), 13469#(<= main_~i~0 15), 13470#(<= main_~i~0 16), 13471#(<= main_~i~0 17), 13472#(<= main_~i~0 18), 13473#(<= main_~i~0 19), 13474#(<= main_~i~0 20), 13475#(<= main_~i~0 21), 13476#(<= main_~i~0 22), 13477#(<= main_~i~0 23), 13478#(<= main_~i~0 24), 13479#(<= main_~i~0 25), 13480#(<= main_~i~0 26), 13481#(<= main_~i~0 27), 13482#(<= main_~i~0 28), 13483#(<= main_~i~0 29), 13484#(<= main_~i~0 30), 13485#(<= main_~i~0 31), 13486#(<= main_~i~0 32), 13487#(<= main_~i~0 33), 13488#(<= main_~i~0 34), 13489#(<= main_~i~0 35), 13490#(<= main_~i~0 36), 13491#(<= main_~i~0 37), 13492#(<= main_~i~0 38), 13493#(<= main_~i~0 39), 13494#(<= main_~i~0 40), 13495#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 13496#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 13497#(and (<= 2 main_~i~0) (<= main_~i~0 42))] [2018-04-12 03:05:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:37,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 03:05:37,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 03:05:37,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 03:05:37,873 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 46 states. [2018-04-12 03:05:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:38,619 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-04-12 03:05:38,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-12 03:05:38,619 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 217 [2018-04-12 03:05:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:38,620 INFO L225 Difference]: With dead ends: 228 [2018-04-12 03:05:38,620 INFO L226 Difference]: Without dead ends: 228 [2018-04-12 03:05:38,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2018-04-12 03:05:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-12 03:05:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-04-12 03:05:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-12 03:05:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-04-12 03:05:38,624 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-04-12 03:05:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:38,624 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-04-12 03:05:38,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 03:05:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-04-12 03:05:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-12 03:05:38,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:38,625 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:38,625 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 344604279, now seen corresponding path program 43 times [2018-04-12 03:05:38,626 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:38,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:39,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:39,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-12 03:05:39,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:39,230 INFO L182 omatonBuilderFactory]: Interpolants [14080#(<= main_~i~0 40), 14081#(<= main_~i~0 41), 14082#(<= main_~i~0 42), 14083#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 14084#(and (<= 1 main_~i~0) (<= main_~i~0 43)), 14038#true, 14039#false, 14040#(<= main_~i~0 0), 14041#(<= main_~i~0 1), 14042#(<= main_~i~0 2), 14043#(<= main_~i~0 3), 14044#(<= main_~i~0 4), 14045#(<= main_~i~0 5), 14046#(<= main_~i~0 6), 14047#(<= main_~i~0 7), 14048#(<= main_~i~0 8), 14049#(<= main_~i~0 9), 14050#(<= main_~i~0 10), 14051#(<= main_~i~0 11), 14052#(<= main_~i~0 12), 14053#(<= main_~i~0 13), 14054#(<= main_~i~0 14), 14055#(<= main_~i~0 15), 14056#(<= main_~i~0 16), 14057#(<= main_~i~0 17), 14058#(<= main_~i~0 18), 14059#(<= main_~i~0 19), 14060#(<= main_~i~0 20), 14061#(<= main_~i~0 21), 14062#(<= main_~i~0 22), 14063#(<= main_~i~0 23), 14064#(<= main_~i~0 24), 14065#(<= main_~i~0 25), 14066#(<= main_~i~0 26), 14067#(<= main_~i~0 27), 14068#(<= main_~i~0 28), 14069#(<= main_~i~0 29), 14070#(<= main_~i~0 30), 14071#(<= main_~i~0 31), 14072#(<= main_~i~0 32), 14073#(<= main_~i~0 33), 14074#(<= main_~i~0 34), 14075#(<= main_~i~0 35), 14076#(<= main_~i~0 36), 14077#(<= main_~i~0 37), 14078#(<= main_~i~0 38), 14079#(<= main_~i~0 39)] [2018-04-12 03:05:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:39,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-12 03:05:39,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-12 03:05:39,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 03:05:39,231 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-04-12 03:05:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:39,999 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-04-12 03:05:40,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 03:05:40,000 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-12 03:05:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:40,000 INFO L225 Difference]: With dead ends: 233 [2018-04-12 03:05:40,001 INFO L226 Difference]: Without dead ends: 233 [2018-04-12 03:05:40,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-12 03:05:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-12 03:05:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-04-12 03:05:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-12 03:05:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-04-12 03:05:40,004 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-04-12 03:05:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:40,004 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-04-12 03:05:40,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-12 03:05:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-04-12 03:05:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-12 03:05:40,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:40,005 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:40,005 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash -865231642, now seen corresponding path program 44 times [2018-04-12 03:05:40,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:40,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:40,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:40,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-12 03:05:40,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:40,667 INFO L182 omatonBuilderFactory]: Interpolants [14656#(<= main_~i~0 17), 14657#(<= main_~i~0 18), 14658#(<= main_~i~0 19), 14659#(<= main_~i~0 20), 14660#(<= main_~i~0 21), 14661#(<= main_~i~0 22), 14662#(<= main_~i~0 23), 14663#(<= main_~i~0 24), 14664#(<= main_~i~0 25), 14665#(<= main_~i~0 26), 14666#(<= main_~i~0 27), 14667#(<= main_~i~0 28), 14668#(<= main_~i~0 29), 14669#(<= main_~i~0 30), 14670#(<= main_~i~0 31), 14671#(<= main_~i~0 32), 14672#(<= main_~i~0 33), 14673#(<= main_~i~0 34), 14674#(<= main_~i~0 35), 14675#(<= main_~i~0 36), 14676#(<= main_~i~0 37), 14677#(<= main_~i~0 38), 14678#(<= main_~i~0 39), 14679#(<= main_~i~0 40), 14680#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 14681#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 14682#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 14683#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 14684#(and (<= main_~i~0 44) (<= 4 main_~i~0)), 14637#true, 14638#false, 14639#(<= main_~i~0 0), 14640#(<= main_~i~0 1), 14641#(<= main_~i~0 2), 14642#(<= main_~i~0 3), 14643#(<= main_~i~0 4), 14644#(<= main_~i~0 5), 14645#(<= main_~i~0 6), 14646#(<= main_~i~0 7), 14647#(<= main_~i~0 8), 14648#(<= main_~i~0 9), 14649#(<= main_~i~0 10), 14650#(<= main_~i~0 11), 14651#(<= main_~i~0 12), 14652#(<= main_~i~0 13), 14653#(<= main_~i~0 14), 14654#(<= main_~i~0 15), 14655#(<= main_~i~0 16)] [2018-04-12 03:05:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:40,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 03:05:40,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 03:05:40,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 03:05:40,668 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 48 states. [2018-04-12 03:05:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:41,652 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-04-12 03:05:41,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 03:05:41,652 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-04-12 03:05:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:41,653 INFO L225 Difference]: With dead ends: 238 [2018-04-12 03:05:41,653 INFO L226 Difference]: Without dead ends: 238 [2018-04-12 03:05:41,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-04-12 03:05:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-12 03:05:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-04-12 03:05:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-12 03:05:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-04-12 03:05:41,655 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-04-12 03:05:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:41,655 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-04-12 03:05:41,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 03:05:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-04-12 03:05:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-12 03:05:41,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:41,656 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:41,656 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1352733737, now seen corresponding path program 45 times [2018-04-12 03:05:41,657 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:41,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:42,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:42,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-12 03:05:42,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:42,295 INFO L182 omatonBuilderFactory]: Interpolants [15249#true, 15250#false, 15251#(<= main_~i~0 0), 15252#(<= main_~i~0 1), 15253#(<= main_~i~0 2), 15254#(<= main_~i~0 3), 15255#(<= main_~i~0 4), 15256#(<= main_~i~0 5), 15257#(<= main_~i~0 6), 15258#(<= main_~i~0 7), 15259#(<= main_~i~0 8), 15260#(<= main_~i~0 9), 15261#(<= main_~i~0 10), 15262#(<= main_~i~0 11), 15263#(<= main_~i~0 12), 15264#(<= main_~i~0 13), 15265#(<= main_~i~0 14), 15266#(<= main_~i~0 15), 15267#(<= main_~i~0 16), 15268#(<= main_~i~0 17), 15269#(<= main_~i~0 18), 15270#(<= main_~i~0 19), 15271#(<= main_~i~0 20), 15272#(<= main_~i~0 21), 15273#(<= main_~i~0 22), 15274#(<= main_~i~0 23), 15275#(<= main_~i~0 24), 15276#(<= main_~i~0 25), 15277#(<= main_~i~0 26), 15278#(<= main_~i~0 27), 15279#(<= main_~i~0 28), 15280#(<= main_~i~0 29), 15281#(<= main_~i~0 30), 15282#(<= main_~i~0 31), 15283#(<= main_~i~0 32), 15284#(<= main_~i~0 33), 15285#(<= main_~i~0 34), 15286#(<= main_~i~0 35), 15287#(<= main_~i~0 36), 15288#(<= main_~i~0 37), 15289#(<= main_~i~0 38), 15290#(<= main_~i~0 39), 15291#(<= main_~i~0 40), 15292#(<= main_~i~0 41), 15293#(<= main_~i~0 42), 15294#(<= main_~i~0 43), 15295#(<= main_~i~0 44), 15296#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15297#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-04-12 03:05:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:42,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-12 03:05:42,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-12 03:05:42,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 03:05:42,295 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-04-12 03:05:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:43,053 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-04-12 03:05:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 03:05:43,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-12 03:05:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:43,054 INFO L225 Difference]: With dead ends: 243 [2018-04-12 03:05:43,054 INFO L226 Difference]: Without dead ends: 243 [2018-04-12 03:05:43,054 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-12 03:05:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-12 03:05:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-04-12 03:05:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-12 03:05:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-04-12 03:05:43,056 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-04-12 03:05:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:43,056 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-04-12 03:05:43,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-12 03:05:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-04-12 03:05:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-12 03:05:43,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:43,057 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:43,057 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1337046138, now seen corresponding path program 46 times [2018-04-12 03:05:43,058 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:43,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:43,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:43,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-12 03:05:43,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:43,671 INFO L182 omatonBuilderFactory]: Interpolants [15874#true, 15875#false, 15876#(<= main_~i~0 0), 15877#(<= main_~i~0 1), 15878#(<= main_~i~0 2), 15879#(<= main_~i~0 3), 15880#(<= main_~i~0 4), 15881#(<= main_~i~0 5), 15882#(<= main_~i~0 6), 15883#(<= main_~i~0 7), 15884#(<= main_~i~0 8), 15885#(<= main_~i~0 9), 15886#(<= main_~i~0 10), 15887#(<= main_~i~0 11), 15888#(<= main_~i~0 12), 15889#(<= main_~i~0 13), 15890#(<= main_~i~0 14), 15891#(<= main_~i~0 15), 15892#(<= main_~i~0 16), 15893#(<= main_~i~0 17), 15894#(<= main_~i~0 18), 15895#(<= main_~i~0 19), 15896#(<= main_~i~0 20), 15897#(<= main_~i~0 21), 15898#(<= main_~i~0 22), 15899#(<= main_~i~0 23), 15900#(<= main_~i~0 24), 15901#(<= main_~i~0 25), 15902#(<= main_~i~0 26), 15903#(<= main_~i~0 27), 15904#(<= main_~i~0 28), 15905#(<= main_~i~0 29), 15906#(<= main_~i~0 30), 15907#(<= main_~i~0 31), 15908#(<= main_~i~0 32), 15909#(<= main_~i~0 33), 15910#(<= main_~i~0 34), 15911#(<= main_~i~0 35), 15912#(<= main_~i~0 36), 15913#(<= main_~i~0 37), 15914#(<= main_~i~0 38), 15915#(<= main_~i~0 39), 15916#(<= main_~i~0 40), 15917#(<= main_~i~0 41), 15918#(<= main_~i~0 42), 15919#(<= main_~i~0 43), 15920#(<= main_~i~0 44), 15921#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15922#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 15923#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-04-12 03:05:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:43,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 03:05:43,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 03:05:43,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 03:05:43,672 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-04-12 03:05:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:44,547 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-04-12 03:05:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-12 03:05:44,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-12 03:05:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:44,548 INFO L225 Difference]: With dead ends: 248 [2018-04-12 03:05:44,548 INFO L226 Difference]: Without dead ends: 248 [2018-04-12 03:05:44,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-04-12 03:05:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-12 03:05:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-04-12 03:05:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-12 03:05:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-04-12 03:05:44,551 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-04-12 03:05:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:44,551 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-04-12 03:05:44,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 03:05:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-04-12 03:05:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-12 03:05:44,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:44,553 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:44,553 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 868376887, now seen corresponding path program 47 times [2018-04-12 03:05:44,554 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:44,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:45,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:45,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 03:05:45,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:45,186 INFO L182 omatonBuilderFactory]: Interpolants [16512#true, 16513#false, 16514#(<= main_~i~0 0), 16515#(<= main_~i~0 1), 16516#(<= main_~i~0 2), 16517#(<= main_~i~0 3), 16518#(<= main_~i~0 4), 16519#(<= main_~i~0 5), 16520#(<= main_~i~0 6), 16521#(<= main_~i~0 7), 16522#(<= main_~i~0 8), 16523#(<= main_~i~0 9), 16524#(<= main_~i~0 10), 16525#(<= main_~i~0 11), 16526#(<= main_~i~0 12), 16527#(<= main_~i~0 13), 16528#(<= main_~i~0 14), 16529#(<= main_~i~0 15), 16530#(<= main_~i~0 16), 16531#(<= main_~i~0 17), 16532#(<= main_~i~0 18), 16533#(<= main_~i~0 19), 16534#(<= main_~i~0 20), 16535#(<= main_~i~0 21), 16536#(<= main_~i~0 22), 16537#(<= main_~i~0 23), 16538#(<= main_~i~0 24), 16539#(<= main_~i~0 25), 16540#(<= main_~i~0 26), 16541#(<= main_~i~0 27), 16542#(<= main_~i~0 28), 16543#(<= main_~i~0 29), 16544#(<= main_~i~0 30), 16545#(<= main_~i~0 31), 16546#(<= main_~i~0 32), 16547#(<= main_~i~0 33), 16548#(<= main_~i~0 34), 16549#(<= main_~i~0 35), 16550#(<= main_~i~0 36), 16551#(<= main_~i~0 37), 16552#(<= main_~i~0 38), 16553#(<= main_~i~0 39), 16554#(<= main_~i~0 40), 16555#(<= main_~i~0 41), 16556#(<= main_~i~0 42), 16557#(<= main_~i~0 43), 16558#(<= main_~i~0 44), 16559#(<= main_~i~0 45), 16560#(<= main_~i~0 46), 16561#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 16562#(and (<= 1 main_~i~0) (<= main_~i~0 47))] [2018-04-12 03:05:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:45,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-12 03:05:45,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-12 03:05:45,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 03:05:45,187 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 51 states. [2018-04-12 03:05:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:46,027 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-04-12 03:05:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 03:05:46,027 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-04-12 03:05:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:46,028 INFO L225 Difference]: With dead ends: 253 [2018-04-12 03:05:46,028 INFO L226 Difference]: Without dead ends: 253 [2018-04-12 03:05:46,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-04-12 03:05:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-12 03:05:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-04-12 03:05:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-12 03:05:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-04-12 03:05:46,032 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-04-12 03:05:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:46,032 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-04-12 03:05:46,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-12 03:05:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-04-12 03:05:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-12 03:05:46,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:46,033 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:46,033 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1130548698, now seen corresponding path program 48 times [2018-04-12 03:05:46,034 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:46,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:46,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:46,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-12 03:05:46,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:46,678 INFO L182 omatonBuilderFactory]: Interpolants [17163#true, 17164#false, 17165#(<= main_~i~0 0), 17166#(<= main_~i~0 1), 17167#(<= main_~i~0 2), 17168#(<= main_~i~0 3), 17169#(<= main_~i~0 4), 17170#(<= main_~i~0 5), 17171#(<= main_~i~0 6), 17172#(<= main_~i~0 7), 17173#(<= main_~i~0 8), 17174#(<= main_~i~0 9), 17175#(<= main_~i~0 10), 17176#(<= main_~i~0 11), 17177#(<= main_~i~0 12), 17178#(<= main_~i~0 13), 17179#(<= main_~i~0 14), 17180#(<= main_~i~0 15), 17181#(<= main_~i~0 16), 17182#(<= main_~i~0 17), 17183#(<= main_~i~0 18), 17184#(<= main_~i~0 19), 17185#(<= main_~i~0 20), 17186#(<= main_~i~0 21), 17187#(<= main_~i~0 22), 17188#(<= main_~i~0 23), 17189#(<= main_~i~0 24), 17190#(<= main_~i~0 25), 17191#(<= main_~i~0 26), 17192#(<= main_~i~0 27), 17193#(<= main_~i~0 28), 17194#(<= main_~i~0 29), 17195#(<= main_~i~0 30), 17196#(<= main_~i~0 31), 17197#(<= main_~i~0 32), 17198#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 17199#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 17200#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 17201#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 17202#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 17203#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 17204#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 17205#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 17206#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 17207#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 17208#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 17209#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 17210#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 17211#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 17212#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 17213#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 17214#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-04-12 03:05:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:46,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 03:05:46,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 03:05:46,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 03:05:46,679 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 52 states. [2018-04-12 03:05:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:48,558 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-04-12 03:05:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-12 03:05:48,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 247 [2018-04-12 03:05:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:48,559 INFO L225 Difference]: With dead ends: 258 [2018-04-12 03:05:48,559 INFO L226 Difference]: Without dead ends: 258 [2018-04-12 03:05:48,559 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-04-12 03:05:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-12 03:05:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-04-12 03:05:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-12 03:05:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-04-12 03:05:48,561 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-04-12 03:05:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:48,561 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-04-12 03:05:48,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 03:05:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-04-12 03:05:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-12 03:05:48,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:48,562 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:48,562 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 869965463, now seen corresponding path program 49 times [2018-04-12 03:05:48,563 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:48,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:49,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:49,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-12 03:05:49,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:49,275 INFO L182 omatonBuilderFactory]: Interpolants [17827#true, 17828#false, 17829#(<= main_~i~0 0), 17830#(<= main_~i~0 1), 17831#(<= main_~i~0 2), 17832#(<= main_~i~0 3), 17833#(<= main_~i~0 4), 17834#(<= main_~i~0 5), 17835#(<= main_~i~0 6), 17836#(<= main_~i~0 7), 17837#(<= main_~i~0 8), 17838#(<= main_~i~0 9), 17839#(<= main_~i~0 10), 17840#(<= main_~i~0 11), 17841#(<= main_~i~0 12), 17842#(<= main_~i~0 13), 17843#(<= main_~i~0 14), 17844#(<= main_~i~0 15), 17845#(<= main_~i~0 16), 17846#(<= main_~i~0 17), 17847#(<= main_~i~0 18), 17848#(<= main_~i~0 19), 17849#(<= main_~i~0 20), 17850#(<= main_~i~0 21), 17851#(<= main_~i~0 22), 17852#(<= main_~i~0 23), 17853#(<= main_~i~0 24), 17854#(<= main_~i~0 25), 17855#(<= main_~i~0 26), 17856#(<= main_~i~0 27), 17857#(<= main_~i~0 28), 17858#(<= main_~i~0 29), 17859#(<= main_~i~0 30), 17860#(<= main_~i~0 31), 17861#(<= main_~i~0 32), 17862#(<= main_~i~0 33), 17863#(<= main_~i~0 34), 17864#(<= main_~i~0 35), 17865#(<= main_~i~0 36), 17866#(<= main_~i~0 37), 17867#(<= main_~i~0 38), 17868#(<= main_~i~0 39), 17869#(<= main_~i~0 40), 17870#(<= main_~i~0 41), 17871#(<= main_~i~0 42), 17872#(<= main_~i~0 43), 17873#(<= main_~i~0 44), 17874#(<= main_~i~0 45), 17875#(<= main_~i~0 46), 17876#(<= main_~i~0 47), 17877#(<= main_~i~0 48), 17878#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 17879#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-04-12 03:05:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:49,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-12 03:05:49,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-12 03:05:49,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 03:05:49,276 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-04-12 03:05:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:50,198 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-04-12 03:05:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 03:05:50,199 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-12 03:05:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:50,199 INFO L225 Difference]: With dead ends: 263 [2018-04-12 03:05:50,199 INFO L226 Difference]: Without dead ends: 263 [2018-04-12 03:05:50,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-04-12 03:05:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-12 03:05:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-12 03:05:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-12 03:05:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-04-12 03:05:50,201 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-04-12 03:05:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:50,201 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-04-12 03:05:50,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-12 03:05:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-04-12 03:05:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-12 03:05:50,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:50,203 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:50,203 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash -957067066, now seen corresponding path program 50 times [2018-04-12 03:05:50,203 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:50,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:50,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:50,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-12 03:05:50,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:50,943 INFO L182 omatonBuilderFactory]: Interpolants [18504#true, 18505#false, 18506#(<= main_~i~0 0), 18507#(<= main_~i~0 1), 18508#(<= main_~i~0 2), 18509#(<= main_~i~0 3), 18510#(<= main_~i~0 4), 18511#(<= main_~i~0 5), 18512#(<= main_~i~0 6), 18513#(<= main_~i~0 7), 18514#(<= main_~i~0 8), 18515#(<= main_~i~0 9), 18516#(<= main_~i~0 10), 18517#(<= main_~i~0 11), 18518#(<= main_~i~0 12), 18519#(<= main_~i~0 13), 18520#(<= main_~i~0 14), 18521#(<= main_~i~0 15), 18522#(<= main_~i~0 16), 18523#(<= main_~i~0 17), 18524#(<= main_~i~0 18), 18525#(<= main_~i~0 19), 18526#(<= main_~i~0 20), 18527#(<= main_~i~0 21), 18528#(<= main_~i~0 22), 18529#(<= main_~i~0 23), 18530#(<= main_~i~0 24), 18531#(<= main_~i~0 25), 18532#(<= main_~i~0 26), 18533#(<= main_~i~0 27), 18534#(<= main_~i~0 28), 18535#(<= main_~i~0 29), 18536#(<= main_~i~0 30), 18537#(<= main_~i~0 31), 18538#(<= main_~i~0 32), 18539#(<= main_~i~0 33), 18540#(<= main_~i~0 34), 18541#(<= main_~i~0 35), 18542#(<= main_~i~0 36), 18543#(<= main_~i~0 37), 18544#(<= main_~i~0 38), 18545#(<= main_~i~0 39), 18546#(<= main_~i~0 40), 18547#(<= main_~i~0 41), 18548#(<= main_~i~0 42), 18549#(<= main_~i~0 43), 18550#(<= main_~i~0 44), 18551#(<= main_~i~0 45), 18552#(<= main_~i~0 46), 18553#(<= main_~i~0 47), 18554#(<= main_~i~0 48), 18555#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 18556#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 18557#(and (<= 2 main_~i~0) (<= main_~i~0 50))] [2018-04-12 03:05:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:50,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 03:05:50,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 03:05:50,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 03:05:50,944 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 54 states. [2018-04-12 03:05:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:51,902 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-04-12 03:05:51,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-12 03:05:51,902 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 257 [2018-04-12 03:05:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:51,903 INFO L225 Difference]: With dead ends: 268 [2018-04-12 03:05:51,903 INFO L226 Difference]: Without dead ends: 268 [2018-04-12 03:05:51,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-04-12 03:05:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-12 03:05:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-12 03:05:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-12 03:05:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-04-12 03:05:51,906 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-04-12 03:05:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:51,906 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-04-12 03:05:51,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 03:05:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-04-12 03:05:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-12 03:05:51,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:51,907 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:51,907 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1246602231, now seen corresponding path program 51 times [2018-04-12 03:05:51,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:51,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:52,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:52,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-12 03:05:52,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:52,653 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= main_~i~0 4), 19201#(<= main_~i~0 5), 19202#(<= main_~i~0 6), 19203#(<= main_~i~0 7), 19204#(<= main_~i~0 8), 19205#(<= main_~i~0 9), 19206#(<= main_~i~0 10), 19207#(<= main_~i~0 11), 19208#(<= main_~i~0 12), 19209#(<= main_~i~0 13), 19210#(<= main_~i~0 14), 19211#(<= main_~i~0 15), 19212#(<= main_~i~0 16), 19213#(<= main_~i~0 17), 19214#(<= main_~i~0 18), 19215#(<= main_~i~0 19), 19216#(<= main_~i~0 20), 19217#(<= main_~i~0 21), 19218#(<= main_~i~0 22), 19219#(<= main_~i~0 23), 19220#(<= main_~i~0 24), 19221#(<= main_~i~0 25), 19222#(<= main_~i~0 26), 19223#(<= main_~i~0 27), 19224#(<= main_~i~0 28), 19225#(<= main_~i~0 29), 19226#(<= main_~i~0 30), 19227#(<= main_~i~0 31), 19228#(<= main_~i~0 32), 19229#(<= main_~i~0 33), 19230#(<= main_~i~0 34), 19231#(<= main_~i~0 35), 19232#(<= main_~i~0 36), 19233#(<= main_~i~0 37), 19234#(<= main_~i~0 38), 19235#(<= main_~i~0 39), 19236#(<= main_~i~0 40), 19237#(<= main_~i~0 41), 19238#(<= main_~i~0 42), 19239#(<= main_~i~0 43), 19240#(<= main_~i~0 44), 19241#(<= main_~i~0 45), 19242#(<= main_~i~0 46), 19243#(<= main_~i~0 47), 19244#(<= main_~i~0 48), 19245#(<= main_~i~0 49), 19246#(<= main_~i~0 50), 19247#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 19248#(and (<= 1 main_~i~0) (<= main_~i~0 51)), 19194#true, 19195#false, 19196#(<= main_~i~0 0), 19197#(<= main_~i~0 1), 19198#(<= main_~i~0 2), 19199#(<= main_~i~0 3)] [2018-04-12 03:05:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:52,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 03:05:52,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 03:05:52,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 03:05:52,654 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-04-12 03:05:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:53,593 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-04-12 03:05:53,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-12 03:05:53,593 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-12 03:05:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:53,594 INFO L225 Difference]: With dead ends: 273 [2018-04-12 03:05:53,594 INFO L226 Difference]: Without dead ends: 273 [2018-04-12 03:05:53,594 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 03:05:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-12 03:05:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-04-12 03:05:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-12 03:05:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-04-12 03:05:53,596 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-04-12 03:05:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:53,597 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-04-12 03:05:53,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 03:05:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-04-12 03:05:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-12 03:05:53,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:53,597 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:53,598 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash -328358042, now seen corresponding path program 52 times [2018-04-12 03:05:53,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:53,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:54,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:54,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-12 03:05:54,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:54,485 INFO L182 omatonBuilderFactory]: Interpolants [19897#true, 19898#false, 19899#(<= main_~i~0 0), 19900#(<= main_~i~0 1), 19901#(<= main_~i~0 2), 19902#(<= main_~i~0 3), 19903#(<= main_~i~0 4), 19904#(<= main_~i~0 5), 19905#(<= main_~i~0 6), 19906#(<= main_~i~0 7), 19907#(<= main_~i~0 8), 19908#(<= main_~i~0 9), 19909#(<= main_~i~0 10), 19910#(<= main_~i~0 11), 19911#(<= main_~i~0 12), 19912#(<= main_~i~0 13), 19913#(<= main_~i~0 14), 19914#(<= main_~i~0 15), 19915#(<= main_~i~0 16), 19916#(<= main_~i~0 17), 19917#(<= main_~i~0 18), 19918#(<= main_~i~0 19), 19919#(<= main_~i~0 20), 19920#(<= main_~i~0 21), 19921#(<= main_~i~0 22), 19922#(<= main_~i~0 23), 19923#(<= main_~i~0 24), 19924#(<= main_~i~0 25), 19925#(<= main_~i~0 26), 19926#(<= main_~i~0 27), 19927#(<= main_~i~0 28), 19928#(<= main_~i~0 29), 19929#(<= main_~i~0 30), 19930#(<= main_~i~0 31), 19931#(<= main_~i~0 32), 19932#(<= main_~i~0 33), 19933#(<= main_~i~0 34), 19934#(<= main_~i~0 35), 19935#(<= main_~i~0 36), 19936#(<= main_~i~0 37), 19937#(<= main_~i~0 38), 19938#(<= main_~i~0 39), 19939#(<= main_~i~0 40), 19940#(<= main_~i~0 41), 19941#(<= main_~i~0 42), 19942#(<= main_~i~0 43), 19943#(<= main_~i~0 44), 19944#(<= main_~i~0 45), 19945#(<= main_~i~0 46), 19946#(<= main_~i~0 47), 19947#(<= main_~i~0 48), 19948#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 19949#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 19950#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 19951#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 19952#(and (<= 4 main_~i~0) (<= main_~i~0 52))] [2018-04-12 03:05:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:54,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-12 03:05:54,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-12 03:05:54,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 03:05:54,486 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 56 states. [2018-04-12 03:05:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:55,731 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-04-12 03:05:55,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-12 03:05:55,731 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 267 [2018-04-12 03:05:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:55,732 INFO L225 Difference]: With dead ends: 278 [2018-04-12 03:05:55,732 INFO L226 Difference]: Without dead ends: 278 [2018-04-12 03:05:55,732 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-04-12 03:05:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-12 03:05:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-04-12 03:05:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-12 03:05:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-04-12 03:05:55,734 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-04-12 03:05:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:55,734 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-04-12 03:05:55,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-12 03:05:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-04-12 03:05:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-12 03:05:55,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:55,735 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:55,735 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2051109207, now seen corresponding path program 53 times [2018-04-12 03:05:55,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:55,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:56,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:56,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-12 03:05:56,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:56,574 INFO L182 omatonBuilderFactory]: Interpolants [20613#true, 20614#false, 20615#(<= main_~i~0 0), 20616#(<= main_~i~0 1), 20617#(<= main_~i~0 2), 20618#(<= main_~i~0 3), 20619#(<= main_~i~0 4), 20620#(<= main_~i~0 5), 20621#(<= main_~i~0 6), 20622#(<= main_~i~0 7), 20623#(<= main_~i~0 8), 20624#(<= main_~i~0 9), 20625#(<= main_~i~0 10), 20626#(<= main_~i~0 11), 20627#(<= main_~i~0 12), 20628#(<= main_~i~0 13), 20629#(<= main_~i~0 14), 20630#(<= main_~i~0 15), 20631#(<= main_~i~0 16), 20632#(<= main_~i~0 17), 20633#(<= main_~i~0 18), 20634#(<= main_~i~0 19), 20635#(<= main_~i~0 20), 20636#(<= main_~i~0 21), 20637#(<= main_~i~0 22), 20638#(<= main_~i~0 23), 20639#(<= main_~i~0 24), 20640#(<= main_~i~0 25), 20641#(<= main_~i~0 26), 20642#(<= main_~i~0 27), 20643#(<= main_~i~0 28), 20644#(<= main_~i~0 29), 20645#(<= main_~i~0 30), 20646#(<= main_~i~0 31), 20647#(<= main_~i~0 32), 20648#(<= main_~i~0 33), 20649#(<= main_~i~0 34), 20650#(<= main_~i~0 35), 20651#(<= main_~i~0 36), 20652#(<= main_~i~0 37), 20653#(<= main_~i~0 38), 20654#(<= main_~i~0 39), 20655#(<= main_~i~0 40), 20656#(<= main_~i~0 41), 20657#(<= main_~i~0 42), 20658#(<= main_~i~0 43), 20659#(<= main_~i~0 44), 20660#(<= main_~i~0 45), 20661#(<= main_~i~0 46), 20662#(<= main_~i~0 47), 20663#(<= main_~i~0 48), 20664#(<= main_~i~0 49), 20665#(<= main_~i~0 50), 20666#(<= main_~i~0 51), 20667#(<= main_~i~0 52), 20668#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 20669#(and (<= 1 main_~i~0) (<= main_~i~0 53))] [2018-04-12 03:05:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:56,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-12 03:05:56,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-12 03:05:56,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 03:05:56,575 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 57 states. [2018-04-12 03:05:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:57,589 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-04-12 03:05:57,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 03:05:57,589 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-04-12 03:05:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:57,590 INFO L225 Difference]: With dead ends: 283 [2018-04-12 03:05:57,590 INFO L226 Difference]: Without dead ends: 283 [2018-04-12 03:05:57,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4458, Invalid=7532, Unknown=0, NotChecked=0, Total=11990 [2018-04-12 03:05:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-12 03:05:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-04-12 03:05:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-12 03:05:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-04-12 03:05:57,592 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-04-12 03:05:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:57,593 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-04-12 03:05:57,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-12 03:05:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-04-12 03:05:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-12 03:05:57,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:57,593 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:57,593 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash 832779782, now seen corresponding path program 54 times [2018-04-12 03:05:57,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:57,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:58,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:58,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-12 03:05:58,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:58,477 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= main_~i~0 32), 21377#(<= main_~i~0 33), 21378#(<= main_~i~0 34), 21379#(<= main_~i~0 35), 21380#(<= main_~i~0 36), 21381#(<= main_~i~0 37), 21382#(<= main_~i~0 38), 21383#(<= main_~i~0 39), 21384#(<= main_~i~0 40), 21385#(<= main_~i~0 41), 21386#(<= main_~i~0 42), 21387#(<= main_~i~0 43), 21388#(<= main_~i~0 44), 21389#(<= main_~i~0 45), 21390#(<= main_~i~0 46), 21391#(<= main_~i~0 47), 21392#(<= main_~i~0 48), 21393#(<= main_~i~0 49), 21394#(<= main_~i~0 50), 21395#(<= main_~i~0 51), 21396#(<= main_~i~0 52), 21397#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 21398#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 21399#(and (<= 2 main_~i~0) (<= main_~i~0 54)), 21342#true, 21343#false, 21344#(<= main_~i~0 0), 21345#(<= main_~i~0 1), 21346#(<= main_~i~0 2), 21347#(<= main_~i~0 3), 21348#(<= main_~i~0 4), 21349#(<= main_~i~0 5), 21350#(<= main_~i~0 6), 21351#(<= main_~i~0 7), 21352#(<= main_~i~0 8), 21353#(<= main_~i~0 9), 21354#(<= main_~i~0 10), 21355#(<= main_~i~0 11), 21356#(<= main_~i~0 12), 21357#(<= main_~i~0 13), 21358#(<= main_~i~0 14), 21359#(<= main_~i~0 15), 21360#(<= main_~i~0 16), 21361#(<= main_~i~0 17), 21362#(<= main_~i~0 18), 21363#(<= main_~i~0 19), 21364#(<= main_~i~0 20), 21365#(<= main_~i~0 21), 21366#(<= main_~i~0 22), 21367#(<= main_~i~0 23), 21368#(<= main_~i~0 24), 21369#(<= main_~i~0 25), 21370#(<= main_~i~0 26), 21371#(<= main_~i~0 27), 21372#(<= main_~i~0 28), 21373#(<= main_~i~0 29), 21374#(<= main_~i~0 30), 21375#(<= main_~i~0 31)] [2018-04-12 03:05:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:58,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-12 03:05:58,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-12 03:05:58,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 03:05:58,478 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 58 states. [2018-04-12 03:05:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:59,576 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-04-12 03:05:59,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-12 03:05:59,576 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 277 [2018-04-12 03:05:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:59,577 INFO L225 Difference]: With dead ends: 288 [2018-04-12 03:05:59,577 INFO L226 Difference]: Without dead ends: 288 [2018-04-12 03:05:59,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-04-12 03:05:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-12 03:05:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-04-12 03:05:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-12 03:05:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-04-12 03:05:59,579 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-04-12 03:05:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:59,580 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-04-12 03:05:59,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-12 03:05:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-04-12 03:05:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-12 03:05:59,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:59,581 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:59,581 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1889794377, now seen corresponding path program 55 times [2018-04-12 03:05:59,581 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:59,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:00,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:00,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-12 03:06:00,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:00,436 INFO L182 omatonBuilderFactory]: Interpolants [22084#true, 22085#false, 22086#(<= main_~i~0 0), 22087#(<= main_~i~0 1), 22088#(<= main_~i~0 2), 22089#(<= main_~i~0 3), 22090#(<= main_~i~0 4), 22091#(<= main_~i~0 5), 22092#(<= main_~i~0 6), 22093#(<= main_~i~0 7), 22094#(<= main_~i~0 8), 22095#(<= main_~i~0 9), 22096#(<= main_~i~0 10), 22097#(<= main_~i~0 11), 22098#(<= main_~i~0 12), 22099#(<= main_~i~0 13), 22100#(<= main_~i~0 14), 22101#(<= main_~i~0 15), 22102#(<= main_~i~0 16), 22103#(<= main_~i~0 17), 22104#(<= main_~i~0 18), 22105#(<= main_~i~0 19), 22106#(<= main_~i~0 20), 22107#(<= main_~i~0 21), 22108#(<= main_~i~0 22), 22109#(<= main_~i~0 23), 22110#(<= main_~i~0 24), 22111#(<= main_~i~0 25), 22112#(<= main_~i~0 26), 22113#(<= main_~i~0 27), 22114#(<= main_~i~0 28), 22115#(<= main_~i~0 29), 22116#(<= main_~i~0 30), 22117#(<= main_~i~0 31), 22118#(<= main_~i~0 32), 22119#(<= main_~i~0 33), 22120#(<= main_~i~0 34), 22121#(<= main_~i~0 35), 22122#(<= main_~i~0 36), 22123#(<= main_~i~0 37), 22124#(<= main_~i~0 38), 22125#(<= main_~i~0 39), 22126#(<= main_~i~0 40), 22127#(<= main_~i~0 41), 22128#(<= main_~i~0 42), 22129#(<= main_~i~0 43), 22130#(<= main_~i~0 44), 22131#(<= main_~i~0 45), 22132#(<= main_~i~0 46), 22133#(<= main_~i~0 47), 22134#(<= main_~i~0 48), 22135#(<= main_~i~0 49), 22136#(<= main_~i~0 50), 22137#(<= main_~i~0 51), 22138#(<= main_~i~0 52), 22139#(<= main_~i~0 53), 22140#(<= main_~i~0 54), 22141#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 22142#(and (<= main_~i~0 55) (<= 1 main_~i~0))] [2018-04-12 03:06:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:00,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-12 03:06:00,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-12 03:06:00,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 03:06:00,437 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-04-12 03:06:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:01,539 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-04-12 03:06:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-12 03:06:01,539 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-12 03:06:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:01,539 INFO L225 Difference]: With dead ends: 293 [2018-04-12 03:06:01,540 INFO L226 Difference]: Without dead ends: 293 [2018-04-12 03:06:01,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-12 03:06:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-12 03:06:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-04-12 03:06:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-12 03:06:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-04-12 03:06:01,542 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-04-12 03:06:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:01,542 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-04-12 03:06:01,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-12 03:06:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-04-12 03:06:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-12 03:06:01,542 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:01,543 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:01,543 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:01,543 INFO L82 PathProgramCache]: Analyzing trace with hash 581893286, now seen corresponding path program 56 times [2018-04-12 03:06:01,543 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:01,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:02,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:02,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-12 03:06:02,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:02,624 INFO L182 omatonBuilderFactory]: Interpolants [22839#true, 22840#false, 22841#(<= main_~i~0 0), 22842#(<= main_~i~0 1), 22843#(<= main_~i~0 2), 22844#(<= main_~i~0 3), 22845#(<= main_~i~0 4), 22846#(<= main_~i~0 5), 22847#(<= main_~i~0 6), 22848#(<= main_~i~0 7), 22849#(<= main_~i~0 8), 22850#(<= main_~i~0 9), 22851#(<= main_~i~0 10), 22852#(<= main_~i~0 11), 22853#(<= main_~i~0 12), 22854#(<= main_~i~0 13), 22855#(<= main_~i~0 14), 22856#(<= main_~i~0 15), 22857#(<= main_~i~0 16), 22858#(<= main_~i~0 17), 22859#(<= main_~i~0 18), 22860#(<= main_~i~0 19), 22861#(<= main_~i~0 20), 22862#(<= main_~i~0 21), 22863#(<= main_~i~0 22), 22864#(<= main_~i~0 23), 22865#(<= main_~i~0 24), 22866#(<= main_~i~0 25), 22867#(<= main_~i~0 26), 22868#(<= main_~i~0 27), 22869#(<= main_~i~0 28), 22870#(<= main_~i~0 29), 22871#(<= main_~i~0 30), 22872#(<= main_~i~0 31), 22873#(<= main_~i~0 32), 22874#(<= main_~i~0 33), 22875#(<= main_~i~0 34), 22876#(<= main_~i~0 35), 22877#(<= main_~i~0 36), 22878#(<= main_~i~0 37), 22879#(<= main_~i~0 38), 22880#(<= main_~i~0 39), 22881#(<= main_~i~0 40), 22882#(<= main_~i~0 41), 22883#(<= main_~i~0 42), 22884#(<= main_~i~0 43), 22885#(<= main_~i~0 44), 22886#(<= main_~i~0 45), 22887#(<= main_~i~0 46), 22888#(<= main_~i~0 47), 22889#(<= main_~i~0 48), 22890#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 22891#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 22892#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 22893#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 22894#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 22895#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 22896#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 22897#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 22898#(and (<= main_~i~0 56) (<= 8 main_~i~0))] [2018-04-12 03:06:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:02,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-12 03:06:02,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-12 03:06:02,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 03:06:02,625 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-04-12 03:06:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:04,290 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-04-12 03:06:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-12 03:06:04,290 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-12 03:06:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:04,291 INFO L225 Difference]: With dead ends: 298 [2018-04-12 03:06:04,291 INFO L226 Difference]: Without dead ends: 298 [2018-04-12 03:06:04,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-12 03:06:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-12 03:06:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-04-12 03:06:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-12 03:06:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-04-12 03:06:04,293 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-04-12 03:06:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:04,293 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-04-12 03:06:04,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-12 03:06:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-04-12 03:06:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-12 03:06:04,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:04,294 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:04,294 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2109957143, now seen corresponding path program 57 times [2018-04-12 03:06:04,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:04,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:05,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:05,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-12 03:06:05,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:05,258 INFO L182 omatonBuilderFactory]: Interpolants [23607#true, 23608#false, 23609#(<= main_~i~0 0), 23610#(<= main_~i~0 1), 23611#(<= main_~i~0 2), 23612#(<= main_~i~0 3), 23613#(<= main_~i~0 4), 23614#(<= main_~i~0 5), 23615#(<= main_~i~0 6), 23616#(<= main_~i~0 7), 23617#(<= main_~i~0 8), 23618#(<= main_~i~0 9), 23619#(<= main_~i~0 10), 23620#(<= main_~i~0 11), 23621#(<= main_~i~0 12), 23622#(<= main_~i~0 13), 23623#(<= main_~i~0 14), 23624#(<= main_~i~0 15), 23625#(<= main_~i~0 16), 23626#(<= main_~i~0 17), 23627#(<= main_~i~0 18), 23628#(<= main_~i~0 19), 23629#(<= main_~i~0 20), 23630#(<= main_~i~0 21), 23631#(<= main_~i~0 22), 23632#(<= main_~i~0 23), 23633#(<= main_~i~0 24), 23634#(<= main_~i~0 25), 23635#(<= main_~i~0 26), 23636#(<= main_~i~0 27), 23637#(<= main_~i~0 28), 23638#(<= main_~i~0 29), 23639#(<= main_~i~0 30), 23640#(<= main_~i~0 31), 23641#(<= main_~i~0 32), 23642#(<= main_~i~0 33), 23643#(<= main_~i~0 34), 23644#(<= main_~i~0 35), 23645#(<= main_~i~0 36), 23646#(<= main_~i~0 37), 23647#(<= main_~i~0 38), 23648#(<= main_~i~0 39), 23649#(<= main_~i~0 40), 23650#(<= main_~i~0 41), 23651#(<= main_~i~0 42), 23652#(<= main_~i~0 43), 23653#(<= main_~i~0 44), 23654#(<= main_~i~0 45), 23655#(<= main_~i~0 46), 23656#(<= main_~i~0 47), 23657#(<= main_~i~0 48), 23658#(<= main_~i~0 49), 23659#(<= main_~i~0 50), 23660#(<= main_~i~0 51), 23661#(<= main_~i~0 52), 23662#(<= main_~i~0 53), 23663#(<= main_~i~0 54), 23664#(<= main_~i~0 55), 23665#(<= main_~i~0 56), 23666#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 23667#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-04-12 03:06:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:05,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-12 03:06:05,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-12 03:06:05,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-04-12 03:06:05,259 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 61 states. [2018-04-12 03:06:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:06,411 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-04-12 03:06:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-12 03:06:06,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-04-12 03:06:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:06,412 INFO L225 Difference]: With dead ends: 303 [2018-04-12 03:06:06,412 INFO L226 Difference]: Without dead ends: 303 [2018-04-12 03:06:06,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5136, Invalid=8670, Unknown=0, NotChecked=0, Total=13806 [2018-04-12 03:06:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-12 03:06:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-04-12 03:06:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-12 03:06:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-04-12 03:06:06,414 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-04-12 03:06:06,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:06,414 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-04-12 03:06:06,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-12 03:06:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-04-12 03:06:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-12 03:06:06,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:06,415 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:06,415 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1932196678, now seen corresponding path program 58 times [2018-04-12 03:06:06,416 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:06,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:07,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:07,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-12 03:06:07,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:07,365 INFO L182 omatonBuilderFactory]: Interpolants [24448#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 24449#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 24388#true, 24389#false, 24390#(<= main_~i~0 0), 24391#(<= main_~i~0 1), 24392#(<= main_~i~0 2), 24393#(<= main_~i~0 3), 24394#(<= main_~i~0 4), 24395#(<= main_~i~0 5), 24396#(<= main_~i~0 6), 24397#(<= main_~i~0 7), 24398#(<= main_~i~0 8), 24399#(<= main_~i~0 9), 24400#(<= main_~i~0 10), 24401#(<= main_~i~0 11), 24402#(<= main_~i~0 12), 24403#(<= main_~i~0 13), 24404#(<= main_~i~0 14), 24405#(<= main_~i~0 15), 24406#(<= main_~i~0 16), 24407#(<= main_~i~0 17), 24408#(<= main_~i~0 18), 24409#(<= main_~i~0 19), 24410#(<= main_~i~0 20), 24411#(<= main_~i~0 21), 24412#(<= main_~i~0 22), 24413#(<= main_~i~0 23), 24414#(<= main_~i~0 24), 24415#(<= main_~i~0 25), 24416#(<= main_~i~0 26), 24417#(<= main_~i~0 27), 24418#(<= main_~i~0 28), 24419#(<= main_~i~0 29), 24420#(<= main_~i~0 30), 24421#(<= main_~i~0 31), 24422#(<= main_~i~0 32), 24423#(<= main_~i~0 33), 24424#(<= main_~i~0 34), 24425#(<= main_~i~0 35), 24426#(<= main_~i~0 36), 24427#(<= main_~i~0 37), 24428#(<= main_~i~0 38), 24429#(<= main_~i~0 39), 24430#(<= main_~i~0 40), 24431#(<= main_~i~0 41), 24432#(<= main_~i~0 42), 24433#(<= main_~i~0 43), 24434#(<= main_~i~0 44), 24435#(<= main_~i~0 45), 24436#(<= main_~i~0 46), 24437#(<= main_~i~0 47), 24438#(<= main_~i~0 48), 24439#(<= main_~i~0 49), 24440#(<= main_~i~0 50), 24441#(<= main_~i~0 51), 24442#(<= main_~i~0 52), 24443#(<= main_~i~0 53), 24444#(<= main_~i~0 54), 24445#(<= main_~i~0 55), 24446#(<= main_~i~0 56), 24447#(and (<= 0 main_~i~0) (<= main_~i~0 56))] [2018-04-12 03:06:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:07,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-12 03:06:07,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-12 03:06:07,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 03:06:07,366 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 62 states. [2018-04-12 03:06:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:08,636 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-04-12 03:06:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-12 03:06:08,636 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 297 [2018-04-12 03:06:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:08,637 INFO L225 Difference]: With dead ends: 308 [2018-04-12 03:06:08,637 INFO L226 Difference]: Without dead ends: 308 [2018-04-12 03:06:08,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5197, Invalid=9083, Unknown=0, NotChecked=0, Total=14280 [2018-04-12 03:06:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-12 03:06:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-04-12 03:06:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-04-12 03:06:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-04-12 03:06:08,640 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 297 [2018-04-12 03:06:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:08,640 INFO L459 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-04-12 03:06:08,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-12 03:06:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-04-12 03:06:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-12 03:06:08,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:08,641 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:08,641 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:08,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1038251657, now seen corresponding path program 59 times [2018-04-12 03:06:08,641 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:08,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:09,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:09,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-12 03:06:09,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:09,627 INFO L182 omatonBuilderFactory]: Interpolants [25216#(<= main_~i~0 32), 25217#(<= main_~i~0 33), 25218#(<= main_~i~0 34), 25219#(<= main_~i~0 35), 25220#(<= main_~i~0 36), 25221#(<= main_~i~0 37), 25222#(<= main_~i~0 38), 25223#(<= main_~i~0 39), 25224#(<= main_~i~0 40), 25225#(<= main_~i~0 41), 25226#(<= main_~i~0 42), 25227#(<= main_~i~0 43), 25228#(<= main_~i~0 44), 25229#(<= main_~i~0 45), 25230#(<= main_~i~0 46), 25231#(<= main_~i~0 47), 25232#(<= main_~i~0 48), 25233#(<= main_~i~0 49), 25234#(<= main_~i~0 50), 25235#(<= main_~i~0 51), 25236#(<= main_~i~0 52), 25237#(<= main_~i~0 53), 25238#(<= main_~i~0 54), 25239#(<= main_~i~0 55), 25240#(<= main_~i~0 56), 25241#(<= main_~i~0 57), 25242#(<= main_~i~0 58), 25243#(and (<= 0 main_~i~0) (<= main_~i~0 58)), 25244#(and (<= main_~i~0 59) (<= 1 main_~i~0)), 25182#true, 25183#false, 25184#(<= main_~i~0 0), 25185#(<= main_~i~0 1), 25186#(<= main_~i~0 2), 25187#(<= main_~i~0 3), 25188#(<= main_~i~0 4), 25189#(<= main_~i~0 5), 25190#(<= main_~i~0 6), 25191#(<= main_~i~0 7), 25192#(<= main_~i~0 8), 25193#(<= main_~i~0 9), 25194#(<= main_~i~0 10), 25195#(<= main_~i~0 11), 25196#(<= main_~i~0 12), 25197#(<= main_~i~0 13), 25198#(<= main_~i~0 14), 25199#(<= main_~i~0 15), 25200#(<= main_~i~0 16), 25201#(<= main_~i~0 17), 25202#(<= main_~i~0 18), 25203#(<= main_~i~0 19), 25204#(<= main_~i~0 20), 25205#(<= main_~i~0 21), 25206#(<= main_~i~0 22), 25207#(<= main_~i~0 23), 25208#(<= main_~i~0 24), 25209#(<= main_~i~0 25), 25210#(<= main_~i~0 26), 25211#(<= main_~i~0 27), 25212#(<= main_~i~0 28), 25213#(<= main_~i~0 29), 25214#(<= main_~i~0 30), 25215#(<= main_~i~0 31)] [2018-04-12 03:06:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:09,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-12 03:06:09,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-12 03:06:09,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-04-12 03:06:09,628 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 63 states. [2018-04-12 03:06:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:10,823 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-04-12 03:06:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-12 03:06:10,823 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 302 [2018-04-12 03:06:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:10,824 INFO L225 Difference]: With dead ends: 313 [2018-04-12 03:06:10,824 INFO L226 Difference]: Without dead ends: 313 [2018-04-12 03:06:10,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5493, Invalid=9269, Unknown=0, NotChecked=0, Total=14762 [2018-04-12 03:06:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-12 03:06:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-04-12 03:06:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-12 03:06:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-04-12 03:06:10,826 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-04-12 03:06:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:10,826 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-04-12 03:06:10,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-12 03:06:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-04-12 03:06:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-12 03:06:10,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:10,827 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:10,827 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1640943130, now seen corresponding path program 60 times [2018-04-12 03:06:10,827 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:10,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:11,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:11,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-12 03:06:11,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:11,857 INFO L182 omatonBuilderFactory]: Interpolants [25989#true, 25990#false, 25991#(<= main_~i~0 0), 25992#(<= main_~i~0 1), 25993#(<= main_~i~0 2), 25994#(<= main_~i~0 3), 25995#(<= main_~i~0 4), 25996#(<= main_~i~0 5), 25997#(<= main_~i~0 6), 25998#(<= main_~i~0 7), 25999#(<= main_~i~0 8), 26000#(<= main_~i~0 9), 26001#(<= main_~i~0 10), 26002#(<= main_~i~0 11), 26003#(<= main_~i~0 12), 26004#(<= main_~i~0 13), 26005#(<= main_~i~0 14), 26006#(<= main_~i~0 15), 26007#(<= main_~i~0 16), 26008#(<= main_~i~0 17), 26009#(<= main_~i~0 18), 26010#(<= main_~i~0 19), 26011#(<= main_~i~0 20), 26012#(<= main_~i~0 21), 26013#(<= main_~i~0 22), 26014#(<= main_~i~0 23), 26015#(<= main_~i~0 24), 26016#(<= main_~i~0 25), 26017#(<= main_~i~0 26), 26018#(<= main_~i~0 27), 26019#(<= main_~i~0 28), 26020#(<= main_~i~0 29), 26021#(<= main_~i~0 30), 26022#(<= main_~i~0 31), 26023#(<= main_~i~0 32), 26024#(<= main_~i~0 33), 26025#(<= main_~i~0 34), 26026#(<= main_~i~0 35), 26027#(<= main_~i~0 36), 26028#(<= main_~i~0 37), 26029#(<= main_~i~0 38), 26030#(<= main_~i~0 39), 26031#(<= main_~i~0 40), 26032#(<= main_~i~0 41), 26033#(<= main_~i~0 42), 26034#(<= main_~i~0 43), 26035#(<= main_~i~0 44), 26036#(<= main_~i~0 45), 26037#(<= main_~i~0 46), 26038#(<= main_~i~0 47), 26039#(<= main_~i~0 48), 26040#(<= main_~i~0 49), 26041#(<= main_~i~0 50), 26042#(<= main_~i~0 51), 26043#(<= main_~i~0 52), 26044#(<= main_~i~0 53), 26045#(<= main_~i~0 54), 26046#(<= main_~i~0 55), 26047#(<= main_~i~0 56), 26048#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 26049#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 26050#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 26051#(and (<= main_~i~0 59) (<= 3 main_~i~0)), 26052#(and (<= main_~i~0 60) (<= 4 main_~i~0))] [2018-04-12 03:06:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:11,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-12 03:06:11,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-12 03:06:11,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=2310, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 03:06:11,858 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 64 states. [2018-04-12 03:06:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:13,379 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-04-12 03:06:13,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-12 03:06:13,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 307 [2018-04-12 03:06:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:13,380 INFO L225 Difference]: With dead ends: 318 [2018-04-12 03:06:13,380 INFO L226 Difference]: Without dead ends: 318 [2018-04-12 03:06:13,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5319, Invalid=9933, Unknown=0, NotChecked=0, Total=15252 [2018-04-12 03:06:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-12 03:06:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-04-12 03:06:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-12 03:06:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-04-12 03:06:13,384 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 307 [2018-04-12 03:06:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:13,384 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-04-12 03:06:13,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-12 03:06:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-04-12 03:06:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-12 03:06:13,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:13,385 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:13,385 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1047497001, now seen corresponding path program 61 times [2018-04-12 03:06:13,385 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:13,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:14,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:14,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-12 03:06:14,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:14,455 INFO L182 omatonBuilderFactory]: Interpolants [26809#true, 26810#false, 26811#(<= main_~i~0 0), 26812#(<= main_~i~0 1), 26813#(<= main_~i~0 2), 26814#(<= main_~i~0 3), 26815#(<= main_~i~0 4), 26816#(<= main_~i~0 5), 26817#(<= main_~i~0 6), 26818#(<= main_~i~0 7), 26819#(<= main_~i~0 8), 26820#(<= main_~i~0 9), 26821#(<= main_~i~0 10), 26822#(<= main_~i~0 11), 26823#(<= main_~i~0 12), 26824#(<= main_~i~0 13), 26825#(<= main_~i~0 14), 26826#(<= main_~i~0 15), 26827#(<= main_~i~0 16), 26828#(<= main_~i~0 17), 26829#(<= main_~i~0 18), 26830#(<= main_~i~0 19), 26831#(<= main_~i~0 20), 26832#(<= main_~i~0 21), 26833#(<= main_~i~0 22), 26834#(<= main_~i~0 23), 26835#(<= main_~i~0 24), 26836#(<= main_~i~0 25), 26837#(<= main_~i~0 26), 26838#(<= main_~i~0 27), 26839#(<= main_~i~0 28), 26840#(<= main_~i~0 29), 26841#(<= main_~i~0 30), 26842#(<= main_~i~0 31), 26843#(<= main_~i~0 32), 26844#(<= main_~i~0 33), 26845#(<= main_~i~0 34), 26846#(<= main_~i~0 35), 26847#(<= main_~i~0 36), 26848#(<= main_~i~0 37), 26849#(<= main_~i~0 38), 26850#(<= main_~i~0 39), 26851#(<= main_~i~0 40), 26852#(<= main_~i~0 41), 26853#(<= main_~i~0 42), 26854#(<= main_~i~0 43), 26855#(<= main_~i~0 44), 26856#(<= main_~i~0 45), 26857#(<= main_~i~0 46), 26858#(<= main_~i~0 47), 26859#(<= main_~i~0 48), 26860#(<= main_~i~0 49), 26861#(<= main_~i~0 50), 26862#(<= main_~i~0 51), 26863#(<= main_~i~0 52), 26864#(<= main_~i~0 53), 26865#(<= main_~i~0 54), 26866#(<= main_~i~0 55), 26867#(<= main_~i~0 56), 26868#(<= main_~i~0 57), 26869#(<= main_~i~0 58), 26870#(<= main_~i~0 59), 26871#(<= main_~i~0 60), 26872#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 26873#(and (<= main_~i~0 61) (<= 1 main_~i~0))] [2018-04-12 03:06:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:14,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-12 03:06:14,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-12 03:06:14,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 03:06:14,456 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 65 states. [2018-04-12 03:06:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:15,739 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-04-12 03:06:15,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-12 03:06:15,740 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-12 03:06:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:15,740 INFO L225 Difference]: With dead ends: 323 [2018-04-12 03:06:15,741 INFO L226 Difference]: Without dead ends: 323 [2018-04-12 03:06:15,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-12 03:06:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-12 03:06:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-04-12 03:06:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-12 03:06:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-04-12 03:06:15,743 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-04-12 03:06:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:15,743 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-04-12 03:06:15,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-12 03:06:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-04-12 03:06:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-12 03:06:15,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:15,744 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:15,744 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:15,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2040815482, now seen corresponding path program 62 times [2018-04-12 03:06:15,745 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:15,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:16,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:16,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-12 03:06:16,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:16,861 INFO L182 omatonBuilderFactory]: Interpolants [27648#(<= main_~i~0 4), 27649#(<= main_~i~0 5), 27650#(<= main_~i~0 6), 27651#(<= main_~i~0 7), 27652#(<= main_~i~0 8), 27653#(<= main_~i~0 9), 27654#(<= main_~i~0 10), 27655#(<= main_~i~0 11), 27656#(<= main_~i~0 12), 27657#(<= main_~i~0 13), 27658#(<= main_~i~0 14), 27659#(<= main_~i~0 15), 27660#(<= main_~i~0 16), 27661#(<= main_~i~0 17), 27662#(<= main_~i~0 18), 27663#(<= main_~i~0 19), 27664#(<= main_~i~0 20), 27665#(<= main_~i~0 21), 27666#(<= main_~i~0 22), 27667#(<= main_~i~0 23), 27668#(<= main_~i~0 24), 27669#(<= main_~i~0 25), 27670#(<= main_~i~0 26), 27671#(<= main_~i~0 27), 27672#(<= main_~i~0 28), 27673#(<= main_~i~0 29), 27674#(<= main_~i~0 30), 27675#(<= main_~i~0 31), 27676#(<= main_~i~0 32), 27677#(<= main_~i~0 33), 27678#(<= main_~i~0 34), 27679#(<= main_~i~0 35), 27680#(<= main_~i~0 36), 27681#(<= main_~i~0 37), 27682#(<= main_~i~0 38), 27683#(<= main_~i~0 39), 27684#(<= main_~i~0 40), 27685#(<= main_~i~0 41), 27686#(<= main_~i~0 42), 27687#(<= main_~i~0 43), 27688#(<= main_~i~0 44), 27689#(<= main_~i~0 45), 27690#(<= main_~i~0 46), 27691#(<= main_~i~0 47), 27692#(<= main_~i~0 48), 27693#(<= main_~i~0 49), 27694#(<= main_~i~0 50), 27695#(<= main_~i~0 51), 27696#(<= main_~i~0 52), 27697#(<= main_~i~0 53), 27698#(<= main_~i~0 54), 27699#(<= main_~i~0 55), 27700#(<= main_~i~0 56), 27701#(<= main_~i~0 57), 27702#(<= main_~i~0 58), 27703#(<= main_~i~0 59), 27704#(<= main_~i~0 60), 27705#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 27706#(and (<= main_~i~0 61) (<= 1 main_~i~0)), 27707#(and (<= 2 main_~i~0) (<= main_~i~0 62)), 27642#true, 27643#false, 27644#(<= main_~i~0 0), 27645#(<= main_~i~0 1), 27646#(<= main_~i~0 2), 27647#(<= main_~i~0 3)] [2018-04-12 03:06:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:16,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-12 03:06:16,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-12 03:06:16,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 03:06:16,862 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 66 states. [2018-04-12 03:06:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:18,237 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-04-12 03:06:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-12 03:06:18,237 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-12 03:06:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:18,238 INFO L225 Difference]: With dead ends: 328 [2018-04-12 03:06:18,238 INFO L226 Difference]: Without dead ends: 328 [2018-04-12 03:06:18,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-12 03:06:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-04-12 03:06:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-04-12 03:06:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-12 03:06:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-04-12 03:06:18,240 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 317 [2018-04-12 03:06:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:18,241 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-04-12 03:06:18,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-12 03:06:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-04-12 03:06:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-12 03:06:18,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:18,242 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:18,242 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 700591159, now seen corresponding path program 63 times [2018-04-12 03:06:18,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:18,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:19,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:19,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 03:06:19,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:19,375 INFO L182 omatonBuilderFactory]: Interpolants [28544#(<= main_~i~0 54), 28545#(<= main_~i~0 55), 28546#(<= main_~i~0 56), 28547#(<= main_~i~0 57), 28548#(<= main_~i~0 58), 28549#(<= main_~i~0 59), 28550#(<= main_~i~0 60), 28551#(<= main_~i~0 61), 28552#(<= main_~i~0 62), 28553#(and (<= 0 main_~i~0) (<= main_~i~0 62)), 28554#(and (<= 1 main_~i~0) (<= main_~i~0 63)), 28488#true, 28489#false, 28490#(<= main_~i~0 0), 28491#(<= main_~i~0 1), 28492#(<= main_~i~0 2), 28493#(<= main_~i~0 3), 28494#(<= main_~i~0 4), 28495#(<= main_~i~0 5), 28496#(<= main_~i~0 6), 28497#(<= main_~i~0 7), 28498#(<= main_~i~0 8), 28499#(<= main_~i~0 9), 28500#(<= main_~i~0 10), 28501#(<= main_~i~0 11), 28502#(<= main_~i~0 12), 28503#(<= main_~i~0 13), 28504#(<= main_~i~0 14), 28505#(<= main_~i~0 15), 28506#(<= main_~i~0 16), 28507#(<= main_~i~0 17), 28508#(<= main_~i~0 18), 28509#(<= main_~i~0 19), 28510#(<= main_~i~0 20), 28511#(<= main_~i~0 21), 28512#(<= main_~i~0 22), 28513#(<= main_~i~0 23), 28514#(<= main_~i~0 24), 28515#(<= main_~i~0 25), 28516#(<= main_~i~0 26), 28517#(<= main_~i~0 27), 28518#(<= main_~i~0 28), 28519#(<= main_~i~0 29), 28520#(<= main_~i~0 30), 28521#(<= main_~i~0 31), 28522#(<= main_~i~0 32), 28523#(<= main_~i~0 33), 28524#(<= main_~i~0 34), 28525#(<= main_~i~0 35), 28526#(<= main_~i~0 36), 28527#(<= main_~i~0 37), 28528#(<= main_~i~0 38), 28529#(<= main_~i~0 39), 28530#(<= main_~i~0 40), 28531#(<= main_~i~0 41), 28532#(<= main_~i~0 42), 28533#(<= main_~i~0 43), 28534#(<= main_~i~0 44), 28535#(<= main_~i~0 45), 28536#(<= main_~i~0 46), 28537#(<= main_~i~0 47), 28538#(<= main_~i~0 48), 28539#(<= main_~i~0 49), 28540#(<= main_~i~0 50), 28541#(<= main_~i~0 51), 28542#(<= main_~i~0 52), 28543#(<= main_~i~0 53)] [2018-04-12 03:06:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:19,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-12 03:06:19,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-12 03:06:19,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 03:06:19,376 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 67 states. [2018-04-12 03:06:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:20,714 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-04-12 03:06:20,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-12 03:06:20,715 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 322 [2018-04-12 03:06:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:20,715 INFO L225 Difference]: With dead ends: 333 [2018-04-12 03:06:20,715 INFO L226 Difference]: Without dead ends: 333 [2018-04-12 03:06:20,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6243, Invalid=10527, Unknown=0, NotChecked=0, Total=16770 [2018-04-12 03:06:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-12 03:06:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-04-12 03:06:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-12 03:06:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-04-12 03:06:20,718 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-04-12 03:06:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:20,718 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-04-12 03:06:20,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-12 03:06:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-04-12 03:06:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-12 03:06:20,719 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:20,719 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:20,719 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:20,719 INFO L82 PathProgramCache]: Analyzing trace with hash 365184806, now seen corresponding path program 64 times [2018-04-12 03:06:20,719 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:20,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:22,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:22,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 03:06:22,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:22,236 INFO L182 omatonBuilderFactory]: Interpolants [29347#true, 29348#false, 29349#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 29350#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 29351#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 29352#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 29353#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 29354#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 29355#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 29356#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 29357#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 29358#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 29359#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 29360#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 29361#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 29362#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 29363#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 29364#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 29365#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 29366#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 29367#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 29368#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 29369#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 29370#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 29371#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 29372#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 29373#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 29374#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 29375#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 29376#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 29377#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 29378#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 29379#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 29380#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 29381#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 29382#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 29383#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 29384#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 29385#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 29386#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 29387#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 29388#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 29389#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 29390#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 29391#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 29392#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 29393#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 29394#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 29395#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 29396#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 29397#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 29398#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 29399#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 29400#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 29401#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 29402#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 29403#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 29404#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 29405#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 29406#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 29407#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 29408#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 29409#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 29410#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 29411#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 29412#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 29413#(and (<= main_~i~0 64) (<= 64 main_~i~0))] [2018-04-12 03:06:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:22,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-12 03:06:22,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-12 03:06:22,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 03:06:22,236 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 67 states. [2018-04-12 03:06:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:26,274 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-04-12 03:06:26,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-12 03:06:26,274 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-12 03:06:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:26,275 INFO L225 Difference]: With dead ends: 338 [2018-04-12 03:06:26,275 INFO L226 Difference]: Without dead ends: 338 [2018-04-12 03:06:26,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 03:06:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-12 03:06:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-04-12 03:06:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-12 03:06:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-04-12 03:06:26,277 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 327 [2018-04-12 03:06:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:26,278 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-04-12 03:06:26,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-12 03:06:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-04-12 03:06:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-12 03:06:26,278 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:26,279 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:26,279 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1356376471, now seen corresponding path program 65 times [2018-04-12 03:06:26,279 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:26,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:27,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:27,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-12 03:06:27,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:27,466 INFO L182 omatonBuilderFactory]: Interpolants [30090#true, 30091#false, 30092#(<= main_~i~0 0), 30093#(<= main_~i~0 1), 30094#(<= main_~i~0 2), 30095#(<= main_~i~0 3), 30096#(<= main_~i~0 4), 30097#(<= main_~i~0 5), 30098#(<= main_~i~0 6), 30099#(<= main_~i~0 7), 30100#(<= main_~i~0 8), 30101#(<= main_~i~0 9), 30102#(<= main_~i~0 10), 30103#(<= main_~i~0 11), 30104#(<= main_~i~0 12), 30105#(<= main_~i~0 13), 30106#(<= main_~i~0 14), 30107#(<= main_~i~0 15), 30108#(<= main_~i~0 16), 30109#(<= main_~i~0 17), 30110#(<= main_~i~0 18), 30111#(<= main_~i~0 19), 30112#(<= main_~i~0 20), 30113#(<= main_~i~0 21), 30114#(<= main_~i~0 22), 30115#(<= main_~i~0 23), 30116#(<= main_~i~0 24), 30117#(<= main_~i~0 25), 30118#(<= main_~i~0 26), 30119#(<= main_~i~0 27), 30120#(<= main_~i~0 28), 30121#(<= main_~i~0 29), 30122#(<= main_~i~0 30), 30123#(<= main_~i~0 31), 30124#(<= main_~i~0 32), 30125#(<= main_~i~0 33), 30126#(<= main_~i~0 34), 30127#(<= main_~i~0 35), 30128#(<= main_~i~0 36), 30129#(<= main_~i~0 37), 30130#(<= main_~i~0 38), 30131#(<= main_~i~0 39), 30132#(<= main_~i~0 40), 30133#(<= main_~i~0 41), 30134#(<= main_~i~0 42), 30135#(<= main_~i~0 43), 30136#(<= main_~i~0 44), 30137#(<= main_~i~0 45), 30138#(<= main_~i~0 46), 30139#(<= main_~i~0 47), 30140#(<= main_~i~0 48), 30141#(<= main_~i~0 49), 30142#(<= main_~i~0 50), 30143#(<= main_~i~0 51), 30144#(<= main_~i~0 52), 30145#(<= main_~i~0 53), 30146#(<= main_~i~0 54), 30147#(<= main_~i~0 55), 30148#(<= main_~i~0 56), 30149#(<= main_~i~0 57), 30150#(<= main_~i~0 58), 30151#(<= main_~i~0 59), 30152#(<= main_~i~0 60), 30153#(<= main_~i~0 61), 30154#(<= main_~i~0 62), 30155#(<= main_~i~0 63), 30156#(<= main_~i~0 64), 30157#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 30158#(and (<= 1 main_~i~0) (<= main_~i~0 65))] [2018-04-12 03:06:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:27,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-12 03:06:27,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-12 03:06:27,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 03:06:27,467 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 69 states. [2018-04-12 03:06:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:28,935 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-04-12 03:06:28,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 03:06:28,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 332 [2018-04-12 03:06:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:28,936 INFO L225 Difference]: With dead ends: 343 [2018-04-12 03:06:28,936 INFO L226 Difference]: Without dead ends: 343 [2018-04-12 03:06:28,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6636, Invalid=11186, Unknown=0, NotChecked=0, Total=17822 [2018-04-12 03:06:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-12 03:06:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-04-12 03:06:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-12 03:06:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-04-12 03:06:28,938 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-04-12 03:06:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:28,938 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-04-12 03:06:28,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-12 03:06:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-04-12 03:06:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-12 03:06:28,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:28,939 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:28,939 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash -570087994, now seen corresponding path program 66 times [2018-04-12 03:06:28,940 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:28,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:30,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:30,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-12 03:06:30,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:30,214 INFO L182 omatonBuilderFactory]: Interpolants [30976#false, 30977#(<= main_~i~0 0), 30978#(<= main_~i~0 1), 30979#(<= main_~i~0 2), 30980#(<= main_~i~0 3), 30981#(<= main_~i~0 4), 30982#(<= main_~i~0 5), 30983#(<= main_~i~0 6), 30984#(<= main_~i~0 7), 30985#(<= main_~i~0 8), 30986#(<= main_~i~0 9), 30987#(<= main_~i~0 10), 30988#(<= main_~i~0 11), 30989#(<= main_~i~0 12), 30990#(<= main_~i~0 13), 30991#(<= main_~i~0 14), 30992#(<= main_~i~0 15), 30993#(<= main_~i~0 16), 30994#(<= main_~i~0 17), 30995#(<= main_~i~0 18), 30996#(<= main_~i~0 19), 30997#(<= main_~i~0 20), 30998#(<= main_~i~0 21), 30999#(<= main_~i~0 22), 31000#(<= main_~i~0 23), 31001#(<= main_~i~0 24), 31002#(<= main_~i~0 25), 31003#(<= main_~i~0 26), 31004#(<= main_~i~0 27), 31005#(<= main_~i~0 28), 31006#(<= main_~i~0 29), 31007#(<= main_~i~0 30), 31008#(<= main_~i~0 31), 31009#(<= main_~i~0 32), 31010#(<= main_~i~0 33), 31011#(<= main_~i~0 34), 31012#(<= main_~i~0 35), 31013#(<= main_~i~0 36), 31014#(<= main_~i~0 37), 31015#(<= main_~i~0 38), 31016#(<= main_~i~0 39), 31017#(<= main_~i~0 40), 31018#(<= main_~i~0 41), 31019#(<= main_~i~0 42), 31020#(<= main_~i~0 43), 31021#(<= main_~i~0 44), 31022#(<= main_~i~0 45), 31023#(<= main_~i~0 46), 31024#(<= main_~i~0 47), 31025#(<= main_~i~0 48), 31026#(<= main_~i~0 49), 31027#(<= main_~i~0 50), 31028#(<= main_~i~0 51), 31029#(<= main_~i~0 52), 31030#(<= main_~i~0 53), 31031#(<= main_~i~0 54), 31032#(<= main_~i~0 55), 31033#(<= main_~i~0 56), 31034#(<= main_~i~0 57), 31035#(<= main_~i~0 58), 31036#(<= main_~i~0 59), 31037#(<= main_~i~0 60), 31038#(<= main_~i~0 61), 31039#(<= main_~i~0 62), 31040#(<= main_~i~0 63), 31041#(<= main_~i~0 64), 31042#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 31043#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 31044#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 30975#true] [2018-04-12 03:06:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:30,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-12 03:06:30,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-12 03:06:30,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2218, Invalid=2612, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 03:06:30,215 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 70 states. [2018-04-12 03:06:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:31,804 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-04-12 03:06:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-12 03:06:31,805 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 337 [2018-04-12 03:06:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:31,805 INFO L225 Difference]: With dead ends: 348 [2018-04-12 03:06:31,805 INFO L226 Difference]: Without dead ends: 348 [2018-04-12 03:06:31,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6705, Invalid=11655, Unknown=0, NotChecked=0, Total=18360 [2018-04-12 03:06:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-12 03:06:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-04-12 03:06:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-12 03:06:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-04-12 03:06:31,807 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 337 [2018-04-12 03:06:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:31,808 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-04-12 03:06:31,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-12 03:06:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-04-12 03:06:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-12 03:06:31,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:31,809 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:31,809 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1787171081, now seen corresponding path program 67 times [2018-04-12 03:06:31,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:31,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:33,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:33,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-12 03:06:33,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:33,074 INFO L182 omatonBuilderFactory]: Interpolants [31873#true, 31874#false, 31875#(<= main_~i~0 0), 31876#(<= main_~i~0 1), 31877#(<= main_~i~0 2), 31878#(<= main_~i~0 3), 31879#(<= main_~i~0 4), 31880#(<= main_~i~0 5), 31881#(<= main_~i~0 6), 31882#(<= main_~i~0 7), 31883#(<= main_~i~0 8), 31884#(<= main_~i~0 9), 31885#(<= main_~i~0 10), 31886#(<= main_~i~0 11), 31887#(<= main_~i~0 12), 31888#(<= main_~i~0 13), 31889#(<= main_~i~0 14), 31890#(<= main_~i~0 15), 31891#(<= main_~i~0 16), 31892#(<= main_~i~0 17), 31893#(<= main_~i~0 18), 31894#(<= main_~i~0 19), 31895#(<= main_~i~0 20), 31896#(<= main_~i~0 21), 31897#(<= main_~i~0 22), 31898#(<= main_~i~0 23), 31899#(<= main_~i~0 24), 31900#(<= main_~i~0 25), 31901#(<= main_~i~0 26), 31902#(<= main_~i~0 27), 31903#(<= main_~i~0 28), 31904#(<= main_~i~0 29), 31905#(<= main_~i~0 30), 31906#(<= main_~i~0 31), 31907#(<= main_~i~0 32), 31908#(<= main_~i~0 33), 31909#(<= main_~i~0 34), 31910#(<= main_~i~0 35), 31911#(<= main_~i~0 36), 31912#(<= main_~i~0 37), 31913#(<= main_~i~0 38), 31914#(<= main_~i~0 39), 31915#(<= main_~i~0 40), 31916#(<= main_~i~0 41), 31917#(<= main_~i~0 42), 31918#(<= main_~i~0 43), 31919#(<= main_~i~0 44), 31920#(<= main_~i~0 45), 31921#(<= main_~i~0 46), 31922#(<= main_~i~0 47), 31923#(<= main_~i~0 48), 31924#(<= main_~i~0 49), 31925#(<= main_~i~0 50), 31926#(<= main_~i~0 51), 31927#(<= main_~i~0 52), 31928#(<= main_~i~0 53), 31929#(<= main_~i~0 54), 31930#(<= main_~i~0 55), 31931#(<= main_~i~0 56), 31932#(<= main_~i~0 57), 31933#(<= main_~i~0 58), 31934#(<= main_~i~0 59), 31935#(<= main_~i~0 60), 31936#(<= main_~i~0 61), 31937#(<= main_~i~0 62), 31938#(<= main_~i~0 63), 31939#(<= main_~i~0 64), 31940#(<= main_~i~0 65), 31941#(<= main_~i~0 66), 31942#(and (<= main_~i~0 66) (<= 0 main_~i~0)), 31943#(and (<= main_~i~0 67) (<= 1 main_~i~0))] [2018-04-12 03:06:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:33,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-12 03:06:33,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-12 03:06:33,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-12 03:06:33,075 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 71 states. [2018-04-12 03:06:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:34,558 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-04-12 03:06:34,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-12 03:06:34,559 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-04-12 03:06:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:34,560 INFO L225 Difference]: With dead ends: 353 [2018-04-12 03:06:34,560 INFO L226 Difference]: Without dead ends: 353 [2018-04-12 03:06:34,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-12 03:06:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-12 03:06:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-04-12 03:06:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-12 03:06:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-04-12 03:06:34,563 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-04-12 03:06:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:34,563 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-04-12 03:06:34,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-12 03:06:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-04-12 03:06:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-12 03:06:34,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:34,564 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:34,564 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1204274074, now seen corresponding path program 68 times [2018-04-12 03:06:34,565 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:34,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:35,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:35,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-12 03:06:35,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:35,854 INFO L182 omatonBuilderFactory]: Interpolants [32784#true, 32785#false, 32786#(<= main_~i~0 0), 32787#(<= main_~i~0 1), 32788#(<= main_~i~0 2), 32789#(<= main_~i~0 3), 32790#(<= main_~i~0 4), 32791#(<= main_~i~0 5), 32792#(<= main_~i~0 6), 32793#(<= main_~i~0 7), 32794#(<= main_~i~0 8), 32795#(<= main_~i~0 9), 32796#(<= main_~i~0 10), 32797#(<= main_~i~0 11), 32798#(<= main_~i~0 12), 32799#(<= main_~i~0 13), 32800#(<= main_~i~0 14), 32801#(<= main_~i~0 15), 32802#(<= main_~i~0 16), 32803#(<= main_~i~0 17), 32804#(<= main_~i~0 18), 32805#(<= main_~i~0 19), 32806#(<= main_~i~0 20), 32807#(<= main_~i~0 21), 32808#(<= main_~i~0 22), 32809#(<= main_~i~0 23), 32810#(<= main_~i~0 24), 32811#(<= main_~i~0 25), 32812#(<= main_~i~0 26), 32813#(<= main_~i~0 27), 32814#(<= main_~i~0 28), 32815#(<= main_~i~0 29), 32816#(<= main_~i~0 30), 32817#(<= main_~i~0 31), 32818#(<= main_~i~0 32), 32819#(<= main_~i~0 33), 32820#(<= main_~i~0 34), 32821#(<= main_~i~0 35), 32822#(<= main_~i~0 36), 32823#(<= main_~i~0 37), 32824#(<= main_~i~0 38), 32825#(<= main_~i~0 39), 32826#(<= main_~i~0 40), 32827#(<= main_~i~0 41), 32828#(<= main_~i~0 42), 32829#(<= main_~i~0 43), 32830#(<= main_~i~0 44), 32831#(<= main_~i~0 45), 32832#(<= main_~i~0 46), 32833#(<= main_~i~0 47), 32834#(<= main_~i~0 48), 32835#(<= main_~i~0 49), 32836#(<= main_~i~0 50), 32837#(<= main_~i~0 51), 32838#(<= main_~i~0 52), 32839#(<= main_~i~0 53), 32840#(<= main_~i~0 54), 32841#(<= main_~i~0 55), 32842#(<= main_~i~0 56), 32843#(<= main_~i~0 57), 32844#(<= main_~i~0 58), 32845#(<= main_~i~0 59), 32846#(<= main_~i~0 60), 32847#(<= main_~i~0 61), 32848#(<= main_~i~0 62), 32849#(<= main_~i~0 63), 32850#(<= main_~i~0 64), 32851#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 32852#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 32853#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 32854#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 32855#(and (<= 4 main_~i~0) (<= main_~i~0 68))] [2018-04-12 03:06:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:35,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-12 03:06:35,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-12 03:06:35,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 03:06:35,855 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 72 states. [2018-04-12 03:06:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:37,742 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-04-12 03:06:37,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-12 03:06:37,742 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-04-12 03:06:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:37,743 INFO L225 Difference]: With dead ends: 358 [2018-04-12 03:06:37,743 INFO L226 Difference]: Without dead ends: 358 [2018-04-12 03:06:37,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-04-12 03:06:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-12 03:06:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-04-12 03:06:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-04-12 03:06:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-04-12 03:06:37,746 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 347 [2018-04-12 03:06:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:37,746 INFO L459 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-04-12 03:06:37,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-12 03:06:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-04-12 03:06:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-12 03:06:37,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:37,747 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:37,747 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1093927849, now seen corresponding path program 69 times [2018-04-12 03:06:37,747 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:37,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:39,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:39,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-12 03:06:39,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:39,104 INFO L182 omatonBuilderFactory]: Interpolants [33708#true, 33709#false, 33710#(<= main_~i~0 0), 33711#(<= main_~i~0 1), 33712#(<= main_~i~0 2), 33713#(<= main_~i~0 3), 33714#(<= main_~i~0 4), 33715#(<= main_~i~0 5), 33716#(<= main_~i~0 6), 33717#(<= main_~i~0 7), 33718#(<= main_~i~0 8), 33719#(<= main_~i~0 9), 33720#(<= main_~i~0 10), 33721#(<= main_~i~0 11), 33722#(<= main_~i~0 12), 33723#(<= main_~i~0 13), 33724#(<= main_~i~0 14), 33725#(<= main_~i~0 15), 33726#(<= main_~i~0 16), 33727#(<= main_~i~0 17), 33728#(<= main_~i~0 18), 33729#(<= main_~i~0 19), 33730#(<= main_~i~0 20), 33731#(<= main_~i~0 21), 33732#(<= main_~i~0 22), 33733#(<= main_~i~0 23), 33734#(<= main_~i~0 24), 33735#(<= main_~i~0 25), 33736#(<= main_~i~0 26), 33737#(<= main_~i~0 27), 33738#(<= main_~i~0 28), 33739#(<= main_~i~0 29), 33740#(<= main_~i~0 30), 33741#(<= main_~i~0 31), 33742#(<= main_~i~0 32), 33743#(<= main_~i~0 33), 33744#(<= main_~i~0 34), 33745#(<= main_~i~0 35), 33746#(<= main_~i~0 36), 33747#(<= main_~i~0 37), 33748#(<= main_~i~0 38), 33749#(<= main_~i~0 39), 33750#(<= main_~i~0 40), 33751#(<= main_~i~0 41), 33752#(<= main_~i~0 42), 33753#(<= main_~i~0 43), 33754#(<= main_~i~0 44), 33755#(<= main_~i~0 45), 33756#(<= main_~i~0 46), 33757#(<= main_~i~0 47), 33758#(<= main_~i~0 48), 33759#(<= main_~i~0 49), 33760#(<= main_~i~0 50), 33761#(<= main_~i~0 51), 33762#(<= main_~i~0 52), 33763#(<= main_~i~0 53), 33764#(<= main_~i~0 54), 33765#(<= main_~i~0 55), 33766#(<= main_~i~0 56), 33767#(<= main_~i~0 57), 33768#(<= main_~i~0 58), 33769#(<= main_~i~0 59), 33770#(<= main_~i~0 60), 33771#(<= main_~i~0 61), 33772#(<= main_~i~0 62), 33773#(<= main_~i~0 63), 33774#(<= main_~i~0 64), 33775#(<= main_~i~0 65), 33776#(<= main_~i~0 66), 33777#(<= main_~i~0 67), 33778#(<= main_~i~0 68), 33779#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 33780#(and (<= main_~i~0 69) (<= 1 main_~i~0))] [2018-04-12 03:06:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:39,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-12 03:06:39,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-12 03:06:39,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-12 03:06:39,105 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 73 states. [2018-04-12 03:06:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:40,686 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-04-12 03:06:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-12 03:06:40,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-04-12 03:06:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:40,687 INFO L225 Difference]: With dead ends: 363 [2018-04-12 03:06:40,687 INFO L226 Difference]: Without dead ends: 363 [2018-04-12 03:06:40,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-04-12 03:06:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-12 03:06:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-04-12 03:06:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-12 03:06:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-04-12 03:06:40,690 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-04-12 03:06:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:40,690 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-04-12 03:06:40,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-12 03:06:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-04-12 03:06:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-12 03:06:40,691 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:40,691 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:40,691 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1693944582, now seen corresponding path program 70 times [2018-04-12 03:06:40,691 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:40,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:42,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:42,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-12 03:06:42,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:42,083 INFO L182 omatonBuilderFactory]: Interpolants [34688#(<= main_~i~0 41), 34689#(<= main_~i~0 42), 34690#(<= main_~i~0 43), 34691#(<= main_~i~0 44), 34692#(<= main_~i~0 45), 34693#(<= main_~i~0 46), 34694#(<= main_~i~0 47), 34695#(<= main_~i~0 48), 34696#(<= main_~i~0 49), 34697#(<= main_~i~0 50), 34698#(<= main_~i~0 51), 34699#(<= main_~i~0 52), 34700#(<= main_~i~0 53), 34701#(<= main_~i~0 54), 34702#(<= main_~i~0 55), 34703#(<= main_~i~0 56), 34704#(<= main_~i~0 57), 34705#(<= main_~i~0 58), 34706#(<= main_~i~0 59), 34707#(<= main_~i~0 60), 34708#(<= main_~i~0 61), 34709#(<= main_~i~0 62), 34710#(<= main_~i~0 63), 34711#(<= main_~i~0 64), 34712#(<= main_~i~0 65), 34713#(<= main_~i~0 66), 34714#(<= main_~i~0 67), 34715#(<= main_~i~0 68), 34716#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 34717#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 34718#(and (<= 2 main_~i~0) (<= main_~i~0 70)), 34645#true, 34646#false, 34647#(<= main_~i~0 0), 34648#(<= main_~i~0 1), 34649#(<= main_~i~0 2), 34650#(<= main_~i~0 3), 34651#(<= main_~i~0 4), 34652#(<= main_~i~0 5), 34653#(<= main_~i~0 6), 34654#(<= main_~i~0 7), 34655#(<= main_~i~0 8), 34656#(<= main_~i~0 9), 34657#(<= main_~i~0 10), 34658#(<= main_~i~0 11), 34659#(<= main_~i~0 12), 34660#(<= main_~i~0 13), 34661#(<= main_~i~0 14), 34662#(<= main_~i~0 15), 34663#(<= main_~i~0 16), 34664#(<= main_~i~0 17), 34665#(<= main_~i~0 18), 34666#(<= main_~i~0 19), 34667#(<= main_~i~0 20), 34668#(<= main_~i~0 21), 34669#(<= main_~i~0 22), 34670#(<= main_~i~0 23), 34671#(<= main_~i~0 24), 34672#(<= main_~i~0 25), 34673#(<= main_~i~0 26), 34674#(<= main_~i~0 27), 34675#(<= main_~i~0 28), 34676#(<= main_~i~0 29), 34677#(<= main_~i~0 30), 34678#(<= main_~i~0 31), 34679#(<= main_~i~0 32), 34680#(<= main_~i~0 33), 34681#(<= main_~i~0 34), 34682#(<= main_~i~0 35), 34683#(<= main_~i~0 36), 34684#(<= main_~i~0 37), 34685#(<= main_~i~0 38), 34686#(<= main_~i~0 39), 34687#(<= main_~i~0 40)] [2018-04-12 03:06:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:42,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-12 03:06:42,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-12 03:06:42,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 03:06:42,084 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 74 states. [2018-04-12 03:06:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:43,813 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-04-12 03:06:43,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-12 03:06:43,813 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-04-12 03:06:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:43,814 INFO L225 Difference]: With dead ends: 368 [2018-04-12 03:06:43,814 INFO L226 Difference]: Without dead ends: 368 [2018-04-12 03:06:43,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-04-12 03:06:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-12 03:06:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-04-12 03:06:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-12 03:06:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-04-12 03:06:43,816 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 357 [2018-04-12 03:06:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:43,816 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-04-12 03:06:43,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-12 03:06:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-04-12 03:06:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-12 03:06:43,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:43,817 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:43,817 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:43,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1551159735, now seen corresponding path program 71 times [2018-04-12 03:06:43,818 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:43,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:45,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:45,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-12 03:06:45,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:45,272 INFO L182 omatonBuilderFactory]: Interpolants [35595#true, 35596#false, 35597#(<= main_~i~0 0), 35598#(<= main_~i~0 1), 35599#(<= main_~i~0 2), 35600#(<= main_~i~0 3), 35601#(<= main_~i~0 4), 35602#(<= main_~i~0 5), 35603#(<= main_~i~0 6), 35604#(<= main_~i~0 7), 35605#(<= main_~i~0 8), 35606#(<= main_~i~0 9), 35607#(<= main_~i~0 10), 35608#(<= main_~i~0 11), 35609#(<= main_~i~0 12), 35610#(<= main_~i~0 13), 35611#(<= main_~i~0 14), 35612#(<= main_~i~0 15), 35613#(<= main_~i~0 16), 35614#(<= main_~i~0 17), 35615#(<= main_~i~0 18), 35616#(<= main_~i~0 19), 35617#(<= main_~i~0 20), 35618#(<= main_~i~0 21), 35619#(<= main_~i~0 22), 35620#(<= main_~i~0 23), 35621#(<= main_~i~0 24), 35622#(<= main_~i~0 25), 35623#(<= main_~i~0 26), 35624#(<= main_~i~0 27), 35625#(<= main_~i~0 28), 35626#(<= main_~i~0 29), 35627#(<= main_~i~0 30), 35628#(<= main_~i~0 31), 35629#(<= main_~i~0 32), 35630#(<= main_~i~0 33), 35631#(<= main_~i~0 34), 35632#(<= main_~i~0 35), 35633#(<= main_~i~0 36), 35634#(<= main_~i~0 37), 35635#(<= main_~i~0 38), 35636#(<= main_~i~0 39), 35637#(<= main_~i~0 40), 35638#(<= main_~i~0 41), 35639#(<= main_~i~0 42), 35640#(<= main_~i~0 43), 35641#(<= main_~i~0 44), 35642#(<= main_~i~0 45), 35643#(<= main_~i~0 46), 35644#(<= main_~i~0 47), 35645#(<= main_~i~0 48), 35646#(<= main_~i~0 49), 35647#(<= main_~i~0 50), 35648#(<= main_~i~0 51), 35649#(<= main_~i~0 52), 35650#(<= main_~i~0 53), 35651#(<= main_~i~0 54), 35652#(<= main_~i~0 55), 35653#(<= main_~i~0 56), 35654#(<= main_~i~0 57), 35655#(<= main_~i~0 58), 35656#(<= main_~i~0 59), 35657#(<= main_~i~0 60), 35658#(<= main_~i~0 61), 35659#(<= main_~i~0 62), 35660#(<= main_~i~0 63), 35661#(<= main_~i~0 64), 35662#(<= main_~i~0 65), 35663#(<= main_~i~0 66), 35664#(<= main_~i~0 67), 35665#(<= main_~i~0 68), 35666#(<= main_~i~0 69), 35667#(<= main_~i~0 70), 35668#(and (<= 0 main_~i~0) (<= main_~i~0 70)), 35669#(and (<= 1 main_~i~0) (<= main_~i~0 71))] [2018-04-12 03:06:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:45,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-12 03:06:45,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-12 03:06:45,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2633, Invalid=2917, Unknown=0, NotChecked=0, Total=5550 [2018-04-12 03:06:45,273 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 75 states. [2018-04-12 03:06:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:46,934 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-04-12 03:06:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-12 03:06:46,935 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 362 [2018-04-12 03:06:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:46,936 INFO L225 Difference]: With dead ends: 373 [2018-04-12 03:06:46,936 INFO L226 Difference]: Without dead ends: 373 [2018-04-12 03:06:46,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7887, Invalid=13283, Unknown=0, NotChecked=0, Total=21170 [2018-04-12 03:06:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-12 03:06:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-04-12 03:06:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-12 03:06:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-04-12 03:06:46,938 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-04-12 03:06:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:46,938 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-04-12 03:06:46,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-12 03:06:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-04-12 03:06:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-12 03:06:46,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:46,939 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:46,939 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash 744296870, now seen corresponding path program 72 times [2018-04-12 03:06:46,940 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:46,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:48,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:48,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-12 03:06:48,382 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:48,382 INFO L182 omatonBuilderFactory]: Interpolants [36608#(<= main_~i~0 48), 36609#(<= main_~i~0 49), 36610#(<= main_~i~0 50), 36611#(<= main_~i~0 51), 36612#(<= main_~i~0 52), 36613#(<= main_~i~0 53), 36614#(<= main_~i~0 54), 36615#(<= main_~i~0 55), 36616#(<= main_~i~0 56), 36617#(<= main_~i~0 57), 36618#(<= main_~i~0 58), 36619#(<= main_~i~0 59), 36620#(<= main_~i~0 60), 36621#(<= main_~i~0 61), 36622#(<= main_~i~0 62), 36623#(<= main_~i~0 63), 36624#(<= main_~i~0 64), 36625#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 36626#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 36627#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 36628#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 36629#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 36630#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 36631#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 36632#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 36633#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 36558#true, 36559#false, 36560#(<= main_~i~0 0), 36561#(<= main_~i~0 1), 36562#(<= main_~i~0 2), 36563#(<= main_~i~0 3), 36564#(<= main_~i~0 4), 36565#(<= main_~i~0 5), 36566#(<= main_~i~0 6), 36567#(<= main_~i~0 7), 36568#(<= main_~i~0 8), 36569#(<= main_~i~0 9), 36570#(<= main_~i~0 10), 36571#(<= main_~i~0 11), 36572#(<= main_~i~0 12), 36573#(<= main_~i~0 13), 36574#(<= main_~i~0 14), 36575#(<= main_~i~0 15), 36576#(<= main_~i~0 16), 36577#(<= main_~i~0 17), 36578#(<= main_~i~0 18), 36579#(<= main_~i~0 19), 36580#(<= main_~i~0 20), 36581#(<= main_~i~0 21), 36582#(<= main_~i~0 22), 36583#(<= main_~i~0 23), 36584#(<= main_~i~0 24), 36585#(<= main_~i~0 25), 36586#(<= main_~i~0 26), 36587#(<= main_~i~0 27), 36588#(<= main_~i~0 28), 36589#(<= main_~i~0 29), 36590#(<= main_~i~0 30), 36591#(<= main_~i~0 31), 36592#(<= main_~i~0 32), 36593#(<= main_~i~0 33), 36594#(<= main_~i~0 34), 36595#(<= main_~i~0 35), 36596#(<= main_~i~0 36), 36597#(<= main_~i~0 37), 36598#(<= main_~i~0 38), 36599#(<= main_~i~0 39), 36600#(<= main_~i~0 40), 36601#(<= main_~i~0 41), 36602#(<= main_~i~0 42), 36603#(<= main_~i~0 43), 36604#(<= main_~i~0 44), 36605#(<= main_~i~0 45), 36606#(<= main_~i~0 46), 36607#(<= main_~i~0 47)] [2018-04-12 03:06:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:48,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-12 03:06:48,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-12 03:06:48,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3470, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 03:06:48,383 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 76 states. [2018-04-12 03:06:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:50,967 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-04-12 03:06:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-12 03:06:50,967 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 367 [2018-04-12 03:06:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:50,968 INFO L225 Difference]: With dead ends: 378 [2018-04-12 03:06:50,968 INFO L226 Difference]: Without dead ends: 378 [2018-04-12 03:06:50,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7119, Invalid=14637, Unknown=0, NotChecked=0, Total=21756 [2018-04-12 03:06:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-12 03:06:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-04-12 03:06:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-12 03:06:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-04-12 03:06:50,970 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 367 [2018-04-12 03:06:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:50,971 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-04-12 03:06:50,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-12 03:06:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-04-12 03:06:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-12 03:06:50,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:50,972 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:50,972 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash 647655191, now seen corresponding path program 73 times [2018-04-12 03:06:50,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:50,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:52,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:52,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-12 03:06:52,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:52,510 INFO L182 omatonBuilderFactory]: Interpolants [37534#true, 37535#false, 37536#(<= main_~i~0 0), 37537#(<= main_~i~0 1), 37538#(<= main_~i~0 2), 37539#(<= main_~i~0 3), 37540#(<= main_~i~0 4), 37541#(<= main_~i~0 5), 37542#(<= main_~i~0 6), 37543#(<= main_~i~0 7), 37544#(<= main_~i~0 8), 37545#(<= main_~i~0 9), 37546#(<= main_~i~0 10), 37547#(<= main_~i~0 11), 37548#(<= main_~i~0 12), 37549#(<= main_~i~0 13), 37550#(<= main_~i~0 14), 37551#(<= main_~i~0 15), 37552#(<= main_~i~0 16), 37553#(<= main_~i~0 17), 37554#(<= main_~i~0 18), 37555#(<= main_~i~0 19), 37556#(<= main_~i~0 20), 37557#(<= main_~i~0 21), 37558#(<= main_~i~0 22), 37559#(<= main_~i~0 23), 37560#(<= main_~i~0 24), 37561#(<= main_~i~0 25), 37562#(<= main_~i~0 26), 37563#(<= main_~i~0 27), 37564#(<= main_~i~0 28), 37565#(<= main_~i~0 29), 37566#(<= main_~i~0 30), 37567#(<= main_~i~0 31), 37568#(<= main_~i~0 32), 37569#(<= main_~i~0 33), 37570#(<= main_~i~0 34), 37571#(<= main_~i~0 35), 37572#(<= main_~i~0 36), 37573#(<= main_~i~0 37), 37574#(<= main_~i~0 38), 37575#(<= main_~i~0 39), 37576#(<= main_~i~0 40), 37577#(<= main_~i~0 41), 37578#(<= main_~i~0 42), 37579#(<= main_~i~0 43), 37580#(<= main_~i~0 44), 37581#(<= main_~i~0 45), 37582#(<= main_~i~0 46), 37583#(<= main_~i~0 47), 37584#(<= main_~i~0 48), 37585#(<= main_~i~0 49), 37586#(<= main_~i~0 50), 37587#(<= main_~i~0 51), 37588#(<= main_~i~0 52), 37589#(<= main_~i~0 53), 37590#(<= main_~i~0 54), 37591#(<= main_~i~0 55), 37592#(<= main_~i~0 56), 37593#(<= main_~i~0 57), 37594#(<= main_~i~0 58), 37595#(<= main_~i~0 59), 37596#(<= main_~i~0 60), 37597#(<= main_~i~0 61), 37598#(<= main_~i~0 62), 37599#(<= main_~i~0 63), 37600#(<= main_~i~0 64), 37601#(<= main_~i~0 65), 37602#(<= main_~i~0 66), 37603#(<= main_~i~0 67), 37604#(<= main_~i~0 68), 37605#(<= main_~i~0 69), 37606#(<= main_~i~0 70), 37607#(<= main_~i~0 71), 37608#(<= main_~i~0 72), 37609#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 37610#(and (<= 1 main_~i~0) (<= main_~i~0 73))] [2018-04-12 03:06:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:52,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-12 03:06:52,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-12 03:06:52,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-12 03:06:52,511 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 77 states. [2018-04-12 03:06:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:54,232 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-04-12 03:06:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-12 03:06:54,232 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-04-12 03:06:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:54,233 INFO L225 Difference]: With dead ends: 383 [2018-04-12 03:06:54,233 INFO L226 Difference]: Without dead ends: 383 [2018-04-12 03:06:54,234 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-04-12 03:06:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-12 03:06:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-04-12 03:06:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-12 03:06:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-04-12 03:06:54,235 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-04-12 03:06:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:54,236 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-04-12 03:06:54,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-12 03:06:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-04-12 03:06:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-12 03:06:54,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:54,237 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:54,237 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2114113606, now seen corresponding path program 74 times [2018-04-12 03:06:54,237 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:54,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:55,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:55,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-12 03:06:55,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:55,764 INFO L182 omatonBuilderFactory]: Interpolants [38528#(<= main_~i~0 3), 38529#(<= main_~i~0 4), 38530#(<= main_~i~0 5), 38531#(<= main_~i~0 6), 38532#(<= main_~i~0 7), 38533#(<= main_~i~0 8), 38534#(<= main_~i~0 9), 38535#(<= main_~i~0 10), 38536#(<= main_~i~0 11), 38537#(<= main_~i~0 12), 38538#(<= main_~i~0 13), 38539#(<= main_~i~0 14), 38540#(<= main_~i~0 15), 38541#(<= main_~i~0 16), 38542#(<= main_~i~0 17), 38543#(<= main_~i~0 18), 38544#(<= main_~i~0 19), 38545#(<= main_~i~0 20), 38546#(<= main_~i~0 21), 38547#(<= main_~i~0 22), 38548#(<= main_~i~0 23), 38549#(<= main_~i~0 24), 38550#(<= main_~i~0 25), 38551#(<= main_~i~0 26), 38552#(<= main_~i~0 27), 38553#(<= main_~i~0 28), 38554#(<= main_~i~0 29), 38555#(<= main_~i~0 30), 38556#(<= main_~i~0 31), 38557#(<= main_~i~0 32), 38558#(<= main_~i~0 33), 38559#(<= main_~i~0 34), 38560#(<= main_~i~0 35), 38561#(<= main_~i~0 36), 38562#(<= main_~i~0 37), 38563#(<= main_~i~0 38), 38564#(<= main_~i~0 39), 38565#(<= main_~i~0 40), 38566#(<= main_~i~0 41), 38567#(<= main_~i~0 42), 38568#(<= main_~i~0 43), 38569#(<= main_~i~0 44), 38570#(<= main_~i~0 45), 38571#(<= main_~i~0 46), 38572#(<= main_~i~0 47), 38573#(<= main_~i~0 48), 38574#(<= main_~i~0 49), 38575#(<= main_~i~0 50), 38576#(<= main_~i~0 51), 38577#(<= main_~i~0 52), 38578#(<= main_~i~0 53), 38579#(<= main_~i~0 54), 38580#(<= main_~i~0 55), 38581#(<= main_~i~0 56), 38582#(<= main_~i~0 57), 38583#(<= main_~i~0 58), 38584#(<= main_~i~0 59), 38585#(<= main_~i~0 60), 38586#(<= main_~i~0 61), 38587#(<= main_~i~0 62), 38588#(<= main_~i~0 63), 38589#(<= main_~i~0 64), 38590#(<= main_~i~0 65), 38591#(<= main_~i~0 66), 38592#(<= main_~i~0 67), 38593#(<= main_~i~0 68), 38594#(<= main_~i~0 69), 38595#(<= main_~i~0 70), 38596#(<= main_~i~0 71), 38597#(<= main_~i~0 72), 38598#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 38599#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 38600#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 38523#true, 38524#false, 38525#(<= main_~i~0 0), 38526#(<= main_~i~0 1), 38527#(<= main_~i~0 2)] [2018-04-12 03:06:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:55,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-12 03:06:55,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-12 03:06:55,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 03:06:55,766 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 78 states. [2018-04-12 03:06:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:06:57,717 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-04-12 03:06:57,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-12 03:06:57,717 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-04-12 03:06:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:06:57,718 INFO L225 Difference]: With dead ends: 388 [2018-04-12 03:06:57,718 INFO L226 Difference]: Without dead ends: 388 [2018-04-12 03:06:57,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-12 03:06:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-12 03:06:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-04-12 03:06:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-12 03:06:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-04-12 03:06:57,720 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 377 [2018-04-12 03:06:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:06:57,720 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-04-12 03:06:57,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-12 03:06:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-04-12 03:06:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-12 03:06:57,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:06:57,722 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-12 03:06:57,722 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:06:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1575146615, now seen corresponding path program 75 times [2018-04-12 03:06:57,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:06:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:06:57,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:06:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:59,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:06:59,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-12 03:06:59,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:06:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:59,295 INFO L182 omatonBuilderFactory]: Interpolants [39552#(<= main_~i~0 25), 39553#(<= main_~i~0 26), 39554#(<= main_~i~0 27), 39555#(<= main_~i~0 28), 39556#(<= main_~i~0 29), 39557#(<= main_~i~0 30), 39558#(<= main_~i~0 31), 39559#(<= main_~i~0 32), 39560#(<= main_~i~0 33), 39561#(<= main_~i~0 34), 39562#(<= main_~i~0 35), 39563#(<= main_~i~0 36), 39564#(<= main_~i~0 37), 39565#(<= main_~i~0 38), 39566#(<= main_~i~0 39), 39567#(<= main_~i~0 40), 39568#(<= main_~i~0 41), 39569#(<= main_~i~0 42), 39570#(<= main_~i~0 43), 39571#(<= main_~i~0 44), 39572#(<= main_~i~0 45), 39573#(<= main_~i~0 46), 39574#(<= main_~i~0 47), 39575#(<= main_~i~0 48), 39576#(<= main_~i~0 49), 39577#(<= main_~i~0 50), 39578#(<= main_~i~0 51), 39579#(<= main_~i~0 52), 39580#(<= main_~i~0 53), 39581#(<= main_~i~0 54), 39582#(<= main_~i~0 55), 39583#(<= main_~i~0 56), 39584#(<= main_~i~0 57), 39585#(<= main_~i~0 58), 39586#(<= main_~i~0 59), 39587#(<= main_~i~0 60), 39588#(<= main_~i~0 61), 39589#(<= main_~i~0 62), 39590#(<= main_~i~0 63), 39591#(<= main_~i~0 64), 39592#(<= main_~i~0 65), 39593#(<= main_~i~0 66), 39594#(<= main_~i~0 67), 39595#(<= main_~i~0 68), 39596#(<= main_~i~0 69), 39597#(<= main_~i~0 70), 39598#(<= main_~i~0 71), 39599#(<= main_~i~0 72), 39600#(<= main_~i~0 73), 39601#(<= main_~i~0 74), 39602#(and (<= 0 main_~i~0) (<= main_~i~0 74)), 39603#(and (<= 1 main_~i~0) (<= main_~i~0 75)), 39525#true, 39526#false, 39527#(<= main_~i~0 0), 39528#(<= main_~i~0 1), 39529#(<= main_~i~0 2), 39530#(<= main_~i~0 3), 39531#(<= main_~i~0 4), 39532#(<= main_~i~0 5), 39533#(<= main_~i~0 6), 39534#(<= main_~i~0 7), 39535#(<= main_~i~0 8), 39536#(<= main_~i~0 9), 39537#(<= main_~i~0 10), 39538#(<= main_~i~0 11), 39539#(<= main_~i~0 12), 39540#(<= main_~i~0 13), 39541#(<= main_~i~0 14), 39542#(<= main_~i~0 15), 39543#(<= main_~i~0 16), 39544#(<= main_~i~0 17), 39545#(<= main_~i~0 18), 39546#(<= main_~i~0 19), 39547#(<= main_~i~0 20), 39548#(<= main_~i~0 21), 39549#(<= main_~i~0 22), 39550#(<= main_~i~0 23), 39551#(<= main_~i~0 24)] [2018-04-12 03:06:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:06:59,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-12 03:06:59,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-12 03:06:59,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-12 03:06:59,296 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 79 states. [2018-04-12 03:07:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:01,115 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-04-12 03:07:01,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-12 03:07:01,115 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-04-12 03:07:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:01,116 INFO L225 Difference]: With dead ends: 393 [2018-04-12 03:07:01,116 INFO L226 Difference]: Without dead ends: 393 [2018-04-12 03:07:01,117 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-04-12 03:07:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-12 03:07:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-04-12 03:07:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-12 03:07:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-04-12 03:07:01,119 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-04-12 03:07:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:01,119 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-04-12 03:07:01,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-12 03:07:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-04-12 03:07:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-12 03:07:01,120 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:01,120 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:01,120 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1862088986, now seen corresponding path program 76 times [2018-04-12 03:07:01,121 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:01,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:02,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:02,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-12 03:07:02,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:02,982 INFO L182 omatonBuilderFactory]: Interpolants [40576#(<= main_~i~0 34), 40577#(<= main_~i~0 35), 40578#(<= main_~i~0 36), 40579#(<= main_~i~0 37), 40580#(<= main_~i~0 38), 40581#(<= main_~i~0 39), 40582#(<= main_~i~0 40), 40583#(<= main_~i~0 41), 40584#(<= main_~i~0 42), 40585#(<= main_~i~0 43), 40586#(<= main_~i~0 44), 40587#(<= main_~i~0 45), 40588#(<= main_~i~0 46), 40589#(<= main_~i~0 47), 40590#(<= main_~i~0 48), 40591#(<= main_~i~0 49), 40592#(<= main_~i~0 50), 40593#(<= main_~i~0 51), 40594#(<= main_~i~0 52), 40595#(<= main_~i~0 53), 40596#(<= main_~i~0 54), 40597#(<= main_~i~0 55), 40598#(<= main_~i~0 56), 40599#(<= main_~i~0 57), 40600#(<= main_~i~0 58), 40601#(<= main_~i~0 59), 40602#(<= main_~i~0 60), 40603#(<= main_~i~0 61), 40604#(<= main_~i~0 62), 40605#(<= main_~i~0 63), 40606#(<= main_~i~0 64), 40607#(<= main_~i~0 65), 40608#(<= main_~i~0 66), 40609#(<= main_~i~0 67), 40610#(<= main_~i~0 68), 40611#(<= main_~i~0 69), 40612#(<= main_~i~0 70), 40613#(<= main_~i~0 71), 40614#(<= main_~i~0 72), 40615#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 40616#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 40617#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 40618#(and (<= main_~i~0 75) (<= 3 main_~i~0)), 40619#(and (<= main_~i~0 76) (<= 4 main_~i~0)), 40540#true, 40541#false, 40542#(<= main_~i~0 0), 40543#(<= main_~i~0 1), 40544#(<= main_~i~0 2), 40545#(<= main_~i~0 3), 40546#(<= main_~i~0 4), 40547#(<= main_~i~0 5), 40548#(<= main_~i~0 6), 40549#(<= main_~i~0 7), 40550#(<= main_~i~0 8), 40551#(<= main_~i~0 9), 40552#(<= main_~i~0 10), 40553#(<= main_~i~0 11), 40554#(<= main_~i~0 12), 40555#(<= main_~i~0 13), 40556#(<= main_~i~0 14), 40557#(<= main_~i~0 15), 40558#(<= main_~i~0 16), 40559#(<= main_~i~0 17), 40560#(<= main_~i~0 18), 40561#(<= main_~i~0 19), 40562#(<= main_~i~0 20), 40563#(<= main_~i~0 21), 40564#(<= main_~i~0 22), 40565#(<= main_~i~0 23), 40566#(<= main_~i~0 24), 40567#(<= main_~i~0 25), 40568#(<= main_~i~0 26), 40569#(<= main_~i~0 27), 40570#(<= main_~i~0 28), 40571#(<= main_~i~0 29), 40572#(<= main_~i~0 30), 40573#(<= main_~i~0 31), 40574#(<= main_~i~0 32), 40575#(<= main_~i~0 33)] [2018-04-12 03:07:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:02,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-12 03:07:02,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-12 03:07:02,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 03:07:02,983 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 80 states. [2018-04-12 03:07:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:05,262 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-04-12 03:07:05,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-12 03:07:05,262 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-04-12 03:07:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:05,263 INFO L225 Difference]: With dead ends: 398 [2018-04-12 03:07:05,263 INFO L226 Difference]: Without dead ends: 398 [2018-04-12 03:07:05,264 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-12 03:07:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-04-12 03:07:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-04-12 03:07:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-12 03:07:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-04-12 03:07:05,265 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 387 [2018-04-12 03:07:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:05,266 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-04-12 03:07:05,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-12 03:07:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-04-12 03:07:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-12 03:07:05,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:05,267 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:05,267 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:05,267 INFO L82 PathProgramCache]: Analyzing trace with hash 729022935, now seen corresponding path program 77 times [2018-04-12 03:07:05,267 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:05,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:06,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:06,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-12 03:07:06,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:06,962 INFO L182 omatonBuilderFactory]: Interpolants [41600#(<= main_~i~0 30), 41601#(<= main_~i~0 31), 41602#(<= main_~i~0 32), 41603#(<= main_~i~0 33), 41604#(<= main_~i~0 34), 41605#(<= main_~i~0 35), 41606#(<= main_~i~0 36), 41607#(<= main_~i~0 37), 41608#(<= main_~i~0 38), 41609#(<= main_~i~0 39), 41610#(<= main_~i~0 40), 41611#(<= main_~i~0 41), 41612#(<= main_~i~0 42), 41613#(<= main_~i~0 43), 41614#(<= main_~i~0 44), 41615#(<= main_~i~0 45), 41616#(<= main_~i~0 46), 41617#(<= main_~i~0 47), 41618#(<= main_~i~0 48), 41619#(<= main_~i~0 49), 41620#(<= main_~i~0 50), 41621#(<= main_~i~0 51), 41622#(<= main_~i~0 52), 41623#(<= main_~i~0 53), 41624#(<= main_~i~0 54), 41625#(<= main_~i~0 55), 41626#(<= main_~i~0 56), 41627#(<= main_~i~0 57), 41628#(<= main_~i~0 58), 41629#(<= main_~i~0 59), 41630#(<= main_~i~0 60), 41631#(<= main_~i~0 61), 41632#(<= main_~i~0 62), 41633#(<= main_~i~0 63), 41634#(<= main_~i~0 64), 41635#(<= main_~i~0 65), 41636#(<= main_~i~0 66), 41637#(<= main_~i~0 67), 41638#(<= main_~i~0 68), 41639#(<= main_~i~0 69), 41640#(<= main_~i~0 70), 41641#(<= main_~i~0 71), 41642#(<= main_~i~0 72), 41643#(<= main_~i~0 73), 41644#(<= main_~i~0 74), 41645#(<= main_~i~0 75), 41646#(<= main_~i~0 76), 41647#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 41648#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 41568#true, 41569#false, 41570#(<= main_~i~0 0), 41571#(<= main_~i~0 1), 41572#(<= main_~i~0 2), 41573#(<= main_~i~0 3), 41574#(<= main_~i~0 4), 41575#(<= main_~i~0 5), 41576#(<= main_~i~0 6), 41577#(<= main_~i~0 7), 41578#(<= main_~i~0 8), 41579#(<= main_~i~0 9), 41580#(<= main_~i~0 10), 41581#(<= main_~i~0 11), 41582#(<= main_~i~0 12), 41583#(<= main_~i~0 13), 41584#(<= main_~i~0 14), 41585#(<= main_~i~0 15), 41586#(<= main_~i~0 16), 41587#(<= main_~i~0 17), 41588#(<= main_~i~0 18), 41589#(<= main_~i~0 19), 41590#(<= main_~i~0 20), 41591#(<= main_~i~0 21), 41592#(<= main_~i~0 22), 41593#(<= main_~i~0 23), 41594#(<= main_~i~0 24), 41595#(<= main_~i~0 25), 41596#(<= main_~i~0 26), 41597#(<= main_~i~0 27), 41598#(<= main_~i~0 28), 41599#(<= main_~i~0 29)] [2018-04-12 03:07:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:06,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-12 03:07:06,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-12 03:07:06,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=3394, Unknown=0, NotChecked=0, Total=6480 [2018-04-12 03:07:06,964 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 81 states. [2018-04-12 03:07:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:08,852 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-04-12 03:07:08,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-12 03:07:08,852 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 392 [2018-04-12 03:07:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:08,853 INFO L225 Difference]: With dead ends: 403 [2018-04-12 03:07:08,853 INFO L226 Difference]: Without dead ends: 403 [2018-04-12 03:07:08,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=9246, Invalid=15560, Unknown=0, NotChecked=0, Total=24806 [2018-04-12 03:07:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-12 03:07:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-04-12 03:07:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-12 03:07:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-04-12 03:07:08,856 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-04-12 03:07:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:08,856 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-04-12 03:07:08,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-12 03:07:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-04-12 03:07:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-12 03:07:08,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:08,857 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:08,857 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash 66516358, now seen corresponding path program 78 times [2018-04-12 03:07:08,857 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:08,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:10,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:10,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-12 03:07:10,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:10,652 INFO L182 omatonBuilderFactory]: Interpolants [42624#(<= main_~i~0 13), 42625#(<= main_~i~0 14), 42626#(<= main_~i~0 15), 42627#(<= main_~i~0 16), 42628#(<= main_~i~0 17), 42629#(<= main_~i~0 18), 42630#(<= main_~i~0 19), 42631#(<= main_~i~0 20), 42632#(<= main_~i~0 21), 42633#(<= main_~i~0 22), 42634#(<= main_~i~0 23), 42635#(<= main_~i~0 24), 42636#(<= main_~i~0 25), 42637#(<= main_~i~0 26), 42638#(<= main_~i~0 27), 42639#(<= main_~i~0 28), 42640#(<= main_~i~0 29), 42641#(<= main_~i~0 30), 42642#(<= main_~i~0 31), 42643#(<= main_~i~0 32), 42644#(<= main_~i~0 33), 42645#(<= main_~i~0 34), 42646#(<= main_~i~0 35), 42647#(<= main_~i~0 36), 42648#(<= main_~i~0 37), 42649#(<= main_~i~0 38), 42650#(<= main_~i~0 39), 42651#(<= main_~i~0 40), 42652#(<= main_~i~0 41), 42653#(<= main_~i~0 42), 42654#(<= main_~i~0 43), 42655#(<= main_~i~0 44), 42656#(<= main_~i~0 45), 42657#(<= main_~i~0 46), 42658#(<= main_~i~0 47), 42659#(<= main_~i~0 48), 42660#(<= main_~i~0 49), 42661#(<= main_~i~0 50), 42662#(<= main_~i~0 51), 42663#(<= main_~i~0 52), 42664#(<= main_~i~0 53), 42665#(<= main_~i~0 54), 42666#(<= main_~i~0 55), 42667#(<= main_~i~0 56), 42668#(<= main_~i~0 57), 42669#(<= main_~i~0 58), 42670#(<= main_~i~0 59), 42671#(<= main_~i~0 60), 42672#(<= main_~i~0 61), 42673#(<= main_~i~0 62), 42674#(<= main_~i~0 63), 42675#(<= main_~i~0 64), 42676#(<= main_~i~0 65), 42677#(<= main_~i~0 66), 42678#(<= main_~i~0 67), 42679#(<= main_~i~0 68), 42680#(<= main_~i~0 69), 42681#(<= main_~i~0 70), 42682#(<= main_~i~0 71), 42683#(<= main_~i~0 72), 42684#(<= main_~i~0 73), 42685#(<= main_~i~0 74), 42686#(<= main_~i~0 75), 42687#(<= main_~i~0 76), 42688#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 42689#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 42690#(and (<= 2 main_~i~0) (<= main_~i~0 78)), 42609#true, 42610#false, 42611#(<= main_~i~0 0), 42612#(<= main_~i~0 1), 42613#(<= main_~i~0 2), 42614#(<= main_~i~0 3), 42615#(<= main_~i~0 4), 42616#(<= main_~i~0 5), 42617#(<= main_~i~0 6), 42618#(<= main_~i~0 7), 42619#(<= main_~i~0 8), 42620#(<= main_~i~0 9), 42621#(<= main_~i~0 10), 42622#(<= main_~i~0 11), 42623#(<= main_~i~0 12)] [2018-04-12 03:07:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:10,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-12 03:07:10,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-12 03:07:10,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3088, Invalid=3554, Unknown=0, NotChecked=0, Total=6642 [2018-04-12 03:07:10,653 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 82 states. [2018-04-12 03:07:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:12,768 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-04-12 03:07:12,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-12 03:07:12,768 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 397 [2018-04-12 03:07:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:12,769 INFO L225 Difference]: With dead ends: 408 [2018-04-12 03:07:12,769 INFO L226 Difference]: Without dead ends: 408 [2018-04-12 03:07:12,770 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9327, Invalid=16113, Unknown=0, NotChecked=0, Total=25440 [2018-04-12 03:07:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-12 03:07:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-04-12 03:07:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-12 03:07:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-04-12 03:07:12,772 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 397 [2018-04-12 03:07:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:12,772 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-04-12 03:07:12,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-12 03:07:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-04-12 03:07:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-04-12 03:07:12,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:12,773 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:12,773 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:12,773 INFO L82 PathProgramCache]: Analyzing trace with hash 15988535, now seen corresponding path program 79 times [2018-04-12 03:07:12,774 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:12,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:14,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:14,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-12 03:07:14,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:14,577 INFO L182 omatonBuilderFactory]: Interpolants [43663#true, 43664#false, 43665#(<= main_~i~0 0), 43666#(<= main_~i~0 1), 43667#(<= main_~i~0 2), 43668#(<= main_~i~0 3), 43669#(<= main_~i~0 4), 43670#(<= main_~i~0 5), 43671#(<= main_~i~0 6), 43672#(<= main_~i~0 7), 43673#(<= main_~i~0 8), 43674#(<= main_~i~0 9), 43675#(<= main_~i~0 10), 43676#(<= main_~i~0 11), 43677#(<= main_~i~0 12), 43678#(<= main_~i~0 13), 43679#(<= main_~i~0 14), 43680#(<= main_~i~0 15), 43681#(<= main_~i~0 16), 43682#(<= main_~i~0 17), 43683#(<= main_~i~0 18), 43684#(<= main_~i~0 19), 43685#(<= main_~i~0 20), 43686#(<= main_~i~0 21), 43687#(<= main_~i~0 22), 43688#(<= main_~i~0 23), 43689#(<= main_~i~0 24), 43690#(<= main_~i~0 25), 43691#(<= main_~i~0 26), 43692#(<= main_~i~0 27), 43693#(<= main_~i~0 28), 43694#(<= main_~i~0 29), 43695#(<= main_~i~0 30), 43696#(<= main_~i~0 31), 43697#(<= main_~i~0 32), 43698#(<= main_~i~0 33), 43699#(<= main_~i~0 34), 43700#(<= main_~i~0 35), 43701#(<= main_~i~0 36), 43702#(<= main_~i~0 37), 43703#(<= main_~i~0 38), 43704#(<= main_~i~0 39), 43705#(<= main_~i~0 40), 43706#(<= main_~i~0 41), 43707#(<= main_~i~0 42), 43708#(<= main_~i~0 43), 43709#(<= main_~i~0 44), 43710#(<= main_~i~0 45), 43711#(<= main_~i~0 46), 43712#(<= main_~i~0 47), 43713#(<= main_~i~0 48), 43714#(<= main_~i~0 49), 43715#(<= main_~i~0 50), 43716#(<= main_~i~0 51), 43717#(<= main_~i~0 52), 43718#(<= main_~i~0 53), 43719#(<= main_~i~0 54), 43720#(<= main_~i~0 55), 43721#(<= main_~i~0 56), 43722#(<= main_~i~0 57), 43723#(<= main_~i~0 58), 43724#(<= main_~i~0 59), 43725#(<= main_~i~0 60), 43726#(<= main_~i~0 61), 43727#(<= main_~i~0 62), 43728#(<= main_~i~0 63), 43729#(<= main_~i~0 64), 43730#(<= main_~i~0 65), 43731#(<= main_~i~0 66), 43732#(<= main_~i~0 67), 43733#(<= main_~i~0 68), 43734#(<= main_~i~0 69), 43735#(<= main_~i~0 70), 43736#(<= main_~i~0 71), 43737#(<= main_~i~0 72), 43738#(<= main_~i~0 73), 43739#(<= main_~i~0 74), 43740#(<= main_~i~0 75), 43741#(<= main_~i~0 76), 43742#(<= main_~i~0 77), 43743#(<= main_~i~0 78), 43744#(and (<= 0 main_~i~0) (<= main_~i~0 78)), 43745#(and (<= 1 main_~i~0) (<= main_~i~0 79))] [2018-04-12 03:07:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:14,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-12 03:07:14,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-12 03:07:14,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=3561, Unknown=0, NotChecked=0, Total=6806 [2018-04-12 03:07:14,579 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 83 states. [2018-04-12 03:07:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:16,600 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-04-12 03:07:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-12 03:07:16,601 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 402 [2018-04-12 03:07:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:16,601 INFO L225 Difference]: With dead ends: 413 [2018-04-12 03:07:16,602 INFO L226 Difference]: Without dead ends: 413 [2018-04-12 03:07:16,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=9723, Invalid=16359, Unknown=0, NotChecked=0, Total=26082 [2018-04-12 03:07:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-12 03:07:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-04-12 03:07:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-12 03:07:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-04-12 03:07:16,604 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 402 [2018-04-12 03:07:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:16,604 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-04-12 03:07:16,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-12 03:07:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-04-12 03:07:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-12 03:07:16,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:16,605 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:16,605 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:16,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2096716838, now seen corresponding path program 80 times [2018-04-12 03:07:16,606 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:16,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:18,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:18,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-12 03:07:18,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:18,363 INFO L182 omatonBuilderFactory]: Interpolants [44800#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 44801#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 44802#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 44803#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 44804#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 44805#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 44806#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 44807#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 44808#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 44809#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 44810#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 44811#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 44812#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 44813#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 44730#true, 44731#false, 44732#(<= main_~i~0 0), 44733#(<= main_~i~0 1), 44734#(<= main_~i~0 2), 44735#(<= main_~i~0 3), 44736#(<= main_~i~0 4), 44737#(<= main_~i~0 5), 44738#(<= main_~i~0 6), 44739#(<= main_~i~0 7), 44740#(<= main_~i~0 8), 44741#(<= main_~i~0 9), 44742#(<= main_~i~0 10), 44743#(<= main_~i~0 11), 44744#(<= main_~i~0 12), 44745#(<= main_~i~0 13), 44746#(<= main_~i~0 14), 44747#(<= main_~i~0 15), 44748#(<= main_~i~0 16), 44749#(<= main_~i~0 17), 44750#(<= main_~i~0 18), 44751#(<= main_~i~0 19), 44752#(<= main_~i~0 20), 44753#(<= main_~i~0 21), 44754#(<= main_~i~0 22), 44755#(<= main_~i~0 23), 44756#(<= main_~i~0 24), 44757#(<= main_~i~0 25), 44758#(<= main_~i~0 26), 44759#(<= main_~i~0 27), 44760#(<= main_~i~0 28), 44761#(<= main_~i~0 29), 44762#(<= main_~i~0 30), 44763#(<= main_~i~0 31), 44764#(<= main_~i~0 32), 44765#(<= main_~i~0 33), 44766#(<= main_~i~0 34), 44767#(<= main_~i~0 35), 44768#(<= main_~i~0 36), 44769#(<= main_~i~0 37), 44770#(<= main_~i~0 38), 44771#(<= main_~i~0 39), 44772#(<= main_~i~0 40), 44773#(<= main_~i~0 41), 44774#(<= main_~i~0 42), 44775#(<= main_~i~0 43), 44776#(<= main_~i~0 44), 44777#(<= main_~i~0 45), 44778#(<= main_~i~0 46), 44779#(<= main_~i~0 47), 44780#(<= main_~i~0 48), 44781#(<= main_~i~0 49), 44782#(<= main_~i~0 50), 44783#(<= main_~i~0 51), 44784#(<= main_~i~0 52), 44785#(<= main_~i~0 53), 44786#(<= main_~i~0 54), 44787#(<= main_~i~0 55), 44788#(<= main_~i~0 56), 44789#(<= main_~i~0 57), 44790#(<= main_~i~0 58), 44791#(<= main_~i~0 59), 44792#(<= main_~i~0 60), 44793#(<= main_~i~0 61), 44794#(<= main_~i~0 62), 44795#(<= main_~i~0 63), 44796#(<= main_~i~0 64), 44797#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 44798#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 44799#(and (<= main_~i~0 66) (<= 2 main_~i~0))] [2018-04-12 03:07:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:18,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-12 03:07:18,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-12 03:07:18,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2246, Invalid=4726, Unknown=0, NotChecked=0, Total=6972 [2018-04-12 03:07:18,365 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 84 states. [2018-04-12 03:07:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:22,642 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-04-12 03:07:22,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-12 03:07:22,642 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 407 [2018-04-12 03:07:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:22,643 INFO L225 Difference]: With dead ends: 418 [2018-04-12 03:07:22,643 INFO L226 Difference]: Without dead ends: 418 [2018-04-12 03:07:22,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4279 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7671, Invalid=19061, Unknown=0, NotChecked=0, Total=26732 [2018-04-12 03:07:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-12 03:07:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-04-12 03:07:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-12 03:07:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-04-12 03:07:22,646 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 407 [2018-04-12 03:07:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:22,647 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-04-12 03:07:22,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-12 03:07:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-04-12 03:07:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-12 03:07:22,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:22,648 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:22,648 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash -125258601, now seen corresponding path program 81 times [2018-04-12 03:07:22,648 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:22,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:24,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:24,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-12 03:07:24,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:24,625 INFO L182 omatonBuilderFactory]: Interpolants [45824#(<= main_~i~0 12), 45825#(<= main_~i~0 13), 45826#(<= main_~i~0 14), 45827#(<= main_~i~0 15), 45828#(<= main_~i~0 16), 45829#(<= main_~i~0 17), 45830#(<= main_~i~0 18), 45831#(<= main_~i~0 19), 45832#(<= main_~i~0 20), 45833#(<= main_~i~0 21), 45834#(<= main_~i~0 22), 45835#(<= main_~i~0 23), 45836#(<= main_~i~0 24), 45837#(<= main_~i~0 25), 45838#(<= main_~i~0 26), 45839#(<= main_~i~0 27), 45840#(<= main_~i~0 28), 45841#(<= main_~i~0 29), 45842#(<= main_~i~0 30), 45843#(<= main_~i~0 31), 45844#(<= main_~i~0 32), 45845#(<= main_~i~0 33), 45846#(<= main_~i~0 34), 45847#(<= main_~i~0 35), 45848#(<= main_~i~0 36), 45849#(<= main_~i~0 37), 45850#(<= main_~i~0 38), 45851#(<= main_~i~0 39), 45852#(<= main_~i~0 40), 45853#(<= main_~i~0 41), 45854#(<= main_~i~0 42), 45855#(<= main_~i~0 43), 45856#(<= main_~i~0 44), 45857#(<= main_~i~0 45), 45858#(<= main_~i~0 46), 45859#(<= main_~i~0 47), 45860#(<= main_~i~0 48), 45861#(<= main_~i~0 49), 45862#(<= main_~i~0 50), 45863#(<= main_~i~0 51), 45864#(<= main_~i~0 52), 45865#(<= main_~i~0 53), 45866#(<= main_~i~0 54), 45867#(<= main_~i~0 55), 45868#(<= main_~i~0 56), 45869#(<= main_~i~0 57), 45870#(<= main_~i~0 58), 45871#(<= main_~i~0 59), 45872#(<= main_~i~0 60), 45873#(<= main_~i~0 61), 45874#(<= main_~i~0 62), 45875#(<= main_~i~0 63), 45876#(<= main_~i~0 64), 45877#(<= main_~i~0 65), 45878#(<= main_~i~0 66), 45879#(<= main_~i~0 67), 45880#(<= main_~i~0 68), 45881#(<= main_~i~0 69), 45882#(<= main_~i~0 70), 45883#(<= main_~i~0 71), 45884#(<= main_~i~0 72), 45885#(<= main_~i~0 73), 45886#(<= main_~i~0 74), 45887#(<= main_~i~0 75), 45888#(<= main_~i~0 76), 45889#(<= main_~i~0 77), 45890#(<= main_~i~0 78), 45891#(<= main_~i~0 79), 45892#(<= main_~i~0 80), 45893#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 45894#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 45810#true, 45811#false, 45812#(<= main_~i~0 0), 45813#(<= main_~i~0 1), 45814#(<= main_~i~0 2), 45815#(<= main_~i~0 3), 45816#(<= main_~i~0 4), 45817#(<= main_~i~0 5), 45818#(<= main_~i~0 6), 45819#(<= main_~i~0 7), 45820#(<= main_~i~0 8), 45821#(<= main_~i~0 9), 45822#(<= main_~i~0 10), 45823#(<= main_~i~0 11)] [2018-04-12 03:07:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:24,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-12 03:07:24,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-12 03:07:24,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3408, Invalid=3732, Unknown=0, NotChecked=0, Total=7140 [2018-04-12 03:07:24,626 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 85 states. [2018-04-12 03:07:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:26,702 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-04-12 03:07:26,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-12 03:07:26,702 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 412 [2018-04-12 03:07:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:26,703 INFO L225 Difference]: With dead ends: 423 [2018-04-12 03:07:26,703 INFO L226 Difference]: Without dead ends: 423 [2018-04-12 03:07:26,704 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=10212, Invalid=17178, Unknown=0, NotChecked=0, Total=27390 [2018-04-12 03:07:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-04-12 03:07:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-04-12 03:07:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-12 03:07:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-04-12 03:07:26,707 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 412 [2018-04-12 03:07:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:26,707 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-04-12 03:07:26,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-12 03:07:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-04-12 03:07:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-12 03:07:26,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:26,708 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:26,708 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1235483334, now seen corresponding path program 82 times [2018-04-12 03:07:26,709 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:26,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:28,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:28,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-12 03:07:28,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:28,687 INFO L182 omatonBuilderFactory]: Interpolants [46976#(<= main_~i~0 71), 46977#(<= main_~i~0 72), 46978#(<= main_~i~0 73), 46979#(<= main_~i~0 74), 46980#(<= main_~i~0 75), 46981#(<= main_~i~0 76), 46982#(<= main_~i~0 77), 46983#(<= main_~i~0 78), 46984#(<= main_~i~0 79), 46985#(<= main_~i~0 80), 46986#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 46987#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 46988#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 46903#true, 46904#false, 46905#(<= main_~i~0 0), 46906#(<= main_~i~0 1), 46907#(<= main_~i~0 2), 46908#(<= main_~i~0 3), 46909#(<= main_~i~0 4), 46910#(<= main_~i~0 5), 46911#(<= main_~i~0 6), 46912#(<= main_~i~0 7), 46913#(<= main_~i~0 8), 46914#(<= main_~i~0 9), 46915#(<= main_~i~0 10), 46916#(<= main_~i~0 11), 46917#(<= main_~i~0 12), 46918#(<= main_~i~0 13), 46919#(<= main_~i~0 14), 46920#(<= main_~i~0 15), 46921#(<= main_~i~0 16), 46922#(<= main_~i~0 17), 46923#(<= main_~i~0 18), 46924#(<= main_~i~0 19), 46925#(<= main_~i~0 20), 46926#(<= main_~i~0 21), 46927#(<= main_~i~0 22), 46928#(<= main_~i~0 23), 46929#(<= main_~i~0 24), 46930#(<= main_~i~0 25), 46931#(<= main_~i~0 26), 46932#(<= main_~i~0 27), 46933#(<= main_~i~0 28), 46934#(<= main_~i~0 29), 46935#(<= main_~i~0 30), 46936#(<= main_~i~0 31), 46937#(<= main_~i~0 32), 46938#(<= main_~i~0 33), 46939#(<= main_~i~0 34), 46940#(<= main_~i~0 35), 46941#(<= main_~i~0 36), 46942#(<= main_~i~0 37), 46943#(<= main_~i~0 38), 46944#(<= main_~i~0 39), 46945#(<= main_~i~0 40), 46946#(<= main_~i~0 41), 46947#(<= main_~i~0 42), 46948#(<= main_~i~0 43), 46949#(<= main_~i~0 44), 46950#(<= main_~i~0 45), 46951#(<= main_~i~0 46), 46952#(<= main_~i~0 47), 46953#(<= main_~i~0 48), 46954#(<= main_~i~0 49), 46955#(<= main_~i~0 50), 46956#(<= main_~i~0 51), 46957#(<= main_~i~0 52), 46958#(<= main_~i~0 53), 46959#(<= main_~i~0 54), 46960#(<= main_~i~0 55), 46961#(<= main_~i~0 56), 46962#(<= main_~i~0 57), 46963#(<= main_~i~0 58), 46964#(<= main_~i~0 59), 46965#(<= main_~i~0 60), 46966#(<= main_~i~0 61), 46967#(<= main_~i~0 62), 46968#(<= main_~i~0 63), 46969#(<= main_~i~0 64), 46970#(<= main_~i~0 65), 46971#(<= main_~i~0 66), 46972#(<= main_~i~0 67), 46973#(<= main_~i~0 68), 46974#(<= main_~i~0 69), 46975#(<= main_~i~0 70)] [2018-04-12 03:07:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:28,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-12 03:07:28,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-12 03:07:28,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3410, Invalid=3900, Unknown=0, NotChecked=0, Total=7310 [2018-04-12 03:07:28,688 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 86 states. [2018-04-12 03:07:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:30,956 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-04-12 03:07:30,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-12 03:07:30,957 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 417 [2018-04-12 03:07:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:30,958 INFO L225 Difference]: With dead ends: 428 [2018-04-12 03:07:30,958 INFO L226 Difference]: Without dead ends: 428 [2018-04-12 03:07:30,959 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=10297, Invalid=17759, Unknown=0, NotChecked=0, Total=28056 [2018-04-12 03:07:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-12 03:07:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2018-04-12 03:07:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-12 03:07:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2018-04-12 03:07:30,961 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 417 [2018-04-12 03:07:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:30,961 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2018-04-12 03:07:30,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-12 03:07:30,961 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2018-04-12 03:07:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-04-12 03:07:30,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:30,962 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:30,962 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash 886585847, now seen corresponding path program 83 times [2018-04-12 03:07:30,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:30,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:32,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:32,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-12 03:07:32,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:32,977 INFO L182 omatonBuilderFactory]: Interpolants [48009#true, 48010#false, 48011#(<= main_~i~0 0), 48012#(<= main_~i~0 1), 48013#(<= main_~i~0 2), 48014#(<= main_~i~0 3), 48015#(<= main_~i~0 4), 48016#(<= main_~i~0 5), 48017#(<= main_~i~0 6), 48018#(<= main_~i~0 7), 48019#(<= main_~i~0 8), 48020#(<= main_~i~0 9), 48021#(<= main_~i~0 10), 48022#(<= main_~i~0 11), 48023#(<= main_~i~0 12), 48024#(<= main_~i~0 13), 48025#(<= main_~i~0 14), 48026#(<= main_~i~0 15), 48027#(<= main_~i~0 16), 48028#(<= main_~i~0 17), 48029#(<= main_~i~0 18), 48030#(<= main_~i~0 19), 48031#(<= main_~i~0 20), 48032#(<= main_~i~0 21), 48033#(<= main_~i~0 22), 48034#(<= main_~i~0 23), 48035#(<= main_~i~0 24), 48036#(<= main_~i~0 25), 48037#(<= main_~i~0 26), 48038#(<= main_~i~0 27), 48039#(<= main_~i~0 28), 48040#(<= main_~i~0 29), 48041#(<= main_~i~0 30), 48042#(<= main_~i~0 31), 48043#(<= main_~i~0 32), 48044#(<= main_~i~0 33), 48045#(<= main_~i~0 34), 48046#(<= main_~i~0 35), 48047#(<= main_~i~0 36), 48048#(<= main_~i~0 37), 48049#(<= main_~i~0 38), 48050#(<= main_~i~0 39), 48051#(<= main_~i~0 40), 48052#(<= main_~i~0 41), 48053#(<= main_~i~0 42), 48054#(<= main_~i~0 43), 48055#(<= main_~i~0 44), 48056#(<= main_~i~0 45), 48057#(<= main_~i~0 46), 48058#(<= main_~i~0 47), 48059#(<= main_~i~0 48), 48060#(<= main_~i~0 49), 48061#(<= main_~i~0 50), 48062#(<= main_~i~0 51), 48063#(<= main_~i~0 52), 48064#(<= main_~i~0 53), 48065#(<= main_~i~0 54), 48066#(<= main_~i~0 55), 48067#(<= main_~i~0 56), 48068#(<= main_~i~0 57), 48069#(<= main_~i~0 58), 48070#(<= main_~i~0 59), 48071#(<= main_~i~0 60), 48072#(<= main_~i~0 61), 48073#(<= main_~i~0 62), 48074#(<= main_~i~0 63), 48075#(<= main_~i~0 64), 48076#(<= main_~i~0 65), 48077#(<= main_~i~0 66), 48078#(<= main_~i~0 67), 48079#(<= main_~i~0 68), 48080#(<= main_~i~0 69), 48081#(<= main_~i~0 70), 48082#(<= main_~i~0 71), 48083#(<= main_~i~0 72), 48084#(<= main_~i~0 73), 48085#(<= main_~i~0 74), 48086#(<= main_~i~0 75), 48087#(<= main_~i~0 76), 48088#(<= main_~i~0 77), 48089#(<= main_~i~0 78), 48090#(<= main_~i~0 79), 48091#(<= main_~i~0 80), 48092#(<= main_~i~0 81), 48093#(<= main_~i~0 82), 48094#(and (<= 0 main_~i~0) (<= main_~i~0 82)), 48095#(and (<= 1 main_~i~0) (<= main_~i~0 83))] [2018-04-12 03:07:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:32,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-12 03:07:32,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-12 03:07:32,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3575, Invalid=3907, Unknown=0, NotChecked=0, Total=7482 [2018-04-12 03:07:32,978 INFO L87 Difference]: Start difference. First operand 428 states and 428 transitions. Second operand 87 states. [2018-04-12 03:07:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:35,143 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-04-12 03:07:35,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-12 03:07:35,143 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 422 [2018-04-12 03:07:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:35,144 INFO L225 Difference]: With dead ends: 433 [2018-04-12 03:07:35,144 INFO L226 Difference]: Without dead ends: 433 [2018-04-12 03:07:35,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=10713, Invalid=18017, Unknown=0, NotChecked=0, Total=28730 [2018-04-12 03:07:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-12 03:07:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-12 03:07:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-12 03:07:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-04-12 03:07:35,147 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 422 [2018-04-12 03:07:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:35,147 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-04-12 03:07:35,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-12 03:07:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-04-12 03:07:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-12 03:07:35,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:35,149 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:35,149 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -15675034, now seen corresponding path program 84 times [2018-04-12 03:07:35,149 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:35,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:37,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:37,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-12 03:07:37,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:37,212 INFO L182 omatonBuilderFactory]: Interpolants [49152#(<= main_~i~0 22), 49153#(<= main_~i~0 23), 49154#(<= main_~i~0 24), 49155#(<= main_~i~0 25), 49156#(<= main_~i~0 26), 49157#(<= main_~i~0 27), 49158#(<= main_~i~0 28), 49159#(<= main_~i~0 29), 49160#(<= main_~i~0 30), 49161#(<= main_~i~0 31), 49162#(<= main_~i~0 32), 49163#(<= main_~i~0 33), 49164#(<= main_~i~0 34), 49165#(<= main_~i~0 35), 49166#(<= main_~i~0 36), 49167#(<= main_~i~0 37), 49168#(<= main_~i~0 38), 49169#(<= main_~i~0 39), 49170#(<= main_~i~0 40), 49171#(<= main_~i~0 41), 49172#(<= main_~i~0 42), 49173#(<= main_~i~0 43), 49174#(<= main_~i~0 44), 49175#(<= main_~i~0 45), 49176#(<= main_~i~0 46), 49177#(<= main_~i~0 47), 49178#(<= main_~i~0 48), 49179#(<= main_~i~0 49), 49180#(<= main_~i~0 50), 49181#(<= main_~i~0 51), 49182#(<= main_~i~0 52), 49183#(<= main_~i~0 53), 49184#(<= main_~i~0 54), 49185#(<= main_~i~0 55), 49186#(<= main_~i~0 56), 49187#(<= main_~i~0 57), 49188#(<= main_~i~0 58), 49189#(<= main_~i~0 59), 49190#(<= main_~i~0 60), 49191#(<= main_~i~0 61), 49192#(<= main_~i~0 62), 49193#(<= main_~i~0 63), 49194#(<= main_~i~0 64), 49195#(<= main_~i~0 65), 49196#(<= main_~i~0 66), 49197#(<= main_~i~0 67), 49198#(<= main_~i~0 68), 49199#(<= main_~i~0 69), 49200#(<= main_~i~0 70), 49201#(<= main_~i~0 71), 49202#(<= main_~i~0 72), 49203#(<= main_~i~0 73), 49204#(<= main_~i~0 74), 49205#(<= main_~i~0 75), 49206#(<= main_~i~0 76), 49207#(<= main_~i~0 77), 49208#(<= main_~i~0 78), 49209#(<= main_~i~0 79), 49210#(<= main_~i~0 80), 49211#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 49212#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 49213#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 49214#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 49215#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 49128#true, 49129#false, 49130#(<= main_~i~0 0), 49131#(<= main_~i~0 1), 49132#(<= main_~i~0 2), 49133#(<= main_~i~0 3), 49134#(<= main_~i~0 4), 49135#(<= main_~i~0 5), 49136#(<= main_~i~0 6), 49137#(<= main_~i~0 7), 49138#(<= main_~i~0 8), 49139#(<= main_~i~0 9), 49140#(<= main_~i~0 10), 49141#(<= main_~i~0 11), 49142#(<= main_~i~0 12), 49143#(<= main_~i~0 13), 49144#(<= main_~i~0 14), 49145#(<= main_~i~0 15), 49146#(<= main_~i~0 16), 49147#(<= main_~i~0 17), 49148#(<= main_~i~0 18), 49149#(<= main_~i~0 19), 49150#(<= main_~i~0 20), 49151#(<= main_~i~0 21)] [2018-04-12 03:07:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:37,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-12 03:07:37,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-12 03:07:37,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3414, Invalid=4242, Unknown=0, NotChecked=0, Total=7656 [2018-04-12 03:07:37,214 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 88 states. [2018-04-12 03:07:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:39,932 INFO L93 Difference]: Finished difference Result 438 states and 438 transitions. [2018-04-12 03:07:39,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-12 03:07:39,932 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 427 [2018-04-12 03:07:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:39,933 INFO L225 Difference]: With dead ends: 438 [2018-04-12 03:07:39,933 INFO L226 Difference]: Without dead ends: 438 [2018-04-12 03:07:39,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3893 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10467, Invalid=18945, Unknown=0, NotChecked=0, Total=29412 [2018-04-12 03:07:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-04-12 03:07:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2018-04-12 03:07:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-12 03:07:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2018-04-12 03:07:39,937 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 427 [2018-04-12 03:07:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:39,937 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 438 transitions. [2018-04-12 03:07:39,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-12 03:07:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 438 transitions. [2018-04-12 03:07:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-04-12 03:07:39,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:39,938 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:39,938 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1091077975, now seen corresponding path program 85 times [2018-04-12 03:07:39,939 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:39,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:42,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:42,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-12 03:07:42,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:42,020 INFO L182 omatonBuilderFactory]: Interpolants [50304#(<= main_~i~0 42), 50305#(<= main_~i~0 43), 50306#(<= main_~i~0 44), 50307#(<= main_~i~0 45), 50308#(<= main_~i~0 46), 50309#(<= main_~i~0 47), 50310#(<= main_~i~0 48), 50311#(<= main_~i~0 49), 50312#(<= main_~i~0 50), 50313#(<= main_~i~0 51), 50314#(<= main_~i~0 52), 50315#(<= main_~i~0 53), 50316#(<= main_~i~0 54), 50317#(<= main_~i~0 55), 50318#(<= main_~i~0 56), 50319#(<= main_~i~0 57), 50320#(<= main_~i~0 58), 50321#(<= main_~i~0 59), 50322#(<= main_~i~0 60), 50323#(<= main_~i~0 61), 50324#(<= main_~i~0 62), 50325#(<= main_~i~0 63), 50326#(<= main_~i~0 64), 50327#(<= main_~i~0 65), 50328#(<= main_~i~0 66), 50329#(<= main_~i~0 67), 50330#(<= main_~i~0 68), 50331#(<= main_~i~0 69), 50332#(<= main_~i~0 70), 50333#(<= main_~i~0 71), 50334#(<= main_~i~0 72), 50335#(<= main_~i~0 73), 50336#(<= main_~i~0 74), 50337#(<= main_~i~0 75), 50338#(<= main_~i~0 76), 50339#(<= main_~i~0 77), 50340#(<= main_~i~0 78), 50341#(<= main_~i~0 79), 50342#(<= main_~i~0 80), 50343#(<= main_~i~0 81), 50344#(<= main_~i~0 82), 50345#(<= main_~i~0 83), 50346#(<= main_~i~0 84), 50347#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 50348#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 50260#true, 50261#false, 50262#(<= main_~i~0 0), 50263#(<= main_~i~0 1), 50264#(<= main_~i~0 2), 50265#(<= main_~i~0 3), 50266#(<= main_~i~0 4), 50267#(<= main_~i~0 5), 50268#(<= main_~i~0 6), 50269#(<= main_~i~0 7), 50270#(<= main_~i~0 8), 50271#(<= main_~i~0 9), 50272#(<= main_~i~0 10), 50273#(<= main_~i~0 11), 50274#(<= main_~i~0 12), 50275#(<= main_~i~0 13), 50276#(<= main_~i~0 14), 50277#(<= main_~i~0 15), 50278#(<= main_~i~0 16), 50279#(<= main_~i~0 17), 50280#(<= main_~i~0 18), 50281#(<= main_~i~0 19), 50282#(<= main_~i~0 20), 50283#(<= main_~i~0 21), 50284#(<= main_~i~0 22), 50285#(<= main_~i~0 23), 50286#(<= main_~i~0 24), 50287#(<= main_~i~0 25), 50288#(<= main_~i~0 26), 50289#(<= main_~i~0 27), 50290#(<= main_~i~0 28), 50291#(<= main_~i~0 29), 50292#(<= main_~i~0 30), 50293#(<= main_~i~0 31), 50294#(<= main_~i~0 32), 50295#(<= main_~i~0 33), 50296#(<= main_~i~0 34), 50297#(<= main_~i~0 35), 50298#(<= main_~i~0 36), 50299#(<= main_~i~0 37), 50300#(<= main_~i~0 38), 50301#(<= main_~i~0 39), 50302#(<= main_~i~0 40), 50303#(<= main_~i~0 41)] [2018-04-12 03:07:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:42,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-12 03:07:42,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-12 03:07:42,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3746, Invalid=4086, Unknown=0, NotChecked=0, Total=7832 [2018-04-12 03:07:42,021 INFO L87 Difference]: Start difference. First operand 438 states and 438 transitions. Second operand 89 states. [2018-04-12 03:07:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:44,240 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-04-12 03:07:44,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-12 03:07:44,241 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 432 [2018-04-12 03:07:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:44,242 INFO L225 Difference]: With dead ends: 443 [2018-04-12 03:07:44,242 INFO L226 Difference]: Without dead ends: 443 [2018-04-12 03:07:44,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=11226, Invalid=18876, Unknown=0, NotChecked=0, Total=30102 [2018-04-12 03:07:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-12 03:07:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-04-12 03:07:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-04-12 03:07:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-04-12 03:07:44,246 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 432 [2018-04-12 03:07:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:44,246 INFO L459 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-04-12 03:07:44,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-12 03:07:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-04-12 03:07:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-12 03:07:44,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:44,248 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:44,248 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 433709062, now seen corresponding path program 86 times [2018-04-12 03:07:44,248 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:44,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:46,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:46,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-12 03:07:46,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:46,396 INFO L182 omatonBuilderFactory]: Interpolants [51456#(<= main_~i~0 49), 51457#(<= main_~i~0 50), 51458#(<= main_~i~0 51), 51459#(<= main_~i~0 52), 51460#(<= main_~i~0 53), 51461#(<= main_~i~0 54), 51462#(<= main_~i~0 55), 51463#(<= main_~i~0 56), 51464#(<= main_~i~0 57), 51465#(<= main_~i~0 58), 51466#(<= main_~i~0 59), 51467#(<= main_~i~0 60), 51468#(<= main_~i~0 61), 51469#(<= main_~i~0 62), 51470#(<= main_~i~0 63), 51471#(<= main_~i~0 64), 51472#(<= main_~i~0 65), 51473#(<= main_~i~0 66), 51474#(<= main_~i~0 67), 51475#(<= main_~i~0 68), 51476#(<= main_~i~0 69), 51477#(<= main_~i~0 70), 51478#(<= main_~i~0 71), 51479#(<= main_~i~0 72), 51480#(<= main_~i~0 73), 51481#(<= main_~i~0 74), 51482#(<= main_~i~0 75), 51483#(<= main_~i~0 76), 51484#(<= main_~i~0 77), 51485#(<= main_~i~0 78), 51486#(<= main_~i~0 79), 51487#(<= main_~i~0 80), 51488#(<= main_~i~0 81), 51489#(<= main_~i~0 82), 51490#(<= main_~i~0 83), 51491#(<= main_~i~0 84), 51492#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 51493#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 51494#(and (<= main_~i~0 86) (<= 2 main_~i~0)), 51405#true, 51406#false, 51407#(<= main_~i~0 0), 51408#(<= main_~i~0 1), 51409#(<= main_~i~0 2), 51410#(<= main_~i~0 3), 51411#(<= main_~i~0 4), 51412#(<= main_~i~0 5), 51413#(<= main_~i~0 6), 51414#(<= main_~i~0 7), 51415#(<= main_~i~0 8), 51416#(<= main_~i~0 9), 51417#(<= main_~i~0 10), 51418#(<= main_~i~0 11), 51419#(<= main_~i~0 12), 51420#(<= main_~i~0 13), 51421#(<= main_~i~0 14), 51422#(<= main_~i~0 15), 51423#(<= main_~i~0 16), 51424#(<= main_~i~0 17), 51425#(<= main_~i~0 18), 51426#(<= main_~i~0 19), 51427#(<= main_~i~0 20), 51428#(<= main_~i~0 21), 51429#(<= main_~i~0 22), 51430#(<= main_~i~0 23), 51431#(<= main_~i~0 24), 51432#(<= main_~i~0 25), 51433#(<= main_~i~0 26), 51434#(<= main_~i~0 27), 51435#(<= main_~i~0 28), 51436#(<= main_~i~0 29), 51437#(<= main_~i~0 30), 51438#(<= main_~i~0 31), 51439#(<= main_~i~0 32), 51440#(<= main_~i~0 33), 51441#(<= main_~i~0 34), 51442#(<= main_~i~0 35), 51443#(<= main_~i~0 36), 51444#(<= main_~i~0 37), 51445#(<= main_~i~0 38), 51446#(<= main_~i~0 39), 51447#(<= main_~i~0 40), 51448#(<= main_~i~0 41), 51449#(<= main_~i~0 42), 51450#(<= main_~i~0 43), 51451#(<= main_~i~0 44), 51452#(<= main_~i~0 45), 51453#(<= main_~i~0 46), 51454#(<= main_~i~0 47), 51455#(<= main_~i~0 48)] [2018-04-12 03:07:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:46,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-12 03:07:46,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-12 03:07:46,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3748, Invalid=4262, Unknown=0, NotChecked=0, Total=8010 [2018-04-12 03:07:46,397 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 90 states. [2018-04-12 03:07:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:48,834 INFO L93 Difference]: Finished difference Result 448 states and 448 transitions. [2018-04-12 03:07:48,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-12 03:07:48,834 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 437 [2018-04-12 03:07:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:48,835 INFO L225 Difference]: With dead ends: 448 [2018-04-12 03:07:48,836 INFO L226 Difference]: Without dead ends: 448 [2018-04-12 03:07:48,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3910 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11315, Invalid=19485, Unknown=0, NotChecked=0, Total=30800 [2018-04-12 03:07:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-04-12 03:07:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2018-04-12 03:07:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-12 03:07:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 448 transitions. [2018-04-12 03:07:48,839 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 448 transitions. Word has length 437 [2018-04-12 03:07:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:48,839 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 448 transitions. [2018-04-12 03:07:48,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-12 03:07:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 448 transitions. [2018-04-12 03:07:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-04-12 03:07:48,840 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:48,840 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:48,840 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1891605687, now seen corresponding path program 87 times [2018-04-12 03:07:48,841 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:48,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:51,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:51,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-12 03:07:51,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:51,055 INFO L182 omatonBuilderFactory]: Interpolants [52608#(<= main_~i~0 43), 52609#(<= main_~i~0 44), 52610#(<= main_~i~0 45), 52611#(<= main_~i~0 46), 52612#(<= main_~i~0 47), 52613#(<= main_~i~0 48), 52614#(<= main_~i~0 49), 52615#(<= main_~i~0 50), 52616#(<= main_~i~0 51), 52617#(<= main_~i~0 52), 52618#(<= main_~i~0 53), 52619#(<= main_~i~0 54), 52620#(<= main_~i~0 55), 52621#(<= main_~i~0 56), 52622#(<= main_~i~0 57), 52623#(<= main_~i~0 58), 52624#(<= main_~i~0 59), 52625#(<= main_~i~0 60), 52626#(<= main_~i~0 61), 52627#(<= main_~i~0 62), 52628#(<= main_~i~0 63), 52629#(<= main_~i~0 64), 52630#(<= main_~i~0 65), 52631#(<= main_~i~0 66), 52632#(<= main_~i~0 67), 52633#(<= main_~i~0 68), 52634#(<= main_~i~0 69), 52635#(<= main_~i~0 70), 52636#(<= main_~i~0 71), 52637#(<= main_~i~0 72), 52638#(<= main_~i~0 73), 52639#(<= main_~i~0 74), 52640#(<= main_~i~0 75), 52641#(<= main_~i~0 76), 52642#(<= main_~i~0 77), 52643#(<= main_~i~0 78), 52644#(<= main_~i~0 79), 52645#(<= main_~i~0 80), 52646#(<= main_~i~0 81), 52647#(<= main_~i~0 82), 52648#(<= main_~i~0 83), 52649#(<= main_~i~0 84), 52650#(<= main_~i~0 85), 52651#(<= main_~i~0 86), 52652#(and (<= main_~i~0 86) (<= 0 main_~i~0)), 52653#(and (<= 1 main_~i~0) (<= main_~i~0 87)), 52563#true, 52564#false, 52565#(<= main_~i~0 0), 52566#(<= main_~i~0 1), 52567#(<= main_~i~0 2), 52568#(<= main_~i~0 3), 52569#(<= main_~i~0 4), 52570#(<= main_~i~0 5), 52571#(<= main_~i~0 6), 52572#(<= main_~i~0 7), 52573#(<= main_~i~0 8), 52574#(<= main_~i~0 9), 52575#(<= main_~i~0 10), 52576#(<= main_~i~0 11), 52577#(<= main_~i~0 12), 52578#(<= main_~i~0 13), 52579#(<= main_~i~0 14), 52580#(<= main_~i~0 15), 52581#(<= main_~i~0 16), 52582#(<= main_~i~0 17), 52583#(<= main_~i~0 18), 52584#(<= main_~i~0 19), 52585#(<= main_~i~0 20), 52586#(<= main_~i~0 21), 52587#(<= main_~i~0 22), 52588#(<= main_~i~0 23), 52589#(<= main_~i~0 24), 52590#(<= main_~i~0 25), 52591#(<= main_~i~0 26), 52592#(<= main_~i~0 27), 52593#(<= main_~i~0 28), 52594#(<= main_~i~0 29), 52595#(<= main_~i~0 30), 52596#(<= main_~i~0 31), 52597#(<= main_~i~0 32), 52598#(<= main_~i~0 33), 52599#(<= main_~i~0 34), 52600#(<= main_~i~0 35), 52601#(<= main_~i~0 36), 52602#(<= main_~i~0 37), 52603#(<= main_~i~0 38), 52604#(<= main_~i~0 39), 52605#(<= main_~i~0 40), 52606#(<= main_~i~0 41), 52607#(<= main_~i~0 42)] [2018-04-12 03:07:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:51,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-12 03:07:51,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-12 03:07:51,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=4269, Unknown=0, NotChecked=0, Total=8190 [2018-04-12 03:07:51,056 INFO L87 Difference]: Start difference. First operand 448 states and 448 transitions. Second operand 91 states. [2018-04-12 03:07:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:53,395 INFO L93 Difference]: Finished difference Result 453 states and 453 transitions. [2018-04-12 03:07:53,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-12 03:07:53,395 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 442 [2018-04-12 03:07:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:53,396 INFO L225 Difference]: With dead ends: 453 [2018-04-12 03:07:53,396 INFO L226 Difference]: Without dead ends: 453 [2018-04-12 03:07:53,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11751, Invalid=19755, Unknown=0, NotChecked=0, Total=31506 [2018-04-12 03:07:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-04-12 03:07:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-04-12 03:07:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-04-12 03:07:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2018-04-12 03:07:53,400 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 442 [2018-04-12 03:07:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:53,400 INFO L459 AbstractCegarLoop]: Abstraction has 453 states and 453 transitions. [2018-04-12 03:07:53,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-12 03:07:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 453 transitions. [2018-04-12 03:07:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-04-12 03:07:53,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:53,401 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:53,401 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1642518874, now seen corresponding path program 88 times [2018-04-12 03:07:53,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:53,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:07:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:55,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:07:55,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-12 03:07:55,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:07:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:55,579 INFO L182 omatonBuilderFactory]: Interpolants [53760#(<= main_~i~0 24), 53761#(<= main_~i~0 25), 53762#(<= main_~i~0 26), 53763#(<= main_~i~0 27), 53764#(<= main_~i~0 28), 53765#(<= main_~i~0 29), 53766#(<= main_~i~0 30), 53767#(<= main_~i~0 31), 53768#(<= main_~i~0 32), 53769#(<= main_~i~0 33), 53770#(<= main_~i~0 34), 53771#(<= main_~i~0 35), 53772#(<= main_~i~0 36), 53773#(<= main_~i~0 37), 53774#(<= main_~i~0 38), 53775#(<= main_~i~0 39), 53776#(<= main_~i~0 40), 53777#(<= main_~i~0 41), 53778#(<= main_~i~0 42), 53779#(<= main_~i~0 43), 53780#(<= main_~i~0 44), 53781#(<= main_~i~0 45), 53782#(<= main_~i~0 46), 53783#(<= main_~i~0 47), 53784#(<= main_~i~0 48), 53785#(<= main_~i~0 49), 53786#(<= main_~i~0 50), 53787#(<= main_~i~0 51), 53788#(<= main_~i~0 52), 53789#(<= main_~i~0 53), 53790#(<= main_~i~0 54), 53791#(<= main_~i~0 55), 53792#(<= main_~i~0 56), 53793#(<= main_~i~0 57), 53794#(<= main_~i~0 58), 53795#(<= main_~i~0 59), 53796#(<= main_~i~0 60), 53797#(<= main_~i~0 61), 53798#(<= main_~i~0 62), 53799#(<= main_~i~0 63), 53800#(<= main_~i~0 64), 53801#(<= main_~i~0 65), 53802#(<= main_~i~0 66), 53803#(<= main_~i~0 67), 53804#(<= main_~i~0 68), 53805#(<= main_~i~0 69), 53806#(<= main_~i~0 70), 53807#(<= main_~i~0 71), 53808#(<= main_~i~0 72), 53809#(<= main_~i~0 73), 53810#(<= main_~i~0 74), 53811#(<= main_~i~0 75), 53812#(<= main_~i~0 76), 53813#(<= main_~i~0 77), 53814#(<= main_~i~0 78), 53815#(<= main_~i~0 79), 53816#(<= main_~i~0 80), 53817#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 53818#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 53819#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 53820#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 53821#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 53822#(and (<= 5 main_~i~0) (<= main_~i~0 85)), 53823#(and (<= main_~i~0 86) (<= 6 main_~i~0)), 53824#(and (<= 7 main_~i~0) (<= main_~i~0 87)), 53825#(and (<= 8 main_~i~0) (<= main_~i~0 88)), 53734#true, 53735#false, 53736#(<= main_~i~0 0), 53737#(<= main_~i~0 1), 53738#(<= main_~i~0 2), 53739#(<= main_~i~0 3), 53740#(<= main_~i~0 4), 53741#(<= main_~i~0 5), 53742#(<= main_~i~0 6), 53743#(<= main_~i~0 7), 53744#(<= main_~i~0 8), 53745#(<= main_~i~0 9), 53746#(<= main_~i~0 10), 53747#(<= main_~i~0 11), 53748#(<= main_~i~0 12), 53749#(<= main_~i~0 13), 53750#(<= main_~i~0 14), 53751#(<= main_~i~0 15), 53752#(<= main_~i~0 16), 53753#(<= main_~i~0 17), 53754#(<= main_~i~0 18), 53755#(<= main_~i~0 19), 53756#(<= main_~i~0 20), 53757#(<= main_~i~0 21), 53758#(<= main_~i~0 22), 53759#(<= main_~i~0 23)] [2018-04-12 03:07:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:07:55,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-12 03:07:55,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-12 03:07:55,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3422, Invalid=4950, Unknown=0, NotChecked=0, Total=8372 [2018-04-12 03:07:55,580 INFO L87 Difference]: Start difference. First operand 453 states and 453 transitions. Second operand 92 states. [2018-04-12 03:07:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:07:59,252 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-04-12 03:07:59,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-12 03:07:59,253 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 447 [2018-04-12 03:07:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:07:59,254 INFO L225 Difference]: With dead ends: 458 [2018-04-12 03:07:59,254 INFO L226 Difference]: Without dead ends: 458 [2018-04-12 03:07:59,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=10807, Invalid=21413, Unknown=0, NotChecked=0, Total=32220 [2018-04-12 03:07:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-12 03:07:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2018-04-12 03:07:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-12 03:07:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-04-12 03:07:59,257 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 447 [2018-04-12 03:07:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:07:59,257 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-04-12 03:07:59,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-12 03:07:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-04-12 03:07:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-04-12 03:07:59,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:07:59,258 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-04-12 03:07:59,258 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:07:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1076066839, now seen corresponding path program 89 times [2018-04-12 03:07:59,259 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:07:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:07:59,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:01,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:01,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-12 03:08:01,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:01,607 INFO L182 omatonBuilderFactory]: Interpolants [54918#true, 54919#false, 54920#(<= main_~i~0 0), 54921#(<= main_~i~0 1), 54922#(<= main_~i~0 2), 54923#(<= main_~i~0 3), 54924#(<= main_~i~0 4), 54925#(<= main_~i~0 5), 54926#(<= main_~i~0 6), 54927#(<= main_~i~0 7), 54928#(<= main_~i~0 8), 54929#(<= main_~i~0 9), 54930#(<= main_~i~0 10), 54931#(<= main_~i~0 11), 54932#(<= main_~i~0 12), 54933#(<= main_~i~0 13), 54934#(<= main_~i~0 14), 54935#(<= main_~i~0 15), 54936#(<= main_~i~0 16), 54937#(<= main_~i~0 17), 54938#(<= main_~i~0 18), 54939#(<= main_~i~0 19), 54940#(<= main_~i~0 20), 54941#(<= main_~i~0 21), 54942#(<= main_~i~0 22), 54943#(<= main_~i~0 23), 54944#(<= main_~i~0 24), 54945#(<= main_~i~0 25), 54946#(<= main_~i~0 26), 54947#(<= main_~i~0 27), 54948#(<= main_~i~0 28), 54949#(<= main_~i~0 29), 54950#(<= main_~i~0 30), 54951#(<= main_~i~0 31), 54952#(<= main_~i~0 32), 54953#(<= main_~i~0 33), 54954#(<= main_~i~0 34), 54955#(<= main_~i~0 35), 54956#(<= main_~i~0 36), 54957#(<= main_~i~0 37), 54958#(<= main_~i~0 38), 54959#(<= main_~i~0 39), 54960#(<= main_~i~0 40), 54961#(<= main_~i~0 41), 54962#(<= main_~i~0 42), 54963#(<= main_~i~0 43), 54964#(<= main_~i~0 44), 54965#(<= main_~i~0 45), 54966#(<= main_~i~0 46), 54967#(<= main_~i~0 47), 54968#(<= main_~i~0 48), 54969#(<= main_~i~0 49), 54970#(<= main_~i~0 50), 54971#(<= main_~i~0 51), 54972#(<= main_~i~0 52), 54973#(<= main_~i~0 53), 54974#(<= main_~i~0 54), 54975#(<= main_~i~0 55), 54976#(<= main_~i~0 56), 54977#(<= main_~i~0 57), 54978#(<= main_~i~0 58), 54979#(<= main_~i~0 59), 54980#(<= main_~i~0 60), 54981#(<= main_~i~0 61), 54982#(<= main_~i~0 62), 54983#(<= main_~i~0 63), 54984#(<= main_~i~0 64), 54985#(<= main_~i~0 65), 54986#(<= main_~i~0 66), 54987#(<= main_~i~0 67), 54988#(<= main_~i~0 68), 54989#(<= main_~i~0 69), 54990#(<= main_~i~0 70), 54991#(<= main_~i~0 71), 54992#(<= main_~i~0 72), 54993#(<= main_~i~0 73), 54994#(<= main_~i~0 74), 54995#(<= main_~i~0 75), 54996#(<= main_~i~0 76), 54997#(<= main_~i~0 77), 54998#(<= main_~i~0 78), 54999#(<= main_~i~0 79), 55000#(<= main_~i~0 80), 55001#(<= main_~i~0 81), 55002#(<= main_~i~0 82), 55003#(<= main_~i~0 83), 55004#(<= main_~i~0 84), 55005#(<= main_~i~0 85), 55006#(<= main_~i~0 86), 55007#(<= main_~i~0 87), 55008#(<= main_~i~0 88), 55009#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 55010#(and (<= 1 main_~i~0) (<= main_~i~0 89))] [2018-04-12 03:08:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:01,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-12 03:08:01,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-12 03:08:01,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4100, Invalid=4456, Unknown=0, NotChecked=0, Total=8556 [2018-04-12 03:08:01,609 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 93 states. [2018-04-12 03:08:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:04,184 INFO L93 Difference]: Finished difference Result 463 states and 463 transitions. [2018-04-12 03:08:04,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-12 03:08:04,184 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 452 [2018-04-12 03:08:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:04,185 INFO L225 Difference]: With dead ends: 463 [2018-04-12 03:08:04,185 INFO L226 Difference]: Without dead ends: 463 [2018-04-12 03:08:04,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=12288, Invalid=20654, Unknown=0, NotChecked=0, Total=32942 [2018-04-12 03:08:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-12 03:08:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-04-12 03:08:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-12 03:08:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 463 transitions. [2018-04-12 03:08:04,188 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 463 transitions. Word has length 452 [2018-04-12 03:08:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:04,188 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 463 transitions. [2018-04-12 03:08:04,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-12 03:08:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 463 transitions. [2018-04-12 03:08:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-04-12 03:08:04,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:04,190 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:04,190 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1217878714, now seen corresponding path program 90 times [2018-04-12 03:08:04,190 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:04,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:06,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:06,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-12 03:08:06,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:06,536 INFO L182 omatonBuilderFactory]: Interpolants [56192#(<= main_~i~0 75), 56193#(<= main_~i~0 76), 56194#(<= main_~i~0 77), 56195#(<= main_~i~0 78), 56196#(<= main_~i~0 79), 56197#(<= main_~i~0 80), 56198#(<= main_~i~0 81), 56199#(<= main_~i~0 82), 56200#(<= main_~i~0 83), 56201#(<= main_~i~0 84), 56202#(<= main_~i~0 85), 56203#(<= main_~i~0 86), 56204#(<= main_~i~0 87), 56205#(<= main_~i~0 88), 56206#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 56207#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 56208#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 56115#true, 56116#false, 56117#(<= main_~i~0 0), 56118#(<= main_~i~0 1), 56119#(<= main_~i~0 2), 56120#(<= main_~i~0 3), 56121#(<= main_~i~0 4), 56122#(<= main_~i~0 5), 56123#(<= main_~i~0 6), 56124#(<= main_~i~0 7), 56125#(<= main_~i~0 8), 56126#(<= main_~i~0 9), 56127#(<= main_~i~0 10), 56128#(<= main_~i~0 11), 56129#(<= main_~i~0 12), 56130#(<= main_~i~0 13), 56131#(<= main_~i~0 14), 56132#(<= main_~i~0 15), 56133#(<= main_~i~0 16), 56134#(<= main_~i~0 17), 56135#(<= main_~i~0 18), 56136#(<= main_~i~0 19), 56137#(<= main_~i~0 20), 56138#(<= main_~i~0 21), 56139#(<= main_~i~0 22), 56140#(<= main_~i~0 23), 56141#(<= main_~i~0 24), 56142#(<= main_~i~0 25), 56143#(<= main_~i~0 26), 56144#(<= main_~i~0 27), 56145#(<= main_~i~0 28), 56146#(<= main_~i~0 29), 56147#(<= main_~i~0 30), 56148#(<= main_~i~0 31), 56149#(<= main_~i~0 32), 56150#(<= main_~i~0 33), 56151#(<= main_~i~0 34), 56152#(<= main_~i~0 35), 56153#(<= main_~i~0 36), 56154#(<= main_~i~0 37), 56155#(<= main_~i~0 38), 56156#(<= main_~i~0 39), 56157#(<= main_~i~0 40), 56158#(<= main_~i~0 41), 56159#(<= main_~i~0 42), 56160#(<= main_~i~0 43), 56161#(<= main_~i~0 44), 56162#(<= main_~i~0 45), 56163#(<= main_~i~0 46), 56164#(<= main_~i~0 47), 56165#(<= main_~i~0 48), 56166#(<= main_~i~0 49), 56167#(<= main_~i~0 50), 56168#(<= main_~i~0 51), 56169#(<= main_~i~0 52), 56170#(<= main_~i~0 53), 56171#(<= main_~i~0 54), 56172#(<= main_~i~0 55), 56173#(<= main_~i~0 56), 56174#(<= main_~i~0 57), 56175#(<= main_~i~0 58), 56176#(<= main_~i~0 59), 56177#(<= main_~i~0 60), 56178#(<= main_~i~0 61), 56179#(<= main_~i~0 62), 56180#(<= main_~i~0 63), 56181#(<= main_~i~0 64), 56182#(<= main_~i~0 65), 56183#(<= main_~i~0 66), 56184#(<= main_~i~0 67), 56185#(<= main_~i~0 68), 56186#(<= main_~i~0 69), 56187#(<= main_~i~0 70), 56188#(<= main_~i~0 71), 56189#(<= main_~i~0 72), 56190#(<= main_~i~0 73), 56191#(<= main_~i~0 74)] [2018-04-12 03:08:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:06,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-12 03:08:06,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-12 03:08:06,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4102, Invalid=4640, Unknown=0, NotChecked=0, Total=8742 [2018-04-12 03:08:06,537 INFO L87 Difference]: Start difference. First operand 463 states and 463 transitions. Second operand 94 states. [2018-04-12 03:08:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:09,193 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-04-12 03:08:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-12 03:08:09,194 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 457 [2018-04-12 03:08:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:09,195 INFO L225 Difference]: With dead ends: 468 [2018-04-12 03:08:09,195 INFO L226 Difference]: Without dead ends: 468 [2018-04-12 03:08:09,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4272 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=12381, Invalid=21291, Unknown=0, NotChecked=0, Total=33672 [2018-04-12 03:08:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-04-12 03:08:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2018-04-12 03:08:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-12 03:08:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 468 transitions. [2018-04-12 03:08:09,197 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 468 transitions. Word has length 457 [2018-04-12 03:08:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:09,198 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 468 transitions. [2018-04-12 03:08:09,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-12 03:08:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 468 transitions. [2018-04-12 03:08:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-04-12 03:08:09,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:09,199 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:09,199 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:09,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1277550729, now seen corresponding path program 91 times [2018-04-12 03:08:09,199 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:09,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:11,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:11,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-12 03:08:11,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:11,619 INFO L182 omatonBuilderFactory]: Interpolants [57344#(<= main_~i~0 17), 57345#(<= main_~i~0 18), 57346#(<= main_~i~0 19), 57347#(<= main_~i~0 20), 57348#(<= main_~i~0 21), 57349#(<= main_~i~0 22), 57350#(<= main_~i~0 23), 57351#(<= main_~i~0 24), 57352#(<= main_~i~0 25), 57353#(<= main_~i~0 26), 57354#(<= main_~i~0 27), 57355#(<= main_~i~0 28), 57356#(<= main_~i~0 29), 57357#(<= main_~i~0 30), 57358#(<= main_~i~0 31), 57359#(<= main_~i~0 32), 57360#(<= main_~i~0 33), 57361#(<= main_~i~0 34), 57362#(<= main_~i~0 35), 57363#(<= main_~i~0 36), 57364#(<= main_~i~0 37), 57365#(<= main_~i~0 38), 57366#(<= main_~i~0 39), 57367#(<= main_~i~0 40), 57368#(<= main_~i~0 41), 57369#(<= main_~i~0 42), 57370#(<= main_~i~0 43), 57371#(<= main_~i~0 44), 57372#(<= main_~i~0 45), 57373#(<= main_~i~0 46), 57374#(<= main_~i~0 47), 57375#(<= main_~i~0 48), 57376#(<= main_~i~0 49), 57377#(<= main_~i~0 50), 57378#(<= main_~i~0 51), 57379#(<= main_~i~0 52), 57380#(<= main_~i~0 53), 57381#(<= main_~i~0 54), 57382#(<= main_~i~0 55), 57383#(<= main_~i~0 56), 57384#(<= main_~i~0 57), 57385#(<= main_~i~0 58), 57386#(<= main_~i~0 59), 57387#(<= main_~i~0 60), 57388#(<= main_~i~0 61), 57389#(<= main_~i~0 62), 57390#(<= main_~i~0 63), 57391#(<= main_~i~0 64), 57392#(<= main_~i~0 65), 57393#(<= main_~i~0 66), 57394#(<= main_~i~0 67), 57395#(<= main_~i~0 68), 57396#(<= main_~i~0 69), 57397#(<= main_~i~0 70), 57398#(<= main_~i~0 71), 57399#(<= main_~i~0 72), 57400#(<= main_~i~0 73), 57401#(<= main_~i~0 74), 57402#(<= main_~i~0 75), 57403#(<= main_~i~0 76), 57404#(<= main_~i~0 77), 57405#(<= main_~i~0 78), 57406#(<= main_~i~0 79), 57407#(<= main_~i~0 80), 57408#(<= main_~i~0 81), 57409#(<= main_~i~0 82), 57410#(<= main_~i~0 83), 57411#(<= main_~i~0 84), 57412#(<= main_~i~0 85), 57413#(<= main_~i~0 86), 57414#(<= main_~i~0 87), 57415#(<= main_~i~0 88), 57416#(<= main_~i~0 89), 57417#(<= main_~i~0 90), 57418#(and (<= 0 main_~i~0) (<= main_~i~0 90)), 57419#(and (<= main_~i~0 91) (<= 1 main_~i~0)), 57325#true, 57326#false, 57327#(<= main_~i~0 0), 57328#(<= main_~i~0 1), 57329#(<= main_~i~0 2), 57330#(<= main_~i~0 3), 57331#(<= main_~i~0 4), 57332#(<= main_~i~0 5), 57333#(<= main_~i~0 6), 57334#(<= main_~i~0 7), 57335#(<= main_~i~0 8), 57336#(<= main_~i~0 9), 57337#(<= main_~i~0 10), 57338#(<= main_~i~0 11), 57339#(<= main_~i~0 12), 57340#(<= main_~i~0 13), 57341#(<= main_~i~0 14), 57342#(<= main_~i~0 15), 57343#(<= main_~i~0 16)] [2018-04-12 03:08:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:11,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-12 03:08:11,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-12 03:08:11,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4283, Invalid=4647, Unknown=0, NotChecked=0, Total=8930 [2018-04-12 03:08:11,620 INFO L87 Difference]: Start difference. First operand 468 states and 468 transitions. Second operand 95 states. [2018-04-12 03:08:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:14,197 INFO L93 Difference]: Finished difference Result 473 states and 473 transitions. [2018-04-12 03:08:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-12 03:08:14,197 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 462 [2018-04-12 03:08:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:14,198 INFO L225 Difference]: With dead ends: 473 [2018-04-12 03:08:14,198 INFO L226 Difference]: Without dead ends: 473 [2018-04-12 03:08:14,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=12837, Invalid=21573, Unknown=0, NotChecked=0, Total=34410 [2018-04-12 03:08:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-04-12 03:08:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2018-04-12 03:08:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-12 03:08:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-04-12 03:08:14,202 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 462 [2018-04-12 03:08:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:14,202 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-04-12 03:08:14,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-12 03:08:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-04-12 03:08:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-12 03:08:14,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:14,203 INFO L355 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:14,203 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:14,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1491229670, now seen corresponding path program 92 times [2018-04-12 03:08:14,204 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:14,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:16,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:16,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-04-12 03:08:16,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:16,666 INFO L182 omatonBuilderFactory]: Interpolants [58624#(<= main_~i~0 74), 58625#(<= main_~i~0 75), 58626#(<= main_~i~0 76), 58627#(<= main_~i~0 77), 58628#(<= main_~i~0 78), 58629#(<= main_~i~0 79), 58630#(<= main_~i~0 80), 58631#(<= main_~i~0 81), 58632#(<= main_~i~0 82), 58633#(<= main_~i~0 83), 58634#(<= main_~i~0 84), 58635#(<= main_~i~0 85), 58636#(<= main_~i~0 86), 58637#(<= main_~i~0 87), 58638#(<= main_~i~0 88), 58639#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 58640#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 58641#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 58642#(and (<= main_~i~0 91) (<= 3 main_~i~0)), 58643#(and (<= 4 main_~i~0) (<= main_~i~0 92)), 58548#true, 58549#false, 58550#(<= main_~i~0 0), 58551#(<= main_~i~0 1), 58552#(<= main_~i~0 2), 58553#(<= main_~i~0 3), 58554#(<= main_~i~0 4), 58555#(<= main_~i~0 5), 58556#(<= main_~i~0 6), 58557#(<= main_~i~0 7), 58558#(<= main_~i~0 8), 58559#(<= main_~i~0 9), 58560#(<= main_~i~0 10), 58561#(<= main_~i~0 11), 58562#(<= main_~i~0 12), 58563#(<= main_~i~0 13), 58564#(<= main_~i~0 14), 58565#(<= main_~i~0 15), 58566#(<= main_~i~0 16), 58567#(<= main_~i~0 17), 58568#(<= main_~i~0 18), 58569#(<= main_~i~0 19), 58570#(<= main_~i~0 20), 58571#(<= main_~i~0 21), 58572#(<= main_~i~0 22), 58573#(<= main_~i~0 23), 58574#(<= main_~i~0 24), 58575#(<= main_~i~0 25), 58576#(<= main_~i~0 26), 58577#(<= main_~i~0 27), 58578#(<= main_~i~0 28), 58579#(<= main_~i~0 29), 58580#(<= main_~i~0 30), 58581#(<= main_~i~0 31), 58582#(<= main_~i~0 32), 58583#(<= main_~i~0 33), 58584#(<= main_~i~0 34), 58585#(<= main_~i~0 35), 58586#(<= main_~i~0 36), 58587#(<= main_~i~0 37), 58588#(<= main_~i~0 38), 58589#(<= main_~i~0 39), 58590#(<= main_~i~0 40), 58591#(<= main_~i~0 41), 58592#(<= main_~i~0 42), 58593#(<= main_~i~0 43), 58594#(<= main_~i~0 44), 58595#(<= main_~i~0 45), 58596#(<= main_~i~0 46), 58597#(<= main_~i~0 47), 58598#(<= main_~i~0 48), 58599#(<= main_~i~0 49), 58600#(<= main_~i~0 50), 58601#(<= main_~i~0 51), 58602#(<= main_~i~0 52), 58603#(<= main_~i~0 53), 58604#(<= main_~i~0 54), 58605#(<= main_~i~0 55), 58606#(<= main_~i~0 56), 58607#(<= main_~i~0 57), 58608#(<= main_~i~0 58), 58609#(<= main_~i~0 59), 58610#(<= main_~i~0 60), 58611#(<= main_~i~0 61), 58612#(<= main_~i~0 62), 58613#(<= main_~i~0 63), 58614#(<= main_~i~0 64), 58615#(<= main_~i~0 65), 58616#(<= main_~i~0 66), 58617#(<= main_~i~0 67), 58618#(<= main_~i~0 68), 58619#(<= main_~i~0 69), 58620#(<= main_~i~0 70), 58621#(<= main_~i~0 71), 58622#(<= main_~i~0 72), 58623#(<= main_~i~0 73)] [2018-04-12 03:08:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:16,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-12 03:08:16,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-12 03:08:16,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4106, Invalid=5014, Unknown=0, NotChecked=0, Total=9120 [2018-04-12 03:08:16,667 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 96 states. [2018-04-12 03:08:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:19,841 INFO L93 Difference]: Finished difference Result 478 states and 478 transitions. [2018-04-12 03:08:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-12 03:08:19,842 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 467 [2018-04-12 03:08:19,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:19,843 INFO L225 Difference]: With dead ends: 478 [2018-04-12 03:08:19,843 INFO L226 Difference]: Without dead ends: 478 [2018-04-12 03:08:19,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4633 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=12567, Invalid=22589, Unknown=0, NotChecked=0, Total=35156 [2018-04-12 03:08:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-04-12 03:08:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2018-04-12 03:08:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-04-12 03:08:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 478 transitions. [2018-04-12 03:08:19,847 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 478 transitions. Word has length 467 [2018-04-12 03:08:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:19,847 INFO L459 AbstractCegarLoop]: Abstraction has 478 states and 478 transitions. [2018-04-12 03:08:19,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-12 03:08:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 478 transitions. [2018-04-12 03:08:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-04-12 03:08:19,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:19,848 INFO L355 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:19,848 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1190556457, now seen corresponding path program 93 times [2018-04-12 03:08:19,849 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:19,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:22,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:22,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-12 03:08:22,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:22,409 INFO L182 omatonBuilderFactory]: Interpolants [59784#true, 59785#false, 59786#(<= main_~i~0 0), 59787#(<= main_~i~0 1), 59788#(<= main_~i~0 2), 59789#(<= main_~i~0 3), 59790#(<= main_~i~0 4), 59791#(<= main_~i~0 5), 59792#(<= main_~i~0 6), 59793#(<= main_~i~0 7), 59794#(<= main_~i~0 8), 59795#(<= main_~i~0 9), 59796#(<= main_~i~0 10), 59797#(<= main_~i~0 11), 59798#(<= main_~i~0 12), 59799#(<= main_~i~0 13), 59800#(<= main_~i~0 14), 59801#(<= main_~i~0 15), 59802#(<= main_~i~0 16), 59803#(<= main_~i~0 17), 59804#(<= main_~i~0 18), 59805#(<= main_~i~0 19), 59806#(<= main_~i~0 20), 59807#(<= main_~i~0 21), 59808#(<= main_~i~0 22), 59809#(<= main_~i~0 23), 59810#(<= main_~i~0 24), 59811#(<= main_~i~0 25), 59812#(<= main_~i~0 26), 59813#(<= main_~i~0 27), 59814#(<= main_~i~0 28), 59815#(<= main_~i~0 29), 59816#(<= main_~i~0 30), 59817#(<= main_~i~0 31), 59818#(<= main_~i~0 32), 59819#(<= main_~i~0 33), 59820#(<= main_~i~0 34), 59821#(<= main_~i~0 35), 59822#(<= main_~i~0 36), 59823#(<= main_~i~0 37), 59824#(<= main_~i~0 38), 59825#(<= main_~i~0 39), 59826#(<= main_~i~0 40), 59827#(<= main_~i~0 41), 59828#(<= main_~i~0 42), 59829#(<= main_~i~0 43), 59830#(<= main_~i~0 44), 59831#(<= main_~i~0 45), 59832#(<= main_~i~0 46), 59833#(<= main_~i~0 47), 59834#(<= main_~i~0 48), 59835#(<= main_~i~0 49), 59836#(<= main_~i~0 50), 59837#(<= main_~i~0 51), 59838#(<= main_~i~0 52), 59839#(<= main_~i~0 53), 59840#(<= main_~i~0 54), 59841#(<= main_~i~0 55), 59842#(<= main_~i~0 56), 59843#(<= main_~i~0 57), 59844#(<= main_~i~0 58), 59845#(<= main_~i~0 59), 59846#(<= main_~i~0 60), 59847#(<= main_~i~0 61), 59848#(<= main_~i~0 62), 59849#(<= main_~i~0 63), 59850#(<= main_~i~0 64), 59851#(<= main_~i~0 65), 59852#(<= main_~i~0 66), 59853#(<= main_~i~0 67), 59854#(<= main_~i~0 68), 59855#(<= main_~i~0 69), 59856#(<= main_~i~0 70), 59857#(<= main_~i~0 71), 59858#(<= main_~i~0 72), 59859#(<= main_~i~0 73), 59860#(<= main_~i~0 74), 59861#(<= main_~i~0 75), 59862#(<= main_~i~0 76), 59863#(<= main_~i~0 77), 59864#(<= main_~i~0 78), 59865#(<= main_~i~0 79), 59866#(<= main_~i~0 80), 59867#(<= main_~i~0 81), 59868#(<= main_~i~0 82), 59869#(<= main_~i~0 83), 59870#(<= main_~i~0 84), 59871#(<= main_~i~0 85), 59872#(<= main_~i~0 86), 59873#(<= main_~i~0 87), 59874#(<= main_~i~0 88), 59875#(<= main_~i~0 89), 59876#(<= main_~i~0 90), 59877#(<= main_~i~0 91), 59878#(<= main_~i~0 92), 59879#(and (<= 0 main_~i~0) (<= main_~i~0 92)), 59880#(and (<= 1 main_~i~0) (<= main_~i~0 93))] [2018-04-12 03:08:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:22,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-12 03:08:22,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-12 03:08:22,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4470, Invalid=4842, Unknown=0, NotChecked=0, Total=9312 [2018-04-12 03:08:22,411 INFO L87 Difference]: Start difference. First operand 478 states and 478 transitions. Second operand 97 states. [2018-04-12 03:08:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:25,102 INFO L93 Difference]: Finished difference Result 483 states and 483 transitions. [2018-04-12 03:08:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-12 03:08:25,102 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 472 [2018-04-12 03:08:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:25,103 INFO L225 Difference]: With dead ends: 483 [2018-04-12 03:08:25,103 INFO L226 Difference]: Without dead ends: 483 [2018-04-12 03:08:25,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=13398, Invalid=22512, Unknown=0, NotChecked=0, Total=35910 [2018-04-12 03:08:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-12 03:08:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2018-04-12 03:08:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-04-12 03:08:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 483 transitions. [2018-04-12 03:08:25,107 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 483 transitions. Word has length 472 [2018-04-12 03:08:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:25,107 INFO L459 AbstractCegarLoop]: Abstraction has 483 states and 483 transitions. [2018-04-12 03:08:25,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-12 03:08:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 483 transitions. [2018-04-12 03:08:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-04-12 03:08:25,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:25,108 INFO L355 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:25,108 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash -585086330, now seen corresponding path program 94 times [2018-04-12 03:08:25,109 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:25,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:27,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:27,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-12 03:08:27,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:27,745 INFO L182 omatonBuilderFactory]: Interpolants [61033#true, 61034#false, 61035#(<= main_~i~0 0), 61036#(<= main_~i~0 1), 61037#(<= main_~i~0 2), 61038#(<= main_~i~0 3), 61039#(<= main_~i~0 4), 61040#(<= main_~i~0 5), 61041#(<= main_~i~0 6), 61042#(<= main_~i~0 7), 61043#(<= main_~i~0 8), 61044#(<= main_~i~0 9), 61045#(<= main_~i~0 10), 61046#(<= main_~i~0 11), 61047#(<= main_~i~0 12), 61048#(<= main_~i~0 13), 61049#(<= main_~i~0 14), 61050#(<= main_~i~0 15), 61051#(<= main_~i~0 16), 61052#(<= main_~i~0 17), 61053#(<= main_~i~0 18), 61054#(<= main_~i~0 19), 61055#(<= main_~i~0 20), 61056#(<= main_~i~0 21), 61057#(<= main_~i~0 22), 61058#(<= main_~i~0 23), 61059#(<= main_~i~0 24), 61060#(<= main_~i~0 25), 61061#(<= main_~i~0 26), 61062#(<= main_~i~0 27), 61063#(<= main_~i~0 28), 61064#(<= main_~i~0 29), 61065#(<= main_~i~0 30), 61066#(<= main_~i~0 31), 61067#(<= main_~i~0 32), 61068#(<= main_~i~0 33), 61069#(<= main_~i~0 34), 61070#(<= main_~i~0 35), 61071#(<= main_~i~0 36), 61072#(<= main_~i~0 37), 61073#(<= main_~i~0 38), 61074#(<= main_~i~0 39), 61075#(<= main_~i~0 40), 61076#(<= main_~i~0 41), 61077#(<= main_~i~0 42), 61078#(<= main_~i~0 43), 61079#(<= main_~i~0 44), 61080#(<= main_~i~0 45), 61081#(<= main_~i~0 46), 61082#(<= main_~i~0 47), 61083#(<= main_~i~0 48), 61084#(<= main_~i~0 49), 61085#(<= main_~i~0 50), 61086#(<= main_~i~0 51), 61087#(<= main_~i~0 52), 61088#(<= main_~i~0 53), 61089#(<= main_~i~0 54), 61090#(<= main_~i~0 55), 61091#(<= main_~i~0 56), 61092#(<= main_~i~0 57), 61093#(<= main_~i~0 58), 61094#(<= main_~i~0 59), 61095#(<= main_~i~0 60), 61096#(<= main_~i~0 61), 61097#(<= main_~i~0 62), 61098#(<= main_~i~0 63), 61099#(<= main_~i~0 64), 61100#(<= main_~i~0 65), 61101#(<= main_~i~0 66), 61102#(<= main_~i~0 67), 61103#(<= main_~i~0 68), 61104#(<= main_~i~0 69), 61105#(<= main_~i~0 70), 61106#(<= main_~i~0 71), 61107#(<= main_~i~0 72), 61108#(<= main_~i~0 73), 61109#(<= main_~i~0 74), 61110#(<= main_~i~0 75), 61111#(<= main_~i~0 76), 61112#(<= main_~i~0 77), 61113#(<= main_~i~0 78), 61114#(<= main_~i~0 79), 61115#(<= main_~i~0 80), 61116#(<= main_~i~0 81), 61117#(<= main_~i~0 82), 61118#(<= main_~i~0 83), 61119#(<= main_~i~0 84), 61120#(<= main_~i~0 85), 61121#(<= main_~i~0 86), 61122#(<= main_~i~0 87), 61123#(<= main_~i~0 88), 61124#(<= main_~i~0 89), 61125#(<= main_~i~0 90), 61126#(<= main_~i~0 91), 61127#(<= main_~i~0 92), 61128#(and (<= 0 main_~i~0) (<= main_~i~0 92)), 61129#(and (<= 1 main_~i~0) (<= main_~i~0 93)), 61130#(and (<= 2 main_~i~0) (<= main_~i~0 94))] [2018-04-12 03:08:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:27,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-12 03:08:27,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-12 03:08:27,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4472, Invalid=5034, Unknown=0, NotChecked=0, Total=9506 [2018-04-12 03:08:27,747 INFO L87 Difference]: Start difference. First operand 483 states and 483 transitions. Second operand 98 states. [2018-04-12 03:08:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:30,715 INFO L93 Difference]: Finished difference Result 488 states and 488 transitions. [2018-04-12 03:08:30,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-12 03:08:30,715 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 477 [2018-04-12 03:08:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:30,716 INFO L225 Difference]: With dead ends: 488 [2018-04-12 03:08:30,716 INFO L226 Difference]: Without dead ends: 488 [2018-04-12 03:08:30,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4650 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=13495, Invalid=23177, Unknown=0, NotChecked=0, Total=36672 [2018-04-12 03:08:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-04-12 03:08:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2018-04-12 03:08:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-04-12 03:08:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 488 transitions. [2018-04-12 03:08:30,719 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 488 transitions. Word has length 477 [2018-04-12 03:08:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:30,720 INFO L459 AbstractCegarLoop]: Abstraction has 488 states and 488 transitions. [2018-04-12 03:08:30,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-12 03:08:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 488 transitions. [2018-04-12 03:08:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-04-12 03:08:30,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:30,721 INFO L355 BasicCegarLoop]: trace histogram [96, 95, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:30,721 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2057846217, now seen corresponding path program 95 times [2018-04-12 03:08:30,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:30,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:33,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:33,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-12 03:08:33,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:33,385 INFO L182 omatonBuilderFactory]: Interpolants [62295#true, 62296#false, 62297#(<= main_~i~0 0), 62298#(<= main_~i~0 1), 62299#(<= main_~i~0 2), 62300#(<= main_~i~0 3), 62301#(<= main_~i~0 4), 62302#(<= main_~i~0 5), 62303#(<= main_~i~0 6), 62304#(<= main_~i~0 7), 62305#(<= main_~i~0 8), 62306#(<= main_~i~0 9), 62307#(<= main_~i~0 10), 62308#(<= main_~i~0 11), 62309#(<= main_~i~0 12), 62310#(<= main_~i~0 13), 62311#(<= main_~i~0 14), 62312#(<= main_~i~0 15), 62313#(<= main_~i~0 16), 62314#(<= main_~i~0 17), 62315#(<= main_~i~0 18), 62316#(<= main_~i~0 19), 62317#(<= main_~i~0 20), 62318#(<= main_~i~0 21), 62319#(<= main_~i~0 22), 62320#(<= main_~i~0 23), 62321#(<= main_~i~0 24), 62322#(<= main_~i~0 25), 62323#(<= main_~i~0 26), 62324#(<= main_~i~0 27), 62325#(<= main_~i~0 28), 62326#(<= main_~i~0 29), 62327#(<= main_~i~0 30), 62328#(<= main_~i~0 31), 62329#(<= main_~i~0 32), 62330#(<= main_~i~0 33), 62331#(<= main_~i~0 34), 62332#(<= main_~i~0 35), 62333#(<= main_~i~0 36), 62334#(<= main_~i~0 37), 62335#(<= main_~i~0 38), 62336#(<= main_~i~0 39), 62337#(<= main_~i~0 40), 62338#(<= main_~i~0 41), 62339#(<= main_~i~0 42), 62340#(<= main_~i~0 43), 62341#(<= main_~i~0 44), 62342#(<= main_~i~0 45), 62343#(<= main_~i~0 46), 62344#(<= main_~i~0 47), 62345#(<= main_~i~0 48), 62346#(<= main_~i~0 49), 62347#(<= main_~i~0 50), 62348#(<= main_~i~0 51), 62349#(<= main_~i~0 52), 62350#(<= main_~i~0 53), 62351#(<= main_~i~0 54), 62352#(<= main_~i~0 55), 62353#(<= main_~i~0 56), 62354#(<= main_~i~0 57), 62355#(<= main_~i~0 58), 62356#(<= main_~i~0 59), 62357#(<= main_~i~0 60), 62358#(<= main_~i~0 61), 62359#(<= main_~i~0 62), 62360#(<= main_~i~0 63), 62361#(<= main_~i~0 64), 62362#(<= main_~i~0 65), 62363#(<= main_~i~0 66), 62364#(<= main_~i~0 67), 62365#(<= main_~i~0 68), 62366#(<= main_~i~0 69), 62367#(<= main_~i~0 70), 62368#(<= main_~i~0 71), 62369#(<= main_~i~0 72), 62370#(<= main_~i~0 73), 62371#(<= main_~i~0 74), 62372#(<= main_~i~0 75), 62373#(<= main_~i~0 76), 62374#(<= main_~i~0 77), 62375#(<= main_~i~0 78), 62376#(<= main_~i~0 79), 62377#(<= main_~i~0 80), 62378#(<= main_~i~0 81), 62379#(<= main_~i~0 82), 62380#(<= main_~i~0 83), 62381#(<= main_~i~0 84), 62382#(<= main_~i~0 85), 62383#(<= main_~i~0 86), 62384#(<= main_~i~0 87), 62385#(<= main_~i~0 88), 62386#(<= main_~i~0 89), 62387#(<= main_~i~0 90), 62388#(<= main_~i~0 91), 62389#(<= main_~i~0 92), 62390#(<= main_~i~0 93), 62391#(<= main_~i~0 94), 62392#(and (<= 0 main_~i~0) (<= main_~i~0 94)), 62393#(and (<= 1 main_~i~0) (<= main_~i~0 95))] [2018-04-12 03:08:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:33,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-12 03:08:33,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-12 03:08:33,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4661, Invalid=5041, Unknown=0, NotChecked=0, Total=9702 [2018-04-12 03:08:33,386 INFO L87 Difference]: Start difference. First operand 488 states and 488 transitions. Second operand 99 states. [2018-04-12 03:08:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:36,136 INFO L93 Difference]: Finished difference Result 493 states and 493 transitions. [2018-04-12 03:08:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-12 03:08:36,136 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 482 [2018-04-12 03:08:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:36,137 INFO L225 Difference]: With dead ends: 493 [2018-04-12 03:08:36,137 INFO L226 Difference]: Without dead ends: 493 [2018-04-12 03:08:36,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=13971, Invalid=23471, Unknown=0, NotChecked=0, Total=37442 [2018-04-12 03:08:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-04-12 03:08:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-04-12 03:08:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-12 03:08:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 493 transitions. [2018-04-12 03:08:36,141 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 493 transitions. Word has length 482 [2018-04-12 03:08:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:36,141 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 493 transitions. [2018-04-12 03:08:36,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-12 03:08:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 493 transitions. [2018-04-12 03:08:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-04-12 03:08:36,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:36,142 INFO L355 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:36,142 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1505988314, now seen corresponding path program 96 times [2018-04-12 03:08:36,143 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:36,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:38,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:38,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-12 03:08:38,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:38,733 INFO L182 omatonBuilderFactory]: Interpolants [63570#true, 63571#false, 63572#(<= main_~i~0 0), 63573#(<= main_~i~0 1), 63574#(<= main_~i~0 2), 63575#(<= main_~i~0 3), 63576#(<= main_~i~0 4), 63577#(<= main_~i~0 5), 63578#(<= main_~i~0 6), 63579#(<= main_~i~0 7), 63580#(<= main_~i~0 8), 63581#(<= main_~i~0 9), 63582#(<= main_~i~0 10), 63583#(<= main_~i~0 11), 63584#(<= main_~i~0 12), 63585#(<= main_~i~0 13), 63586#(<= main_~i~0 14), 63587#(<= main_~i~0 15), 63588#(<= main_~i~0 16), 63589#(<= main_~i~0 17), 63590#(<= main_~i~0 18), 63591#(<= main_~i~0 19), 63592#(<= main_~i~0 20), 63593#(<= main_~i~0 21), 63594#(<= main_~i~0 22), 63595#(<= main_~i~0 23), 63596#(<= main_~i~0 24), 63597#(<= main_~i~0 25), 63598#(<= main_~i~0 26), 63599#(<= main_~i~0 27), 63600#(<= main_~i~0 28), 63601#(<= main_~i~0 29), 63602#(<= main_~i~0 30), 63603#(<= main_~i~0 31), 63604#(<= main_~i~0 32), 63605#(<= main_~i~0 33), 63606#(<= main_~i~0 34), 63607#(<= main_~i~0 35), 63608#(<= main_~i~0 36), 63609#(<= main_~i~0 37), 63610#(<= main_~i~0 38), 63611#(<= main_~i~0 39), 63612#(<= main_~i~0 40), 63613#(<= main_~i~0 41), 63614#(<= main_~i~0 42), 63615#(<= main_~i~0 43), 63616#(<= main_~i~0 44), 63617#(<= main_~i~0 45), 63618#(<= main_~i~0 46), 63619#(<= main_~i~0 47), 63620#(<= main_~i~0 48), 63621#(<= main_~i~0 49), 63622#(<= main_~i~0 50), 63623#(<= main_~i~0 51), 63624#(<= main_~i~0 52), 63625#(<= main_~i~0 53), 63626#(<= main_~i~0 54), 63627#(<= main_~i~0 55), 63628#(<= main_~i~0 56), 63629#(<= main_~i~0 57), 63630#(<= main_~i~0 58), 63631#(<= main_~i~0 59), 63632#(<= main_~i~0 60), 63633#(<= main_~i~0 61), 63634#(<= main_~i~0 62), 63635#(<= main_~i~0 63), 63636#(<= main_~i~0 64), 63637#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 63638#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 63639#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 63640#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 63641#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 63642#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 63643#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 63644#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 63645#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 63646#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 63647#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 63648#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 63649#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 63650#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 63651#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 63652#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 63653#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 63654#(and (<= main_~i~0 81) (<= 17 main_~i~0)), 63655#(and (<= main_~i~0 82) (<= 18 main_~i~0)), 63656#(and (<= 19 main_~i~0) (<= main_~i~0 83)), 63657#(and (<= main_~i~0 84) (<= 20 main_~i~0)), 63658#(and (<= 21 main_~i~0) (<= main_~i~0 85)), 63659#(and (<= main_~i~0 86) (<= 22 main_~i~0)), 63660#(and (<= 23 main_~i~0) (<= main_~i~0 87)), 63661#(and (<= 24 main_~i~0) (<= main_~i~0 88)), 63662#(and (<= 25 main_~i~0) (<= main_~i~0 89)), 63663#(and (<= 26 main_~i~0) (<= main_~i~0 90)), 63664#(and (<= main_~i~0 91) (<= 27 main_~i~0)), 63665#(and (<= main_~i~0 92) (<= 28 main_~i~0)), 63666#(and (<= 29 main_~i~0) (<= main_~i~0 93)), 63667#(and (<= main_~i~0 94) (<= 30 main_~i~0)), 63668#(and (<= main_~i~0 95) (<= 31 main_~i~0)), 63669#(and (<= main_~i~0 96) (<= 32 main_~i~0))] [2018-04-12 03:08:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:38,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-12 03:08:38,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-12 03:08:38,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=7622, Unknown=0, NotChecked=0, Total=9900 [2018-04-12 03:08:38,735 INFO L87 Difference]: Start difference. First operand 493 states and 493 transitions. Second operand 100 states. [2018-04-12 03:08:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:47,500 INFO L93 Difference]: Finished difference Result 498 states and 498 transitions. [2018-04-12 03:08:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-12 03:08:47,500 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 487 [2018-04-12 03:08:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:47,501 INFO L225 Difference]: With dead ends: 498 [2018-04-12 03:08:47,502 INFO L226 Difference]: Without dead ends: 498 [2018-04-12 03:08:47,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6735 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=8775, Invalid=29445, Unknown=0, NotChecked=0, Total=38220 [2018-04-12 03:08:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-04-12 03:08:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2018-04-12 03:08:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-04-12 03:08:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 498 transitions. [2018-04-12 03:08:47,517 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 498 transitions. Word has length 487 [2018-04-12 03:08:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:47,517 INFO L459 AbstractCegarLoop]: Abstraction has 498 states and 498 transitions. [2018-04-12 03:08:47,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-12 03:08:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 498 transitions. [2018-04-12 03:08:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-12 03:08:47,519 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:47,519 INFO L355 BasicCegarLoop]: trace histogram [98, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:47,519 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -152387689, now seen corresponding path program 97 times [2018-04-12 03:08:47,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:47,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:50,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:50,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-04-12 03:08:50,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:50,313 INFO L182 omatonBuilderFactory]: Interpolants [64858#true, 64859#false, 64860#(<= main_~i~0 0), 64861#(<= main_~i~0 1), 64862#(<= main_~i~0 2), 64863#(<= main_~i~0 3), 64864#(<= main_~i~0 4), 64865#(<= main_~i~0 5), 64866#(<= main_~i~0 6), 64867#(<= main_~i~0 7), 64868#(<= main_~i~0 8), 64869#(<= main_~i~0 9), 64870#(<= main_~i~0 10), 64871#(<= main_~i~0 11), 64872#(<= main_~i~0 12), 64873#(<= main_~i~0 13), 64874#(<= main_~i~0 14), 64875#(<= main_~i~0 15), 64876#(<= main_~i~0 16), 64877#(<= main_~i~0 17), 64878#(<= main_~i~0 18), 64879#(<= main_~i~0 19), 64880#(<= main_~i~0 20), 64881#(<= main_~i~0 21), 64882#(<= main_~i~0 22), 64883#(<= main_~i~0 23), 64884#(<= main_~i~0 24), 64885#(<= main_~i~0 25), 64886#(<= main_~i~0 26), 64887#(<= main_~i~0 27), 64888#(<= main_~i~0 28), 64889#(<= main_~i~0 29), 64890#(<= main_~i~0 30), 64891#(<= main_~i~0 31), 64892#(<= main_~i~0 32), 64893#(<= main_~i~0 33), 64894#(<= main_~i~0 34), 64895#(<= main_~i~0 35), 64896#(<= main_~i~0 36), 64897#(<= main_~i~0 37), 64898#(<= main_~i~0 38), 64899#(<= main_~i~0 39), 64900#(<= main_~i~0 40), 64901#(<= main_~i~0 41), 64902#(<= main_~i~0 42), 64903#(<= main_~i~0 43), 64904#(<= main_~i~0 44), 64905#(<= main_~i~0 45), 64906#(<= main_~i~0 46), 64907#(<= main_~i~0 47), 64908#(<= main_~i~0 48), 64909#(<= main_~i~0 49), 64910#(<= main_~i~0 50), 64911#(<= main_~i~0 51), 64912#(<= main_~i~0 52), 64913#(<= main_~i~0 53), 64914#(<= main_~i~0 54), 64915#(<= main_~i~0 55), 64916#(<= main_~i~0 56), 64917#(<= main_~i~0 57), 64918#(<= main_~i~0 58), 64919#(<= main_~i~0 59), 64920#(<= main_~i~0 60), 64921#(<= main_~i~0 61), 64922#(<= main_~i~0 62), 64923#(<= main_~i~0 63), 64924#(<= main_~i~0 64), 64925#(<= main_~i~0 65), 64926#(<= main_~i~0 66), 64927#(<= main_~i~0 67), 64928#(<= main_~i~0 68), 64929#(<= main_~i~0 69), 64930#(<= main_~i~0 70), 64931#(<= main_~i~0 71), 64932#(<= main_~i~0 72), 64933#(<= main_~i~0 73), 64934#(<= main_~i~0 74), 64935#(<= main_~i~0 75), 64936#(<= main_~i~0 76), 64937#(<= main_~i~0 77), 64938#(<= main_~i~0 78), 64939#(<= main_~i~0 79), 64940#(<= main_~i~0 80), 64941#(<= main_~i~0 81), 64942#(<= main_~i~0 82), 64943#(<= main_~i~0 83), 64944#(<= main_~i~0 84), 64945#(<= main_~i~0 85), 64946#(<= main_~i~0 86), 64947#(<= main_~i~0 87), 64948#(<= main_~i~0 88), 64949#(<= main_~i~0 89), 64950#(<= main_~i~0 90), 64951#(<= main_~i~0 91), 64952#(<= main_~i~0 92), 64953#(<= main_~i~0 93), 64954#(<= main_~i~0 94), 64955#(<= main_~i~0 95), 64956#(<= main_~i~0 96), 64957#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 64958#(and (<= 1 main_~i~0) (<= main_~i~0 97))] [2018-04-12 03:08:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:50,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-12 03:08:50,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-12 03:08:50,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4856, Invalid=5244, Unknown=0, NotChecked=0, Total=10100 [2018-04-12 03:08:50,314 INFO L87 Difference]: Start difference. First operand 498 states and 498 transitions. Second operand 101 states. [2018-04-12 03:08:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:53,171 INFO L93 Difference]: Finished difference Result 503 states and 503 transitions. [2018-04-12 03:08:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-12 03:08:53,171 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 492 [2018-04-12 03:08:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:53,173 INFO L225 Difference]: With dead ends: 503 [2018-04-12 03:08:53,173 INFO L226 Difference]: Without dead ends: 503 [2018-04-12 03:08:53,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=14556, Invalid=24450, Unknown=0, NotChecked=0, Total=39006 [2018-04-12 03:08:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-12 03:08:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2018-04-12 03:08:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-04-12 03:08:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 503 transitions. [2018-04-12 03:08:53,178 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 503 transitions. Word has length 492 [2018-04-12 03:08:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:53,178 INFO L459 AbstractCegarLoop]: Abstraction has 503 states and 503 transitions. [2018-04-12 03:08:53,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-12 03:08:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 503 transitions. [2018-04-12 03:08:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-04-12 03:08:53,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:53,179 INFO L355 BasicCegarLoop]: trace histogram [99, 98, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:53,179 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1110388794, now seen corresponding path program 98 times [2018-04-12 03:08:53,180 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:53,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:08:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:56,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:08:56,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-04-12 03:08:56,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:08:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:56,039 INFO L182 omatonBuilderFactory]: Interpolants [66159#true, 66161#(<= main_~i~0 0), 66160#false, 66163#(<= main_~i~0 2), 66162#(<= main_~i~0 1), 66165#(<= main_~i~0 4), 66164#(<= main_~i~0 3), 66167#(<= main_~i~0 6), 66166#(<= main_~i~0 5), 66169#(<= main_~i~0 8), 66168#(<= main_~i~0 7), 66171#(<= main_~i~0 10), 66170#(<= main_~i~0 9), 66173#(<= main_~i~0 12), 66172#(<= main_~i~0 11), 66175#(<= main_~i~0 14), 66174#(<= main_~i~0 13), 66177#(<= main_~i~0 16), 66176#(<= main_~i~0 15), 66179#(<= main_~i~0 18), 66178#(<= main_~i~0 17), 66181#(<= main_~i~0 20), 66180#(<= main_~i~0 19), 66183#(<= main_~i~0 22), 66182#(<= main_~i~0 21), 66185#(<= main_~i~0 24), 66184#(<= main_~i~0 23), 66187#(<= main_~i~0 26), 66186#(<= main_~i~0 25), 66189#(<= main_~i~0 28), 66188#(<= main_~i~0 27), 66191#(<= main_~i~0 30), 66190#(<= main_~i~0 29), 66193#(<= main_~i~0 32), 66192#(<= main_~i~0 31), 66195#(<= main_~i~0 34), 66194#(<= main_~i~0 33), 66197#(<= main_~i~0 36), 66196#(<= main_~i~0 35), 66199#(<= main_~i~0 38), 66198#(<= main_~i~0 37), 66201#(<= main_~i~0 40), 66200#(<= main_~i~0 39), 66203#(<= main_~i~0 42), 66202#(<= main_~i~0 41), 66205#(<= main_~i~0 44), 66204#(<= main_~i~0 43), 66207#(<= main_~i~0 46), 66206#(<= main_~i~0 45), 66209#(<= main_~i~0 48), 66208#(<= main_~i~0 47), 66211#(<= main_~i~0 50), 66210#(<= main_~i~0 49), 66213#(<= main_~i~0 52), 66212#(<= main_~i~0 51), 66215#(<= main_~i~0 54), 66214#(<= main_~i~0 53), 66217#(<= main_~i~0 56), 66216#(<= main_~i~0 55), 66219#(<= main_~i~0 58), 66218#(<= main_~i~0 57), 66221#(<= main_~i~0 60), 66220#(<= main_~i~0 59), 66223#(<= main_~i~0 62), 66222#(<= main_~i~0 61), 66225#(<= main_~i~0 64), 66224#(<= main_~i~0 63), 66227#(<= main_~i~0 66), 66226#(<= main_~i~0 65), 66229#(<= main_~i~0 68), 66228#(<= main_~i~0 67), 66231#(<= main_~i~0 70), 66230#(<= main_~i~0 69), 66233#(<= main_~i~0 72), 66232#(<= main_~i~0 71), 66235#(<= main_~i~0 74), 66234#(<= main_~i~0 73), 66237#(<= main_~i~0 76), 66236#(<= main_~i~0 75), 66239#(<= main_~i~0 78), 66238#(<= main_~i~0 77), 66241#(<= main_~i~0 80), 66240#(<= main_~i~0 79), 66243#(<= main_~i~0 82), 66242#(<= main_~i~0 81), 66245#(<= main_~i~0 84), 66244#(<= main_~i~0 83), 66247#(<= main_~i~0 86), 66246#(<= main_~i~0 85), 66249#(<= main_~i~0 88), 66248#(<= main_~i~0 87), 66251#(<= main_~i~0 90), 66250#(<= main_~i~0 89), 66253#(<= main_~i~0 92), 66252#(<= main_~i~0 91), 66255#(<= main_~i~0 94), 66254#(<= main_~i~0 93), 66257#(<= main_~i~0 96), 66256#(<= main_~i~0 95), 66259#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 66258#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 66260#(and (<= 2 main_~i~0) (<= main_~i~0 98))] [2018-04-12 03:08:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:08:56,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-12 03:08:56,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-12 03:08:56,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4858, Invalid=5444, Unknown=0, NotChecked=0, Total=10302 [2018-04-12 03:08:56,041 INFO L87 Difference]: Start difference. First operand 503 states and 503 transitions. Second operand 102 states. [2018-04-12 03:08:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:08:59,180 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-04-12 03:08:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-12 03:08:59,180 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 497 [2018-04-12 03:08:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:08:59,181 INFO L225 Difference]: With dead ends: 508 [2018-04-12 03:08:59,181 INFO L226 Difference]: Without dead ends: 508 [2018-04-12 03:08:59,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5044 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=14657, Invalid=25143, Unknown=0, NotChecked=0, Total=39800 [2018-04-12 03:08:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-04-12 03:08:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2018-04-12 03:08:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-04-12 03:08:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 508 transitions. [2018-04-12 03:08:59,185 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 508 transitions. Word has length 497 [2018-04-12 03:08:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:08:59,186 INFO L459 AbstractCegarLoop]: Abstraction has 508 states and 508 transitions. [2018-04-12 03:08:59,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-12 03:08:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 508 transitions. [2018-04-12 03:08:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-12 03:08:59,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:08:59,187 INFO L355 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-04-12 03:08:59,187 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:08:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash -194476809, now seen corresponding path program 99 times [2018-04-12 03:08:59,188 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:08:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:08:59,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:02,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:02,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-04-12 03:09:02,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:02,331 INFO L182 omatonBuilderFactory]: Interpolants [67473#true, 67475#(<= main_~i~0 0), 67474#false, 67477#(<= main_~i~0 2), 67476#(<= main_~i~0 1), 67479#(<= main_~i~0 4), 67478#(<= main_~i~0 3), 67481#(<= main_~i~0 6), 67480#(<= main_~i~0 5), 67483#(<= main_~i~0 8), 67482#(<= main_~i~0 7), 67485#(<= main_~i~0 10), 67484#(<= main_~i~0 9), 67487#(<= main_~i~0 12), 67486#(<= main_~i~0 11), 67489#(<= main_~i~0 14), 67488#(<= main_~i~0 13), 67491#(<= main_~i~0 16), 67490#(<= main_~i~0 15), 67493#(<= main_~i~0 18), 67492#(<= main_~i~0 17), 67495#(<= main_~i~0 20), 67494#(<= main_~i~0 19), 67497#(<= main_~i~0 22), 67496#(<= main_~i~0 21), 67499#(<= main_~i~0 24), 67498#(<= main_~i~0 23), 67501#(<= main_~i~0 26), 67500#(<= main_~i~0 25), 67503#(<= main_~i~0 28), 67502#(<= main_~i~0 27), 67505#(<= main_~i~0 30), 67504#(<= main_~i~0 29), 67507#(<= main_~i~0 32), 67506#(<= main_~i~0 31), 67509#(<= main_~i~0 34), 67508#(<= main_~i~0 33), 67511#(<= main_~i~0 36), 67510#(<= main_~i~0 35), 67513#(<= main_~i~0 38), 67512#(<= main_~i~0 37), 67515#(<= main_~i~0 40), 67514#(<= main_~i~0 39), 67517#(<= main_~i~0 42), 67516#(<= main_~i~0 41), 67519#(<= main_~i~0 44), 67518#(<= main_~i~0 43), 67521#(<= main_~i~0 46), 67520#(<= main_~i~0 45), 67523#(<= main_~i~0 48), 67522#(<= main_~i~0 47), 67525#(<= main_~i~0 50), 67524#(<= main_~i~0 49), 67527#(<= main_~i~0 52), 67526#(<= main_~i~0 51), 67529#(<= main_~i~0 54), 67528#(<= main_~i~0 53), 67531#(<= main_~i~0 56), 67530#(<= main_~i~0 55), 67533#(<= main_~i~0 58), 67532#(<= main_~i~0 57), 67535#(<= main_~i~0 60), 67534#(<= main_~i~0 59), 67537#(<= main_~i~0 62), 67536#(<= main_~i~0 61), 67539#(<= main_~i~0 64), 67538#(<= main_~i~0 63), 67541#(<= main_~i~0 66), 67540#(<= main_~i~0 65), 67543#(<= main_~i~0 68), 67542#(<= main_~i~0 67), 67545#(<= main_~i~0 70), 67544#(<= main_~i~0 69), 67547#(<= main_~i~0 72), 67546#(<= main_~i~0 71), 67549#(<= main_~i~0 74), 67548#(<= main_~i~0 73), 67551#(<= main_~i~0 76), 67550#(<= main_~i~0 75), 67553#(<= main_~i~0 78), 67552#(<= main_~i~0 77), 67555#(<= main_~i~0 80), 67554#(<= main_~i~0 79), 67557#(<= main_~i~0 82), 67556#(<= main_~i~0 81), 67559#(<= main_~i~0 84), 67558#(<= main_~i~0 83), 67561#(<= main_~i~0 86), 67560#(<= main_~i~0 85), 67563#(<= main_~i~0 88), 67562#(<= main_~i~0 87), 67565#(<= main_~i~0 90), 67564#(<= main_~i~0 89), 67567#(<= main_~i~0 92), 67566#(<= main_~i~0 91), 67569#(<= main_~i~0 94), 67568#(<= main_~i~0 93), 67571#(<= main_~i~0 96), 67570#(<= main_~i~0 95), 67573#(<= main_~i~0 98), 67572#(<= main_~i~0 97), 67575#(and (<= 1 main_~i~0) (<= main_~i~0 99)), 67574#(and (<= main_~i~0 98) (<= 0 main_~i~0))] [2018-04-12 03:09:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:02,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-12 03:09:02,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-12 03:09:02,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5055, Invalid=5451, Unknown=0, NotChecked=0, Total=10506 [2018-04-12 03:09:02,333 INFO L87 Difference]: Start difference. First operand 508 states and 508 transitions. Second operand 103 states. [2018-04-12 03:09:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:05,236 INFO L93 Difference]: Finished difference Result 513 states and 513 transitions. [2018-04-12 03:09:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-12 03:09:05,237 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 502 [2018-04-12 03:09:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:05,237 INFO L225 Difference]: With dead ends: 513 [2018-04-12 03:09:05,237 INFO L226 Difference]: Without dead ends: 513 [2018-04-12 03:09:05,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=15153, Invalid=25449, Unknown=0, NotChecked=0, Total=40602 [2018-04-12 03:09:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-04-12 03:09:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-04-12 03:09:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-12 03:09:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2018-04-12 03:09:05,242 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 502 [2018-04-12 03:09:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:05,242 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 513 transitions. [2018-04-12 03:09:05,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-12 03:09:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 513 transitions. [2018-04-12 03:09:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-04-12 03:09:05,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:05,245 INFO L355 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:05,245 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1962370662, now seen corresponding path program 100 times [2018-04-12 03:09:05,245 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:05,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:08,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:08,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-04-12 03:09:08,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:08,195 INFO L182 omatonBuilderFactory]: Interpolants [68865#(<= main_~i~0 63), 68864#(<= main_~i~0 62), 68867#(<= main_~i~0 65), 68866#(<= main_~i~0 64), 68869#(<= main_~i~0 67), 68868#(<= main_~i~0 66), 68871#(<= main_~i~0 69), 68870#(<= main_~i~0 68), 68873#(<= main_~i~0 71), 68872#(<= main_~i~0 70), 68875#(<= main_~i~0 73), 68874#(<= main_~i~0 72), 68877#(<= main_~i~0 75), 68876#(<= main_~i~0 74), 68879#(<= main_~i~0 77), 68878#(<= main_~i~0 76), 68881#(<= main_~i~0 79), 68880#(<= main_~i~0 78), 68883#(<= main_~i~0 81), 68882#(<= main_~i~0 80), 68885#(<= main_~i~0 83), 68884#(<= main_~i~0 82), 68887#(<= main_~i~0 85), 68886#(<= main_~i~0 84), 68889#(<= main_~i~0 87), 68888#(<= main_~i~0 86), 68891#(<= main_~i~0 89), 68890#(<= main_~i~0 88), 68893#(<= main_~i~0 91), 68892#(<= main_~i~0 90), 68895#(<= main_~i~0 93), 68894#(<= main_~i~0 92), 68897#(<= main_~i~0 95), 68896#(<= main_~i~0 94), 68899#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 68898#(<= main_~i~0 96), 68901#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 68900#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 68903#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 68902#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 68801#false, 68800#true, 68803#(<= main_~i~0 1), 68802#(<= main_~i~0 0), 68805#(<= main_~i~0 3), 68804#(<= main_~i~0 2), 68807#(<= main_~i~0 5), 68806#(<= main_~i~0 4), 68809#(<= main_~i~0 7), 68808#(<= main_~i~0 6), 68811#(<= main_~i~0 9), 68810#(<= main_~i~0 8), 68813#(<= main_~i~0 11), 68812#(<= main_~i~0 10), 68815#(<= main_~i~0 13), 68814#(<= main_~i~0 12), 68817#(<= main_~i~0 15), 68816#(<= main_~i~0 14), 68819#(<= main_~i~0 17), 68818#(<= main_~i~0 16), 68821#(<= main_~i~0 19), 68820#(<= main_~i~0 18), 68823#(<= main_~i~0 21), 68822#(<= main_~i~0 20), 68825#(<= main_~i~0 23), 68824#(<= main_~i~0 22), 68827#(<= main_~i~0 25), 68826#(<= main_~i~0 24), 68829#(<= main_~i~0 27), 68828#(<= main_~i~0 26), 68831#(<= main_~i~0 29), 68830#(<= main_~i~0 28), 68833#(<= main_~i~0 31), 68832#(<= main_~i~0 30), 68835#(<= main_~i~0 33), 68834#(<= main_~i~0 32), 68837#(<= main_~i~0 35), 68836#(<= main_~i~0 34), 68839#(<= main_~i~0 37), 68838#(<= main_~i~0 36), 68841#(<= main_~i~0 39), 68840#(<= main_~i~0 38), 68843#(<= main_~i~0 41), 68842#(<= main_~i~0 40), 68845#(<= main_~i~0 43), 68844#(<= main_~i~0 42), 68847#(<= main_~i~0 45), 68846#(<= main_~i~0 44), 68849#(<= main_~i~0 47), 68848#(<= main_~i~0 46), 68851#(<= main_~i~0 49), 68850#(<= main_~i~0 48), 68853#(<= main_~i~0 51), 68852#(<= main_~i~0 50), 68855#(<= main_~i~0 53), 68854#(<= main_~i~0 52), 68857#(<= main_~i~0 55), 68856#(<= main_~i~0 54), 68859#(<= main_~i~0 57), 68858#(<= main_~i~0 56), 68861#(<= main_~i~0 59), 68860#(<= main_~i~0 58), 68863#(<= main_~i~0 61), 68862#(<= main_~i~0 60)] [2018-04-12 03:09:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:08,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-12 03:09:08,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-12 03:09:08,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4862, Invalid=5850, Unknown=0, NotChecked=0, Total=10712 [2018-04-12 03:09:08,198 INFO L87 Difference]: Start difference. First operand 513 states and 513 transitions. Second operand 104 states. [2018-04-12 03:09:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:11,904 INFO L93 Difference]: Finished difference Result 518 states and 518 transitions. [2018-04-12 03:09:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-12 03:09:11,904 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 507 [2018-04-12 03:09:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:11,905 INFO L225 Difference]: With dead ends: 518 [2018-04-12 03:09:11,905 INFO L226 Difference]: Without dead ends: 518 [2018-04-12 03:09:11,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5437 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14859, Invalid=26553, Unknown=0, NotChecked=0, Total=41412 [2018-04-12 03:09:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-04-12 03:09:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-04-12 03:09:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-12 03:09:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 518 transitions. [2018-04-12 03:09:11,909 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 518 transitions. Word has length 507 [2018-04-12 03:09:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:11,909 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 518 transitions. [2018-04-12 03:09:11,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-12 03:09:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 518 transitions. [2018-04-12 03:09:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-04-12 03:09:11,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:11,910 INFO L355 BasicCegarLoop]: trace histogram [102, 101, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:11,910 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash -856223145, now seen corresponding path program 101 times [2018-04-12 03:09:11,911 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:11,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:14,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:14,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-04-12 03:09:14,965 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:14,965 INFO L182 omatonBuilderFactory]: Interpolants [70145#(<= main_~i~0 3), 70144#(<= main_~i~0 2), 70147#(<= main_~i~0 5), 70146#(<= main_~i~0 4), 70149#(<= main_~i~0 7), 70148#(<= main_~i~0 6), 70151#(<= main_~i~0 9), 70150#(<= main_~i~0 8), 70153#(<= main_~i~0 11), 70152#(<= main_~i~0 10), 70155#(<= main_~i~0 13), 70154#(<= main_~i~0 12), 70157#(<= main_~i~0 15), 70156#(<= main_~i~0 14), 70159#(<= main_~i~0 17), 70158#(<= main_~i~0 16), 70161#(<= main_~i~0 19), 70160#(<= main_~i~0 18), 70163#(<= main_~i~0 21), 70162#(<= main_~i~0 20), 70165#(<= main_~i~0 23), 70164#(<= main_~i~0 22), 70167#(<= main_~i~0 25), 70166#(<= main_~i~0 24), 70169#(<= main_~i~0 27), 70168#(<= main_~i~0 26), 70171#(<= main_~i~0 29), 70170#(<= main_~i~0 28), 70173#(<= main_~i~0 31), 70172#(<= main_~i~0 30), 70175#(<= main_~i~0 33), 70174#(<= main_~i~0 32), 70177#(<= main_~i~0 35), 70176#(<= main_~i~0 34), 70179#(<= main_~i~0 37), 70178#(<= main_~i~0 36), 70181#(<= main_~i~0 39), 70180#(<= main_~i~0 38), 70183#(<= main_~i~0 41), 70182#(<= main_~i~0 40), 70185#(<= main_~i~0 43), 70184#(<= main_~i~0 42), 70187#(<= main_~i~0 45), 70186#(<= main_~i~0 44), 70189#(<= main_~i~0 47), 70188#(<= main_~i~0 46), 70191#(<= main_~i~0 49), 70190#(<= main_~i~0 48), 70193#(<= main_~i~0 51), 70192#(<= main_~i~0 50), 70195#(<= main_~i~0 53), 70194#(<= main_~i~0 52), 70197#(<= main_~i~0 55), 70196#(<= main_~i~0 54), 70199#(<= main_~i~0 57), 70198#(<= main_~i~0 56), 70201#(<= main_~i~0 59), 70200#(<= main_~i~0 58), 70203#(<= main_~i~0 61), 70202#(<= main_~i~0 60), 70205#(<= main_~i~0 63), 70204#(<= main_~i~0 62), 70207#(<= main_~i~0 65), 70206#(<= main_~i~0 64), 70209#(<= main_~i~0 67), 70208#(<= main_~i~0 66), 70211#(<= main_~i~0 69), 70210#(<= main_~i~0 68), 70213#(<= main_~i~0 71), 70212#(<= main_~i~0 70), 70215#(<= main_~i~0 73), 70214#(<= main_~i~0 72), 70217#(<= main_~i~0 75), 70216#(<= main_~i~0 74), 70219#(<= main_~i~0 77), 70218#(<= main_~i~0 76), 70221#(<= main_~i~0 79), 70220#(<= main_~i~0 78), 70223#(<= main_~i~0 81), 70222#(<= main_~i~0 80), 70225#(<= main_~i~0 83), 70224#(<= main_~i~0 82), 70227#(<= main_~i~0 85), 70226#(<= main_~i~0 84), 70229#(<= main_~i~0 87), 70228#(<= main_~i~0 86), 70231#(<= main_~i~0 89), 70230#(<= main_~i~0 88), 70233#(<= main_~i~0 91), 70232#(<= main_~i~0 90), 70235#(<= main_~i~0 93), 70234#(<= main_~i~0 92), 70237#(<= main_~i~0 95), 70236#(<= main_~i~0 94), 70239#(<= main_~i~0 97), 70238#(<= main_~i~0 96), 70241#(<= main_~i~0 99), 70240#(<= main_~i~0 98), 70243#(and (<= 0 main_~i~0) (<= main_~i~0 100)), 70242#(<= main_~i~0 100), 70244#(and (<= 1 main_~i~0) (<= main_~i~0 101)), 70141#false, 70140#true, 70143#(<= main_~i~0 1), 70142#(<= main_~i~0 0)] [2018-04-12 03:09:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:14,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-12 03:09:14,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-12 03:09:14,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2018-04-12 03:09:14,967 INFO L87 Difference]: Start difference. First operand 518 states and 518 transitions. Second operand 105 states. [2018-04-12 03:09:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:17,997 INFO L93 Difference]: Finished difference Result 523 states and 523 transitions. [2018-04-12 03:09:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-12 03:09:17,997 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 512 [2018-04-12 03:09:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:17,998 INFO L225 Difference]: With dead ends: 523 [2018-04-12 03:09:17,998 INFO L226 Difference]: Without dead ends: 523 [2018-04-12 03:09:17,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=15762, Invalid=26468, Unknown=0, NotChecked=0, Total=42230 [2018-04-12 03:09:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-04-12 03:09:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2018-04-12 03:09:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-04-12 03:09:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 523 transitions. [2018-04-12 03:09:18,001 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 523 transitions. Word has length 512 [2018-04-12 03:09:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:18,002 INFO L459 AbstractCegarLoop]: Abstraction has 523 states and 523 transitions. [2018-04-12 03:09:18,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-12 03:09:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 523 transitions. [2018-04-12 03:09:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-04-12 03:09:18,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:18,003 INFO L355 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:18,003 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:18,003 INFO L82 PathProgramCache]: Analyzing trace with hash 71972102, now seen corresponding path program 102 times [2018-04-12 03:09:18,003 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:18,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:21,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:21,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-04-12 03:09:21,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:21,101 INFO L182 omatonBuilderFactory]: Interpolants [71493#true, 71495#(<= main_~i~0 0), 71494#false, 71497#(<= main_~i~0 2), 71496#(<= main_~i~0 1), 71499#(<= main_~i~0 4), 71498#(<= main_~i~0 3), 71501#(<= main_~i~0 6), 71500#(<= main_~i~0 5), 71503#(<= main_~i~0 8), 71502#(<= main_~i~0 7), 71505#(<= main_~i~0 10), 71504#(<= main_~i~0 9), 71507#(<= main_~i~0 12), 71506#(<= main_~i~0 11), 71509#(<= main_~i~0 14), 71508#(<= main_~i~0 13), 71511#(<= main_~i~0 16), 71510#(<= main_~i~0 15), 71513#(<= main_~i~0 18), 71512#(<= main_~i~0 17), 71515#(<= main_~i~0 20), 71514#(<= main_~i~0 19), 71517#(<= main_~i~0 22), 71516#(<= main_~i~0 21), 71519#(<= main_~i~0 24), 71518#(<= main_~i~0 23), 71521#(<= main_~i~0 26), 71520#(<= main_~i~0 25), 71523#(<= main_~i~0 28), 71522#(<= main_~i~0 27), 71525#(<= main_~i~0 30), 71524#(<= main_~i~0 29), 71527#(<= main_~i~0 32), 71526#(<= main_~i~0 31), 71529#(<= main_~i~0 34), 71528#(<= main_~i~0 33), 71531#(<= main_~i~0 36), 71530#(<= main_~i~0 35), 71533#(<= main_~i~0 38), 71532#(<= main_~i~0 37), 71535#(<= main_~i~0 40), 71534#(<= main_~i~0 39), 71537#(<= main_~i~0 42), 71536#(<= main_~i~0 41), 71539#(<= main_~i~0 44), 71538#(<= main_~i~0 43), 71541#(<= main_~i~0 46), 71540#(<= main_~i~0 45), 71543#(<= main_~i~0 48), 71542#(<= main_~i~0 47), 71545#(<= main_~i~0 50), 71544#(<= main_~i~0 49), 71547#(<= main_~i~0 52), 71546#(<= main_~i~0 51), 71549#(<= main_~i~0 54), 71548#(<= main_~i~0 53), 71551#(<= main_~i~0 56), 71550#(<= main_~i~0 55), 71553#(<= main_~i~0 58), 71552#(<= main_~i~0 57), 71555#(<= main_~i~0 60), 71554#(<= main_~i~0 59), 71557#(<= main_~i~0 62), 71556#(<= main_~i~0 61), 71559#(<= main_~i~0 64), 71558#(<= main_~i~0 63), 71561#(<= main_~i~0 66), 71560#(<= main_~i~0 65), 71563#(<= main_~i~0 68), 71562#(<= main_~i~0 67), 71565#(<= main_~i~0 70), 71564#(<= main_~i~0 69), 71567#(<= main_~i~0 72), 71566#(<= main_~i~0 71), 71569#(<= main_~i~0 74), 71568#(<= main_~i~0 73), 71571#(<= main_~i~0 76), 71570#(<= main_~i~0 75), 71573#(<= main_~i~0 78), 71572#(<= main_~i~0 77), 71575#(<= main_~i~0 80), 71574#(<= main_~i~0 79), 71577#(<= main_~i~0 82), 71576#(<= main_~i~0 81), 71579#(<= main_~i~0 84), 71578#(<= main_~i~0 83), 71581#(<= main_~i~0 86), 71580#(<= main_~i~0 85), 71583#(<= main_~i~0 88), 71582#(<= main_~i~0 87), 71585#(<= main_~i~0 90), 71584#(<= main_~i~0 89), 71587#(<= main_~i~0 92), 71586#(<= main_~i~0 91), 71589#(<= main_~i~0 94), 71588#(<= main_~i~0 93), 71591#(<= main_~i~0 96), 71590#(<= main_~i~0 95), 71593#(<= main_~i~0 98), 71592#(<= main_~i~0 97), 71595#(<= main_~i~0 100), 71594#(<= main_~i~0 99), 71597#(and (<= 1 main_~i~0) (<= main_~i~0 101)), 71596#(and (<= 0 main_~i~0) (<= main_~i~0 100)), 71598#(and (<= 2 main_~i~0) (<= main_~i~0 102))] [2018-04-12 03:09:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:21,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-12 03:09:21,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-12 03:09:21,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5260, Invalid=5870, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 03:09:21,103 INFO L87 Difference]: Start difference. First operand 523 states and 523 transitions. Second operand 106 states. [2018-04-12 03:09:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:24,482 INFO L93 Difference]: Finished difference Result 528 states and 528 transitions. [2018-04-12 03:09:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-12 03:09:24,482 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 517 [2018-04-12 03:09:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:24,482 INFO L225 Difference]: With dead ends: 528 [2018-04-12 03:09:24,483 INFO L226 Difference]: Without dead ends: 528 [2018-04-12 03:09:24,484 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5454 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=15867, Invalid=27189, Unknown=0, NotChecked=0, Total=43056 [2018-04-12 03:09:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-04-12 03:09:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-04-12 03:09:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-12 03:09:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 528 transitions. [2018-04-12 03:09:24,486 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 528 transitions. Word has length 517 [2018-04-12 03:09:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:24,486 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 528 transitions. [2018-04-12 03:09:24,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-12 03:09:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 528 transitions. [2018-04-12 03:09:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-04-12 03:09:24,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:24,488 INFO L355 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:24,488 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1740871753, now seen corresponding path program 103 times [2018-04-12 03:09:24,488 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:24,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:27,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:27,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-04-12 03:09:27,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:27,645 INFO L182 omatonBuilderFactory]: Interpolants [72961#(<= main_~i~0 100), 72960#(<= main_~i~0 99), 72963#(<= main_~i~0 102), 72962#(<= main_~i~0 101), 72965#(and (<= 1 main_~i~0) (<= main_~i~0 103)), 72964#(and (<= 0 main_~i~0) (<= main_~i~0 102)), 72859#true, 72861#(<= main_~i~0 0), 72860#false, 72863#(<= main_~i~0 2), 72862#(<= main_~i~0 1), 72865#(<= main_~i~0 4), 72864#(<= main_~i~0 3), 72867#(<= main_~i~0 6), 72866#(<= main_~i~0 5), 72869#(<= main_~i~0 8), 72868#(<= main_~i~0 7), 72871#(<= main_~i~0 10), 72870#(<= main_~i~0 9), 72873#(<= main_~i~0 12), 72872#(<= main_~i~0 11), 72875#(<= main_~i~0 14), 72874#(<= main_~i~0 13), 72877#(<= main_~i~0 16), 72876#(<= main_~i~0 15), 72879#(<= main_~i~0 18), 72878#(<= main_~i~0 17), 72881#(<= main_~i~0 20), 72880#(<= main_~i~0 19), 72883#(<= main_~i~0 22), 72882#(<= main_~i~0 21), 72885#(<= main_~i~0 24), 72884#(<= main_~i~0 23), 72887#(<= main_~i~0 26), 72886#(<= main_~i~0 25), 72889#(<= main_~i~0 28), 72888#(<= main_~i~0 27), 72891#(<= main_~i~0 30), 72890#(<= main_~i~0 29), 72893#(<= main_~i~0 32), 72892#(<= main_~i~0 31), 72895#(<= main_~i~0 34), 72894#(<= main_~i~0 33), 72897#(<= main_~i~0 36), 72896#(<= main_~i~0 35), 72899#(<= main_~i~0 38), 72898#(<= main_~i~0 37), 72901#(<= main_~i~0 40), 72900#(<= main_~i~0 39), 72903#(<= main_~i~0 42), 72902#(<= main_~i~0 41), 72905#(<= main_~i~0 44), 72904#(<= main_~i~0 43), 72907#(<= main_~i~0 46), 72906#(<= main_~i~0 45), 72909#(<= main_~i~0 48), 72908#(<= main_~i~0 47), 72911#(<= main_~i~0 50), 72910#(<= main_~i~0 49), 72913#(<= main_~i~0 52), 72912#(<= main_~i~0 51), 72915#(<= main_~i~0 54), 72914#(<= main_~i~0 53), 72917#(<= main_~i~0 56), 72916#(<= main_~i~0 55), 72919#(<= main_~i~0 58), 72918#(<= main_~i~0 57), 72921#(<= main_~i~0 60), 72920#(<= main_~i~0 59), 72923#(<= main_~i~0 62), 72922#(<= main_~i~0 61), 72925#(<= main_~i~0 64), 72924#(<= main_~i~0 63), 72927#(<= main_~i~0 66), 72926#(<= main_~i~0 65), 72929#(<= main_~i~0 68), 72928#(<= main_~i~0 67), 72931#(<= main_~i~0 70), 72930#(<= main_~i~0 69), 72933#(<= main_~i~0 72), 72932#(<= main_~i~0 71), 72935#(<= main_~i~0 74), 72934#(<= main_~i~0 73), 72937#(<= main_~i~0 76), 72936#(<= main_~i~0 75), 72939#(<= main_~i~0 78), 72938#(<= main_~i~0 77), 72941#(<= main_~i~0 80), 72940#(<= main_~i~0 79), 72943#(<= main_~i~0 82), 72942#(<= main_~i~0 81), 72945#(<= main_~i~0 84), 72944#(<= main_~i~0 83), 72947#(<= main_~i~0 86), 72946#(<= main_~i~0 85), 72949#(<= main_~i~0 88), 72948#(<= main_~i~0 87), 72951#(<= main_~i~0 90), 72950#(<= main_~i~0 89), 72953#(<= main_~i~0 92), 72952#(<= main_~i~0 91), 72955#(<= main_~i~0 94), 72954#(<= main_~i~0 93), 72957#(<= main_~i~0 96), 72956#(<= main_~i~0 95), 72959#(<= main_~i~0 98), 72958#(<= main_~i~0 97)] [2018-04-12 03:09:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:27,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-12 03:09:27,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-12 03:09:27,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5465, Invalid=5877, Unknown=0, NotChecked=0, Total=11342 [2018-04-12 03:09:27,647 INFO L87 Difference]: Start difference. First operand 528 states and 528 transitions. Second operand 107 states. [2018-04-12 03:09:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:30,735 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-04-12 03:09:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-12 03:09:30,735 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 522 [2018-04-12 03:09:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:30,736 INFO L225 Difference]: With dead ends: 533 [2018-04-12 03:09:30,736 INFO L226 Difference]: Without dead ends: 533 [2018-04-12 03:09:30,738 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=16383, Invalid=27507, Unknown=0, NotChecked=0, Total=43890 [2018-04-12 03:09:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-12 03:09:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2018-04-12 03:09:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-04-12 03:09:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 533 transitions. [2018-04-12 03:09:30,740 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 533 transitions. Word has length 522 [2018-04-12 03:09:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:30,740 INFO L459 AbstractCegarLoop]: Abstraction has 533 states and 533 transitions. [2018-04-12 03:09:30,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-12 03:09:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 533 transitions. [2018-04-12 03:09:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-04-12 03:09:30,741 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:30,741 INFO L355 BasicCegarLoop]: trace histogram [105, 104, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:30,741 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash 736312230, now seen corresponding path program 104 times [2018-04-12 03:09:30,742 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:30,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:33,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:33,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-04-12 03:09:33,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:33,897 INFO L182 omatonBuilderFactory]: Interpolants [74241#(<= main_~i~0 1), 74240#(<= main_~i~0 0), 74243#(<= main_~i~0 3), 74242#(<= main_~i~0 2), 74245#(<= main_~i~0 5), 74244#(<= main_~i~0 4), 74247#(<= main_~i~0 7), 74246#(<= main_~i~0 6), 74249#(<= main_~i~0 9), 74248#(<= main_~i~0 8), 74251#(<= main_~i~0 11), 74250#(<= main_~i~0 10), 74253#(<= main_~i~0 13), 74252#(<= main_~i~0 12), 74255#(<= main_~i~0 15), 74254#(<= main_~i~0 14), 74257#(<= main_~i~0 17), 74256#(<= main_~i~0 16), 74259#(<= main_~i~0 19), 74258#(<= main_~i~0 18), 74261#(<= main_~i~0 21), 74260#(<= main_~i~0 20), 74263#(<= main_~i~0 23), 74262#(<= main_~i~0 22), 74265#(<= main_~i~0 25), 74264#(<= main_~i~0 24), 74267#(<= main_~i~0 27), 74266#(<= main_~i~0 26), 74269#(<= main_~i~0 29), 74268#(<= main_~i~0 28), 74271#(<= main_~i~0 31), 74270#(<= main_~i~0 30), 74273#(<= main_~i~0 33), 74272#(<= main_~i~0 32), 74275#(<= main_~i~0 35), 74274#(<= main_~i~0 34), 74277#(<= main_~i~0 37), 74276#(<= main_~i~0 36), 74279#(<= main_~i~0 39), 74278#(<= main_~i~0 38), 74281#(<= main_~i~0 41), 74280#(<= main_~i~0 40), 74283#(<= main_~i~0 43), 74282#(<= main_~i~0 42), 74285#(<= main_~i~0 45), 74284#(<= main_~i~0 44), 74287#(<= main_~i~0 47), 74286#(<= main_~i~0 46), 74289#(<= main_~i~0 49), 74288#(<= main_~i~0 48), 74291#(<= main_~i~0 51), 74290#(<= main_~i~0 50), 74293#(<= main_~i~0 53), 74292#(<= main_~i~0 52), 74295#(<= main_~i~0 55), 74294#(<= main_~i~0 54), 74297#(<= main_~i~0 57), 74296#(<= main_~i~0 56), 74299#(<= main_~i~0 59), 74298#(<= main_~i~0 58), 74301#(<= main_~i~0 61), 74300#(<= main_~i~0 60), 74303#(<= main_~i~0 63), 74302#(<= main_~i~0 62), 74305#(<= main_~i~0 65), 74304#(<= main_~i~0 64), 74307#(<= main_~i~0 67), 74306#(<= main_~i~0 66), 74309#(<= main_~i~0 69), 74308#(<= main_~i~0 68), 74311#(<= main_~i~0 71), 74310#(<= main_~i~0 70), 74313#(<= main_~i~0 73), 74312#(<= main_~i~0 72), 74315#(<= main_~i~0 75), 74314#(<= main_~i~0 74), 74317#(<= main_~i~0 77), 74316#(<= main_~i~0 76), 74319#(<= main_~i~0 79), 74318#(<= main_~i~0 78), 74321#(<= main_~i~0 81), 74320#(<= main_~i~0 80), 74323#(<= main_~i~0 83), 74322#(<= main_~i~0 82), 74325#(<= main_~i~0 85), 74324#(<= main_~i~0 84), 74327#(<= main_~i~0 87), 74326#(<= main_~i~0 86), 74329#(<= main_~i~0 89), 74328#(<= main_~i~0 88), 74331#(<= main_~i~0 91), 74330#(<= main_~i~0 90), 74333#(<= main_~i~0 93), 74332#(<= main_~i~0 92), 74335#(<= main_~i~0 95), 74334#(<= main_~i~0 94), 74337#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 74336#(<= main_~i~0 96), 74339#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 74338#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 74341#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 74340#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 74343#(and (<= 6 main_~i~0) (<= main_~i~0 102)), 74342#(and (<= 5 main_~i~0) (<= main_~i~0 101)), 74345#(and (<= main_~i~0 104) (<= 8 main_~i~0)), 74344#(and (<= 7 main_~i~0) (<= main_~i~0 103)), 74239#false, 74238#true] [2018-04-12 03:09:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:33,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-12 03:09:33,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-12 03:09:33,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4870, Invalid=6686, Unknown=0, NotChecked=0, Total=11556 [2018-04-12 03:09:33,899 INFO L87 Difference]: Start difference. First operand 533 states and 533 transitions. Second operand 108 states. [2018-04-12 03:09:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:38,838 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2018-04-12 03:09:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-12 03:09:38,838 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 527 [2018-04-12 03:09:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:38,839 INFO L225 Difference]: With dead ends: 538 [2018-04-12 03:09:38,839 INFO L226 Difference]: Without dead ends: 538 [2018-04-12 03:09:38,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6235 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=15263, Invalid=29469, Unknown=0, NotChecked=0, Total=44732 [2018-04-12 03:09:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-04-12 03:09:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-04-12 03:09:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-04-12 03:09:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 538 transitions. [2018-04-12 03:09:38,841 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 538 transitions. Word has length 527 [2018-04-12 03:09:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:38,842 INFO L459 AbstractCegarLoop]: Abstraction has 538 states and 538 transitions. [2018-04-12 03:09:38,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-12 03:09:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 538 transitions. [2018-04-12 03:09:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-04-12 03:09:38,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:38,843 INFO L355 BasicCegarLoop]: trace histogram [106, 105, 105, 105, 105, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:38,843 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1772190441, now seen corresponding path program 105 times [2018-04-12 03:09:38,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:38,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 27510 backedges. 0 proven. 27510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:42,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:42,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-04-12 03:09:42,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:42,151 INFO L182 omatonBuilderFactory]: Interpolants [75631#false, 75630#true, 75633#(<= main_~i~0 1), 75632#(<= main_~i~0 0), 75635#(<= main_~i~0 3), 75634#(<= main_~i~0 2), 75637#(<= main_~i~0 5), 75636#(<= main_~i~0 4), 75639#(<= main_~i~0 7), 75638#(<= main_~i~0 6), 75641#(<= main_~i~0 9), 75640#(<= main_~i~0 8), 75643#(<= main_~i~0 11), 75642#(<= main_~i~0 10), 75645#(<= main_~i~0 13), 75644#(<= main_~i~0 12), 75647#(<= main_~i~0 15), 75646#(<= main_~i~0 14), 75649#(<= main_~i~0 17), 75648#(<= main_~i~0 16), 75651#(<= main_~i~0 19), 75650#(<= main_~i~0 18), 75653#(<= main_~i~0 21), 75652#(<= main_~i~0 20), 75655#(<= main_~i~0 23), 75654#(<= main_~i~0 22), 75657#(<= main_~i~0 25), 75656#(<= main_~i~0 24), 75659#(<= main_~i~0 27), 75658#(<= main_~i~0 26), 75661#(<= main_~i~0 29), 75660#(<= main_~i~0 28), 75663#(<= main_~i~0 31), 75662#(<= main_~i~0 30), 75665#(<= main_~i~0 33), 75664#(<= main_~i~0 32), 75667#(<= main_~i~0 35), 75666#(<= main_~i~0 34), 75669#(<= main_~i~0 37), 75668#(<= main_~i~0 36), 75671#(<= main_~i~0 39), 75670#(<= main_~i~0 38), 75673#(<= main_~i~0 41), 75672#(<= main_~i~0 40), 75675#(<= main_~i~0 43), 75674#(<= main_~i~0 42), 75677#(<= main_~i~0 45), 75676#(<= main_~i~0 44), 75679#(<= main_~i~0 47), 75678#(<= main_~i~0 46), 75681#(<= main_~i~0 49), 75680#(<= main_~i~0 48), 75683#(<= main_~i~0 51), 75682#(<= main_~i~0 50), 75685#(<= main_~i~0 53), 75684#(<= main_~i~0 52), 75687#(<= main_~i~0 55), 75686#(<= main_~i~0 54), 75689#(<= main_~i~0 57), 75688#(<= main_~i~0 56), 75691#(<= main_~i~0 59), 75690#(<= main_~i~0 58), 75693#(<= main_~i~0 61), 75692#(<= main_~i~0 60), 75695#(<= main_~i~0 63), 75694#(<= main_~i~0 62), 75697#(<= main_~i~0 65), 75696#(<= main_~i~0 64), 75699#(<= main_~i~0 67), 75698#(<= main_~i~0 66), 75701#(<= main_~i~0 69), 75700#(<= main_~i~0 68), 75703#(<= main_~i~0 71), 75702#(<= main_~i~0 70), 75705#(<= main_~i~0 73), 75704#(<= main_~i~0 72), 75707#(<= main_~i~0 75), 75706#(<= main_~i~0 74), 75709#(<= main_~i~0 77), 75708#(<= main_~i~0 76), 75711#(<= main_~i~0 79), 75710#(<= main_~i~0 78), 75713#(<= main_~i~0 81), 75712#(<= main_~i~0 80), 75715#(<= main_~i~0 83), 75714#(<= main_~i~0 82), 75717#(<= main_~i~0 85), 75716#(<= main_~i~0 84), 75719#(<= main_~i~0 87), 75718#(<= main_~i~0 86), 75721#(<= main_~i~0 89), 75720#(<= main_~i~0 88), 75723#(<= main_~i~0 91), 75722#(<= main_~i~0 90), 75725#(<= main_~i~0 93), 75724#(<= main_~i~0 92), 75727#(<= main_~i~0 95), 75726#(<= main_~i~0 94), 75729#(<= main_~i~0 97), 75728#(<= main_~i~0 96), 75731#(<= main_~i~0 99), 75730#(<= main_~i~0 98), 75733#(<= main_~i~0 101), 75732#(<= main_~i~0 100), 75735#(<= main_~i~0 103), 75734#(<= main_~i~0 102), 75737#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 75736#(<= main_~i~0 104), 75738#(and (<= 1 main_~i~0) (<= main_~i~0 105))] [2018-04-12 03:09:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 27510 backedges. 0 proven. 27510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:42,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-12 03:09:42,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-12 03:09:42,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5676, Invalid=6096, Unknown=0, NotChecked=0, Total=11772 [2018-04-12 03:09:42,153 INFO L87 Difference]: Start difference. First operand 538 states and 538 transitions. Second operand 109 states. [2018-04-12 03:09:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:45,399 INFO L93 Difference]: Finished difference Result 543 states and 543 transitions. [2018-04-12 03:09:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-12 03:09:45,431 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 532 [2018-04-12 03:09:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:45,432 INFO L225 Difference]: With dead ends: 543 [2018-04-12 03:09:45,432 INFO L226 Difference]: Without dead ends: 543 [2018-04-12 03:09:45,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=17016, Invalid=28566, Unknown=0, NotChecked=0, Total=45582 [2018-04-12 03:09:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-04-12 03:09:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2018-04-12 03:09:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-04-12 03:09:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2018-04-12 03:09:45,435 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 532 [2018-04-12 03:09:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:45,435 INFO L459 AbstractCegarLoop]: Abstraction has 543 states and 543 transitions. [2018-04-12 03:09:45,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-12 03:09:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 543 transitions. [2018-04-12 03:09:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-04-12 03:09:45,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:45,437 INFO L355 BasicCegarLoop]: trace histogram [107, 106, 106, 106, 106, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:45,437 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash -748914106, now seen corresponding path program 106 times [2018-04-12 03:09:45,437 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:45,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28037 backedges. 0 proven. 28037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:48,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:48,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-04-12 03:09:48,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:48,827 INFO L182 omatonBuilderFactory]: Interpolants [77057#(<= main_~i~0 20), 77056#(<= main_~i~0 19), 77059#(<= main_~i~0 22), 77058#(<= main_~i~0 21), 77061#(<= main_~i~0 24), 77060#(<= main_~i~0 23), 77063#(<= main_~i~0 26), 77062#(<= main_~i~0 25), 77065#(<= main_~i~0 28), 77064#(<= main_~i~0 27), 77067#(<= main_~i~0 30), 77066#(<= main_~i~0 29), 77069#(<= main_~i~0 32), 77068#(<= main_~i~0 31), 77071#(<= main_~i~0 34), 77070#(<= main_~i~0 33), 77073#(<= main_~i~0 36), 77072#(<= main_~i~0 35), 77075#(<= main_~i~0 38), 77074#(<= main_~i~0 37), 77077#(<= main_~i~0 40), 77076#(<= main_~i~0 39), 77079#(<= main_~i~0 42), 77078#(<= main_~i~0 41), 77081#(<= main_~i~0 44), 77080#(<= main_~i~0 43), 77083#(<= main_~i~0 46), 77082#(<= main_~i~0 45), 77085#(<= main_~i~0 48), 77084#(<= main_~i~0 47), 77087#(<= main_~i~0 50), 77086#(<= main_~i~0 49), 77089#(<= main_~i~0 52), 77088#(<= main_~i~0 51), 77091#(<= main_~i~0 54), 77090#(<= main_~i~0 53), 77093#(<= main_~i~0 56), 77092#(<= main_~i~0 55), 77095#(<= main_~i~0 58), 77094#(<= main_~i~0 57), 77097#(<= main_~i~0 60), 77096#(<= main_~i~0 59), 77099#(<= main_~i~0 62), 77098#(<= main_~i~0 61), 77101#(<= main_~i~0 64), 77100#(<= main_~i~0 63), 77103#(<= main_~i~0 66), 77102#(<= main_~i~0 65), 77105#(<= main_~i~0 68), 77104#(<= main_~i~0 67), 77107#(<= main_~i~0 70), 77106#(<= main_~i~0 69), 77109#(<= main_~i~0 72), 77108#(<= main_~i~0 71), 77111#(<= main_~i~0 74), 77110#(<= main_~i~0 73), 77113#(<= main_~i~0 76), 77112#(<= main_~i~0 75), 77115#(<= main_~i~0 78), 77114#(<= main_~i~0 77), 77117#(<= main_~i~0 80), 77116#(<= main_~i~0 79), 77119#(<= main_~i~0 82), 77118#(<= main_~i~0 81), 77121#(<= main_~i~0 84), 77120#(<= main_~i~0 83), 77123#(<= main_~i~0 86), 77122#(<= main_~i~0 85), 77125#(<= main_~i~0 88), 77124#(<= main_~i~0 87), 77127#(<= main_~i~0 90), 77126#(<= main_~i~0 89), 77129#(<= main_~i~0 92), 77128#(<= main_~i~0 91), 77131#(<= main_~i~0 94), 77130#(<= main_~i~0 93), 77133#(<= main_~i~0 96), 77132#(<= main_~i~0 95), 77135#(<= main_~i~0 98), 77134#(<= main_~i~0 97), 77137#(<= main_~i~0 100), 77136#(<= main_~i~0 99), 77139#(<= main_~i~0 102), 77138#(<= main_~i~0 101), 77141#(<= main_~i~0 104), 77140#(<= main_~i~0 103), 77143#(and (<= 1 main_~i~0) (<= main_~i~0 105)), 77142#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 77144#(and (<= 2 main_~i~0) (<= main_~i~0 106)), 77035#true, 77037#(<= main_~i~0 0), 77036#false, 77039#(<= main_~i~0 2), 77038#(<= main_~i~0 1), 77041#(<= main_~i~0 4), 77040#(<= main_~i~0 3), 77043#(<= main_~i~0 6), 77042#(<= main_~i~0 5), 77045#(<= main_~i~0 8), 77044#(<= main_~i~0 7), 77047#(<= main_~i~0 10), 77046#(<= main_~i~0 9), 77049#(<= main_~i~0 12), 77048#(<= main_~i~0 11), 77051#(<= main_~i~0 14), 77050#(<= main_~i~0 13), 77053#(<= main_~i~0 16), 77052#(<= main_~i~0 15), 77055#(<= main_~i~0 18), 77054#(<= main_~i~0 17)] [2018-04-12 03:09:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 28037 backedges. 0 proven. 28037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:48,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-12 03:09:48,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-12 03:09:48,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5678, Invalid=6312, Unknown=0, NotChecked=0, Total=11990 [2018-04-12 03:09:48,829 INFO L87 Difference]: Start difference. First operand 543 states and 543 transitions. Second operand 110 states. [2018-04-12 03:09:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:52,378 INFO L93 Difference]: Finished difference Result 548 states and 548 transitions. [2018-04-12 03:09:52,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-04-12 03:09:52,378 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 537 [2018-04-12 03:09:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:52,379 INFO L225 Difference]: With dead ends: 548 [2018-04-12 03:09:52,379 INFO L226 Difference]: Without dead ends: 548 [2018-04-12 03:09:52,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=17125, Invalid=29315, Unknown=0, NotChecked=0, Total=46440 [2018-04-12 03:09:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-12 03:09:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2018-04-12 03:09:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-04-12 03:09:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 548 transitions. [2018-04-12 03:09:52,383 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 548 transitions. Word has length 537 [2018-04-12 03:09:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:52,383 INFO L459 AbstractCegarLoop]: Abstraction has 548 states and 548 transitions. [2018-04-12 03:09:52,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-12 03:09:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 548 transitions. [2018-04-12 03:09:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-04-12 03:09:52,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:52,385 INFO L355 BasicCegarLoop]: trace histogram [108, 107, 107, 107, 107, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:52,385 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1878824329, now seen corresponding path program 107 times [2018-04-12 03:09:52,385 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:52,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:09:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 28569 backedges. 0 proven. 28569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:55,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:09:55,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-04-12 03:09:55,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:09:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:55,819 INFO L182 omatonBuilderFactory]: Interpolants [78453#true, 78455#(<= main_~i~0 0), 78454#false, 78457#(<= main_~i~0 2), 78456#(<= main_~i~0 1), 78459#(<= main_~i~0 4), 78458#(<= main_~i~0 3), 78461#(<= main_~i~0 6), 78460#(<= main_~i~0 5), 78463#(<= main_~i~0 8), 78462#(<= main_~i~0 7), 78465#(<= main_~i~0 10), 78464#(<= main_~i~0 9), 78467#(<= main_~i~0 12), 78466#(<= main_~i~0 11), 78469#(<= main_~i~0 14), 78468#(<= main_~i~0 13), 78471#(<= main_~i~0 16), 78470#(<= main_~i~0 15), 78473#(<= main_~i~0 18), 78472#(<= main_~i~0 17), 78475#(<= main_~i~0 20), 78474#(<= main_~i~0 19), 78477#(<= main_~i~0 22), 78476#(<= main_~i~0 21), 78479#(<= main_~i~0 24), 78478#(<= main_~i~0 23), 78481#(<= main_~i~0 26), 78480#(<= main_~i~0 25), 78483#(<= main_~i~0 28), 78482#(<= main_~i~0 27), 78485#(<= main_~i~0 30), 78484#(<= main_~i~0 29), 78487#(<= main_~i~0 32), 78486#(<= main_~i~0 31), 78489#(<= main_~i~0 34), 78488#(<= main_~i~0 33), 78491#(<= main_~i~0 36), 78490#(<= main_~i~0 35), 78493#(<= main_~i~0 38), 78492#(<= main_~i~0 37), 78495#(<= main_~i~0 40), 78494#(<= main_~i~0 39), 78497#(<= main_~i~0 42), 78496#(<= main_~i~0 41), 78499#(<= main_~i~0 44), 78498#(<= main_~i~0 43), 78501#(<= main_~i~0 46), 78500#(<= main_~i~0 45), 78503#(<= main_~i~0 48), 78502#(<= main_~i~0 47), 78505#(<= main_~i~0 50), 78504#(<= main_~i~0 49), 78507#(<= main_~i~0 52), 78506#(<= main_~i~0 51), 78509#(<= main_~i~0 54), 78508#(<= main_~i~0 53), 78511#(<= main_~i~0 56), 78510#(<= main_~i~0 55), 78513#(<= main_~i~0 58), 78512#(<= main_~i~0 57), 78515#(<= main_~i~0 60), 78514#(<= main_~i~0 59), 78517#(<= main_~i~0 62), 78516#(<= main_~i~0 61), 78519#(<= main_~i~0 64), 78518#(<= main_~i~0 63), 78521#(<= main_~i~0 66), 78520#(<= main_~i~0 65), 78523#(<= main_~i~0 68), 78522#(<= main_~i~0 67), 78525#(<= main_~i~0 70), 78524#(<= main_~i~0 69), 78527#(<= main_~i~0 72), 78526#(<= main_~i~0 71), 78529#(<= main_~i~0 74), 78528#(<= main_~i~0 73), 78531#(<= main_~i~0 76), 78530#(<= main_~i~0 75), 78533#(<= main_~i~0 78), 78532#(<= main_~i~0 77), 78535#(<= main_~i~0 80), 78534#(<= main_~i~0 79), 78537#(<= main_~i~0 82), 78536#(<= main_~i~0 81), 78539#(<= main_~i~0 84), 78538#(<= main_~i~0 83), 78541#(<= main_~i~0 86), 78540#(<= main_~i~0 85), 78543#(<= main_~i~0 88), 78542#(<= main_~i~0 87), 78545#(<= main_~i~0 90), 78544#(<= main_~i~0 89), 78547#(<= main_~i~0 92), 78546#(<= main_~i~0 91), 78549#(<= main_~i~0 94), 78548#(<= main_~i~0 93), 78551#(<= main_~i~0 96), 78550#(<= main_~i~0 95), 78553#(<= main_~i~0 98), 78552#(<= main_~i~0 97), 78555#(<= main_~i~0 100), 78554#(<= main_~i~0 99), 78557#(<= main_~i~0 102), 78556#(<= main_~i~0 101), 78559#(<= main_~i~0 104), 78558#(<= main_~i~0 103), 78561#(<= main_~i~0 106), 78560#(<= main_~i~0 105), 78563#(and (<= 1 main_~i~0) (<= main_~i~0 107)), 78562#(and (<= 0 main_~i~0) (<= main_~i~0 106))] [2018-04-12 03:09:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 28569 backedges. 0 proven. 28569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:09:55,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-12 03:09:55,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-12 03:09:55,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5891, Invalid=6319, Unknown=0, NotChecked=0, Total=12210 [2018-04-12 03:09:55,821 INFO L87 Difference]: Start difference. First operand 548 states and 548 transitions. Second operand 111 states. [2018-04-12 03:09:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:09:59,212 INFO L93 Difference]: Finished difference Result 553 states and 553 transitions. [2018-04-12 03:09:59,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-12 03:09:59,212 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 542 [2018-04-12 03:09:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:09:59,213 INFO L225 Difference]: With dead ends: 553 [2018-04-12 03:09:59,213 INFO L226 Difference]: Without dead ends: 553 [2018-04-12 03:09:59,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=17661, Invalid=29645, Unknown=0, NotChecked=0, Total=47306 [2018-04-12 03:09:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-04-12 03:09:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2018-04-12 03:09:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-04-12 03:09:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 553 transitions. [2018-04-12 03:09:59,216 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 553 transitions. Word has length 542 [2018-04-12 03:09:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:09:59,216 INFO L459 AbstractCegarLoop]: Abstraction has 553 states and 553 transitions. [2018-04-12 03:09:59,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-12 03:09:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 553 transitions. [2018-04-12 03:09:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-04-12 03:09:59,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:09:59,218 INFO L355 BasicCegarLoop]: trace histogram [109, 108, 108, 108, 108, 1, 1, 1, 1, 1, 1] [2018-04-12 03:09:59,218 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:09:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1445990170, now seen corresponding path program 108 times [2018-04-12 03:09:59,218 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:09:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:09:59,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:10:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 29106 backedges. 0 proven. 29106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:02,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:10:02,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-04-12 03:10:02,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:10:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:02,860 INFO L182 omatonBuilderFactory]: Interpolants [79885#false, 79884#true, 79887#(<= main_~i~0 1), 79886#(<= main_~i~0 0), 79889#(<= main_~i~0 3), 79888#(<= main_~i~0 2), 79891#(<= main_~i~0 5), 79890#(<= main_~i~0 4), 79893#(<= main_~i~0 7), 79892#(<= main_~i~0 6), 79895#(<= main_~i~0 9), 79894#(<= main_~i~0 8), 79897#(<= main_~i~0 11), 79896#(<= main_~i~0 10), 79899#(<= main_~i~0 13), 79898#(<= main_~i~0 12), 79901#(<= main_~i~0 15), 79900#(<= main_~i~0 14), 79903#(<= main_~i~0 17), 79902#(<= main_~i~0 16), 79905#(<= main_~i~0 19), 79904#(<= main_~i~0 18), 79907#(<= main_~i~0 21), 79906#(<= main_~i~0 20), 79909#(<= main_~i~0 23), 79908#(<= main_~i~0 22), 79911#(<= main_~i~0 25), 79910#(<= main_~i~0 24), 79913#(<= main_~i~0 27), 79912#(<= main_~i~0 26), 79915#(<= main_~i~0 29), 79914#(<= main_~i~0 28), 79917#(<= main_~i~0 31), 79916#(<= main_~i~0 30), 79919#(<= main_~i~0 33), 79918#(<= main_~i~0 32), 79921#(<= main_~i~0 35), 79920#(<= main_~i~0 34), 79923#(<= main_~i~0 37), 79922#(<= main_~i~0 36), 79925#(<= main_~i~0 39), 79924#(<= main_~i~0 38), 79927#(<= main_~i~0 41), 79926#(<= main_~i~0 40), 79929#(<= main_~i~0 43), 79928#(<= main_~i~0 42), 79931#(<= main_~i~0 45), 79930#(<= main_~i~0 44), 79933#(<= main_~i~0 47), 79932#(<= main_~i~0 46), 79935#(<= main_~i~0 49), 79934#(<= main_~i~0 48), 79937#(<= main_~i~0 51), 79936#(<= main_~i~0 50), 79939#(<= main_~i~0 53), 79938#(<= main_~i~0 52), 79941#(<= main_~i~0 55), 79940#(<= main_~i~0 54), 79943#(<= main_~i~0 57), 79942#(<= main_~i~0 56), 79945#(<= main_~i~0 59), 79944#(<= main_~i~0 58), 79947#(<= main_~i~0 61), 79946#(<= main_~i~0 60), 79949#(<= main_~i~0 63), 79948#(<= main_~i~0 62), 79951#(<= main_~i~0 65), 79950#(<= main_~i~0 64), 79953#(<= main_~i~0 67), 79952#(<= main_~i~0 66), 79955#(<= main_~i~0 69), 79954#(<= main_~i~0 68), 79957#(<= main_~i~0 71), 79956#(<= main_~i~0 70), 79959#(<= main_~i~0 73), 79958#(<= main_~i~0 72), 79961#(<= main_~i~0 75), 79960#(<= main_~i~0 74), 79963#(<= main_~i~0 77), 79962#(<= main_~i~0 76), 79965#(<= main_~i~0 79), 79964#(<= main_~i~0 78), 79967#(<= main_~i~0 81), 79966#(<= main_~i~0 80), 79969#(<= main_~i~0 83), 79968#(<= main_~i~0 82), 79971#(<= main_~i~0 85), 79970#(<= main_~i~0 84), 79973#(<= main_~i~0 87), 79972#(<= main_~i~0 86), 79975#(<= main_~i~0 89), 79974#(<= main_~i~0 88), 79977#(<= main_~i~0 91), 79976#(<= main_~i~0 90), 79979#(<= main_~i~0 93), 79978#(<= main_~i~0 92), 79981#(<= main_~i~0 95), 79980#(<= main_~i~0 94), 79983#(<= main_~i~0 97), 79982#(<= main_~i~0 96), 79985#(<= main_~i~0 99), 79984#(<= main_~i~0 98), 79987#(<= main_~i~0 101), 79986#(<= main_~i~0 100), 79989#(<= main_~i~0 103), 79988#(<= main_~i~0 102), 79991#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 79990#(<= main_~i~0 104), 79993#(and (<= 2 main_~i~0) (<= main_~i~0 106)), 79992#(and (<= 1 main_~i~0) (<= main_~i~0 105)), 79995#(and (<= 4 main_~i~0) (<= main_~i~0 108)), 79994#(and (<= 3 main_~i~0) (<= main_~i~0 107))] [2018-04-12 03:10:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 29106 backedges. 0 proven. 29106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:02,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-04-12 03:10:02,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-04-12 03:10:02,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5682, Invalid=6750, Unknown=0, NotChecked=0, Total=12432 [2018-04-12 03:10:02,862 INFO L87 Difference]: Start difference. First operand 553 states and 553 transitions. Second operand 112 states. [2018-04-12 03:10:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:10:07,113 INFO L93 Difference]: Finished difference Result 558 states and 558 transitions. [2018-04-12 03:10:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-12 03:10:07,113 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 547 [2018-04-12 03:10:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:10:07,114 INFO L225 Difference]: With dead ends: 558 [2018-04-12 03:10:07,114 INFO L226 Difference]: Without dead ends: 558 [2018-04-12 03:10:07,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6305 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=17343, Invalid=30837, Unknown=0, NotChecked=0, Total=48180 [2018-04-12 03:10:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-04-12 03:10:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2018-04-12 03:10:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-04-12 03:10:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 558 transitions. [2018-04-12 03:10:07,117 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 558 transitions. Word has length 547 [2018-04-12 03:10:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:10:07,117 INFO L459 AbstractCegarLoop]: Abstraction has 558 states and 558 transitions. [2018-04-12 03:10:07,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-04-12 03:10:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 558 transitions. [2018-04-12 03:10:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-04-12 03:10:07,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:10:07,118 INFO L355 BasicCegarLoop]: trace histogram [110, 109, 109, 109, 109, 1, 1, 1, 1, 1, 1] [2018-04-12 03:10:07,119 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:10:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 911284183, now seen corresponding path program 109 times [2018-04-12 03:10:07,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:10:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:10:07,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:10:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29648 backedges. 0 proven. 29648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:10,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:10:10,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-04-12 03:10:10,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:10:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:10,650 INFO L182 omatonBuilderFactory]: Interpolants [81409#(<= main_~i~0 79), 81408#(<= main_~i~0 78), 81411#(<= main_~i~0 81), 81410#(<= main_~i~0 80), 81413#(<= main_~i~0 83), 81412#(<= main_~i~0 82), 81415#(<= main_~i~0 85), 81414#(<= main_~i~0 84), 81417#(<= main_~i~0 87), 81416#(<= main_~i~0 86), 81419#(<= main_~i~0 89), 81418#(<= main_~i~0 88), 81421#(<= main_~i~0 91), 81420#(<= main_~i~0 90), 81423#(<= main_~i~0 93), 81422#(<= main_~i~0 92), 81425#(<= main_~i~0 95), 81424#(<= main_~i~0 94), 81427#(<= main_~i~0 97), 81426#(<= main_~i~0 96), 81429#(<= main_~i~0 99), 81428#(<= main_~i~0 98), 81431#(<= main_~i~0 101), 81430#(<= main_~i~0 100), 81433#(<= main_~i~0 103), 81432#(<= main_~i~0 102), 81435#(<= main_~i~0 105), 81434#(<= main_~i~0 104), 81437#(<= main_~i~0 107), 81436#(<= main_~i~0 106), 81439#(and (<= 0 main_~i~0) (<= main_~i~0 108)), 81438#(<= main_~i~0 108), 81440#(and (<= 1 main_~i~0) (<= main_~i~0 109)), 81329#false, 81328#true, 81331#(<= main_~i~0 1), 81330#(<= main_~i~0 0), 81333#(<= main_~i~0 3), 81332#(<= main_~i~0 2), 81335#(<= main_~i~0 5), 81334#(<= main_~i~0 4), 81337#(<= main_~i~0 7), 81336#(<= main_~i~0 6), 81339#(<= main_~i~0 9), 81338#(<= main_~i~0 8), 81341#(<= main_~i~0 11), 81340#(<= main_~i~0 10), 81343#(<= main_~i~0 13), 81342#(<= main_~i~0 12), 81345#(<= main_~i~0 15), 81344#(<= main_~i~0 14), 81347#(<= main_~i~0 17), 81346#(<= main_~i~0 16), 81349#(<= main_~i~0 19), 81348#(<= main_~i~0 18), 81351#(<= main_~i~0 21), 81350#(<= main_~i~0 20), 81353#(<= main_~i~0 23), 81352#(<= main_~i~0 22), 81355#(<= main_~i~0 25), 81354#(<= main_~i~0 24), 81357#(<= main_~i~0 27), 81356#(<= main_~i~0 26), 81359#(<= main_~i~0 29), 81358#(<= main_~i~0 28), 81361#(<= main_~i~0 31), 81360#(<= main_~i~0 30), 81363#(<= main_~i~0 33), 81362#(<= main_~i~0 32), 81365#(<= main_~i~0 35), 81364#(<= main_~i~0 34), 81367#(<= main_~i~0 37), 81366#(<= main_~i~0 36), 81369#(<= main_~i~0 39), 81368#(<= main_~i~0 38), 81371#(<= main_~i~0 41), 81370#(<= main_~i~0 40), 81373#(<= main_~i~0 43), 81372#(<= main_~i~0 42), 81375#(<= main_~i~0 45), 81374#(<= main_~i~0 44), 81377#(<= main_~i~0 47), 81376#(<= main_~i~0 46), 81379#(<= main_~i~0 49), 81378#(<= main_~i~0 48), 81381#(<= main_~i~0 51), 81380#(<= main_~i~0 50), 81383#(<= main_~i~0 53), 81382#(<= main_~i~0 52), 81385#(<= main_~i~0 55), 81384#(<= main_~i~0 54), 81387#(<= main_~i~0 57), 81386#(<= main_~i~0 56), 81389#(<= main_~i~0 59), 81388#(<= main_~i~0 58), 81391#(<= main_~i~0 61), 81390#(<= main_~i~0 60), 81393#(<= main_~i~0 63), 81392#(<= main_~i~0 62), 81395#(<= main_~i~0 65), 81394#(<= main_~i~0 64), 81397#(<= main_~i~0 67), 81396#(<= main_~i~0 66), 81399#(<= main_~i~0 69), 81398#(<= main_~i~0 68), 81401#(<= main_~i~0 71), 81400#(<= main_~i~0 70), 81403#(<= main_~i~0 73), 81402#(<= main_~i~0 72), 81405#(<= main_~i~0 75), 81404#(<= main_~i~0 74), 81407#(<= main_~i~0 77), 81406#(<= main_~i~0 76)] [2018-04-12 03:10:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 29648 backedges. 0 proven. 29648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:10,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-12 03:10:10,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-12 03:10:10,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6110, Invalid=6546, Unknown=0, NotChecked=0, Total=12656 [2018-04-12 03:10:10,652 INFO L87 Difference]: Start difference. First operand 558 states and 558 transitions. Second operand 113 states. [2018-04-12 03:10:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:10:14,190 INFO L93 Difference]: Finished difference Result 563 states and 563 transitions. [2018-04-12 03:10:14,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-12 03:10:14,190 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 552 [2018-04-12 03:10:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:10:14,191 INFO L225 Difference]: With dead ends: 563 [2018-04-12 03:10:14,191 INFO L226 Difference]: Without dead ends: 563 [2018-04-12 03:10:14,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=18318, Invalid=30744, Unknown=0, NotChecked=0, Total=49062 [2018-04-12 03:10:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-04-12 03:10:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2018-04-12 03:10:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-12 03:10:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-04-12 03:10:14,195 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 552 [2018-04-12 03:10:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:10:14,195 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-04-12 03:10:14,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-12 03:10:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-04-12 03:10:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-04-12 03:10:14,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:10:14,197 INFO L355 BasicCegarLoop]: trace histogram [111, 110, 110, 110, 110, 1, 1, 1, 1, 1, 1] [2018-04-12 03:10:14,197 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:10:14,197 INFO L82 PathProgramCache]: Analyzing trace with hash -975724666, now seen corresponding path program 110 times [2018-04-12 03:10:14,197 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:10:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:10:14,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:10:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30195 backedges. 0 proven. 30195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:17,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:10:17,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-04-12 03:10:17,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:10:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:17,849 INFO L182 omatonBuilderFactory]: Interpolants [82785#true, 82787#(<= main_~i~0 0), 82786#false, 82789#(<= main_~i~0 2), 82788#(<= main_~i~0 1), 82791#(<= main_~i~0 4), 82790#(<= main_~i~0 3), 82793#(<= main_~i~0 6), 82792#(<= main_~i~0 5), 82795#(<= main_~i~0 8), 82794#(<= main_~i~0 7), 82797#(<= main_~i~0 10), 82796#(<= main_~i~0 9), 82799#(<= main_~i~0 12), 82798#(<= main_~i~0 11), 82801#(<= main_~i~0 14), 82800#(<= main_~i~0 13), 82803#(<= main_~i~0 16), 82802#(<= main_~i~0 15), 82805#(<= main_~i~0 18), 82804#(<= main_~i~0 17), 82807#(<= main_~i~0 20), 82806#(<= main_~i~0 19), 82809#(<= main_~i~0 22), 82808#(<= main_~i~0 21), 82811#(<= main_~i~0 24), 82810#(<= main_~i~0 23), 82813#(<= main_~i~0 26), 82812#(<= main_~i~0 25), 82815#(<= main_~i~0 28), 82814#(<= main_~i~0 27), 82817#(<= main_~i~0 30), 82816#(<= main_~i~0 29), 82819#(<= main_~i~0 32), 82818#(<= main_~i~0 31), 82821#(<= main_~i~0 34), 82820#(<= main_~i~0 33), 82823#(<= main_~i~0 36), 82822#(<= main_~i~0 35), 82825#(<= main_~i~0 38), 82824#(<= main_~i~0 37), 82827#(<= main_~i~0 40), 82826#(<= main_~i~0 39), 82829#(<= main_~i~0 42), 82828#(<= main_~i~0 41), 82831#(<= main_~i~0 44), 82830#(<= main_~i~0 43), 82833#(<= main_~i~0 46), 82832#(<= main_~i~0 45), 82835#(<= main_~i~0 48), 82834#(<= main_~i~0 47), 82837#(<= main_~i~0 50), 82836#(<= main_~i~0 49), 82839#(<= main_~i~0 52), 82838#(<= main_~i~0 51), 82841#(<= main_~i~0 54), 82840#(<= main_~i~0 53), 82843#(<= main_~i~0 56), 82842#(<= main_~i~0 55), 82845#(<= main_~i~0 58), 82844#(<= main_~i~0 57), 82847#(<= main_~i~0 60), 82846#(<= main_~i~0 59), 82849#(<= main_~i~0 62), 82848#(<= main_~i~0 61), 82851#(<= main_~i~0 64), 82850#(<= main_~i~0 63), 82853#(<= main_~i~0 66), 82852#(<= main_~i~0 65), 82855#(<= main_~i~0 68), 82854#(<= main_~i~0 67), 82857#(<= main_~i~0 70), 82856#(<= main_~i~0 69), 82859#(<= main_~i~0 72), 82858#(<= main_~i~0 71), 82861#(<= main_~i~0 74), 82860#(<= main_~i~0 73), 82863#(<= main_~i~0 76), 82862#(<= main_~i~0 75), 82865#(<= main_~i~0 78), 82864#(<= main_~i~0 77), 82867#(<= main_~i~0 80), 82866#(<= main_~i~0 79), 82869#(<= main_~i~0 82), 82868#(<= main_~i~0 81), 82871#(<= main_~i~0 84), 82870#(<= main_~i~0 83), 82873#(<= main_~i~0 86), 82872#(<= main_~i~0 85), 82875#(<= main_~i~0 88), 82874#(<= main_~i~0 87), 82877#(<= main_~i~0 90), 82876#(<= main_~i~0 89), 82879#(<= main_~i~0 92), 82878#(<= main_~i~0 91), 82881#(<= main_~i~0 94), 82880#(<= main_~i~0 93), 82883#(<= main_~i~0 96), 82882#(<= main_~i~0 95), 82885#(<= main_~i~0 98), 82884#(<= main_~i~0 97), 82887#(<= main_~i~0 100), 82886#(<= main_~i~0 99), 82889#(<= main_~i~0 102), 82888#(<= main_~i~0 101), 82891#(<= main_~i~0 104), 82890#(<= main_~i~0 103), 82893#(<= main_~i~0 106), 82892#(<= main_~i~0 105), 82895#(<= main_~i~0 108), 82894#(<= main_~i~0 107), 82897#(and (<= 1 main_~i~0) (<= main_~i~0 109)), 82896#(and (<= 0 main_~i~0) (<= main_~i~0 108)), 82898#(and (<= 2 main_~i~0) (<= main_~i~0 110))] [2018-04-12 03:10:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30195 backedges. 0 proven. 30195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:17,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-12 03:10:17,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-12 03:10:17,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6112, Invalid=6770, Unknown=0, NotChecked=0, Total=12882 [2018-04-12 03:10:17,851 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 114 states. [2018-04-12 03:10:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:10:21,657 INFO L93 Difference]: Finished difference Result 568 states and 568 transitions. [2018-04-12 03:10:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-12 03:10:21,657 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 557 [2018-04-12 03:10:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:10:21,658 INFO L225 Difference]: With dead ends: 568 [2018-04-12 03:10:21,658 INFO L226 Difference]: Without dead ends: 568 [2018-04-12 03:10:21,660 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6322 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=18431, Invalid=31521, Unknown=0, NotChecked=0, Total=49952 [2018-04-12 03:10:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-04-12 03:10:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2018-04-12 03:10:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-04-12 03:10:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 568 transitions. [2018-04-12 03:10:21,662 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 568 transitions. Word has length 557 [2018-04-12 03:10:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:10:21,662 INFO L459 AbstractCegarLoop]: Abstraction has 568 states and 568 transitions. [2018-04-12 03:10:21,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-12 03:10:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 568 transitions. [2018-04-12 03:10:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-04-12 03:10:21,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:10:21,664 INFO L355 BasicCegarLoop]: trace histogram [112, 111, 111, 111, 111, 1, 1, 1, 1, 1, 1] [2018-04-12 03:10:21,664 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:10:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2098361033, now seen corresponding path program 111 times [2018-04-12 03:10:21,665 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:10:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:10:21,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:10:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 30747 backedges. 0 proven. 30747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:25,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:10:25,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-04-12 03:10:25,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:10:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:25,383 INFO L182 omatonBuilderFactory]: Interpolants [84255#true, 84257#(<= main_~i~0 0), 84256#false, 84259#(<= main_~i~0 2), 84258#(<= main_~i~0 1), 84261#(<= main_~i~0 4), 84260#(<= main_~i~0 3), 84263#(<= main_~i~0 6), 84262#(<= main_~i~0 5), 84265#(<= main_~i~0 8), 84264#(<= main_~i~0 7), 84267#(<= main_~i~0 10), 84266#(<= main_~i~0 9), 84269#(<= main_~i~0 12), 84268#(<= main_~i~0 11), 84271#(<= main_~i~0 14), 84270#(<= main_~i~0 13), 84273#(<= main_~i~0 16), 84272#(<= main_~i~0 15), 84275#(<= main_~i~0 18), 84274#(<= main_~i~0 17), 84277#(<= main_~i~0 20), 84276#(<= main_~i~0 19), 84279#(<= main_~i~0 22), 84278#(<= main_~i~0 21), 84281#(<= main_~i~0 24), 84280#(<= main_~i~0 23), 84283#(<= main_~i~0 26), 84282#(<= main_~i~0 25), 84285#(<= main_~i~0 28), 84284#(<= main_~i~0 27), 84287#(<= main_~i~0 30), 84286#(<= main_~i~0 29), 84289#(<= main_~i~0 32), 84288#(<= main_~i~0 31), 84291#(<= main_~i~0 34), 84290#(<= main_~i~0 33), 84293#(<= main_~i~0 36), 84292#(<= main_~i~0 35), 84295#(<= main_~i~0 38), 84294#(<= main_~i~0 37), 84297#(<= main_~i~0 40), 84296#(<= main_~i~0 39), 84299#(<= main_~i~0 42), 84298#(<= main_~i~0 41), 84301#(<= main_~i~0 44), 84300#(<= main_~i~0 43), 84303#(<= main_~i~0 46), 84302#(<= main_~i~0 45), 84305#(<= main_~i~0 48), 84304#(<= main_~i~0 47), 84307#(<= main_~i~0 50), 84306#(<= main_~i~0 49), 84309#(<= main_~i~0 52), 84308#(<= main_~i~0 51), 84311#(<= main_~i~0 54), 84310#(<= main_~i~0 53), 84313#(<= main_~i~0 56), 84312#(<= main_~i~0 55), 84315#(<= main_~i~0 58), 84314#(<= main_~i~0 57), 84317#(<= main_~i~0 60), 84316#(<= main_~i~0 59), 84319#(<= main_~i~0 62), 84318#(<= main_~i~0 61), 84321#(<= main_~i~0 64), 84320#(<= main_~i~0 63), 84323#(<= main_~i~0 66), 84322#(<= main_~i~0 65), 84325#(<= main_~i~0 68), 84324#(<= main_~i~0 67), 84327#(<= main_~i~0 70), 84326#(<= main_~i~0 69), 84329#(<= main_~i~0 72), 84328#(<= main_~i~0 71), 84331#(<= main_~i~0 74), 84330#(<= main_~i~0 73), 84333#(<= main_~i~0 76), 84332#(<= main_~i~0 75), 84335#(<= main_~i~0 78), 84334#(<= main_~i~0 77), 84337#(<= main_~i~0 80), 84336#(<= main_~i~0 79), 84339#(<= main_~i~0 82), 84338#(<= main_~i~0 81), 84341#(<= main_~i~0 84), 84340#(<= main_~i~0 83), 84343#(<= main_~i~0 86), 84342#(<= main_~i~0 85), 84345#(<= main_~i~0 88), 84344#(<= main_~i~0 87), 84347#(<= main_~i~0 90), 84346#(<= main_~i~0 89), 84349#(<= main_~i~0 92), 84348#(<= main_~i~0 91), 84351#(<= main_~i~0 94), 84350#(<= main_~i~0 93), 84353#(<= main_~i~0 96), 84352#(<= main_~i~0 95), 84355#(<= main_~i~0 98), 84354#(<= main_~i~0 97), 84357#(<= main_~i~0 100), 84356#(<= main_~i~0 99), 84359#(<= main_~i~0 102), 84358#(<= main_~i~0 101), 84361#(<= main_~i~0 104), 84360#(<= main_~i~0 103), 84363#(<= main_~i~0 106), 84362#(<= main_~i~0 105), 84365#(<= main_~i~0 108), 84364#(<= main_~i~0 107), 84367#(<= main_~i~0 110), 84366#(<= main_~i~0 109), 84369#(and (<= 1 main_~i~0) (<= main_~i~0 111)), 84368#(and (<= 0 main_~i~0) (<= main_~i~0 110))] [2018-04-12 03:10:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30747 backedges. 0 proven. 30747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:25,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-04-12 03:10:25,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-04-12 03:10:25,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6333, Invalid=6777, Unknown=0, NotChecked=0, Total=13110 [2018-04-12 03:10:25,385 INFO L87 Difference]: Start difference. First operand 568 states and 568 transitions. Second operand 115 states. [2018-04-12 03:10:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:10:28,951 INFO L93 Difference]: Finished difference Result 573 states and 573 transitions. [2018-04-12 03:10:28,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-12 03:10:28,951 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 562 [2018-04-12 03:10:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:10:28,952 INFO L225 Difference]: With dead ends: 573 [2018-04-12 03:10:28,952 INFO L226 Difference]: Without dead ends: 573 [2018-04-12 03:10:28,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6326 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=18987, Invalid=31863, Unknown=0, NotChecked=0, Total=50850 [2018-04-12 03:10:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-04-12 03:10:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2018-04-12 03:10:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-04-12 03:10:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 573 transitions. [2018-04-12 03:10:28,958 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 573 transitions. Word has length 562 [2018-04-12 03:10:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:10:28,958 INFO L459 AbstractCegarLoop]: Abstraction has 573 states and 573 transitions. [2018-04-12 03:10:28,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-04-12 03:10:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 573 transitions. [2018-04-12 03:10:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-04-12 03:10:28,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:10:28,961 INFO L355 BasicCegarLoop]: trace histogram [113, 112, 112, 112, 112, 1, 1, 1, 1, 1, 1] [2018-04-12 03:10:28,961 INFO L408 AbstractCegarLoop]: === Iteration 117 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:10:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1166902822, now seen corresponding path program 112 times [2018-04-12 03:10:28,961 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:10:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:10:28,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:10:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 31304 backedges. 0 proven. 31304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:32,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:10:32,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-04-12 03:10:32,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:10:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:32,624 INFO L182 omatonBuilderFactory]: Interpolants [85761#(<= main_~i~0 21), 85760#(<= main_~i~0 20), 85763#(<= main_~i~0 23), 85762#(<= main_~i~0 22), 85765#(<= main_~i~0 25), 85764#(<= main_~i~0 24), 85767#(<= main_~i~0 27), 85766#(<= main_~i~0 26), 85769#(<= main_~i~0 29), 85768#(<= main_~i~0 28), 85771#(<= main_~i~0 31), 85770#(<= main_~i~0 30), 85773#(<= main_~i~0 33), 85772#(<= main_~i~0 32), 85775#(<= main_~i~0 35), 85774#(<= main_~i~0 34), 85777#(<= main_~i~0 37), 85776#(<= main_~i~0 36), 85779#(<= main_~i~0 39), 85778#(<= main_~i~0 38), 85781#(<= main_~i~0 41), 85780#(<= main_~i~0 40), 85783#(<= main_~i~0 43), 85782#(<= main_~i~0 42), 85785#(<= main_~i~0 45), 85784#(<= main_~i~0 44), 85787#(<= main_~i~0 47), 85786#(<= main_~i~0 46), 85789#(<= main_~i~0 49), 85788#(<= main_~i~0 48), 85791#(<= main_~i~0 51), 85790#(<= main_~i~0 50), 85793#(<= main_~i~0 53), 85792#(<= main_~i~0 52), 85795#(<= main_~i~0 55), 85794#(<= main_~i~0 54), 85797#(<= main_~i~0 57), 85796#(<= main_~i~0 56), 85799#(<= main_~i~0 59), 85798#(<= main_~i~0 58), 85801#(<= main_~i~0 61), 85800#(<= main_~i~0 60), 85803#(<= main_~i~0 63), 85802#(<= main_~i~0 62), 85805#(<= main_~i~0 65), 85804#(<= main_~i~0 64), 85807#(<= main_~i~0 67), 85806#(<= main_~i~0 66), 85809#(<= main_~i~0 69), 85808#(<= main_~i~0 68), 85811#(<= main_~i~0 71), 85810#(<= main_~i~0 70), 85813#(<= main_~i~0 73), 85812#(<= main_~i~0 72), 85815#(<= main_~i~0 75), 85814#(<= main_~i~0 74), 85817#(<= main_~i~0 77), 85816#(<= main_~i~0 76), 85819#(<= main_~i~0 79), 85818#(<= main_~i~0 78), 85821#(<= main_~i~0 81), 85820#(<= main_~i~0 80), 85823#(<= main_~i~0 83), 85822#(<= main_~i~0 82), 85825#(<= main_~i~0 85), 85824#(<= main_~i~0 84), 85827#(<= main_~i~0 87), 85826#(<= main_~i~0 86), 85829#(<= main_~i~0 89), 85828#(<= main_~i~0 88), 85831#(<= main_~i~0 91), 85830#(<= main_~i~0 90), 85833#(<= main_~i~0 93), 85832#(<= main_~i~0 92), 85835#(<= main_~i~0 95), 85834#(<= main_~i~0 94), 85837#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 85836#(<= main_~i~0 96), 85839#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 85838#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 85841#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 85840#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 85843#(and (<= 6 main_~i~0) (<= main_~i~0 102)), 85842#(and (<= 5 main_~i~0) (<= main_~i~0 101)), 85845#(and (<= main_~i~0 104) (<= 8 main_~i~0)), 85844#(and (<= 7 main_~i~0) (<= main_~i~0 103)), 85847#(and (<= main_~i~0 106) (<= 10 main_~i~0)), 85846#(and (<= 9 main_~i~0) (<= main_~i~0 105)), 85849#(and (<= 12 main_~i~0) (<= main_~i~0 108)), 85848#(and (<= 11 main_~i~0) (<= main_~i~0 107)), 85851#(and (<= main_~i~0 110) (<= 14 main_~i~0)), 85850#(and (<= main_~i~0 109) (<= 13 main_~i~0)), 85853#(and (<= main_~i~0 112) (<= 16 main_~i~0)), 85852#(and (<= main_~i~0 111) (<= 15 main_~i~0)), 85739#false, 85738#true, 85741#(<= main_~i~0 1), 85740#(<= main_~i~0 0), 85743#(<= main_~i~0 3), 85742#(<= main_~i~0 2), 85745#(<= main_~i~0 5), 85744#(<= main_~i~0 4), 85747#(<= main_~i~0 7), 85746#(<= main_~i~0 6), 85749#(<= main_~i~0 9), 85748#(<= main_~i~0 8), 85751#(<= main_~i~0 11), 85750#(<= main_~i~0 10), 85753#(<= main_~i~0 13), 85752#(<= main_~i~0 12), 85755#(<= main_~i~0 15), 85754#(<= main_~i~0 14), 85757#(<= main_~i~0 17), 85756#(<= main_~i~0 16), 85759#(<= main_~i~0 19), 85758#(<= main_~i~0 18)] [2018-04-12 03:10:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 31304 backedges. 0 proven. 31304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:32,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-12 03:10:32,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-12 03:10:32,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4886, Invalid=8454, Unknown=0, NotChecked=0, Total=13340 [2018-04-12 03:10:32,626 INFO L87 Difference]: Start difference. First operand 573 states and 573 transitions. Second operand 116 states. [2018-04-12 03:10:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:10:40,400 INFO L93 Difference]: Finished difference Result 578 states and 578 transitions. [2018-04-12 03:10:40,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-12 03:10:40,401 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 567 [2018-04-12 03:10:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:10:40,401 INFO L225 Difference]: With dead ends: 578 [2018-04-12 03:10:40,401 INFO L226 Difference]: Without dead ends: 578 [2018-04-12 03:10:40,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7879 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=16071, Invalid=35685, Unknown=0, NotChecked=0, Total=51756 [2018-04-12 03:10:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-04-12 03:10:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-04-12 03:10:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-04-12 03:10:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 578 transitions. [2018-04-12 03:10:40,406 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 578 transitions. Word has length 567 [2018-04-12 03:10:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:10:40,406 INFO L459 AbstractCegarLoop]: Abstraction has 578 states and 578 transitions. [2018-04-12 03:10:40,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-12 03:10:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 578 transitions. [2018-04-12 03:10:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-04-12 03:10:40,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:10:40,408 INFO L355 BasicCegarLoop]: trace histogram [114, 113, 113, 113, 113, 1, 1, 1, 1, 1, 1] [2018-04-12 03:10:40,408 INFO L408 AbstractCegarLoop]: === Iteration 118 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:10:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash 402573975, now seen corresponding path program 113 times [2018-04-12 03:10:40,408 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:10:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:10:40,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:10:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 31866 backedges. 0 proven. 31866 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:44,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:10:44,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-04-12 03:10:44,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:10:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:44,265 INFO L182 omatonBuilderFactory]: Interpolants [87297#(<= main_~i~0 61), 87296#(<= main_~i~0 60), 87299#(<= main_~i~0 63), 87298#(<= main_~i~0 62), 87301#(<= main_~i~0 65), 87300#(<= main_~i~0 64), 87303#(<= main_~i~0 67), 87302#(<= main_~i~0 66), 87305#(<= main_~i~0 69), 87304#(<= main_~i~0 68), 87307#(<= main_~i~0 71), 87306#(<= main_~i~0 70), 87309#(<= main_~i~0 73), 87308#(<= main_~i~0 72), 87311#(<= main_~i~0 75), 87310#(<= main_~i~0 74), 87313#(<= main_~i~0 77), 87312#(<= main_~i~0 76), 87315#(<= main_~i~0 79), 87314#(<= main_~i~0 78), 87317#(<= main_~i~0 81), 87316#(<= main_~i~0 80), 87319#(<= main_~i~0 83), 87318#(<= main_~i~0 82), 87321#(<= main_~i~0 85), 87320#(<= main_~i~0 84), 87323#(<= main_~i~0 87), 87322#(<= main_~i~0 86), 87325#(<= main_~i~0 89), 87324#(<= main_~i~0 88), 87327#(<= main_~i~0 91), 87326#(<= main_~i~0 90), 87329#(<= main_~i~0 93), 87328#(<= main_~i~0 92), 87331#(<= main_~i~0 95), 87330#(<= main_~i~0 94), 87333#(<= main_~i~0 97), 87332#(<= main_~i~0 96), 87335#(<= main_~i~0 99), 87334#(<= main_~i~0 98), 87337#(<= main_~i~0 101), 87336#(<= main_~i~0 100), 87339#(<= main_~i~0 103), 87338#(<= main_~i~0 102), 87341#(<= main_~i~0 105), 87340#(<= main_~i~0 104), 87343#(<= main_~i~0 107), 87342#(<= main_~i~0 106), 87345#(<= main_~i~0 109), 87344#(<= main_~i~0 108), 87347#(<= main_~i~0 111), 87346#(<= main_~i~0 110), 87349#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 87348#(<= main_~i~0 112), 87350#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 87235#false, 87234#true, 87237#(<= main_~i~0 1), 87236#(<= main_~i~0 0), 87239#(<= main_~i~0 3), 87238#(<= main_~i~0 2), 87241#(<= main_~i~0 5), 87240#(<= main_~i~0 4), 87243#(<= main_~i~0 7), 87242#(<= main_~i~0 6), 87245#(<= main_~i~0 9), 87244#(<= main_~i~0 8), 87247#(<= main_~i~0 11), 87246#(<= main_~i~0 10), 87249#(<= main_~i~0 13), 87248#(<= main_~i~0 12), 87251#(<= main_~i~0 15), 87250#(<= main_~i~0 14), 87253#(<= main_~i~0 17), 87252#(<= main_~i~0 16), 87255#(<= main_~i~0 19), 87254#(<= main_~i~0 18), 87257#(<= main_~i~0 21), 87256#(<= main_~i~0 20), 87259#(<= main_~i~0 23), 87258#(<= main_~i~0 22), 87261#(<= main_~i~0 25), 87260#(<= main_~i~0 24), 87263#(<= main_~i~0 27), 87262#(<= main_~i~0 26), 87265#(<= main_~i~0 29), 87264#(<= main_~i~0 28), 87267#(<= main_~i~0 31), 87266#(<= main_~i~0 30), 87269#(<= main_~i~0 33), 87268#(<= main_~i~0 32), 87271#(<= main_~i~0 35), 87270#(<= main_~i~0 34), 87273#(<= main_~i~0 37), 87272#(<= main_~i~0 36), 87275#(<= main_~i~0 39), 87274#(<= main_~i~0 38), 87277#(<= main_~i~0 41), 87276#(<= main_~i~0 40), 87279#(<= main_~i~0 43), 87278#(<= main_~i~0 42), 87281#(<= main_~i~0 45), 87280#(<= main_~i~0 44), 87283#(<= main_~i~0 47), 87282#(<= main_~i~0 46), 87285#(<= main_~i~0 49), 87284#(<= main_~i~0 48), 87287#(<= main_~i~0 51), 87286#(<= main_~i~0 50), 87289#(<= main_~i~0 53), 87288#(<= main_~i~0 52), 87291#(<= main_~i~0 55), 87290#(<= main_~i~0 54), 87293#(<= main_~i~0 57), 87292#(<= main_~i~0 56), 87295#(<= main_~i~0 59), 87294#(<= main_~i~0 58)] [2018-04-12 03:10:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 31866 backedges. 0 proven. 31866 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:44,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-12 03:10:44,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-12 03:10:44,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6560, Invalid=7012, Unknown=0, NotChecked=0, Total=13572 [2018-04-12 03:10:44,266 INFO L87 Difference]: Start difference. First operand 578 states and 578 transitions. Second operand 117 states. [2018-04-12 03:10:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:10:48,002 INFO L93 Difference]: Finished difference Result 583 states and 583 transitions. [2018-04-12 03:10:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-12 03:10:48,002 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 572 [2018-04-12 03:10:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:10:48,003 INFO L225 Difference]: With dead ends: 583 [2018-04-12 03:10:48,003 INFO L226 Difference]: Without dead ends: 583 [2018-04-12 03:10:48,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6553 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=19668, Invalid=33002, Unknown=0, NotChecked=0, Total=52670 [2018-04-12 03:10:48,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-04-12 03:10:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2018-04-12 03:10:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-04-12 03:10:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 583 transitions. [2018-04-12 03:10:48,007 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 583 transitions. Word has length 572 [2018-04-12 03:10:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:10:48,007 INFO L459 AbstractCegarLoop]: Abstraction has 583 states and 583 transitions. [2018-04-12 03:10:48,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-12 03:10:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 583 transitions. [2018-04-12 03:10:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-04-12 03:10:48,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:10:48,009 INFO L355 BasicCegarLoop]: trace histogram [115, 114, 114, 114, 114, 1, 1, 1, 1, 1, 1] [2018-04-12 03:10:48,009 INFO L408 AbstractCegarLoop]: === Iteration 119 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:10:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -292838202, now seen corresponding path program 114 times [2018-04-12 03:10:48,010 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:10:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:10:48,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:10:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 32433 backedges. 0 proven. 32433 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:51,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:10:51,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-04-12 03:10:51,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:10:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:51,960 INFO L182 omatonBuilderFactory]: Interpolants [88833#(<= main_~i~0 88), 88832#(<= main_~i~0 87), 88835#(<= main_~i~0 90), 88834#(<= main_~i~0 89), 88837#(<= main_~i~0 92), 88836#(<= main_~i~0 91), 88839#(<= main_~i~0 94), 88838#(<= main_~i~0 93), 88841#(<= main_~i~0 96), 88840#(<= main_~i~0 95), 88843#(<= main_~i~0 98), 88842#(<= main_~i~0 97), 88845#(<= main_~i~0 100), 88844#(<= main_~i~0 99), 88847#(<= main_~i~0 102), 88846#(<= main_~i~0 101), 88849#(<= main_~i~0 104), 88848#(<= main_~i~0 103), 88851#(<= main_~i~0 106), 88850#(<= main_~i~0 105), 88853#(<= main_~i~0 108), 88852#(<= main_~i~0 107), 88855#(<= main_~i~0 110), 88854#(<= main_~i~0 109), 88857#(<= main_~i~0 112), 88856#(<= main_~i~0 111), 88859#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 88858#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 88860#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 88743#true, 88745#(<= main_~i~0 0), 88744#false, 88747#(<= main_~i~0 2), 88746#(<= main_~i~0 1), 88749#(<= main_~i~0 4), 88748#(<= main_~i~0 3), 88751#(<= main_~i~0 6), 88750#(<= main_~i~0 5), 88753#(<= main_~i~0 8), 88752#(<= main_~i~0 7), 88755#(<= main_~i~0 10), 88754#(<= main_~i~0 9), 88757#(<= main_~i~0 12), 88756#(<= main_~i~0 11), 88759#(<= main_~i~0 14), 88758#(<= main_~i~0 13), 88761#(<= main_~i~0 16), 88760#(<= main_~i~0 15), 88763#(<= main_~i~0 18), 88762#(<= main_~i~0 17), 88765#(<= main_~i~0 20), 88764#(<= main_~i~0 19), 88767#(<= main_~i~0 22), 88766#(<= main_~i~0 21), 88769#(<= main_~i~0 24), 88768#(<= main_~i~0 23), 88771#(<= main_~i~0 26), 88770#(<= main_~i~0 25), 88773#(<= main_~i~0 28), 88772#(<= main_~i~0 27), 88775#(<= main_~i~0 30), 88774#(<= main_~i~0 29), 88777#(<= main_~i~0 32), 88776#(<= main_~i~0 31), 88779#(<= main_~i~0 34), 88778#(<= main_~i~0 33), 88781#(<= main_~i~0 36), 88780#(<= main_~i~0 35), 88783#(<= main_~i~0 38), 88782#(<= main_~i~0 37), 88785#(<= main_~i~0 40), 88784#(<= main_~i~0 39), 88787#(<= main_~i~0 42), 88786#(<= main_~i~0 41), 88789#(<= main_~i~0 44), 88788#(<= main_~i~0 43), 88791#(<= main_~i~0 46), 88790#(<= main_~i~0 45), 88793#(<= main_~i~0 48), 88792#(<= main_~i~0 47), 88795#(<= main_~i~0 50), 88794#(<= main_~i~0 49), 88797#(<= main_~i~0 52), 88796#(<= main_~i~0 51), 88799#(<= main_~i~0 54), 88798#(<= main_~i~0 53), 88801#(<= main_~i~0 56), 88800#(<= main_~i~0 55), 88803#(<= main_~i~0 58), 88802#(<= main_~i~0 57), 88805#(<= main_~i~0 60), 88804#(<= main_~i~0 59), 88807#(<= main_~i~0 62), 88806#(<= main_~i~0 61), 88809#(<= main_~i~0 64), 88808#(<= main_~i~0 63), 88811#(<= main_~i~0 66), 88810#(<= main_~i~0 65), 88813#(<= main_~i~0 68), 88812#(<= main_~i~0 67), 88815#(<= main_~i~0 70), 88814#(<= main_~i~0 69), 88817#(<= main_~i~0 72), 88816#(<= main_~i~0 71), 88819#(<= main_~i~0 74), 88818#(<= main_~i~0 73), 88821#(<= main_~i~0 76), 88820#(<= main_~i~0 75), 88823#(<= main_~i~0 78), 88822#(<= main_~i~0 77), 88825#(<= main_~i~0 80), 88824#(<= main_~i~0 79), 88827#(<= main_~i~0 82), 88826#(<= main_~i~0 81), 88829#(<= main_~i~0 84), 88828#(<= main_~i~0 83), 88831#(<= main_~i~0 86), 88830#(<= main_~i~0 85)] [2018-04-12 03:10:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 32433 backedges. 0 proven. 32433 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:10:51,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-12 03:10:51,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-12 03:10:51,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6562, Invalid=7244, Unknown=0, NotChecked=0, Total=13806 [2018-04-12 03:10:51,962 INFO L87 Difference]: Start difference. First operand 583 states and 583 transitions. Second operand 118 states. [2018-04-12 03:10:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:10:56,037 INFO L93 Difference]: Finished difference Result 588 states and 588 transitions. [2018-04-12 03:10:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-04-12 03:10:56,037 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 577 [2018-04-12 03:10:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:10:56,038 INFO L225 Difference]: With dead ends: 588 [2018-04-12 03:10:56,038 INFO L226 Difference]: Without dead ends: 588 [2018-04-12 03:10:56,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6780 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=19785, Invalid=33807, Unknown=0, NotChecked=0, Total=53592 [2018-04-12 03:10:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-04-12 03:10:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2018-04-12 03:10:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-04-12 03:10:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 588 transitions. [2018-04-12 03:10:56,046 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 588 transitions. Word has length 577 [2018-04-12 03:10:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:10:56,046 INFO L459 AbstractCegarLoop]: Abstraction has 588 states and 588 transitions. [2018-04-12 03:10:56,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-12 03:10:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 588 transitions. [2018-04-12 03:10:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-04-12 03:10:56,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:10:56,049 INFO L355 BasicCegarLoop]: trace histogram [116, 115, 115, 115, 115, 1, 1, 1, 1, 1, 1] [2018-04-12 03:10:56,049 INFO L408 AbstractCegarLoop]: === Iteration 120 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:10:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1607806985, now seen corresponding path program 115 times [2018-04-12 03:10:56,050 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:10:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:10:56,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:11:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 33005 backedges. 0 proven. 33005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:00,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:11:00,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-04-12 03:11:00,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:11:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:00,091 INFO L182 omatonBuilderFactory]: Interpolants [90369#(<= main_~i~0 102), 90368#(<= main_~i~0 101), 90371#(<= main_~i~0 104), 90370#(<= main_~i~0 103), 90373#(<= main_~i~0 106), 90372#(<= main_~i~0 105), 90375#(<= main_~i~0 108), 90374#(<= main_~i~0 107), 90377#(<= main_~i~0 110), 90376#(<= main_~i~0 109), 90379#(<= main_~i~0 112), 90378#(<= main_~i~0 111), 90381#(<= main_~i~0 114), 90380#(<= main_~i~0 113), 90383#(and (<= 1 main_~i~0) (<= main_~i~0 115)), 90382#(and (<= 0 main_~i~0) (<= main_~i~0 114)), 90265#true, 90267#(<= main_~i~0 0), 90266#false, 90269#(<= main_~i~0 2), 90268#(<= main_~i~0 1), 90271#(<= main_~i~0 4), 90270#(<= main_~i~0 3), 90273#(<= main_~i~0 6), 90272#(<= main_~i~0 5), 90275#(<= main_~i~0 8), 90274#(<= main_~i~0 7), 90277#(<= main_~i~0 10), 90276#(<= main_~i~0 9), 90279#(<= main_~i~0 12), 90278#(<= main_~i~0 11), 90281#(<= main_~i~0 14), 90280#(<= main_~i~0 13), 90283#(<= main_~i~0 16), 90282#(<= main_~i~0 15), 90285#(<= main_~i~0 18), 90284#(<= main_~i~0 17), 90287#(<= main_~i~0 20), 90286#(<= main_~i~0 19), 90289#(<= main_~i~0 22), 90288#(<= main_~i~0 21), 90291#(<= main_~i~0 24), 90290#(<= main_~i~0 23), 90293#(<= main_~i~0 26), 90292#(<= main_~i~0 25), 90295#(<= main_~i~0 28), 90294#(<= main_~i~0 27), 90297#(<= main_~i~0 30), 90296#(<= main_~i~0 29), 90299#(<= main_~i~0 32), 90298#(<= main_~i~0 31), 90301#(<= main_~i~0 34), 90300#(<= main_~i~0 33), 90303#(<= main_~i~0 36), 90302#(<= main_~i~0 35), 90305#(<= main_~i~0 38), 90304#(<= main_~i~0 37), 90307#(<= main_~i~0 40), 90306#(<= main_~i~0 39), 90309#(<= main_~i~0 42), 90308#(<= main_~i~0 41), 90311#(<= main_~i~0 44), 90310#(<= main_~i~0 43), 90313#(<= main_~i~0 46), 90312#(<= main_~i~0 45), 90315#(<= main_~i~0 48), 90314#(<= main_~i~0 47), 90317#(<= main_~i~0 50), 90316#(<= main_~i~0 49), 90319#(<= main_~i~0 52), 90318#(<= main_~i~0 51), 90321#(<= main_~i~0 54), 90320#(<= main_~i~0 53), 90323#(<= main_~i~0 56), 90322#(<= main_~i~0 55), 90325#(<= main_~i~0 58), 90324#(<= main_~i~0 57), 90327#(<= main_~i~0 60), 90326#(<= main_~i~0 59), 90329#(<= main_~i~0 62), 90328#(<= main_~i~0 61), 90331#(<= main_~i~0 64), 90330#(<= main_~i~0 63), 90333#(<= main_~i~0 66), 90332#(<= main_~i~0 65), 90335#(<= main_~i~0 68), 90334#(<= main_~i~0 67), 90337#(<= main_~i~0 70), 90336#(<= main_~i~0 69), 90339#(<= main_~i~0 72), 90338#(<= main_~i~0 71), 90341#(<= main_~i~0 74), 90340#(<= main_~i~0 73), 90343#(<= main_~i~0 76), 90342#(<= main_~i~0 75), 90345#(<= main_~i~0 78), 90344#(<= main_~i~0 77), 90347#(<= main_~i~0 80), 90346#(<= main_~i~0 79), 90349#(<= main_~i~0 82), 90348#(<= main_~i~0 81), 90351#(<= main_~i~0 84), 90350#(<= main_~i~0 83), 90353#(<= main_~i~0 86), 90352#(<= main_~i~0 85), 90355#(<= main_~i~0 88), 90354#(<= main_~i~0 87), 90357#(<= main_~i~0 90), 90356#(<= main_~i~0 89), 90359#(<= main_~i~0 92), 90358#(<= main_~i~0 91), 90361#(<= main_~i~0 94), 90360#(<= main_~i~0 93), 90363#(<= main_~i~0 96), 90362#(<= main_~i~0 95), 90365#(<= main_~i~0 98), 90364#(<= main_~i~0 97), 90367#(<= main_~i~0 100), 90366#(<= main_~i~0 99)] [2018-04-12 03:11:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 33005 backedges. 0 proven. 33005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:00,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-12 03:11:00,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-12 03:11:00,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6791, Invalid=7251, Unknown=0, NotChecked=0, Total=14042 [2018-04-12 03:11:00,092 INFO L87 Difference]: Start difference. First operand 588 states and 588 transitions. Second operand 119 states. [2018-04-12 03:11:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:11:04,228 INFO L93 Difference]: Finished difference Result 593 states and 593 transitions. [2018-04-12 03:11:04,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-04-12 03:11:04,228 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 582 [2018-04-12 03:11:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:11:04,229 INFO L225 Difference]: With dead ends: 593 [2018-04-12 03:11:04,229 INFO L226 Difference]: Without dead ends: 593 [2018-04-12 03:11:04,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6784 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=20361, Invalid=34161, Unknown=0, NotChecked=0, Total=54522 [2018-04-12 03:11:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-04-12 03:11:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2018-04-12 03:11:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-04-12 03:11:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 593 transitions. [2018-04-12 03:11:04,232 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 593 transitions. Word has length 582 [2018-04-12 03:11:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:11:04,232 INFO L459 AbstractCegarLoop]: Abstraction has 593 states and 593 transitions. [2018-04-12 03:11:04,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-12 03:11:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 593 transitions. [2018-04-12 03:11:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-04-12 03:11:04,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:11:04,234 INFO L355 BasicCegarLoop]: trace histogram [117, 116, 116, 116, 116, 1, 1, 1, 1, 1, 1] [2018-04-12 03:11:04,234 INFO L408 AbstractCegarLoop]: === Iteration 121 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:11:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash -840172698, now seen corresponding path program 116 times [2018-04-12 03:11:04,234 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:11:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:11:04,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:11:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 33582 backedges. 0 proven. 33582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:08,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:11:08,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-04-12 03:11:08,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:11:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:08,230 INFO L182 omatonBuilderFactory]: Interpolants [91905#(<= main_~i~0 103), 91904#(<= main_~i~0 102), 91907#(<= main_~i~0 105), 91906#(<= main_~i~0 104), 91909#(<= main_~i~0 107), 91908#(<= main_~i~0 106), 91911#(<= main_~i~0 109), 91910#(<= main_~i~0 108), 91913#(<= main_~i~0 111), 91912#(<= main_~i~0 110), 91915#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 91914#(<= main_~i~0 112), 91917#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 91916#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 91919#(and (<= 4 main_~i~0) (<= main_~i~0 116)), 91918#(and (<= main_~i~0 115) (<= 3 main_~i~0)), 91801#false, 91800#true, 91803#(<= main_~i~0 1), 91802#(<= main_~i~0 0), 91805#(<= main_~i~0 3), 91804#(<= main_~i~0 2), 91807#(<= main_~i~0 5), 91806#(<= main_~i~0 4), 91809#(<= main_~i~0 7), 91808#(<= main_~i~0 6), 91811#(<= main_~i~0 9), 91810#(<= main_~i~0 8), 91813#(<= main_~i~0 11), 91812#(<= main_~i~0 10), 91815#(<= main_~i~0 13), 91814#(<= main_~i~0 12), 91817#(<= main_~i~0 15), 91816#(<= main_~i~0 14), 91819#(<= main_~i~0 17), 91818#(<= main_~i~0 16), 91821#(<= main_~i~0 19), 91820#(<= main_~i~0 18), 91823#(<= main_~i~0 21), 91822#(<= main_~i~0 20), 91825#(<= main_~i~0 23), 91824#(<= main_~i~0 22), 91827#(<= main_~i~0 25), 91826#(<= main_~i~0 24), 91829#(<= main_~i~0 27), 91828#(<= main_~i~0 26), 91831#(<= main_~i~0 29), 91830#(<= main_~i~0 28), 91833#(<= main_~i~0 31), 91832#(<= main_~i~0 30), 91835#(<= main_~i~0 33), 91834#(<= main_~i~0 32), 91837#(<= main_~i~0 35), 91836#(<= main_~i~0 34), 91839#(<= main_~i~0 37), 91838#(<= main_~i~0 36), 91841#(<= main_~i~0 39), 91840#(<= main_~i~0 38), 91843#(<= main_~i~0 41), 91842#(<= main_~i~0 40), 91845#(<= main_~i~0 43), 91844#(<= main_~i~0 42), 91847#(<= main_~i~0 45), 91846#(<= main_~i~0 44), 91849#(<= main_~i~0 47), 91848#(<= main_~i~0 46), 91851#(<= main_~i~0 49), 91850#(<= main_~i~0 48), 91853#(<= main_~i~0 51), 91852#(<= main_~i~0 50), 91855#(<= main_~i~0 53), 91854#(<= main_~i~0 52), 91857#(<= main_~i~0 55), 91856#(<= main_~i~0 54), 91859#(<= main_~i~0 57), 91858#(<= main_~i~0 56), 91861#(<= main_~i~0 59), 91860#(<= main_~i~0 58), 91863#(<= main_~i~0 61), 91862#(<= main_~i~0 60), 91865#(<= main_~i~0 63), 91864#(<= main_~i~0 62), 91867#(<= main_~i~0 65), 91866#(<= main_~i~0 64), 91869#(<= main_~i~0 67), 91868#(<= main_~i~0 66), 91871#(<= main_~i~0 69), 91870#(<= main_~i~0 68), 91873#(<= main_~i~0 71), 91872#(<= main_~i~0 70), 91875#(<= main_~i~0 73), 91874#(<= main_~i~0 72), 91877#(<= main_~i~0 75), 91876#(<= main_~i~0 74), 91879#(<= main_~i~0 77), 91878#(<= main_~i~0 76), 91881#(<= main_~i~0 79), 91880#(<= main_~i~0 78), 91883#(<= main_~i~0 81), 91882#(<= main_~i~0 80), 91885#(<= main_~i~0 83), 91884#(<= main_~i~0 82), 91887#(<= main_~i~0 85), 91886#(<= main_~i~0 84), 91889#(<= main_~i~0 87), 91888#(<= main_~i~0 86), 91891#(<= main_~i~0 89), 91890#(<= main_~i~0 88), 91893#(<= main_~i~0 91), 91892#(<= main_~i~0 90), 91895#(<= main_~i~0 93), 91894#(<= main_~i~0 92), 91897#(<= main_~i~0 95), 91896#(<= main_~i~0 94), 91899#(<= main_~i~0 97), 91898#(<= main_~i~0 96), 91901#(<= main_~i~0 99), 91900#(<= main_~i~0 98), 91903#(<= main_~i~0 101), 91902#(<= main_~i~0 100)] [2018-04-12 03:11:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 33582 backedges. 0 proven. 33582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:08,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-12 03:11:08,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-12 03:11:08,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=7714, Unknown=0, NotChecked=0, Total=14280 [2018-04-12 03:11:08,232 INFO L87 Difference]: Start difference. First operand 593 states and 593 transitions. Second operand 120 states. [2018-04-12 03:11:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:11:13,117 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-04-12 03:11:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-12 03:11:13,117 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 587 [2018-04-12 03:11:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:11:13,118 INFO L225 Difference]: With dead ends: 598 [2018-04-12 03:11:13,118 INFO L226 Difference]: Without dead ends: 598 [2018-04-12 03:11:13,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7237 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=20019, Invalid=35441, Unknown=0, NotChecked=0, Total=55460 [2018-04-12 03:11:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-04-12 03:11:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2018-04-12 03:11:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-12 03:11:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 598 transitions. [2018-04-12 03:11:13,121 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 598 transitions. Word has length 587 [2018-04-12 03:11:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:11:13,121 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 598 transitions. [2018-04-12 03:11:13,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-12 03:11:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 598 transitions. [2018-04-12 03:11:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-12 03:11:13,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:11:13,123 INFO L355 BasicCegarLoop]: trace histogram [118, 117, 117, 117, 117, 1, 1, 1, 1, 1, 1] [2018-04-12 03:11:13,123 INFO L408 AbstractCegarLoop]: === Iteration 122 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:11:13,123 INFO L82 PathProgramCache]: Analyzing trace with hash 781688151, now seen corresponding path program 117 times [2018-04-12 03:11:13,124 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:11:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:11:13,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:11:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34164 backedges. 0 proven. 34164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:17,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:11:17,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-04-12 03:11:17,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:11:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:17,275 INFO L182 omatonBuilderFactory]: Interpolants [93441#(<= main_~i~0 91), 93440#(<= main_~i~0 90), 93443#(<= main_~i~0 93), 93442#(<= main_~i~0 92), 93445#(<= main_~i~0 95), 93444#(<= main_~i~0 94), 93447#(<= main_~i~0 97), 93446#(<= main_~i~0 96), 93449#(<= main_~i~0 99), 93448#(<= main_~i~0 98), 93451#(<= main_~i~0 101), 93450#(<= main_~i~0 100), 93453#(<= main_~i~0 103), 93452#(<= main_~i~0 102), 93455#(<= main_~i~0 105), 93454#(<= main_~i~0 104), 93457#(<= main_~i~0 107), 93456#(<= main_~i~0 106), 93459#(<= main_~i~0 109), 93458#(<= main_~i~0 108), 93461#(<= main_~i~0 111), 93460#(<= main_~i~0 110), 93463#(<= main_~i~0 113), 93462#(<= main_~i~0 112), 93465#(<= main_~i~0 115), 93464#(<= main_~i~0 114), 93467#(and (<= 0 main_~i~0) (<= main_~i~0 116)), 93466#(<= main_~i~0 116), 93468#(and (<= 1 main_~i~0) (<= main_~i~0 117)), 93349#false, 93348#true, 93351#(<= main_~i~0 1), 93350#(<= main_~i~0 0), 93353#(<= main_~i~0 3), 93352#(<= main_~i~0 2), 93355#(<= main_~i~0 5), 93354#(<= main_~i~0 4), 93357#(<= main_~i~0 7), 93356#(<= main_~i~0 6), 93359#(<= main_~i~0 9), 93358#(<= main_~i~0 8), 93361#(<= main_~i~0 11), 93360#(<= main_~i~0 10), 93363#(<= main_~i~0 13), 93362#(<= main_~i~0 12), 93365#(<= main_~i~0 15), 93364#(<= main_~i~0 14), 93367#(<= main_~i~0 17), 93366#(<= main_~i~0 16), 93369#(<= main_~i~0 19), 93368#(<= main_~i~0 18), 93371#(<= main_~i~0 21), 93370#(<= main_~i~0 20), 93373#(<= main_~i~0 23), 93372#(<= main_~i~0 22), 93375#(<= main_~i~0 25), 93374#(<= main_~i~0 24), 93377#(<= main_~i~0 27), 93376#(<= main_~i~0 26), 93379#(<= main_~i~0 29), 93378#(<= main_~i~0 28), 93381#(<= main_~i~0 31), 93380#(<= main_~i~0 30), 93383#(<= main_~i~0 33), 93382#(<= main_~i~0 32), 93385#(<= main_~i~0 35), 93384#(<= main_~i~0 34), 93387#(<= main_~i~0 37), 93386#(<= main_~i~0 36), 93389#(<= main_~i~0 39), 93388#(<= main_~i~0 38), 93391#(<= main_~i~0 41), 93390#(<= main_~i~0 40), 93393#(<= main_~i~0 43), 93392#(<= main_~i~0 42), 93395#(<= main_~i~0 45), 93394#(<= main_~i~0 44), 93397#(<= main_~i~0 47), 93396#(<= main_~i~0 46), 93399#(<= main_~i~0 49), 93398#(<= main_~i~0 48), 93401#(<= main_~i~0 51), 93400#(<= main_~i~0 50), 93403#(<= main_~i~0 53), 93402#(<= main_~i~0 52), 93405#(<= main_~i~0 55), 93404#(<= main_~i~0 54), 93407#(<= main_~i~0 57), 93406#(<= main_~i~0 56), 93409#(<= main_~i~0 59), 93408#(<= main_~i~0 58), 93411#(<= main_~i~0 61), 93410#(<= main_~i~0 60), 93413#(<= main_~i~0 63), 93412#(<= main_~i~0 62), 93415#(<= main_~i~0 65), 93414#(<= main_~i~0 64), 93417#(<= main_~i~0 67), 93416#(<= main_~i~0 66), 93419#(<= main_~i~0 69), 93418#(<= main_~i~0 68), 93421#(<= main_~i~0 71), 93420#(<= main_~i~0 70), 93423#(<= main_~i~0 73), 93422#(<= main_~i~0 72), 93425#(<= main_~i~0 75), 93424#(<= main_~i~0 74), 93427#(<= main_~i~0 77), 93426#(<= main_~i~0 76), 93429#(<= main_~i~0 79), 93428#(<= main_~i~0 78), 93431#(<= main_~i~0 81), 93430#(<= main_~i~0 80), 93433#(<= main_~i~0 83), 93432#(<= main_~i~0 82), 93435#(<= main_~i~0 85), 93434#(<= main_~i~0 84), 93437#(<= main_~i~0 87), 93436#(<= main_~i~0 86), 93439#(<= main_~i~0 89), 93438#(<= main_~i~0 88)] [2018-04-12 03:11:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 34164 backedges. 0 proven. 34164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:17,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-12 03:11:17,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-12 03:11:17,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7026, Invalid=7494, Unknown=0, NotChecked=0, Total=14520 [2018-04-12 03:11:17,277 INFO L87 Difference]: Start difference. First operand 598 states and 598 transitions. Second operand 121 states. [2018-04-12 03:11:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:11:21,256 INFO L93 Difference]: Finished difference Result 603 states and 603 transitions. [2018-04-12 03:11:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-04-12 03:11:21,257 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 592 [2018-04-12 03:11:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:11:21,258 INFO L225 Difference]: With dead ends: 603 [2018-04-12 03:11:21,258 INFO L226 Difference]: Without dead ends: 603 [2018-04-12 03:11:21,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7019 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=21066, Invalid=35340, Unknown=0, NotChecked=0, Total=56406 [2018-04-12 03:11:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-04-12 03:11:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2018-04-12 03:11:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-04-12 03:11:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 603 transitions. [2018-04-12 03:11:21,266 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 603 transitions. Word has length 592 [2018-04-12 03:11:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:11:21,266 INFO L459 AbstractCegarLoop]: Abstraction has 603 states and 603 transitions. [2018-04-12 03:11:21,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-12 03:11:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 603 transitions. [2018-04-12 03:11:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-04-12 03:11:21,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:11:21,269 INFO L355 BasicCegarLoop]: trace histogram [119, 118, 118, 118, 118, 1, 1, 1, 1, 1, 1] [2018-04-12 03:11:21,269 INFO L408 AbstractCegarLoop]: === Iteration 123 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:11:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash -666334714, now seen corresponding path program 118 times [2018-04-12 03:11:21,270 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:11:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:11:21,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:11:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 34751 backedges. 0 proven. 34751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:25,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:11:25,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-04-12 03:11:25,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:11:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:25,491 INFO L182 omatonBuilderFactory]: Interpolants [94977#(<= main_~i~0 66), 94976#(<= main_~i~0 65), 94979#(<= main_~i~0 68), 94978#(<= main_~i~0 67), 94981#(<= main_~i~0 70), 94980#(<= main_~i~0 69), 94983#(<= main_~i~0 72), 94982#(<= main_~i~0 71), 94985#(<= main_~i~0 74), 94984#(<= main_~i~0 73), 94987#(<= main_~i~0 76), 94986#(<= main_~i~0 75), 94989#(<= main_~i~0 78), 94988#(<= main_~i~0 77), 94991#(<= main_~i~0 80), 94990#(<= main_~i~0 79), 94993#(<= main_~i~0 82), 94992#(<= main_~i~0 81), 94995#(<= main_~i~0 84), 94994#(<= main_~i~0 83), 94997#(<= main_~i~0 86), 94996#(<= main_~i~0 85), 94999#(<= main_~i~0 88), 94998#(<= main_~i~0 87), 95001#(<= main_~i~0 90), 95000#(<= main_~i~0 89), 95003#(<= main_~i~0 92), 95002#(<= main_~i~0 91), 95005#(<= main_~i~0 94), 95004#(<= main_~i~0 93), 95007#(<= main_~i~0 96), 95006#(<= main_~i~0 95), 95009#(<= main_~i~0 98), 95008#(<= main_~i~0 97), 95011#(<= main_~i~0 100), 95010#(<= main_~i~0 99), 95013#(<= main_~i~0 102), 95012#(<= main_~i~0 101), 95015#(<= main_~i~0 104), 95014#(<= main_~i~0 103), 95017#(<= main_~i~0 106), 95016#(<= main_~i~0 105), 95019#(<= main_~i~0 108), 95018#(<= main_~i~0 107), 95021#(<= main_~i~0 110), 95020#(<= main_~i~0 109), 95023#(<= main_~i~0 112), 95022#(<= main_~i~0 111), 95025#(<= main_~i~0 114), 95024#(<= main_~i~0 113), 95027#(<= main_~i~0 116), 95026#(<= main_~i~0 115), 95029#(and (<= 1 main_~i~0) (<= main_~i~0 117)), 95028#(and (<= 0 main_~i~0) (<= main_~i~0 116)), 95030#(and (<= 2 main_~i~0) (<= main_~i~0 118)), 94909#true, 94911#(<= main_~i~0 0), 94910#false, 94913#(<= main_~i~0 2), 94912#(<= main_~i~0 1), 94915#(<= main_~i~0 4), 94914#(<= main_~i~0 3), 94917#(<= main_~i~0 6), 94916#(<= main_~i~0 5), 94919#(<= main_~i~0 8), 94918#(<= main_~i~0 7), 94921#(<= main_~i~0 10), 94920#(<= main_~i~0 9), 94923#(<= main_~i~0 12), 94922#(<= main_~i~0 11), 94925#(<= main_~i~0 14), 94924#(<= main_~i~0 13), 94927#(<= main_~i~0 16), 94926#(<= main_~i~0 15), 94929#(<= main_~i~0 18), 94928#(<= main_~i~0 17), 94931#(<= main_~i~0 20), 94930#(<= main_~i~0 19), 94933#(<= main_~i~0 22), 94932#(<= main_~i~0 21), 94935#(<= main_~i~0 24), 94934#(<= main_~i~0 23), 94937#(<= main_~i~0 26), 94936#(<= main_~i~0 25), 94939#(<= main_~i~0 28), 94938#(<= main_~i~0 27), 94941#(<= main_~i~0 30), 94940#(<= main_~i~0 29), 94943#(<= main_~i~0 32), 94942#(<= main_~i~0 31), 94945#(<= main_~i~0 34), 94944#(<= main_~i~0 33), 94947#(<= main_~i~0 36), 94946#(<= main_~i~0 35), 94949#(<= main_~i~0 38), 94948#(<= main_~i~0 37), 94951#(<= main_~i~0 40), 94950#(<= main_~i~0 39), 94953#(<= main_~i~0 42), 94952#(<= main_~i~0 41), 94955#(<= main_~i~0 44), 94954#(<= main_~i~0 43), 94957#(<= main_~i~0 46), 94956#(<= main_~i~0 45), 94959#(<= main_~i~0 48), 94958#(<= main_~i~0 47), 94961#(<= main_~i~0 50), 94960#(<= main_~i~0 49), 94963#(<= main_~i~0 52), 94962#(<= main_~i~0 51), 94965#(<= main_~i~0 54), 94964#(<= main_~i~0 53), 94967#(<= main_~i~0 56), 94966#(<= main_~i~0 55), 94969#(<= main_~i~0 58), 94968#(<= main_~i~0 57), 94971#(<= main_~i~0 60), 94970#(<= main_~i~0 59), 94973#(<= main_~i~0 62), 94972#(<= main_~i~0 61), 94975#(<= main_~i~0 64), 94974#(<= main_~i~0 63)] [2018-04-12 03:11:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 34751 backedges. 0 proven. 34751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:25,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-12 03:11:25,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-12 03:11:25,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7028, Invalid=7734, Unknown=0, NotChecked=0, Total=14762 [2018-04-12 03:11:25,493 INFO L87 Difference]: Start difference. First operand 603 states and 603 transitions. Second operand 122 states. [2018-04-12 03:11:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:11:29,813 INFO L93 Difference]: Finished difference Result 608 states and 608 transitions. [2018-04-12 03:11:29,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-12 03:11:29,813 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 597 [2018-04-12 03:11:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:11:29,814 INFO L225 Difference]: With dead ends: 608 [2018-04-12 03:11:29,814 INFO L226 Difference]: Without dead ends: 608 [2018-04-12 03:11:29,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7254 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=21187, Invalid=36173, Unknown=0, NotChecked=0, Total=57360 [2018-04-12 03:11:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-12 03:11:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2018-04-12 03:11:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-04-12 03:11:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 608 transitions. [2018-04-12 03:11:29,817 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 608 transitions. Word has length 597 [2018-04-12 03:11:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:11:29,817 INFO L459 AbstractCegarLoop]: Abstraction has 608 states and 608 transitions. [2018-04-12 03:11:29,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-12 03:11:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 608 transitions. [2018-04-12 03:11:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-04-12 03:11:29,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:11:29,819 INFO L355 BasicCegarLoop]: trace histogram [120, 119, 119, 119, 119, 1, 1, 1, 1, 1, 1] [2018-04-12 03:11:29,819 INFO L408 AbstractCegarLoop]: === Iteration 124 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:11:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1628753225, now seen corresponding path program 119 times [2018-04-12 03:11:29,820 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:11:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:11:29,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:11:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 35343 backedges. 0 proven. 35343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:34,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:11:34,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-04-12 03:11:34,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:11:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:34,109 INFO L182 omatonBuilderFactory]: Interpolants [96513#(<= main_~i~0 28), 96512#(<= main_~i~0 27), 96515#(<= main_~i~0 30), 96514#(<= main_~i~0 29), 96517#(<= main_~i~0 32), 96516#(<= main_~i~0 31), 96519#(<= main_~i~0 34), 96518#(<= main_~i~0 33), 96521#(<= main_~i~0 36), 96520#(<= main_~i~0 35), 96523#(<= main_~i~0 38), 96522#(<= main_~i~0 37), 96525#(<= main_~i~0 40), 96524#(<= main_~i~0 39), 96527#(<= main_~i~0 42), 96526#(<= main_~i~0 41), 96529#(<= main_~i~0 44), 96528#(<= main_~i~0 43), 96531#(<= main_~i~0 46), 96530#(<= main_~i~0 45), 96533#(<= main_~i~0 48), 96532#(<= main_~i~0 47), 96535#(<= main_~i~0 50), 96534#(<= main_~i~0 49), 96537#(<= main_~i~0 52), 96536#(<= main_~i~0 51), 96539#(<= main_~i~0 54), 96538#(<= main_~i~0 53), 96541#(<= main_~i~0 56), 96540#(<= main_~i~0 55), 96543#(<= main_~i~0 58), 96542#(<= main_~i~0 57), 96545#(<= main_~i~0 60), 96544#(<= main_~i~0 59), 96547#(<= main_~i~0 62), 96546#(<= main_~i~0 61), 96549#(<= main_~i~0 64), 96548#(<= main_~i~0 63), 96551#(<= main_~i~0 66), 96550#(<= main_~i~0 65), 96553#(<= main_~i~0 68), 96552#(<= main_~i~0 67), 96555#(<= main_~i~0 70), 96554#(<= main_~i~0 69), 96557#(<= main_~i~0 72), 96556#(<= main_~i~0 71), 96559#(<= main_~i~0 74), 96558#(<= main_~i~0 73), 96561#(<= main_~i~0 76), 96560#(<= main_~i~0 75), 96563#(<= main_~i~0 78), 96562#(<= main_~i~0 77), 96565#(<= main_~i~0 80), 96564#(<= main_~i~0 79), 96567#(<= main_~i~0 82), 96566#(<= main_~i~0 81), 96569#(<= main_~i~0 84), 96568#(<= main_~i~0 83), 96571#(<= main_~i~0 86), 96570#(<= main_~i~0 85), 96573#(<= main_~i~0 88), 96572#(<= main_~i~0 87), 96575#(<= main_~i~0 90), 96574#(<= main_~i~0 89), 96577#(<= main_~i~0 92), 96576#(<= main_~i~0 91), 96579#(<= main_~i~0 94), 96578#(<= main_~i~0 93), 96581#(<= main_~i~0 96), 96580#(<= main_~i~0 95), 96583#(<= main_~i~0 98), 96582#(<= main_~i~0 97), 96585#(<= main_~i~0 100), 96584#(<= main_~i~0 99), 96587#(<= main_~i~0 102), 96586#(<= main_~i~0 101), 96589#(<= main_~i~0 104), 96588#(<= main_~i~0 103), 96591#(<= main_~i~0 106), 96590#(<= main_~i~0 105), 96593#(<= main_~i~0 108), 96592#(<= main_~i~0 107), 96595#(<= main_~i~0 110), 96594#(<= main_~i~0 109), 96597#(<= main_~i~0 112), 96596#(<= main_~i~0 111), 96599#(<= main_~i~0 114), 96598#(<= main_~i~0 113), 96601#(<= main_~i~0 116), 96600#(<= main_~i~0 115), 96603#(<= main_~i~0 118), 96602#(<= main_~i~0 117), 96605#(and (<= main_~i~0 119) (<= 1 main_~i~0)), 96604#(and (<= 0 main_~i~0) (<= main_~i~0 118)), 96483#true, 96485#(<= main_~i~0 0), 96484#false, 96487#(<= main_~i~0 2), 96486#(<= main_~i~0 1), 96489#(<= main_~i~0 4), 96488#(<= main_~i~0 3), 96491#(<= main_~i~0 6), 96490#(<= main_~i~0 5), 96493#(<= main_~i~0 8), 96492#(<= main_~i~0 7), 96495#(<= main_~i~0 10), 96494#(<= main_~i~0 9), 96497#(<= main_~i~0 12), 96496#(<= main_~i~0 11), 96499#(<= main_~i~0 14), 96498#(<= main_~i~0 13), 96501#(<= main_~i~0 16), 96500#(<= main_~i~0 15), 96503#(<= main_~i~0 18), 96502#(<= main_~i~0 17), 96505#(<= main_~i~0 20), 96504#(<= main_~i~0 19), 96507#(<= main_~i~0 22), 96506#(<= main_~i~0 21), 96509#(<= main_~i~0 24), 96508#(<= main_~i~0 23), 96511#(<= main_~i~0 26), 96510#(<= main_~i~0 25)] [2018-04-12 03:11:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 35343 backedges. 0 proven. 35343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:34,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-12 03:11:34,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-12 03:11:34,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7265, Invalid=7741, Unknown=0, NotChecked=0, Total=15006 [2018-04-12 03:11:34,111 INFO L87 Difference]: Start difference. First operand 608 states and 608 transitions. Second operand 123 states. [2018-04-12 03:11:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:11:38,321 INFO L93 Difference]: Finished difference Result 613 states and 613 transitions. [2018-04-12 03:11:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-12 03:11:38,321 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 602 [2018-04-12 03:11:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:11:38,322 INFO L225 Difference]: With dead ends: 613 [2018-04-12 03:11:38,322 INFO L226 Difference]: Without dead ends: 613 [2018-04-12 03:11:38,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7258 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=21783, Invalid=36539, Unknown=0, NotChecked=0, Total=58322 [2018-04-12 03:11:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-12 03:11:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2018-04-12 03:11:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-04-12 03:11:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 613 transitions. [2018-04-12 03:11:38,327 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 613 transitions. Word has length 602 [2018-04-12 03:11:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:11:38,327 INFO L459 AbstractCegarLoop]: Abstraction has 613 states and 613 transitions. [2018-04-12 03:11:38,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-12 03:11:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 613 transitions. [2018-04-12 03:11:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-04-12 03:11:38,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:11:38,329 INFO L355 BasicCegarLoop]: trace histogram [121, 120, 120, 120, 120, 1, 1, 1, 1, 1, 1] [2018-04-12 03:11:38,329 INFO L408 AbstractCegarLoop]: === Iteration 125 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:11:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1984212826, now seen corresponding path program 120 times [2018-04-12 03:11:38,329 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:11:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:11:38,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:11:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 35940 backedges. 0 proven. 35940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:42,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:11:42,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-04-12 03:11:42,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:11:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:42,764 INFO L182 omatonBuilderFactory]: Interpolants [98071#false, 98070#true, 98073#(<= main_~i~0 1), 98072#(<= main_~i~0 0), 98075#(<= main_~i~0 3), 98074#(<= main_~i~0 2), 98077#(<= main_~i~0 5), 98076#(<= main_~i~0 4), 98079#(<= main_~i~0 7), 98078#(<= main_~i~0 6), 98081#(<= main_~i~0 9), 98080#(<= main_~i~0 8), 98083#(<= main_~i~0 11), 98082#(<= main_~i~0 10), 98085#(<= main_~i~0 13), 98084#(<= main_~i~0 12), 98087#(<= main_~i~0 15), 98086#(<= main_~i~0 14), 98089#(<= main_~i~0 17), 98088#(<= main_~i~0 16), 98091#(<= main_~i~0 19), 98090#(<= main_~i~0 18), 98093#(<= main_~i~0 21), 98092#(<= main_~i~0 20), 98095#(<= main_~i~0 23), 98094#(<= main_~i~0 22), 98097#(<= main_~i~0 25), 98096#(<= main_~i~0 24), 98099#(<= main_~i~0 27), 98098#(<= main_~i~0 26), 98101#(<= main_~i~0 29), 98100#(<= main_~i~0 28), 98103#(<= main_~i~0 31), 98102#(<= main_~i~0 30), 98105#(<= main_~i~0 33), 98104#(<= main_~i~0 32), 98107#(<= main_~i~0 35), 98106#(<= main_~i~0 34), 98109#(<= main_~i~0 37), 98108#(<= main_~i~0 36), 98111#(<= main_~i~0 39), 98110#(<= main_~i~0 38), 98113#(<= main_~i~0 41), 98112#(<= main_~i~0 40), 98115#(<= main_~i~0 43), 98114#(<= main_~i~0 42), 98117#(<= main_~i~0 45), 98116#(<= main_~i~0 44), 98119#(<= main_~i~0 47), 98118#(<= main_~i~0 46), 98121#(<= main_~i~0 49), 98120#(<= main_~i~0 48), 98123#(<= main_~i~0 51), 98122#(<= main_~i~0 50), 98125#(<= main_~i~0 53), 98124#(<= main_~i~0 52), 98127#(<= main_~i~0 55), 98126#(<= main_~i~0 54), 98129#(<= main_~i~0 57), 98128#(<= main_~i~0 56), 98131#(<= main_~i~0 59), 98130#(<= main_~i~0 58), 98133#(<= main_~i~0 61), 98132#(<= main_~i~0 60), 98135#(<= main_~i~0 63), 98134#(<= main_~i~0 62), 98137#(<= main_~i~0 65), 98136#(<= main_~i~0 64), 98139#(<= main_~i~0 67), 98138#(<= main_~i~0 66), 98141#(<= main_~i~0 69), 98140#(<= main_~i~0 68), 98143#(<= main_~i~0 71), 98142#(<= main_~i~0 70), 98145#(<= main_~i~0 73), 98144#(<= main_~i~0 72), 98147#(<= main_~i~0 75), 98146#(<= main_~i~0 74), 98149#(<= main_~i~0 77), 98148#(<= main_~i~0 76), 98151#(<= main_~i~0 79), 98150#(<= main_~i~0 78), 98153#(<= main_~i~0 81), 98152#(<= main_~i~0 80), 98155#(<= main_~i~0 83), 98154#(<= main_~i~0 82), 98157#(<= main_~i~0 85), 98156#(<= main_~i~0 84), 98159#(<= main_~i~0 87), 98158#(<= main_~i~0 86), 98161#(<= main_~i~0 89), 98160#(<= main_~i~0 88), 98163#(<= main_~i~0 91), 98162#(<= main_~i~0 90), 98165#(<= main_~i~0 93), 98164#(<= main_~i~0 92), 98167#(<= main_~i~0 95), 98166#(<= main_~i~0 94), 98169#(<= main_~i~0 97), 98168#(<= main_~i~0 96), 98171#(<= main_~i~0 99), 98170#(<= main_~i~0 98), 98173#(<= main_~i~0 101), 98172#(<= main_~i~0 100), 98175#(<= main_~i~0 103), 98174#(<= main_~i~0 102), 98177#(<= main_~i~0 105), 98176#(<= main_~i~0 104), 98179#(<= main_~i~0 107), 98178#(<= main_~i~0 106), 98181#(<= main_~i~0 109), 98180#(<= main_~i~0 108), 98183#(<= main_~i~0 111), 98182#(<= main_~i~0 110), 98185#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 98184#(<= main_~i~0 112), 98187#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 98186#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 98189#(and (<= 4 main_~i~0) (<= main_~i~0 116)), 98188#(and (<= main_~i~0 115) (<= 3 main_~i~0)), 98191#(and (<= 6 main_~i~0) (<= main_~i~0 118)), 98190#(and (<= 5 main_~i~0) (<= main_~i~0 117)), 98193#(and (<= 8 main_~i~0) (<= main_~i~0 120)), 98192#(and (<= main_~i~0 119) (<= 7 main_~i~0))] [2018-04-12 03:11:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 35940 backedges. 0 proven. 35940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:42,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-04-12 03:11:42,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-04-12 03:11:42,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6574, Invalid=8678, Unknown=0, NotChecked=0, Total=15252 [2018-04-12 03:11:42,766 INFO L87 Difference]: Start difference. First operand 613 states and 613 transitions. Second operand 124 states. [2018-04-12 03:11:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:11:49,299 INFO L93 Difference]: Finished difference Result 618 states and 618 transitions. [2018-04-12 03:11:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-12 03:11:49,299 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 607 [2018-04-12 03:11:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:11:49,300 INFO L225 Difference]: With dead ends: 618 [2018-04-12 03:11:49,300 INFO L226 Difference]: Without dead ends: 618 [2018-04-12 03:11:49,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8163 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=20487, Invalid=38805, Unknown=0, NotChecked=0, Total=59292 [2018-04-12 03:11:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-04-12 03:11:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2018-04-12 03:11:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-04-12 03:11:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 618 transitions. [2018-04-12 03:11:49,307 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 618 transitions. Word has length 607 [2018-04-12 03:11:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:11:49,308 INFO L459 AbstractCegarLoop]: Abstraction has 618 states and 618 transitions. [2018-04-12 03:11:49,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-04-12 03:11:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 618 transitions. [2018-04-12 03:11:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-04-12 03:11:49,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:11:49,311 INFO L355 BasicCegarLoop]: trace histogram [122, 121, 121, 121, 121, 1, 1, 1, 1, 1, 1] [2018-04-12 03:11:49,311 INFO L408 AbstractCegarLoop]: === Iteration 126 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:11:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash -179597289, now seen corresponding path program 121 times [2018-04-12 03:11:49,312 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:11:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:11:49,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:11:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36542 backedges. 0 proven. 36542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:53,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:11:53,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-04-12 03:11:53,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:11:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:53,994 INFO L182 omatonBuilderFactory]: Interpolants [99671#false, 99670#true, 99673#(<= main_~i~0 1), 99672#(<= main_~i~0 0), 99675#(<= main_~i~0 3), 99674#(<= main_~i~0 2), 99677#(<= main_~i~0 5), 99676#(<= main_~i~0 4), 99679#(<= main_~i~0 7), 99678#(<= main_~i~0 6), 99681#(<= main_~i~0 9), 99680#(<= main_~i~0 8), 99683#(<= main_~i~0 11), 99682#(<= main_~i~0 10), 99685#(<= main_~i~0 13), 99684#(<= main_~i~0 12), 99687#(<= main_~i~0 15), 99686#(<= main_~i~0 14), 99689#(<= main_~i~0 17), 99688#(<= main_~i~0 16), 99691#(<= main_~i~0 19), 99690#(<= main_~i~0 18), 99693#(<= main_~i~0 21), 99692#(<= main_~i~0 20), 99695#(<= main_~i~0 23), 99694#(<= main_~i~0 22), 99697#(<= main_~i~0 25), 99696#(<= main_~i~0 24), 99699#(<= main_~i~0 27), 99698#(<= main_~i~0 26), 99701#(<= main_~i~0 29), 99700#(<= main_~i~0 28), 99703#(<= main_~i~0 31), 99702#(<= main_~i~0 30), 99705#(<= main_~i~0 33), 99704#(<= main_~i~0 32), 99707#(<= main_~i~0 35), 99706#(<= main_~i~0 34), 99709#(<= main_~i~0 37), 99708#(<= main_~i~0 36), 99711#(<= main_~i~0 39), 99710#(<= main_~i~0 38), 99713#(<= main_~i~0 41), 99712#(<= main_~i~0 40), 99715#(<= main_~i~0 43), 99714#(<= main_~i~0 42), 99717#(<= main_~i~0 45), 99716#(<= main_~i~0 44), 99719#(<= main_~i~0 47), 99718#(<= main_~i~0 46), 99721#(<= main_~i~0 49), 99720#(<= main_~i~0 48), 99723#(<= main_~i~0 51), 99722#(<= main_~i~0 50), 99725#(<= main_~i~0 53), 99724#(<= main_~i~0 52), 99727#(<= main_~i~0 55), 99726#(<= main_~i~0 54), 99729#(<= main_~i~0 57), 99728#(<= main_~i~0 56), 99731#(<= main_~i~0 59), 99730#(<= main_~i~0 58), 99733#(<= main_~i~0 61), 99732#(<= main_~i~0 60), 99735#(<= main_~i~0 63), 99734#(<= main_~i~0 62), 99737#(<= main_~i~0 65), 99736#(<= main_~i~0 64), 99739#(<= main_~i~0 67), 99738#(<= main_~i~0 66), 99741#(<= main_~i~0 69), 99740#(<= main_~i~0 68), 99743#(<= main_~i~0 71), 99742#(<= main_~i~0 70), 99745#(<= main_~i~0 73), 99744#(<= main_~i~0 72), 99747#(<= main_~i~0 75), 99746#(<= main_~i~0 74), 99749#(<= main_~i~0 77), 99748#(<= main_~i~0 76), 99751#(<= main_~i~0 79), 99750#(<= main_~i~0 78), 99753#(<= main_~i~0 81), 99752#(<= main_~i~0 80), 99755#(<= main_~i~0 83), 99754#(<= main_~i~0 82), 99757#(<= main_~i~0 85), 99756#(<= main_~i~0 84), 99759#(<= main_~i~0 87), 99758#(<= main_~i~0 86), 99761#(<= main_~i~0 89), 99760#(<= main_~i~0 88), 99763#(<= main_~i~0 91), 99762#(<= main_~i~0 90), 99765#(<= main_~i~0 93), 99764#(<= main_~i~0 92), 99767#(<= main_~i~0 95), 99766#(<= main_~i~0 94), 99769#(<= main_~i~0 97), 99768#(<= main_~i~0 96), 99771#(<= main_~i~0 99), 99770#(<= main_~i~0 98), 99773#(<= main_~i~0 101), 99772#(<= main_~i~0 100), 99775#(<= main_~i~0 103), 99774#(<= main_~i~0 102), 99777#(<= main_~i~0 105), 99776#(<= main_~i~0 104), 99779#(<= main_~i~0 107), 99778#(<= main_~i~0 106), 99781#(<= main_~i~0 109), 99780#(<= main_~i~0 108), 99783#(<= main_~i~0 111), 99782#(<= main_~i~0 110), 99785#(<= main_~i~0 113), 99784#(<= main_~i~0 112), 99787#(<= main_~i~0 115), 99786#(<= main_~i~0 114), 99789#(<= main_~i~0 117), 99788#(<= main_~i~0 116), 99791#(<= main_~i~0 119), 99790#(<= main_~i~0 118), 99793#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 99792#(<= main_~i~0 120), 99794#(and (<= 1 main_~i~0) (<= main_~i~0 121))] [2018-04-12 03:11:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 36542 backedges. 0 proven. 36542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:11:53,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-04-12 03:11:53,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-04-12 03:11:53,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7508, Invalid=7992, Unknown=0, NotChecked=0, Total=15500 [2018-04-12 03:11:53,996 INFO L87 Difference]: Start difference. First operand 618 states and 618 transitions. Second operand 125 states. [2018-04-12 03:11:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:11:58,485 INFO L93 Difference]: Finished difference Result 623 states and 623 transitions. [2018-04-12 03:11:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-04-12 03:11:58,485 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 612 [2018-04-12 03:11:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:11:58,486 INFO L225 Difference]: With dead ends: 623 [2018-04-12 03:11:58,486 INFO L226 Difference]: Without dead ends: 623 [2018-04-12 03:11:58,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7501 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=22512, Invalid=37758, Unknown=0, NotChecked=0, Total=60270 [2018-04-12 03:11:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-04-12 03:11:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2018-04-12 03:11:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-04-12 03:11:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 623 transitions. [2018-04-12 03:11:58,489 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 623 transitions. Word has length 612 [2018-04-12 03:11:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:11:58,489 INFO L459 AbstractCegarLoop]: Abstraction has 623 states and 623 transitions. [2018-04-12 03:11:58,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-04-12 03:11:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 623 transitions. [2018-04-12 03:11:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-04-12 03:11:58,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:11:58,491 INFO L355 BasicCegarLoop]: trace histogram [123, 122, 122, 122, 122, 1, 1, 1, 1, 1, 1] [2018-04-12 03:11:58,491 INFO L408 AbstractCegarLoop]: === Iteration 127 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:11:58,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2049028282, now seen corresponding path program 122 times [2018-04-12 03:11:58,492 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:11:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:11:58,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:12:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 37149 backedges. 0 proven. 37149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:03,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:12:03,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-04-12 03:12:03,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:12:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:03,390 INFO L182 omatonBuilderFactory]: Interpolants [101377#(<= main_~i~0 92), 101376#(<= main_~i~0 91), 101379#(<= main_~i~0 94), 101378#(<= main_~i~0 93), 101381#(<= main_~i~0 96), 101380#(<= main_~i~0 95), 101383#(<= main_~i~0 98), 101382#(<= main_~i~0 97), 101385#(<= main_~i~0 100), 101384#(<= main_~i~0 99), 101387#(<= main_~i~0 102), 101386#(<= main_~i~0 101), 101389#(<= main_~i~0 104), 101388#(<= main_~i~0 103), 101391#(<= main_~i~0 106), 101390#(<= main_~i~0 105), 101393#(<= main_~i~0 108), 101392#(<= main_~i~0 107), 101395#(<= main_~i~0 110), 101394#(<= main_~i~0 109), 101397#(<= main_~i~0 112), 101396#(<= main_~i~0 111), 101399#(<= main_~i~0 114), 101398#(<= main_~i~0 113), 101401#(<= main_~i~0 116), 101400#(<= main_~i~0 115), 101403#(<= main_~i~0 118), 101402#(<= main_~i~0 117), 101405#(<= main_~i~0 120), 101404#(<= main_~i~0 119), 101407#(and (<= 1 main_~i~0) (<= main_~i~0 121)), 101406#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 101408#(and (<= 2 main_~i~0) (<= main_~i~0 122)), 101283#true, 101285#(<= main_~i~0 0), 101284#false, 101287#(<= main_~i~0 2), 101286#(<= main_~i~0 1), 101289#(<= main_~i~0 4), 101288#(<= main_~i~0 3), 101291#(<= main_~i~0 6), 101290#(<= main_~i~0 5), 101293#(<= main_~i~0 8), 101292#(<= main_~i~0 7), 101295#(<= main_~i~0 10), 101294#(<= main_~i~0 9), 101297#(<= main_~i~0 12), 101296#(<= main_~i~0 11), 101299#(<= main_~i~0 14), 101298#(<= main_~i~0 13), 101301#(<= main_~i~0 16), 101300#(<= main_~i~0 15), 101303#(<= main_~i~0 18), 101302#(<= main_~i~0 17), 101305#(<= main_~i~0 20), 101304#(<= main_~i~0 19), 101307#(<= main_~i~0 22), 101306#(<= main_~i~0 21), 101309#(<= main_~i~0 24), 101308#(<= main_~i~0 23), 101311#(<= main_~i~0 26), 101310#(<= main_~i~0 25), 101313#(<= main_~i~0 28), 101312#(<= main_~i~0 27), 101315#(<= main_~i~0 30), 101314#(<= main_~i~0 29), 101317#(<= main_~i~0 32), 101316#(<= main_~i~0 31), 101319#(<= main_~i~0 34), 101318#(<= main_~i~0 33), 101321#(<= main_~i~0 36), 101320#(<= main_~i~0 35), 101323#(<= main_~i~0 38), 101322#(<= main_~i~0 37), 101325#(<= main_~i~0 40), 101324#(<= main_~i~0 39), 101327#(<= main_~i~0 42), 101326#(<= main_~i~0 41), 101329#(<= main_~i~0 44), 101328#(<= main_~i~0 43), 101331#(<= main_~i~0 46), 101330#(<= main_~i~0 45), 101333#(<= main_~i~0 48), 101332#(<= main_~i~0 47), 101335#(<= main_~i~0 50), 101334#(<= main_~i~0 49), 101337#(<= main_~i~0 52), 101336#(<= main_~i~0 51), 101339#(<= main_~i~0 54), 101338#(<= main_~i~0 53), 101341#(<= main_~i~0 56), 101340#(<= main_~i~0 55), 101343#(<= main_~i~0 58), 101342#(<= main_~i~0 57), 101345#(<= main_~i~0 60), 101344#(<= main_~i~0 59), 101347#(<= main_~i~0 62), 101346#(<= main_~i~0 61), 101349#(<= main_~i~0 64), 101348#(<= main_~i~0 63), 101351#(<= main_~i~0 66), 101350#(<= main_~i~0 65), 101353#(<= main_~i~0 68), 101352#(<= main_~i~0 67), 101355#(<= main_~i~0 70), 101354#(<= main_~i~0 69), 101357#(<= main_~i~0 72), 101356#(<= main_~i~0 71), 101359#(<= main_~i~0 74), 101358#(<= main_~i~0 73), 101361#(<= main_~i~0 76), 101360#(<= main_~i~0 75), 101363#(<= main_~i~0 78), 101362#(<= main_~i~0 77), 101365#(<= main_~i~0 80), 101364#(<= main_~i~0 79), 101367#(<= main_~i~0 82), 101366#(<= main_~i~0 81), 101369#(<= main_~i~0 84), 101368#(<= main_~i~0 83), 101371#(<= main_~i~0 86), 101370#(<= main_~i~0 85), 101373#(<= main_~i~0 88), 101372#(<= main_~i~0 87), 101375#(<= main_~i~0 90), 101374#(<= main_~i~0 89)] [2018-04-12 03:12:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 37149 backedges. 0 proven. 37149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:03,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-04-12 03:12:03,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-04-12 03:12:03,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7510, Invalid=8240, Unknown=0, NotChecked=0, Total=15750 [2018-04-12 03:12:03,393 INFO L87 Difference]: Start difference. First operand 623 states and 623 transitions. Second operand 126 states. [2018-04-12 03:12:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:12:08,231 INFO L93 Difference]: Finished difference Result 628 states and 628 transitions. [2018-04-12 03:12:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-12 03:12:08,231 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 617 [2018-04-12 03:12:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:12:08,232 INFO L225 Difference]: With dead ends: 628 [2018-04-12 03:12:08,232 INFO L226 Difference]: Without dead ends: 628 [2018-04-12 03:12:08,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7744 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=22637, Invalid=38619, Unknown=0, NotChecked=0, Total=61256 [2018-04-12 03:12:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-04-12 03:12:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2018-04-12 03:12:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-04-12 03:12:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 628 transitions. [2018-04-12 03:12:08,237 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 628 transitions. Word has length 617 [2018-04-12 03:12:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:12:08,237 INFO L459 AbstractCegarLoop]: Abstraction has 628 states and 628 transitions. [2018-04-12 03:12:08,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-04-12 03:12:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 628 transitions. [2018-04-12 03:12:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-04-12 03:12:08,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:12:08,240 INFO L355 BasicCegarLoop]: trace histogram [124, 123, 123, 123, 123, 1, 1, 1, 1, 1, 1] [2018-04-12 03:12:08,240 INFO L408 AbstractCegarLoop]: === Iteration 128 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:12:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1101089417, now seen corresponding path program 123 times [2018-04-12 03:12:08,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:12:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:12:08,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:12:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 37761 backedges. 0 proven. 37761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:13,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:12:13,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-04-12 03:12:13,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:12:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:13,024 INFO L182 omatonBuilderFactory]: Interpolants [102913#(<= main_~i~0 2), 102912#(<= main_~i~0 1), 102915#(<= main_~i~0 4), 102914#(<= main_~i~0 3), 102917#(<= main_~i~0 6), 102916#(<= main_~i~0 5), 102919#(<= main_~i~0 8), 102918#(<= main_~i~0 7), 102921#(<= main_~i~0 10), 102920#(<= main_~i~0 9), 102923#(<= main_~i~0 12), 102922#(<= main_~i~0 11), 102925#(<= main_~i~0 14), 102924#(<= main_~i~0 13), 102927#(<= main_~i~0 16), 102926#(<= main_~i~0 15), 102929#(<= main_~i~0 18), 102928#(<= main_~i~0 17), 102931#(<= main_~i~0 20), 102930#(<= main_~i~0 19), 102933#(<= main_~i~0 22), 102932#(<= main_~i~0 21), 102935#(<= main_~i~0 24), 102934#(<= main_~i~0 23), 102937#(<= main_~i~0 26), 102936#(<= main_~i~0 25), 102939#(<= main_~i~0 28), 102938#(<= main_~i~0 27), 102941#(<= main_~i~0 30), 102940#(<= main_~i~0 29), 102943#(<= main_~i~0 32), 102942#(<= main_~i~0 31), 102945#(<= main_~i~0 34), 102944#(<= main_~i~0 33), 102947#(<= main_~i~0 36), 102946#(<= main_~i~0 35), 102949#(<= main_~i~0 38), 102948#(<= main_~i~0 37), 102951#(<= main_~i~0 40), 102950#(<= main_~i~0 39), 102953#(<= main_~i~0 42), 102952#(<= main_~i~0 41), 102955#(<= main_~i~0 44), 102954#(<= main_~i~0 43), 102957#(<= main_~i~0 46), 102956#(<= main_~i~0 45), 102959#(<= main_~i~0 48), 102958#(<= main_~i~0 47), 102961#(<= main_~i~0 50), 102960#(<= main_~i~0 49), 102963#(<= main_~i~0 52), 102962#(<= main_~i~0 51), 102965#(<= main_~i~0 54), 102964#(<= main_~i~0 53), 102967#(<= main_~i~0 56), 102966#(<= main_~i~0 55), 102969#(<= main_~i~0 58), 102968#(<= main_~i~0 57), 102971#(<= main_~i~0 60), 102970#(<= main_~i~0 59), 102973#(<= main_~i~0 62), 102972#(<= main_~i~0 61), 102975#(<= main_~i~0 64), 102974#(<= main_~i~0 63), 102977#(<= main_~i~0 66), 102976#(<= main_~i~0 65), 102979#(<= main_~i~0 68), 102978#(<= main_~i~0 67), 102981#(<= main_~i~0 70), 102980#(<= main_~i~0 69), 102983#(<= main_~i~0 72), 102982#(<= main_~i~0 71), 102985#(<= main_~i~0 74), 102984#(<= main_~i~0 73), 102987#(<= main_~i~0 76), 102986#(<= main_~i~0 75), 102989#(<= main_~i~0 78), 102988#(<= main_~i~0 77), 102991#(<= main_~i~0 80), 102990#(<= main_~i~0 79), 102993#(<= main_~i~0 82), 102992#(<= main_~i~0 81), 102995#(<= main_~i~0 84), 102994#(<= main_~i~0 83), 102997#(<= main_~i~0 86), 102996#(<= main_~i~0 85), 102999#(<= main_~i~0 88), 102998#(<= main_~i~0 87), 103001#(<= main_~i~0 90), 103000#(<= main_~i~0 89), 103003#(<= main_~i~0 92), 103002#(<= main_~i~0 91), 103005#(<= main_~i~0 94), 103004#(<= main_~i~0 93), 103007#(<= main_~i~0 96), 103006#(<= main_~i~0 95), 103009#(<= main_~i~0 98), 103008#(<= main_~i~0 97), 103011#(<= main_~i~0 100), 103010#(<= main_~i~0 99), 103013#(<= main_~i~0 102), 103012#(<= main_~i~0 101), 103015#(<= main_~i~0 104), 103014#(<= main_~i~0 103), 103017#(<= main_~i~0 106), 103016#(<= main_~i~0 105), 103019#(<= main_~i~0 108), 103018#(<= main_~i~0 107), 103021#(<= main_~i~0 110), 103020#(<= main_~i~0 109), 103023#(<= main_~i~0 112), 103022#(<= main_~i~0 111), 103025#(<= main_~i~0 114), 103024#(<= main_~i~0 113), 103027#(<= main_~i~0 116), 103026#(<= main_~i~0 115), 103029#(<= main_~i~0 118), 103028#(<= main_~i~0 117), 103031#(<= main_~i~0 120), 103030#(<= main_~i~0 119), 103033#(<= main_~i~0 122), 103032#(<= main_~i~0 121), 103035#(and (<= 1 main_~i~0) (<= main_~i~0 123)), 103034#(and (<= main_~i~0 122) (<= 0 main_~i~0)), 102909#true, 102911#(<= main_~i~0 0), 102910#false] [2018-04-12 03:12:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 37761 backedges. 0 proven. 37761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:13,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-04-12 03:12:13,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-04-12 03:12:13,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7755, Invalid=8247, Unknown=0, NotChecked=0, Total=16002 [2018-04-12 03:12:13,026 INFO L87 Difference]: Start difference. First operand 628 states and 628 transitions. Second operand 127 states. [2018-04-12 03:12:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:12:17,495 INFO L93 Difference]: Finished difference Result 633 states and 633 transitions. [2018-04-12 03:12:17,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-12 03:12:17,495 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 622 [2018-04-12 03:12:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:12:17,496 INFO L225 Difference]: With dead ends: 633 [2018-04-12 03:12:17,496 INFO L226 Difference]: Without dead ends: 633 [2018-04-12 03:12:17,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7748 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=23253, Invalid=38997, Unknown=0, NotChecked=0, Total=62250 [2018-04-12 03:12:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-04-12 03:12:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2018-04-12 03:12:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-12 03:12:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 633 transitions. [2018-04-12 03:12:17,501 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 633 transitions. Word has length 622 [2018-04-12 03:12:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:12:17,502 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 633 transitions. [2018-04-12 03:12:17,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-04-12 03:12:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 633 transitions. [2018-04-12 03:12:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-04-12 03:12:17,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:12:17,504 INFO L355 BasicCegarLoop]: trace histogram [125, 124, 124, 124, 124, 1, 1, 1, 1, 1, 1] [2018-04-12 03:12:17,504 INFO L408 AbstractCegarLoop]: === Iteration 129 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:12:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash 936084966, now seen corresponding path program 124 times [2018-04-12 03:12:17,504 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:12:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:12:17,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:12:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 38378 backedges. 0 proven. 38378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:22,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:12:22,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-04-12 03:12:22,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:12:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:22,224 INFO L182 omatonBuilderFactory]: Interpolants [104549#false, 104548#true, 104551#(<= main_~i~0 1), 104550#(<= main_~i~0 0), 104553#(<= main_~i~0 3), 104552#(<= main_~i~0 2), 104555#(<= main_~i~0 5), 104554#(<= main_~i~0 4), 104557#(<= main_~i~0 7), 104556#(<= main_~i~0 6), 104559#(<= main_~i~0 9), 104558#(<= main_~i~0 8), 104561#(<= main_~i~0 11), 104560#(<= main_~i~0 10), 104563#(<= main_~i~0 13), 104562#(<= main_~i~0 12), 104565#(<= main_~i~0 15), 104564#(<= main_~i~0 14), 104567#(<= main_~i~0 17), 104566#(<= main_~i~0 16), 104569#(<= main_~i~0 19), 104568#(<= main_~i~0 18), 104571#(<= main_~i~0 21), 104570#(<= main_~i~0 20), 104573#(<= main_~i~0 23), 104572#(<= main_~i~0 22), 104575#(<= main_~i~0 25), 104574#(<= main_~i~0 24), 104577#(<= main_~i~0 27), 104576#(<= main_~i~0 26), 104579#(<= main_~i~0 29), 104578#(<= main_~i~0 28), 104581#(<= main_~i~0 31), 104580#(<= main_~i~0 30), 104583#(<= main_~i~0 33), 104582#(<= main_~i~0 32), 104585#(<= main_~i~0 35), 104584#(<= main_~i~0 34), 104587#(<= main_~i~0 37), 104586#(<= main_~i~0 36), 104589#(<= main_~i~0 39), 104588#(<= main_~i~0 38), 104591#(<= main_~i~0 41), 104590#(<= main_~i~0 40), 104593#(<= main_~i~0 43), 104592#(<= main_~i~0 42), 104595#(<= main_~i~0 45), 104594#(<= main_~i~0 44), 104597#(<= main_~i~0 47), 104596#(<= main_~i~0 46), 104599#(<= main_~i~0 49), 104598#(<= main_~i~0 48), 104601#(<= main_~i~0 51), 104600#(<= main_~i~0 50), 104603#(<= main_~i~0 53), 104602#(<= main_~i~0 52), 104605#(<= main_~i~0 55), 104604#(<= main_~i~0 54), 104607#(<= main_~i~0 57), 104606#(<= main_~i~0 56), 104609#(<= main_~i~0 59), 104608#(<= main_~i~0 58), 104611#(<= main_~i~0 61), 104610#(<= main_~i~0 60), 104613#(<= main_~i~0 63), 104612#(<= main_~i~0 62), 104615#(<= main_~i~0 65), 104614#(<= main_~i~0 64), 104617#(<= main_~i~0 67), 104616#(<= main_~i~0 66), 104619#(<= main_~i~0 69), 104618#(<= main_~i~0 68), 104621#(<= main_~i~0 71), 104620#(<= main_~i~0 70), 104623#(<= main_~i~0 73), 104622#(<= main_~i~0 72), 104625#(<= main_~i~0 75), 104624#(<= main_~i~0 74), 104627#(<= main_~i~0 77), 104626#(<= main_~i~0 76), 104629#(<= main_~i~0 79), 104628#(<= main_~i~0 78), 104631#(<= main_~i~0 81), 104630#(<= main_~i~0 80), 104633#(<= main_~i~0 83), 104632#(<= main_~i~0 82), 104635#(<= main_~i~0 85), 104634#(<= main_~i~0 84), 104637#(<= main_~i~0 87), 104636#(<= main_~i~0 86), 104639#(<= main_~i~0 89), 104638#(<= main_~i~0 88), 104641#(<= main_~i~0 91), 104640#(<= main_~i~0 90), 104643#(<= main_~i~0 93), 104642#(<= main_~i~0 92), 104645#(<= main_~i~0 95), 104644#(<= main_~i~0 94), 104647#(<= main_~i~0 97), 104646#(<= main_~i~0 96), 104649#(<= main_~i~0 99), 104648#(<= main_~i~0 98), 104651#(<= main_~i~0 101), 104650#(<= main_~i~0 100), 104653#(<= main_~i~0 103), 104652#(<= main_~i~0 102), 104655#(<= main_~i~0 105), 104654#(<= main_~i~0 104), 104657#(<= main_~i~0 107), 104656#(<= main_~i~0 106), 104659#(<= main_~i~0 109), 104658#(<= main_~i~0 108), 104661#(<= main_~i~0 111), 104660#(<= main_~i~0 110), 104663#(<= main_~i~0 113), 104662#(<= main_~i~0 112), 104665#(<= main_~i~0 115), 104664#(<= main_~i~0 114), 104667#(<= main_~i~0 117), 104666#(<= main_~i~0 116), 104669#(<= main_~i~0 119), 104668#(<= main_~i~0 118), 104671#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 104670#(<= main_~i~0 120), 104673#(and (<= 2 main_~i~0) (<= main_~i~0 122)), 104672#(and (<= 1 main_~i~0) (<= main_~i~0 121)), 104675#(and (<= 4 main_~i~0) (<= main_~i~0 124)), 104674#(and (<= main_~i~0 123) (<= 3 main_~i~0))] [2018-04-12 03:12:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 38378 backedges. 0 proven. 38378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:22,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-12 03:12:22,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-12 03:12:22,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7514, Invalid=8742, Unknown=0, NotChecked=0, Total=16256 [2018-04-12 03:12:22,227 INFO L87 Difference]: Start difference. First operand 633 states and 633 transitions. Second operand 128 states. [2018-04-12 03:12:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:12:27,886 INFO L93 Difference]: Finished difference Result 638 states and 638 transitions. [2018-04-12 03:12:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-04-12 03:12:27,886 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 627 [2018-04-12 03:12:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:12:27,887 INFO L225 Difference]: With dead ends: 638 [2018-04-12 03:12:27,887 INFO L226 Difference]: Without dead ends: 638 [2018-04-12 03:12:27,889 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8233 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=22887, Invalid=40365, Unknown=0, NotChecked=0, Total=63252 [2018-04-12 03:12:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-12 03:12:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2018-04-12 03:12:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-12 03:12:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 638 transitions. [2018-04-12 03:12:27,892 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 638 transitions. Word has length 627 [2018-04-12 03:12:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:12:27,892 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 638 transitions. [2018-04-12 03:12:27,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-12 03:12:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 638 transitions. [2018-04-12 03:12:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-04-12 03:12:27,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:12:27,894 INFO L355 BasicCegarLoop]: trace histogram [126, 125, 125, 125, 125, 1, 1, 1, 1, 1, 1] [2018-04-12 03:12:27,894 INFO L408 AbstractCegarLoop]: === Iteration 130 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:12:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1867162327, now seen corresponding path program 125 times [2018-04-12 03:12:27,894 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:12:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:12:27,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:12:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 39000 backedges. 0 proven. 39000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:32,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:12:32,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-04-12 03:12:32,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:12:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:32,854 INFO L182 omatonBuilderFactory]: Interpolants [106241#(<= main_~i~0 39), 106240#(<= main_~i~0 38), 106243#(<= main_~i~0 41), 106242#(<= main_~i~0 40), 106245#(<= main_~i~0 43), 106244#(<= main_~i~0 42), 106247#(<= main_~i~0 45), 106246#(<= main_~i~0 44), 106249#(<= main_~i~0 47), 106248#(<= main_~i~0 46), 106251#(<= main_~i~0 49), 106250#(<= main_~i~0 48), 106253#(<= main_~i~0 51), 106252#(<= main_~i~0 50), 106255#(<= main_~i~0 53), 106254#(<= main_~i~0 52), 106257#(<= main_~i~0 55), 106256#(<= main_~i~0 54), 106259#(<= main_~i~0 57), 106258#(<= main_~i~0 56), 106261#(<= main_~i~0 59), 106260#(<= main_~i~0 58), 106263#(<= main_~i~0 61), 106262#(<= main_~i~0 60), 106265#(<= main_~i~0 63), 106264#(<= main_~i~0 62), 106267#(<= main_~i~0 65), 106266#(<= main_~i~0 64), 106269#(<= main_~i~0 67), 106268#(<= main_~i~0 66), 106271#(<= main_~i~0 69), 106270#(<= main_~i~0 68), 106273#(<= main_~i~0 71), 106272#(<= main_~i~0 70), 106275#(<= main_~i~0 73), 106274#(<= main_~i~0 72), 106277#(<= main_~i~0 75), 106276#(<= main_~i~0 74), 106279#(<= main_~i~0 77), 106278#(<= main_~i~0 76), 106281#(<= main_~i~0 79), 106280#(<= main_~i~0 78), 106283#(<= main_~i~0 81), 106282#(<= main_~i~0 80), 106285#(<= main_~i~0 83), 106284#(<= main_~i~0 82), 106287#(<= main_~i~0 85), 106286#(<= main_~i~0 84), 106289#(<= main_~i~0 87), 106288#(<= main_~i~0 86), 106291#(<= main_~i~0 89), 106290#(<= main_~i~0 88), 106293#(<= main_~i~0 91), 106292#(<= main_~i~0 90), 106295#(<= main_~i~0 93), 106294#(<= main_~i~0 92), 106297#(<= main_~i~0 95), 106296#(<= main_~i~0 94), 106299#(<= main_~i~0 97), 106298#(<= main_~i~0 96), 106301#(<= main_~i~0 99), 106300#(<= main_~i~0 98), 106303#(<= main_~i~0 101), 106302#(<= main_~i~0 100), 106305#(<= main_~i~0 103), 106304#(<= main_~i~0 102), 106307#(<= main_~i~0 105), 106306#(<= main_~i~0 104), 106309#(<= main_~i~0 107), 106308#(<= main_~i~0 106), 106311#(<= main_~i~0 109), 106310#(<= main_~i~0 108), 106313#(<= main_~i~0 111), 106312#(<= main_~i~0 110), 106315#(<= main_~i~0 113), 106314#(<= main_~i~0 112), 106317#(<= main_~i~0 115), 106316#(<= main_~i~0 114), 106319#(<= main_~i~0 117), 106318#(<= main_~i~0 116), 106321#(<= main_~i~0 119), 106320#(<= main_~i~0 118), 106323#(<= main_~i~0 121), 106322#(<= main_~i~0 120), 106325#(<= main_~i~0 123), 106324#(<= main_~i~0 122), 106327#(and (<= 0 main_~i~0) (<= main_~i~0 124)), 106326#(<= main_~i~0 124), 106328#(and (<= main_~i~0 125) (<= 1 main_~i~0)), 106201#false, 106200#true, 106203#(<= main_~i~0 1), 106202#(<= main_~i~0 0), 106205#(<= main_~i~0 3), 106204#(<= main_~i~0 2), 106207#(<= main_~i~0 5), 106206#(<= main_~i~0 4), 106209#(<= main_~i~0 7), 106208#(<= main_~i~0 6), 106211#(<= main_~i~0 9), 106210#(<= main_~i~0 8), 106213#(<= main_~i~0 11), 106212#(<= main_~i~0 10), 106215#(<= main_~i~0 13), 106214#(<= main_~i~0 12), 106217#(<= main_~i~0 15), 106216#(<= main_~i~0 14), 106219#(<= main_~i~0 17), 106218#(<= main_~i~0 16), 106221#(<= main_~i~0 19), 106220#(<= main_~i~0 18), 106223#(<= main_~i~0 21), 106222#(<= main_~i~0 20), 106225#(<= main_~i~0 23), 106224#(<= main_~i~0 22), 106227#(<= main_~i~0 25), 106226#(<= main_~i~0 24), 106229#(<= main_~i~0 27), 106228#(<= main_~i~0 26), 106231#(<= main_~i~0 29), 106230#(<= main_~i~0 28), 106233#(<= main_~i~0 31), 106232#(<= main_~i~0 30), 106235#(<= main_~i~0 33), 106234#(<= main_~i~0 32), 106237#(<= main_~i~0 35), 106236#(<= main_~i~0 34), 106239#(<= main_~i~0 37), 106238#(<= main_~i~0 36)] [2018-04-12 03:12:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 39000 backedges. 0 proven. 39000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:32,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-12 03:12:32,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-12 03:12:32,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8006, Invalid=8506, Unknown=0, NotChecked=0, Total=16512 [2018-04-12 03:12:32,857 INFO L87 Difference]: Start difference. First operand 638 states and 638 transitions. Second operand 129 states. [2018-04-12 03:12:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:12:37,551 INFO L93 Difference]: Finished difference Result 643 states and 643 transitions. [2018-04-12 03:12:37,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-12 03:12:37,552 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 632 [2018-04-12 03:12:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:12:37,552 INFO L225 Difference]: With dead ends: 643 [2018-04-12 03:12:37,552 INFO L226 Difference]: Without dead ends: 643 [2018-04-12 03:12:37,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7999 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=24006, Invalid=40256, Unknown=0, NotChecked=0, Total=64262 [2018-04-12 03:12:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-04-12 03:12:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2018-04-12 03:12:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-04-12 03:12:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 643 transitions. [2018-04-12 03:12:37,558 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 643 transitions. Word has length 632 [2018-04-12 03:12:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:12:37,558 INFO L459 AbstractCegarLoop]: Abstraction has 643 states and 643 transitions. [2018-04-12 03:12:37,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-12 03:12:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 643 transitions. [2018-04-12 03:12:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-04-12 03:12:37,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:12:37,562 INFO L355 BasicCegarLoop]: trace histogram [127, 126, 126, 126, 126, 1, 1, 1, 1, 1, 1] [2018-04-12 03:12:37,562 INFO L408 AbstractCegarLoop]: === Iteration 131 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:12:37,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1914500230, now seen corresponding path program 126 times [2018-04-12 03:12:37,563 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:12:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:12:37,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:12:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 39627 backedges. 0 proven. 39627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:42,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:12:42,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-04-12 03:12:42,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:12:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:42,617 INFO L182 omatonBuilderFactory]: Interpolants [107865#true, 107867#(<= main_~i~0 0), 107866#false, 107869#(<= main_~i~0 2), 107868#(<= main_~i~0 1), 107871#(<= main_~i~0 4), 107870#(<= main_~i~0 3), 107873#(<= main_~i~0 6), 107872#(<= main_~i~0 5), 107875#(<= main_~i~0 8), 107874#(<= main_~i~0 7), 107877#(<= main_~i~0 10), 107876#(<= main_~i~0 9), 107879#(<= main_~i~0 12), 107878#(<= main_~i~0 11), 107881#(<= main_~i~0 14), 107880#(<= main_~i~0 13), 107883#(<= main_~i~0 16), 107882#(<= main_~i~0 15), 107885#(<= main_~i~0 18), 107884#(<= main_~i~0 17), 107887#(<= main_~i~0 20), 107886#(<= main_~i~0 19), 107889#(<= main_~i~0 22), 107888#(<= main_~i~0 21), 107891#(<= main_~i~0 24), 107890#(<= main_~i~0 23), 107893#(<= main_~i~0 26), 107892#(<= main_~i~0 25), 107895#(<= main_~i~0 28), 107894#(<= main_~i~0 27), 107897#(<= main_~i~0 30), 107896#(<= main_~i~0 29), 107899#(<= main_~i~0 32), 107898#(<= main_~i~0 31), 107901#(<= main_~i~0 34), 107900#(<= main_~i~0 33), 107903#(<= main_~i~0 36), 107902#(<= main_~i~0 35), 107905#(<= main_~i~0 38), 107904#(<= main_~i~0 37), 107907#(<= main_~i~0 40), 107906#(<= main_~i~0 39), 107909#(<= main_~i~0 42), 107908#(<= main_~i~0 41), 107911#(<= main_~i~0 44), 107910#(<= main_~i~0 43), 107913#(<= main_~i~0 46), 107912#(<= main_~i~0 45), 107915#(<= main_~i~0 48), 107914#(<= main_~i~0 47), 107917#(<= main_~i~0 50), 107916#(<= main_~i~0 49), 107919#(<= main_~i~0 52), 107918#(<= main_~i~0 51), 107921#(<= main_~i~0 54), 107920#(<= main_~i~0 53), 107923#(<= main_~i~0 56), 107922#(<= main_~i~0 55), 107925#(<= main_~i~0 58), 107924#(<= main_~i~0 57), 107927#(<= main_~i~0 60), 107926#(<= main_~i~0 59), 107929#(<= main_~i~0 62), 107928#(<= main_~i~0 61), 107931#(<= main_~i~0 64), 107930#(<= main_~i~0 63), 107933#(<= main_~i~0 66), 107932#(<= main_~i~0 65), 107935#(<= main_~i~0 68), 107934#(<= main_~i~0 67), 107937#(<= main_~i~0 70), 107936#(<= main_~i~0 69), 107939#(<= main_~i~0 72), 107938#(<= main_~i~0 71), 107941#(<= main_~i~0 74), 107940#(<= main_~i~0 73), 107943#(<= main_~i~0 76), 107942#(<= main_~i~0 75), 107945#(<= main_~i~0 78), 107944#(<= main_~i~0 77), 107947#(<= main_~i~0 80), 107946#(<= main_~i~0 79), 107949#(<= main_~i~0 82), 107948#(<= main_~i~0 81), 107951#(<= main_~i~0 84), 107950#(<= main_~i~0 83), 107953#(<= main_~i~0 86), 107952#(<= main_~i~0 85), 107955#(<= main_~i~0 88), 107954#(<= main_~i~0 87), 107957#(<= main_~i~0 90), 107956#(<= main_~i~0 89), 107959#(<= main_~i~0 92), 107958#(<= main_~i~0 91), 107961#(<= main_~i~0 94), 107960#(<= main_~i~0 93), 107963#(<= main_~i~0 96), 107962#(<= main_~i~0 95), 107965#(<= main_~i~0 98), 107964#(<= main_~i~0 97), 107967#(<= main_~i~0 100), 107966#(<= main_~i~0 99), 107969#(<= main_~i~0 102), 107968#(<= main_~i~0 101), 107971#(<= main_~i~0 104), 107970#(<= main_~i~0 103), 107973#(<= main_~i~0 106), 107972#(<= main_~i~0 105), 107975#(<= main_~i~0 108), 107974#(<= main_~i~0 107), 107977#(<= main_~i~0 110), 107976#(<= main_~i~0 109), 107979#(<= main_~i~0 112), 107978#(<= main_~i~0 111), 107981#(<= main_~i~0 114), 107980#(<= main_~i~0 113), 107983#(<= main_~i~0 116), 107982#(<= main_~i~0 115), 107985#(<= main_~i~0 118), 107984#(<= main_~i~0 117), 107987#(<= main_~i~0 120), 107986#(<= main_~i~0 119), 107989#(<= main_~i~0 122), 107988#(<= main_~i~0 121), 107991#(<= main_~i~0 124), 107990#(<= main_~i~0 123), 107993#(and (<= main_~i~0 125) (<= 1 main_~i~0)), 107992#(and (<= 0 main_~i~0) (<= main_~i~0 124)), 107994#(and (<= 2 main_~i~0) (<= main_~i~0 126))] [2018-04-12 03:12:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 39627 backedges. 0 proven. 39627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:42,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-12 03:12:42,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-12 03:12:42,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8008, Invalid=8762, Unknown=0, NotChecked=0, Total=16770 [2018-04-12 03:12:42,619 INFO L87 Difference]: Start difference. First operand 643 states and 643 transitions. Second operand 130 states. [2018-04-12 03:12:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:12:47,668 INFO L93 Difference]: Finished difference Result 648 states and 648 transitions. [2018-04-12 03:12:47,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-04-12 03:12:47,668 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 637 [2018-04-12 03:12:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:12:47,669 INFO L225 Difference]: With dead ends: 648 [2018-04-12 03:12:47,669 INFO L226 Difference]: Without dead ends: 648 [2018-04-12 03:12:47,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8250 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=24135, Invalid=41145, Unknown=0, NotChecked=0, Total=65280 [2018-04-12 03:12:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-04-12 03:12:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2018-04-12 03:12:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-04-12 03:12:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 648 transitions. [2018-04-12 03:12:47,672 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 648 transitions. Word has length 637 [2018-04-12 03:12:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:12:47,672 INFO L459 AbstractCegarLoop]: Abstraction has 648 states and 648 transitions. [2018-04-12 03:12:47,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-12 03:12:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 648 transitions. [2018-04-12 03:12:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-04-12 03:12:47,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:12:47,674 INFO L355 BasicCegarLoop]: trace histogram [128, 127, 127, 127, 127, 1, 1, 1, 1, 1, 1] [2018-04-12 03:12:47,674 INFO L408 AbstractCegarLoop]: === Iteration 132 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:12:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash -977971145, now seen corresponding path program 127 times [2018-04-12 03:12:47,675 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:12:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:12:47,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:12:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 40259 backedges. 0 proven. 40259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:52,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:12:52,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-04-12 03:12:52,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:12:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:52,767 INFO L182 omatonBuilderFactory]: Interpolants [109569#(<= main_~i~0 24), 109568#(<= main_~i~0 23), 109571#(<= main_~i~0 26), 109570#(<= main_~i~0 25), 109573#(<= main_~i~0 28), 109572#(<= main_~i~0 27), 109575#(<= main_~i~0 30), 109574#(<= main_~i~0 29), 109577#(<= main_~i~0 32), 109576#(<= main_~i~0 31), 109579#(<= main_~i~0 34), 109578#(<= main_~i~0 33), 109581#(<= main_~i~0 36), 109580#(<= main_~i~0 35), 109583#(<= main_~i~0 38), 109582#(<= main_~i~0 37), 109585#(<= main_~i~0 40), 109584#(<= main_~i~0 39), 109587#(<= main_~i~0 42), 109586#(<= main_~i~0 41), 109589#(<= main_~i~0 44), 109588#(<= main_~i~0 43), 109591#(<= main_~i~0 46), 109590#(<= main_~i~0 45), 109593#(<= main_~i~0 48), 109592#(<= main_~i~0 47), 109595#(<= main_~i~0 50), 109594#(<= main_~i~0 49), 109597#(<= main_~i~0 52), 109596#(<= main_~i~0 51), 109599#(<= main_~i~0 54), 109598#(<= main_~i~0 53), 109601#(<= main_~i~0 56), 109600#(<= main_~i~0 55), 109603#(<= main_~i~0 58), 109602#(<= main_~i~0 57), 109605#(<= main_~i~0 60), 109604#(<= main_~i~0 59), 109607#(<= main_~i~0 62), 109606#(<= main_~i~0 61), 109609#(<= main_~i~0 64), 109608#(<= main_~i~0 63), 109611#(<= main_~i~0 66), 109610#(<= main_~i~0 65), 109613#(<= main_~i~0 68), 109612#(<= main_~i~0 67), 109615#(<= main_~i~0 70), 109614#(<= main_~i~0 69), 109617#(<= main_~i~0 72), 109616#(<= main_~i~0 71), 109619#(<= main_~i~0 74), 109618#(<= main_~i~0 73), 109621#(<= main_~i~0 76), 109620#(<= main_~i~0 75), 109623#(<= main_~i~0 78), 109622#(<= main_~i~0 77), 109625#(<= main_~i~0 80), 109624#(<= main_~i~0 79), 109627#(<= main_~i~0 82), 109626#(<= main_~i~0 81), 109629#(<= main_~i~0 84), 109628#(<= main_~i~0 83), 109631#(<= main_~i~0 86), 109630#(<= main_~i~0 85), 109633#(<= main_~i~0 88), 109632#(<= main_~i~0 87), 109635#(<= main_~i~0 90), 109634#(<= main_~i~0 89), 109637#(<= main_~i~0 92), 109636#(<= main_~i~0 91), 109639#(<= main_~i~0 94), 109638#(<= main_~i~0 93), 109641#(<= main_~i~0 96), 109640#(<= main_~i~0 95), 109643#(<= main_~i~0 98), 109642#(<= main_~i~0 97), 109645#(<= main_~i~0 100), 109644#(<= main_~i~0 99), 109647#(<= main_~i~0 102), 109646#(<= main_~i~0 101), 109649#(<= main_~i~0 104), 109648#(<= main_~i~0 103), 109651#(<= main_~i~0 106), 109650#(<= main_~i~0 105), 109653#(<= main_~i~0 108), 109652#(<= main_~i~0 107), 109655#(<= main_~i~0 110), 109654#(<= main_~i~0 109), 109657#(<= main_~i~0 112), 109656#(<= main_~i~0 111), 109659#(<= main_~i~0 114), 109658#(<= main_~i~0 113), 109661#(<= main_~i~0 116), 109660#(<= main_~i~0 115), 109663#(<= main_~i~0 118), 109662#(<= main_~i~0 117), 109665#(<= main_~i~0 120), 109664#(<= main_~i~0 119), 109667#(<= main_~i~0 122), 109666#(<= main_~i~0 121), 109669#(<= main_~i~0 124), 109668#(<= main_~i~0 123), 109671#(<= main_~i~0 126), 109670#(<= main_~i~0 125), 109673#(and (<= 1 main_~i~0) (<= main_~i~0 127)), 109672#(and (<= 0 main_~i~0) (<= main_~i~0 126)), 109543#true, 109545#(<= main_~i~0 0), 109544#false, 109547#(<= main_~i~0 2), 109546#(<= main_~i~0 1), 109549#(<= main_~i~0 4), 109548#(<= main_~i~0 3), 109551#(<= main_~i~0 6), 109550#(<= main_~i~0 5), 109553#(<= main_~i~0 8), 109552#(<= main_~i~0 7), 109555#(<= main_~i~0 10), 109554#(<= main_~i~0 9), 109557#(<= main_~i~0 12), 109556#(<= main_~i~0 11), 109559#(<= main_~i~0 14), 109558#(<= main_~i~0 13), 109561#(<= main_~i~0 16), 109560#(<= main_~i~0 15), 109563#(<= main_~i~0 18), 109562#(<= main_~i~0 17), 109565#(<= main_~i~0 20), 109564#(<= main_~i~0 19), 109567#(<= main_~i~0 22), 109566#(<= main_~i~0 21)] [2018-04-12 03:12:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 40259 backedges. 0 proven. 40259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:12:52,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-12 03:12:52,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-12 03:12:52,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8261, Invalid=8769, Unknown=0, NotChecked=0, Total=17030 [2018-04-12 03:12:52,770 INFO L87 Difference]: Start difference. First operand 648 states and 648 transitions. Second operand 131 states. [2018-04-12 03:12:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:12:57,585 INFO L93 Difference]: Finished difference Result 653 states and 653 transitions. [2018-04-12 03:12:57,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-04-12 03:12:57,585 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 642 [2018-04-12 03:12:57,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:12:57,585 INFO L225 Difference]: With dead ends: 653 [2018-04-12 03:12:57,585 INFO L226 Difference]: Without dead ends: 653 [2018-04-12 03:12:57,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8254 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=24771, Invalid=41535, Unknown=0, NotChecked=0, Total=66306 [2018-04-12 03:12:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-04-12 03:12:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2018-04-12 03:12:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-04-12 03:12:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 653 transitions. [2018-04-12 03:12:57,589 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 653 transitions. Word has length 642 [2018-04-12 03:12:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:12:57,589 INFO L459 AbstractCegarLoop]: Abstraction has 653 states and 653 transitions. [2018-04-12 03:12:57,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-12 03:12:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 653 transitions. [2018-04-12 03:12:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-04-12 03:12:57,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:12:57,591 INFO L355 BasicCegarLoop]: trace histogram [129, 128, 128, 128, 128, 1, 1, 1, 1, 1, 1] [2018-04-12 03:12:57,592 INFO L408 AbstractCegarLoop]: === Iteration 133 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:12:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash 250387238, now seen corresponding path program 128 times [2018-04-12 03:12:57,592 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:12:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:12:57,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:13:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 40896 backedges. 0 proven. 40896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:04,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:13:04,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-04-12 03:13:04,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:13:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:04,135 INFO L182 omatonBuilderFactory]: Interpolants [111361#(and (<= main_~i~0 125) (<= 125 main_~i~0)), 111360#(and (<= 124 main_~i~0) (<= main_~i~0 124)), 111363#(and (<= main_~i~0 127) (<= 127 main_~i~0)), 111362#(and (<= main_~i~0 126) (<= 126 main_~i~0)), 111364#(and (<= main_~i~0 128) (<= 128 main_~i~0)), 111235#false, 111234#true, 111237#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 111236#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 111239#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 111238#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 111241#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 111240#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 111243#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 111242#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 111245#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 111244#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 111247#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 111246#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 111249#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 111248#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 111251#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 111250#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 111253#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 111252#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 111255#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 111254#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 111257#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 111256#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 111259#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 111258#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 111261#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 111260#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 111263#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 111262#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 111265#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 111264#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 111267#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 111266#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 111269#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 111268#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 111271#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 111270#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 111273#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 111272#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 111275#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 111274#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 111277#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 111276#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 111279#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 111278#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 111281#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 111280#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 111283#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 111282#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 111285#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 111284#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 111287#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 111286#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 111289#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 111288#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 111291#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 111290#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 111293#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 111292#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 111295#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 111294#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 111297#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 111296#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 111299#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 111298#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 111301#(and (<= 65 main_~i~0) (<= main_~i~0 65)), 111300#(and (<= main_~i~0 64) (<= 64 main_~i~0)), 111303#(and (<= main_~i~0 67) (<= 67 main_~i~0)), 111302#(and (<= main_~i~0 66) (<= 66 main_~i~0)), 111305#(and (<= main_~i~0 69) (<= 69 main_~i~0)), 111304#(and (<= main_~i~0 68) (<= 68 main_~i~0)), 111307#(and (<= 71 main_~i~0) (<= main_~i~0 71)), 111306#(and (<= main_~i~0 70) (<= 70 main_~i~0)), 111309#(and (<= main_~i~0 73) (<= 73 main_~i~0)), 111308#(and (<= main_~i~0 72) (<= 72 main_~i~0)), 111311#(and (<= main_~i~0 75) (<= 75 main_~i~0)), 111310#(and (<= 74 main_~i~0) (<= main_~i~0 74)), 111313#(and (<= main_~i~0 77) (<= 77 main_~i~0)), 111312#(and (<= 76 main_~i~0) (<= main_~i~0 76)), 111315#(and (<= main_~i~0 79) (<= 79 main_~i~0)), 111314#(and (<= main_~i~0 78) (<= 78 main_~i~0)), 111317#(and (<= main_~i~0 81) (<= 81 main_~i~0)), 111316#(and (<= main_~i~0 80) (<= 80 main_~i~0)), 111319#(and (<= main_~i~0 83) (<= 83 main_~i~0)), 111318#(and (<= main_~i~0 82) (<= 82 main_~i~0)), 111321#(and (<= 85 main_~i~0) (<= main_~i~0 85)), 111320#(and (<= main_~i~0 84) (<= 84 main_~i~0)), 111323#(and (<= 87 main_~i~0) (<= main_~i~0 87)), 111322#(and (<= main_~i~0 86) (<= 86 main_~i~0)), 111325#(and (<= 89 main_~i~0) (<= main_~i~0 89)), 111324#(and (<= main_~i~0 88) (<= 88 main_~i~0)), 111327#(and (<= main_~i~0 91) (<= 91 main_~i~0)), 111326#(and (<= main_~i~0 90) (<= 90 main_~i~0)), 111329#(and (<= 93 main_~i~0) (<= main_~i~0 93)), 111328#(and (<= 92 main_~i~0) (<= main_~i~0 92)), 111331#(and (<= main_~i~0 95) (<= 95 main_~i~0)), 111330#(and (<= main_~i~0 94) (<= 94 main_~i~0)), 111333#(and (<= 97 main_~i~0) (<= main_~i~0 97)), 111332#(and (<= main_~i~0 96) (<= 96 main_~i~0)), 111335#(and (<= 99 main_~i~0) (<= main_~i~0 99)), 111334#(and (<= main_~i~0 98) (<= 98 main_~i~0)), 111337#(and (<= 101 main_~i~0) (<= main_~i~0 101)), 111336#(and (<= main_~i~0 100) (<= 100 main_~i~0)), 111339#(and (<= main_~i~0 103) (<= 103 main_~i~0)), 111338#(and (<= 102 main_~i~0) (<= main_~i~0 102)), 111341#(and (<= 105 main_~i~0) (<= main_~i~0 105)), 111340#(and (<= main_~i~0 104) (<= 104 main_~i~0)), 111343#(and (<= 107 main_~i~0) (<= main_~i~0 107)), 111342#(and (<= main_~i~0 106) (<= 106 main_~i~0)), 111345#(and (<= 109 main_~i~0) (<= main_~i~0 109)), 111344#(and (<= 108 main_~i~0) (<= main_~i~0 108)), 111347#(and (<= main_~i~0 111) (<= 111 main_~i~0)), 111346#(and (<= main_~i~0 110) (<= 110 main_~i~0)), 111349#(and (<= 113 main_~i~0) (<= main_~i~0 113)), 111348#(and (<= main_~i~0 112) (<= 112 main_~i~0)), 111351#(and (<= 115 main_~i~0) (<= main_~i~0 115)), 111350#(and (<= 114 main_~i~0) (<= main_~i~0 114)), 111353#(and (<= main_~i~0 117) (<= 117 main_~i~0)), 111352#(and (<= 116 main_~i~0) (<= main_~i~0 116)), 111355#(and (<= main_~i~0 119) (<= 119 main_~i~0)), 111354#(and (<= 118 main_~i~0) (<= main_~i~0 118)), 111357#(and (<= main_~i~0 121) (<= 121 main_~i~0)), 111356#(and (<= 120 main_~i~0) (<= main_~i~0 120)), 111359#(and (<= 123 main_~i~0) (<= main_~i~0 123)), 111358#(and (<= main_~i~0 122) (<= 122 main_~i~0))] [2018-04-12 03:13:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 40896 backedges. 0 proven. 40896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:04,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-12 03:13:04,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-12 03:13:04,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-04-12 03:13:04,137 INFO L87 Difference]: Start difference. First operand 653 states and 653 transitions. Second operand 131 states. [2018-04-12 03:13:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:13:19,830 INFO L93 Difference]: Finished difference Result 658 states and 658 transitions. [2018-04-12 03:13:19,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-04-12 03:13:19,831 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 647 [2018-04-12 03:13:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:13:19,831 INFO L225 Difference]: With dead ends: 658 [2018-04-12 03:13:19,831 INFO L226 Difference]: Without dead ends: 658 [2018-04-12 03:13:19,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-04-12 03:13:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-04-12 03:13:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2018-04-12 03:13:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-04-12 03:13:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 658 transitions. [2018-04-12 03:13:19,834 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 658 transitions. Word has length 647 [2018-04-12 03:13:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:13:19,834 INFO L459 AbstractCegarLoop]: Abstraction has 658 states and 658 transitions. [2018-04-12 03:13:19,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-12 03:13:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 658 transitions. [2018-04-12 03:13:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-04-12 03:13:19,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:13:19,836 INFO L355 BasicCegarLoop]: trace histogram [130, 129, 129, 129, 129, 1, 1, 1, 1, 1, 1] [2018-04-12 03:13:19,836 INFO L408 AbstractCegarLoop]: === Iteration 134 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:13:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 667211159, now seen corresponding path program 129 times [2018-04-12 03:13:19,836 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:13:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:13:19,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:13:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 41538 backedges. 0 proven. 41538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:24,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:13:24,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-04-12 03:13:24,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:13:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:24,996 INFO L182 omatonBuilderFactory]: Interpolants [112681#true, 112683#(<= main_~i~0 0), 112682#false, 112685#(<= main_~i~0 2), 112684#(<= main_~i~0 1), 112687#(<= main_~i~0 4), 112686#(<= main_~i~0 3), 112689#(<= main_~i~0 6), 112688#(<= main_~i~0 5), 112691#(<= main_~i~0 8), 112690#(<= main_~i~0 7), 112693#(<= main_~i~0 10), 112692#(<= main_~i~0 9), 112695#(<= main_~i~0 12), 112694#(<= main_~i~0 11), 112697#(<= main_~i~0 14), 112696#(<= main_~i~0 13), 112699#(<= main_~i~0 16), 112698#(<= main_~i~0 15), 112701#(<= main_~i~0 18), 112700#(<= main_~i~0 17), 112703#(<= main_~i~0 20), 112702#(<= main_~i~0 19), 112705#(<= main_~i~0 22), 112704#(<= main_~i~0 21), 112707#(<= main_~i~0 24), 112706#(<= main_~i~0 23), 112709#(<= main_~i~0 26), 112708#(<= main_~i~0 25), 112711#(<= main_~i~0 28), 112710#(<= main_~i~0 27), 112713#(<= main_~i~0 30), 112712#(<= main_~i~0 29), 112715#(<= main_~i~0 32), 112714#(<= main_~i~0 31), 112717#(<= main_~i~0 34), 112716#(<= main_~i~0 33), 112719#(<= main_~i~0 36), 112718#(<= main_~i~0 35), 112721#(<= main_~i~0 38), 112720#(<= main_~i~0 37), 112723#(<= main_~i~0 40), 112722#(<= main_~i~0 39), 112725#(<= main_~i~0 42), 112724#(<= main_~i~0 41), 112727#(<= main_~i~0 44), 112726#(<= main_~i~0 43), 112729#(<= main_~i~0 46), 112728#(<= main_~i~0 45), 112731#(<= main_~i~0 48), 112730#(<= main_~i~0 47), 112733#(<= main_~i~0 50), 112732#(<= main_~i~0 49), 112735#(<= main_~i~0 52), 112734#(<= main_~i~0 51), 112737#(<= main_~i~0 54), 112736#(<= main_~i~0 53), 112739#(<= main_~i~0 56), 112738#(<= main_~i~0 55), 112741#(<= main_~i~0 58), 112740#(<= main_~i~0 57), 112743#(<= main_~i~0 60), 112742#(<= main_~i~0 59), 112745#(<= main_~i~0 62), 112744#(<= main_~i~0 61), 112747#(<= main_~i~0 64), 112746#(<= main_~i~0 63), 112749#(<= main_~i~0 66), 112748#(<= main_~i~0 65), 112751#(<= main_~i~0 68), 112750#(<= main_~i~0 67), 112753#(<= main_~i~0 70), 112752#(<= main_~i~0 69), 112755#(<= main_~i~0 72), 112754#(<= main_~i~0 71), 112757#(<= main_~i~0 74), 112756#(<= main_~i~0 73), 112759#(<= main_~i~0 76), 112758#(<= main_~i~0 75), 112761#(<= main_~i~0 78), 112760#(<= main_~i~0 77), 112763#(<= main_~i~0 80), 112762#(<= main_~i~0 79), 112765#(<= main_~i~0 82), 112764#(<= main_~i~0 81), 112767#(<= main_~i~0 84), 112766#(<= main_~i~0 83), 112769#(<= main_~i~0 86), 112768#(<= main_~i~0 85), 112771#(<= main_~i~0 88), 112770#(<= main_~i~0 87), 112773#(<= main_~i~0 90), 112772#(<= main_~i~0 89), 112775#(<= main_~i~0 92), 112774#(<= main_~i~0 91), 112777#(<= main_~i~0 94), 112776#(<= main_~i~0 93), 112779#(<= main_~i~0 96), 112778#(<= main_~i~0 95), 112781#(<= main_~i~0 98), 112780#(<= main_~i~0 97), 112783#(<= main_~i~0 100), 112782#(<= main_~i~0 99), 112785#(<= main_~i~0 102), 112784#(<= main_~i~0 101), 112787#(<= main_~i~0 104), 112786#(<= main_~i~0 103), 112789#(<= main_~i~0 106), 112788#(<= main_~i~0 105), 112791#(<= main_~i~0 108), 112790#(<= main_~i~0 107), 112793#(<= main_~i~0 110), 112792#(<= main_~i~0 109), 112795#(<= main_~i~0 112), 112794#(<= main_~i~0 111), 112797#(<= main_~i~0 114), 112796#(<= main_~i~0 113), 112799#(<= main_~i~0 116), 112798#(<= main_~i~0 115), 112801#(<= main_~i~0 118), 112800#(<= main_~i~0 117), 112803#(<= main_~i~0 120), 112802#(<= main_~i~0 119), 112805#(<= main_~i~0 122), 112804#(<= main_~i~0 121), 112807#(<= main_~i~0 124), 112806#(<= main_~i~0 123), 112809#(<= main_~i~0 126), 112808#(<= main_~i~0 125), 112811#(<= main_~i~0 128), 112810#(<= main_~i~0 127), 112813#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 112812#(and (<= 0 main_~i~0) (<= main_~i~0 128))] [2018-04-12 03:13:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 41538 backedges. 0 proven. 41538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:24,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-04-12 03:13:24,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-04-12 03:13:24,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8520, Invalid=9036, Unknown=0, NotChecked=0, Total=17556 [2018-04-12 03:13:24,998 INFO L87 Difference]: Start difference. First operand 658 states and 658 transitions. Second operand 133 states. [2018-04-12 03:13:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:13:29,929 INFO L93 Difference]: Finished difference Result 663 states and 663 transitions. [2018-04-12 03:13:29,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-12 03:13:29,929 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 652 [2018-04-12 03:13:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:13:29,930 INFO L225 Difference]: With dead ends: 663 [2018-04-12 03:13:29,930 INFO L226 Difference]: Without dead ends: 663 [2018-04-12 03:13:29,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8513 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=25548, Invalid=42834, Unknown=0, NotChecked=0, Total=68382 [2018-04-12 03:13:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-04-12 03:13:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2018-04-12 03:13:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-04-12 03:13:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 663 transitions. [2018-04-12 03:13:29,934 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 663 transitions. Word has length 652 [2018-04-12 03:13:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:13:29,934 INFO L459 AbstractCegarLoop]: Abstraction has 663 states and 663 transitions. [2018-04-12 03:13:29,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-04-12 03:13:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 663 transitions. [2018-04-12 03:13:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2018-04-12 03:13:29,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:13:29,936 INFO L355 BasicCegarLoop]: trace histogram [131, 130, 130, 130, 130, 1, 1, 1, 1, 1, 1] [2018-04-12 03:13:29,936 INFO L408 AbstractCegarLoop]: === Iteration 135 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:13:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1881900602, now seen corresponding path program 130 times [2018-04-12 03:13:29,936 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:13:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:13:29,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:13:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 42185 backedges. 0 proven. 42185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:35,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:13:35,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-04-12 03:13:35,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:13:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:35,206 INFO L182 omatonBuilderFactory]: Interpolants [114433#(<= main_~i~0 33), 114432#(<= main_~i~0 32), 114435#(<= main_~i~0 35), 114434#(<= main_~i~0 34), 114437#(<= main_~i~0 37), 114436#(<= main_~i~0 36), 114439#(<= main_~i~0 39), 114438#(<= main_~i~0 38), 114441#(<= main_~i~0 41), 114440#(<= main_~i~0 40), 114443#(<= main_~i~0 43), 114442#(<= main_~i~0 42), 114445#(<= main_~i~0 45), 114444#(<= main_~i~0 44), 114447#(<= main_~i~0 47), 114446#(<= main_~i~0 46), 114449#(<= main_~i~0 49), 114448#(<= main_~i~0 48), 114451#(<= main_~i~0 51), 114450#(<= main_~i~0 50), 114453#(<= main_~i~0 53), 114452#(<= main_~i~0 52), 114455#(<= main_~i~0 55), 114454#(<= main_~i~0 54), 114457#(<= main_~i~0 57), 114456#(<= main_~i~0 56), 114459#(<= main_~i~0 59), 114458#(<= main_~i~0 58), 114461#(<= main_~i~0 61), 114460#(<= main_~i~0 60), 114463#(<= main_~i~0 63), 114462#(<= main_~i~0 62), 114465#(<= main_~i~0 65), 114464#(<= main_~i~0 64), 114467#(<= main_~i~0 67), 114466#(<= main_~i~0 66), 114469#(<= main_~i~0 69), 114468#(<= main_~i~0 68), 114471#(<= main_~i~0 71), 114470#(<= main_~i~0 70), 114473#(<= main_~i~0 73), 114472#(<= main_~i~0 72), 114475#(<= main_~i~0 75), 114474#(<= main_~i~0 74), 114477#(<= main_~i~0 77), 114476#(<= main_~i~0 76), 114479#(<= main_~i~0 79), 114478#(<= main_~i~0 78), 114481#(<= main_~i~0 81), 114480#(<= main_~i~0 80), 114483#(<= main_~i~0 83), 114482#(<= main_~i~0 82), 114485#(<= main_~i~0 85), 114484#(<= main_~i~0 84), 114487#(<= main_~i~0 87), 114486#(<= main_~i~0 86), 114489#(<= main_~i~0 89), 114488#(<= main_~i~0 88), 114491#(<= main_~i~0 91), 114490#(<= main_~i~0 90), 114493#(<= main_~i~0 93), 114492#(<= main_~i~0 92), 114495#(<= main_~i~0 95), 114494#(<= main_~i~0 94), 114497#(<= main_~i~0 97), 114496#(<= main_~i~0 96), 114499#(<= main_~i~0 99), 114498#(<= main_~i~0 98), 114501#(<= main_~i~0 101), 114500#(<= main_~i~0 100), 114503#(<= main_~i~0 103), 114502#(<= main_~i~0 102), 114505#(<= main_~i~0 105), 114504#(<= main_~i~0 104), 114507#(<= main_~i~0 107), 114506#(<= main_~i~0 106), 114509#(<= main_~i~0 109), 114508#(<= main_~i~0 108), 114511#(<= main_~i~0 111), 114510#(<= main_~i~0 110), 114513#(<= main_~i~0 113), 114512#(<= main_~i~0 112), 114515#(<= main_~i~0 115), 114514#(<= main_~i~0 114), 114517#(<= main_~i~0 117), 114516#(<= main_~i~0 116), 114519#(<= main_~i~0 119), 114518#(<= main_~i~0 118), 114521#(<= main_~i~0 121), 114520#(<= main_~i~0 120), 114523#(<= main_~i~0 123), 114522#(<= main_~i~0 122), 114525#(<= main_~i~0 125), 114524#(<= main_~i~0 124), 114527#(<= main_~i~0 127), 114526#(<= main_~i~0 126), 114529#(and (<= 0 main_~i~0) (<= main_~i~0 128)), 114528#(<= main_~i~0 128), 114531#(and (<= 2 main_~i~0) (<= main_~i~0 130)), 114530#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 114399#false, 114398#true, 114401#(<= main_~i~0 1), 114400#(<= main_~i~0 0), 114403#(<= main_~i~0 3), 114402#(<= main_~i~0 2), 114405#(<= main_~i~0 5), 114404#(<= main_~i~0 4), 114407#(<= main_~i~0 7), 114406#(<= main_~i~0 6), 114409#(<= main_~i~0 9), 114408#(<= main_~i~0 8), 114411#(<= main_~i~0 11), 114410#(<= main_~i~0 10), 114413#(<= main_~i~0 13), 114412#(<= main_~i~0 12), 114415#(<= main_~i~0 15), 114414#(<= main_~i~0 14), 114417#(<= main_~i~0 17), 114416#(<= main_~i~0 16), 114419#(<= main_~i~0 19), 114418#(<= main_~i~0 18), 114421#(<= main_~i~0 21), 114420#(<= main_~i~0 20), 114423#(<= main_~i~0 23), 114422#(<= main_~i~0 22), 114425#(<= main_~i~0 25), 114424#(<= main_~i~0 24), 114427#(<= main_~i~0 27), 114426#(<= main_~i~0 26), 114429#(<= main_~i~0 29), 114428#(<= main_~i~0 28), 114431#(<= main_~i~0 31), 114430#(<= main_~i~0 30)] [2018-04-12 03:13:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 42185 backedges. 0 proven. 42185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:35,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-12 03:13:35,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-12 03:13:35,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8522, Invalid=9300, Unknown=0, NotChecked=0, Total=17822 [2018-04-12 03:13:35,208 INFO L87 Difference]: Start difference. First operand 663 states and 663 transitions. Second operand 134 states. [2018-04-12 03:13:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:13:40,410 INFO L93 Difference]: Finished difference Result 668 states and 668 transitions. [2018-04-12 03:13:40,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-04-12 03:13:40,426 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 657 [2018-04-12 03:13:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:13:40,427 INFO L225 Difference]: With dead ends: 668 [2018-04-12 03:13:40,427 INFO L226 Difference]: Without dead ends: 668 [2018-04-12 03:13:40,429 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8772 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=25681, Invalid=43751, Unknown=0, NotChecked=0, Total=69432 [2018-04-12 03:13:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-04-12 03:13:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2018-04-12 03:13:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-04-12 03:13:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 668 transitions. [2018-04-12 03:13:40,432 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 668 transitions. Word has length 657 [2018-04-12 03:13:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:13:40,432 INFO L459 AbstractCegarLoop]: Abstraction has 668 states and 668 transitions. [2018-04-12 03:13:40,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-12 03:13:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 668 transitions. [2018-04-12 03:13:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-04-12 03:13:40,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:13:40,435 INFO L355 BasicCegarLoop]: trace histogram [132, 131, 131, 131, 131, 1, 1, 1, 1, 1, 1] [2018-04-12 03:13:40,435 INFO L408 AbstractCegarLoop]: === Iteration 136 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:13:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 69147383, now seen corresponding path program 131 times [2018-04-12 03:13:40,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:13:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:13:40,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:13:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 42837 backedges. 0 proven. 42837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:45,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:13:45,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-04-12 03:13:45,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:13:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:45,772 INFO L182 omatonBuilderFactory]: Interpolants [116225#(<= main_~i~0 95), 116224#(<= main_~i~0 94), 116227#(<= main_~i~0 97), 116226#(<= main_~i~0 96), 116229#(<= main_~i~0 99), 116228#(<= main_~i~0 98), 116231#(<= main_~i~0 101), 116230#(<= main_~i~0 100), 116233#(<= main_~i~0 103), 116232#(<= main_~i~0 102), 116235#(<= main_~i~0 105), 116234#(<= main_~i~0 104), 116237#(<= main_~i~0 107), 116236#(<= main_~i~0 106), 116239#(<= main_~i~0 109), 116238#(<= main_~i~0 108), 116241#(<= main_~i~0 111), 116240#(<= main_~i~0 110), 116243#(<= main_~i~0 113), 116242#(<= main_~i~0 112), 116245#(<= main_~i~0 115), 116244#(<= main_~i~0 114), 116247#(<= main_~i~0 117), 116246#(<= main_~i~0 116), 116249#(<= main_~i~0 119), 116248#(<= main_~i~0 118), 116251#(<= main_~i~0 121), 116250#(<= main_~i~0 120), 116253#(<= main_~i~0 123), 116252#(<= main_~i~0 122), 116255#(<= main_~i~0 125), 116254#(<= main_~i~0 124), 116257#(<= main_~i~0 127), 116256#(<= main_~i~0 126), 116259#(<= main_~i~0 129), 116258#(<= main_~i~0 128), 116261#(and (<= 0 main_~i~0) (<= main_~i~0 130)), 116260#(<= main_~i~0 130), 116262#(and (<= 1 main_~i~0) (<= main_~i~0 131)), 116129#false, 116128#true, 116131#(<= main_~i~0 1), 116130#(<= main_~i~0 0), 116133#(<= main_~i~0 3), 116132#(<= main_~i~0 2), 116135#(<= main_~i~0 5), 116134#(<= main_~i~0 4), 116137#(<= main_~i~0 7), 116136#(<= main_~i~0 6), 116139#(<= main_~i~0 9), 116138#(<= main_~i~0 8), 116141#(<= main_~i~0 11), 116140#(<= main_~i~0 10), 116143#(<= main_~i~0 13), 116142#(<= main_~i~0 12), 116145#(<= main_~i~0 15), 116144#(<= main_~i~0 14), 116147#(<= main_~i~0 17), 116146#(<= main_~i~0 16), 116149#(<= main_~i~0 19), 116148#(<= main_~i~0 18), 116151#(<= main_~i~0 21), 116150#(<= main_~i~0 20), 116153#(<= main_~i~0 23), 116152#(<= main_~i~0 22), 116155#(<= main_~i~0 25), 116154#(<= main_~i~0 24), 116157#(<= main_~i~0 27), 116156#(<= main_~i~0 26), 116159#(<= main_~i~0 29), 116158#(<= main_~i~0 28), 116161#(<= main_~i~0 31), 116160#(<= main_~i~0 30), 116163#(<= main_~i~0 33), 116162#(<= main_~i~0 32), 116165#(<= main_~i~0 35), 116164#(<= main_~i~0 34), 116167#(<= main_~i~0 37), 116166#(<= main_~i~0 36), 116169#(<= main_~i~0 39), 116168#(<= main_~i~0 38), 116171#(<= main_~i~0 41), 116170#(<= main_~i~0 40), 116173#(<= main_~i~0 43), 116172#(<= main_~i~0 42), 116175#(<= main_~i~0 45), 116174#(<= main_~i~0 44), 116177#(<= main_~i~0 47), 116176#(<= main_~i~0 46), 116179#(<= main_~i~0 49), 116178#(<= main_~i~0 48), 116181#(<= main_~i~0 51), 116180#(<= main_~i~0 50), 116183#(<= main_~i~0 53), 116182#(<= main_~i~0 52), 116185#(<= main_~i~0 55), 116184#(<= main_~i~0 54), 116187#(<= main_~i~0 57), 116186#(<= main_~i~0 56), 116189#(<= main_~i~0 59), 116188#(<= main_~i~0 58), 116191#(<= main_~i~0 61), 116190#(<= main_~i~0 60), 116193#(<= main_~i~0 63), 116192#(<= main_~i~0 62), 116195#(<= main_~i~0 65), 116194#(<= main_~i~0 64), 116197#(<= main_~i~0 67), 116196#(<= main_~i~0 66), 116199#(<= main_~i~0 69), 116198#(<= main_~i~0 68), 116201#(<= main_~i~0 71), 116200#(<= main_~i~0 70), 116203#(<= main_~i~0 73), 116202#(<= main_~i~0 72), 116205#(<= main_~i~0 75), 116204#(<= main_~i~0 74), 116207#(<= main_~i~0 77), 116206#(<= main_~i~0 76), 116209#(<= main_~i~0 79), 116208#(<= main_~i~0 78), 116211#(<= main_~i~0 81), 116210#(<= main_~i~0 80), 116213#(<= main_~i~0 83), 116212#(<= main_~i~0 82), 116215#(<= main_~i~0 85), 116214#(<= main_~i~0 84), 116217#(<= main_~i~0 87), 116216#(<= main_~i~0 86), 116219#(<= main_~i~0 89), 116218#(<= main_~i~0 88), 116221#(<= main_~i~0 91), 116220#(<= main_~i~0 90), 116223#(<= main_~i~0 93), 116222#(<= main_~i~0 92)] [2018-04-12 03:13:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 42837 backedges. 0 proven. 42837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:45,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-04-12 03:13:45,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-04-12 03:13:45,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8783, Invalid=9307, Unknown=0, NotChecked=0, Total=18090 [2018-04-12 03:13:45,774 INFO L87 Difference]: Start difference. First operand 668 states and 668 transitions. Second operand 135 states. [2018-04-12 03:13:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:13:50,701 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-04-12 03:13:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-04-12 03:13:50,701 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 662 [2018-04-12 03:13:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:13:50,702 INFO L225 Difference]: With dead ends: 673 [2018-04-12 03:13:50,702 INFO L226 Difference]: Without dead ends: 673 [2018-04-12 03:13:50,704 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8776 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=26337, Invalid=44153, Unknown=0, NotChecked=0, Total=70490 [2018-04-12 03:13:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-04-12 03:13:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2018-04-12 03:13:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-04-12 03:13:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 673 transitions. [2018-04-12 03:13:50,706 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 673 transitions. Word has length 662 [2018-04-12 03:13:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:13:50,707 INFO L459 AbstractCegarLoop]: Abstraction has 673 states and 673 transitions. [2018-04-12 03:13:50,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-04-12 03:13:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 673 transitions. [2018-04-12 03:13:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-04-12 03:13:50,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:13:50,709 INFO L355 BasicCegarLoop]: trace histogram [133, 132, 132, 132, 132, 1, 1, 1, 1, 1, 1] [2018-04-12 03:13:50,709 INFO L408 AbstractCegarLoop]: === Iteration 137 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:13:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1108438938, now seen corresponding path program 132 times [2018-04-12 03:13:50,709 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:13:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:13:50,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:13:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 43494 backedges. 0 proven. 43494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:56,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:13:56,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-04-12 03:13:56,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:13:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:56,112 INFO L182 omatonBuilderFactory]: Interpolants [117871#true, 117873#(<= main_~i~0 0), 117872#false, 117875#(<= main_~i~0 2), 117874#(<= main_~i~0 1), 117877#(<= main_~i~0 4), 117876#(<= main_~i~0 3), 117879#(<= main_~i~0 6), 117878#(<= main_~i~0 5), 117881#(<= main_~i~0 8), 117880#(<= main_~i~0 7), 117883#(<= main_~i~0 10), 117882#(<= main_~i~0 9), 117885#(<= main_~i~0 12), 117884#(<= main_~i~0 11), 117887#(<= main_~i~0 14), 117886#(<= main_~i~0 13), 117889#(<= main_~i~0 16), 117888#(<= main_~i~0 15), 117891#(<= main_~i~0 18), 117890#(<= main_~i~0 17), 117893#(<= main_~i~0 20), 117892#(<= main_~i~0 19), 117895#(<= main_~i~0 22), 117894#(<= main_~i~0 21), 117897#(<= main_~i~0 24), 117896#(<= main_~i~0 23), 117899#(<= main_~i~0 26), 117898#(<= main_~i~0 25), 117901#(<= main_~i~0 28), 117900#(<= main_~i~0 27), 117903#(<= main_~i~0 30), 117902#(<= main_~i~0 29), 117905#(<= main_~i~0 32), 117904#(<= main_~i~0 31), 117907#(<= main_~i~0 34), 117906#(<= main_~i~0 33), 117909#(<= main_~i~0 36), 117908#(<= main_~i~0 35), 117911#(<= main_~i~0 38), 117910#(<= main_~i~0 37), 117913#(<= main_~i~0 40), 117912#(<= main_~i~0 39), 117915#(<= main_~i~0 42), 117914#(<= main_~i~0 41), 117917#(<= main_~i~0 44), 117916#(<= main_~i~0 43), 117919#(<= main_~i~0 46), 117918#(<= main_~i~0 45), 117921#(<= main_~i~0 48), 117920#(<= main_~i~0 47), 117923#(<= main_~i~0 50), 117922#(<= main_~i~0 49), 117925#(<= main_~i~0 52), 117924#(<= main_~i~0 51), 117927#(<= main_~i~0 54), 117926#(<= main_~i~0 53), 117929#(<= main_~i~0 56), 117928#(<= main_~i~0 55), 117931#(<= main_~i~0 58), 117930#(<= main_~i~0 57), 117933#(<= main_~i~0 60), 117932#(<= main_~i~0 59), 117935#(<= main_~i~0 62), 117934#(<= main_~i~0 61), 117937#(<= main_~i~0 64), 117936#(<= main_~i~0 63), 117939#(<= main_~i~0 66), 117938#(<= main_~i~0 65), 117941#(<= main_~i~0 68), 117940#(<= main_~i~0 67), 117943#(<= main_~i~0 70), 117942#(<= main_~i~0 69), 117945#(<= main_~i~0 72), 117944#(<= main_~i~0 71), 117947#(<= main_~i~0 74), 117946#(<= main_~i~0 73), 117949#(<= main_~i~0 76), 117948#(<= main_~i~0 75), 117951#(<= main_~i~0 78), 117950#(<= main_~i~0 77), 117953#(<= main_~i~0 80), 117952#(<= main_~i~0 79), 117955#(<= main_~i~0 82), 117954#(<= main_~i~0 81), 117957#(<= main_~i~0 84), 117956#(<= main_~i~0 83), 117959#(<= main_~i~0 86), 117958#(<= main_~i~0 85), 117961#(<= main_~i~0 88), 117960#(<= main_~i~0 87), 117963#(<= main_~i~0 90), 117962#(<= main_~i~0 89), 117965#(<= main_~i~0 92), 117964#(<= main_~i~0 91), 117967#(<= main_~i~0 94), 117966#(<= main_~i~0 93), 117969#(<= main_~i~0 96), 117968#(<= main_~i~0 95), 117971#(<= main_~i~0 98), 117970#(<= main_~i~0 97), 117973#(<= main_~i~0 100), 117972#(<= main_~i~0 99), 117975#(<= main_~i~0 102), 117974#(<= main_~i~0 101), 117977#(<= main_~i~0 104), 117976#(<= main_~i~0 103), 117979#(<= main_~i~0 106), 117978#(<= main_~i~0 105), 117981#(<= main_~i~0 108), 117980#(<= main_~i~0 107), 117983#(<= main_~i~0 110), 117982#(<= main_~i~0 109), 117985#(<= main_~i~0 112), 117984#(<= main_~i~0 111), 117987#(<= main_~i~0 114), 117986#(<= main_~i~0 113), 117989#(<= main_~i~0 116), 117988#(<= main_~i~0 115), 117991#(<= main_~i~0 118), 117990#(<= main_~i~0 117), 117993#(<= main_~i~0 120), 117992#(<= main_~i~0 119), 117995#(<= main_~i~0 122), 117994#(<= main_~i~0 121), 117997#(<= main_~i~0 124), 117996#(<= main_~i~0 123), 117999#(<= main_~i~0 126), 117998#(<= main_~i~0 125), 118001#(<= main_~i~0 128), 118000#(<= main_~i~0 127), 118003#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 118002#(and (<= 0 main_~i~0) (<= main_~i~0 128)), 118005#(and (<= main_~i~0 131) (<= 3 main_~i~0)), 118004#(and (<= 2 main_~i~0) (<= main_~i~0 130)), 118006#(and (<= main_~i~0 132) (<= 4 main_~i~0))] [2018-04-12 03:13:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 43494 backedges. 0 proven. 43494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:13:56,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-04-12 03:13:56,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-04-12 03:13:56,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8526, Invalid=9834, Unknown=0, NotChecked=0, Total=18360 [2018-04-12 03:13:56,114 INFO L87 Difference]: Start difference. First operand 673 states and 673 transitions. Second operand 136 states. [2018-04-12 03:14:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:14:02,563 INFO L93 Difference]: Finished difference Result 678 states and 678 transitions. [2018-04-12 03:14:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-12 03:14:02,563 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 667 [2018-04-12 03:14:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:14:02,564 INFO L225 Difference]: With dead ends: 678 [2018-04-12 03:14:02,564 INFO L226 Difference]: Without dead ends: 678 [2018-04-12 03:14:02,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9293 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=25947, Invalid=45609, Unknown=0, NotChecked=0, Total=71556 [2018-04-12 03:14:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-04-12 03:14:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2018-04-12 03:14:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-04-12 03:14:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 678 transitions. [2018-04-12 03:14:02,568 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 678 transitions. Word has length 667 [2018-04-12 03:14:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:14:02,568 INFO L459 AbstractCegarLoop]: Abstraction has 678 states and 678 transitions. [2018-04-12 03:14:02,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-04-12 03:14:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 678 transitions. [2018-04-12 03:14:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-04-12 03:14:02,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:14:02,570 INFO L355 BasicCegarLoop]: trace histogram [134, 133, 133, 133, 133, 1, 1, 1, 1, 1, 1] [2018-04-12 03:14:02,570 INFO L408 AbstractCegarLoop]: === Iteration 138 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:14:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash 837429335, now seen corresponding path program 133 times [2018-04-12 03:14:02,571 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:14:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:14:02,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:14:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 44156 backedges. 0 proven. 44156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:08,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:14:08,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-04-12 03:14:08,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:14:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:08,238 INFO L182 omatonBuilderFactory]: Interpolants [119627#true, 119629#(<= main_~i~0 0), 119628#false, 119631#(<= main_~i~0 2), 119630#(<= main_~i~0 1), 119633#(<= main_~i~0 4), 119632#(<= main_~i~0 3), 119635#(<= main_~i~0 6), 119634#(<= main_~i~0 5), 119637#(<= main_~i~0 8), 119636#(<= main_~i~0 7), 119639#(<= main_~i~0 10), 119638#(<= main_~i~0 9), 119641#(<= main_~i~0 12), 119640#(<= main_~i~0 11), 119643#(<= main_~i~0 14), 119642#(<= main_~i~0 13), 119645#(<= main_~i~0 16), 119644#(<= main_~i~0 15), 119647#(<= main_~i~0 18), 119646#(<= main_~i~0 17), 119649#(<= main_~i~0 20), 119648#(<= main_~i~0 19), 119651#(<= main_~i~0 22), 119650#(<= main_~i~0 21), 119653#(<= main_~i~0 24), 119652#(<= main_~i~0 23), 119655#(<= main_~i~0 26), 119654#(<= main_~i~0 25), 119657#(<= main_~i~0 28), 119656#(<= main_~i~0 27), 119659#(<= main_~i~0 30), 119658#(<= main_~i~0 29), 119661#(<= main_~i~0 32), 119660#(<= main_~i~0 31), 119663#(<= main_~i~0 34), 119662#(<= main_~i~0 33), 119665#(<= main_~i~0 36), 119664#(<= main_~i~0 35), 119667#(<= main_~i~0 38), 119666#(<= main_~i~0 37), 119669#(<= main_~i~0 40), 119668#(<= main_~i~0 39), 119671#(<= main_~i~0 42), 119670#(<= main_~i~0 41), 119673#(<= main_~i~0 44), 119672#(<= main_~i~0 43), 119675#(<= main_~i~0 46), 119674#(<= main_~i~0 45), 119677#(<= main_~i~0 48), 119676#(<= main_~i~0 47), 119679#(<= main_~i~0 50), 119678#(<= main_~i~0 49), 119681#(<= main_~i~0 52), 119680#(<= main_~i~0 51), 119683#(<= main_~i~0 54), 119682#(<= main_~i~0 53), 119685#(<= main_~i~0 56), 119684#(<= main_~i~0 55), 119687#(<= main_~i~0 58), 119686#(<= main_~i~0 57), 119689#(<= main_~i~0 60), 119688#(<= main_~i~0 59), 119691#(<= main_~i~0 62), 119690#(<= main_~i~0 61), 119693#(<= main_~i~0 64), 119692#(<= main_~i~0 63), 119695#(<= main_~i~0 66), 119694#(<= main_~i~0 65), 119697#(<= main_~i~0 68), 119696#(<= main_~i~0 67), 119699#(<= main_~i~0 70), 119698#(<= main_~i~0 69), 119701#(<= main_~i~0 72), 119700#(<= main_~i~0 71), 119703#(<= main_~i~0 74), 119702#(<= main_~i~0 73), 119705#(<= main_~i~0 76), 119704#(<= main_~i~0 75), 119707#(<= main_~i~0 78), 119706#(<= main_~i~0 77), 119709#(<= main_~i~0 80), 119708#(<= main_~i~0 79), 119711#(<= main_~i~0 82), 119710#(<= main_~i~0 81), 119713#(<= main_~i~0 84), 119712#(<= main_~i~0 83), 119715#(<= main_~i~0 86), 119714#(<= main_~i~0 85), 119717#(<= main_~i~0 88), 119716#(<= main_~i~0 87), 119719#(<= main_~i~0 90), 119718#(<= main_~i~0 89), 119721#(<= main_~i~0 92), 119720#(<= main_~i~0 91), 119723#(<= main_~i~0 94), 119722#(<= main_~i~0 93), 119725#(<= main_~i~0 96), 119724#(<= main_~i~0 95), 119727#(<= main_~i~0 98), 119726#(<= main_~i~0 97), 119729#(<= main_~i~0 100), 119728#(<= main_~i~0 99), 119731#(<= main_~i~0 102), 119730#(<= main_~i~0 101), 119733#(<= main_~i~0 104), 119732#(<= main_~i~0 103), 119735#(<= main_~i~0 106), 119734#(<= main_~i~0 105), 119737#(<= main_~i~0 108), 119736#(<= main_~i~0 107), 119739#(<= main_~i~0 110), 119738#(<= main_~i~0 109), 119741#(<= main_~i~0 112), 119740#(<= main_~i~0 111), 119743#(<= main_~i~0 114), 119742#(<= main_~i~0 113), 119745#(<= main_~i~0 116), 119744#(<= main_~i~0 115), 119747#(<= main_~i~0 118), 119746#(<= main_~i~0 117), 119749#(<= main_~i~0 120), 119748#(<= main_~i~0 119), 119751#(<= main_~i~0 122), 119750#(<= main_~i~0 121), 119753#(<= main_~i~0 124), 119752#(<= main_~i~0 123), 119755#(<= main_~i~0 126), 119754#(<= main_~i~0 125), 119757#(<= main_~i~0 128), 119756#(<= main_~i~0 127), 119759#(<= main_~i~0 130), 119758#(<= main_~i~0 129), 119761#(<= main_~i~0 132), 119760#(<= main_~i~0 131), 119763#(and (<= 1 main_~i~0) (<= main_~i~0 133)), 119762#(and (<= 0 main_~i~0) (<= main_~i~0 132))] [2018-04-12 03:14:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 44156 backedges. 0 proven. 44156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:08,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-12 03:14:08,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-12 03:14:08,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9050, Invalid=9582, Unknown=0, NotChecked=0, Total=18632 [2018-04-12 03:14:08,241 INFO L87 Difference]: Start difference. First operand 678 states and 678 transitions. Second operand 137 states. [2018-04-12 03:14:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:14:13,296 INFO L93 Difference]: Finished difference Result 683 states and 683 transitions. [2018-04-12 03:14:13,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-04-12 03:14:13,297 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 672 [2018-04-12 03:14:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:14:13,297 INFO L225 Difference]: With dead ends: 683 [2018-04-12 03:14:13,297 INFO L226 Difference]: Without dead ends: 683 [2018-04-12 03:14:13,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9043 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=27138, Invalid=45492, Unknown=0, NotChecked=0, Total=72630 [2018-04-12 03:14:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-12 03:14:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2018-04-12 03:14:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-04-12 03:14:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 683 transitions. [2018-04-12 03:14:13,301 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 683 transitions. Word has length 672 [2018-04-12 03:14:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:14:13,302 INFO L459 AbstractCegarLoop]: Abstraction has 683 states and 683 transitions. [2018-04-12 03:14:13,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-04-12 03:14:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 683 transitions. [2018-04-12 03:14:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-04-12 03:14:13,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:14:13,304 INFO L355 BasicCegarLoop]: trace histogram [135, 134, 134, 134, 134, 1, 1, 1, 1, 1, 1] [2018-04-12 03:14:13,304 INFO L408 AbstractCegarLoop]: === Iteration 139 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:14:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1238687494, now seen corresponding path program 134 times [2018-04-12 03:14:13,304 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:14:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:14:13,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:14:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 44823 backedges. 0 proven. 44823 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:18,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:14:18,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-04-12 03:14:18,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:14:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:18,917 INFO L182 omatonBuilderFactory]: Interpolants [121397#false, 121396#true, 121399#(<= main_~i~0 1), 121398#(<= main_~i~0 0), 121401#(<= main_~i~0 3), 121400#(<= main_~i~0 2), 121403#(<= main_~i~0 5), 121402#(<= main_~i~0 4), 121405#(<= main_~i~0 7), 121404#(<= main_~i~0 6), 121407#(<= main_~i~0 9), 121406#(<= main_~i~0 8), 121409#(<= main_~i~0 11), 121408#(<= main_~i~0 10), 121411#(<= main_~i~0 13), 121410#(<= main_~i~0 12), 121413#(<= main_~i~0 15), 121412#(<= main_~i~0 14), 121415#(<= main_~i~0 17), 121414#(<= main_~i~0 16), 121417#(<= main_~i~0 19), 121416#(<= main_~i~0 18), 121419#(<= main_~i~0 21), 121418#(<= main_~i~0 20), 121421#(<= main_~i~0 23), 121420#(<= main_~i~0 22), 121423#(<= main_~i~0 25), 121422#(<= main_~i~0 24), 121425#(<= main_~i~0 27), 121424#(<= main_~i~0 26), 121427#(<= main_~i~0 29), 121426#(<= main_~i~0 28), 121429#(<= main_~i~0 31), 121428#(<= main_~i~0 30), 121431#(<= main_~i~0 33), 121430#(<= main_~i~0 32), 121433#(<= main_~i~0 35), 121432#(<= main_~i~0 34), 121435#(<= main_~i~0 37), 121434#(<= main_~i~0 36), 121437#(<= main_~i~0 39), 121436#(<= main_~i~0 38), 121439#(<= main_~i~0 41), 121438#(<= main_~i~0 40), 121441#(<= main_~i~0 43), 121440#(<= main_~i~0 42), 121443#(<= main_~i~0 45), 121442#(<= main_~i~0 44), 121445#(<= main_~i~0 47), 121444#(<= main_~i~0 46), 121447#(<= main_~i~0 49), 121446#(<= main_~i~0 48), 121449#(<= main_~i~0 51), 121448#(<= main_~i~0 50), 121451#(<= main_~i~0 53), 121450#(<= main_~i~0 52), 121453#(<= main_~i~0 55), 121452#(<= main_~i~0 54), 121455#(<= main_~i~0 57), 121454#(<= main_~i~0 56), 121457#(<= main_~i~0 59), 121456#(<= main_~i~0 58), 121459#(<= main_~i~0 61), 121458#(<= main_~i~0 60), 121461#(<= main_~i~0 63), 121460#(<= main_~i~0 62), 121463#(<= main_~i~0 65), 121462#(<= main_~i~0 64), 121465#(<= main_~i~0 67), 121464#(<= main_~i~0 66), 121467#(<= main_~i~0 69), 121466#(<= main_~i~0 68), 121469#(<= main_~i~0 71), 121468#(<= main_~i~0 70), 121471#(<= main_~i~0 73), 121470#(<= main_~i~0 72), 121473#(<= main_~i~0 75), 121472#(<= main_~i~0 74), 121475#(<= main_~i~0 77), 121474#(<= main_~i~0 76), 121477#(<= main_~i~0 79), 121476#(<= main_~i~0 78), 121479#(<= main_~i~0 81), 121478#(<= main_~i~0 80), 121481#(<= main_~i~0 83), 121480#(<= main_~i~0 82), 121483#(<= main_~i~0 85), 121482#(<= main_~i~0 84), 121485#(<= main_~i~0 87), 121484#(<= main_~i~0 86), 121487#(<= main_~i~0 89), 121486#(<= main_~i~0 88), 121489#(<= main_~i~0 91), 121488#(<= main_~i~0 90), 121491#(<= main_~i~0 93), 121490#(<= main_~i~0 92), 121493#(<= main_~i~0 95), 121492#(<= main_~i~0 94), 121495#(<= main_~i~0 97), 121494#(<= main_~i~0 96), 121497#(<= main_~i~0 99), 121496#(<= main_~i~0 98), 121499#(<= main_~i~0 101), 121498#(<= main_~i~0 100), 121501#(<= main_~i~0 103), 121500#(<= main_~i~0 102), 121503#(<= main_~i~0 105), 121502#(<= main_~i~0 104), 121505#(<= main_~i~0 107), 121504#(<= main_~i~0 106), 121507#(<= main_~i~0 109), 121506#(<= main_~i~0 108), 121509#(<= main_~i~0 111), 121508#(<= main_~i~0 110), 121511#(<= main_~i~0 113), 121510#(<= main_~i~0 112), 121513#(<= main_~i~0 115), 121512#(<= main_~i~0 114), 121515#(<= main_~i~0 117), 121514#(<= main_~i~0 116), 121517#(<= main_~i~0 119), 121516#(<= main_~i~0 118), 121519#(<= main_~i~0 121), 121518#(<= main_~i~0 120), 121521#(<= main_~i~0 123), 121520#(<= main_~i~0 122), 121523#(<= main_~i~0 125), 121522#(<= main_~i~0 124), 121525#(<= main_~i~0 127), 121524#(<= main_~i~0 126), 121527#(<= main_~i~0 129), 121526#(<= main_~i~0 128), 121529#(<= main_~i~0 131), 121528#(<= main_~i~0 130), 121531#(and (<= 0 main_~i~0) (<= main_~i~0 132)), 121530#(<= main_~i~0 132), 121533#(and (<= 2 main_~i~0) (<= main_~i~0 134)), 121532#(and (<= 1 main_~i~0) (<= main_~i~0 133))] [2018-04-12 03:14:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 44823 backedges. 0 proven. 44823 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:18,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-04-12 03:14:18,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-04-12 03:14:18,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9052, Invalid=9854, Unknown=0, NotChecked=0, Total=18906 [2018-04-12 03:14:18,920 INFO L87 Difference]: Start difference. First operand 683 states and 683 transitions. Second operand 138 states. [2018-04-12 03:14:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:14:24,434 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2018-04-12 03:14:24,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-12 03:14:24,434 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 677 [2018-04-12 03:14:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:14:24,435 INFO L225 Difference]: With dead ends: 688 [2018-04-12 03:14:24,435 INFO L226 Difference]: Without dead ends: 688 [2018-04-12 03:14:24,437 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9310 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=27275, Invalid=46437, Unknown=0, NotChecked=0, Total=73712 [2018-04-12 03:14:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-04-12 03:14:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2018-04-12 03:14:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-04-12 03:14:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 688 transitions. [2018-04-12 03:14:24,439 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 688 transitions. Word has length 677 [2018-04-12 03:14:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:14:24,440 INFO L459 AbstractCegarLoop]: Abstraction has 688 states and 688 transitions. [2018-04-12 03:14:24,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-04-12 03:14:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 688 transitions. [2018-04-12 03:14:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-04-12 03:14:24,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:14:24,442 INFO L355 BasicCegarLoop]: trace histogram [136, 135, 135, 135, 135, 1, 1, 1, 1, 1, 1] [2018-04-12 03:14:24,442 INFO L408 AbstractCegarLoop]: === Iteration 140 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:14:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1355546039, now seen corresponding path program 135 times [2018-04-12 03:14:24,443 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:14:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:14:24,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:14:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45495 backedges. 0 proven. 45495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:30,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:14:30,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-04-12 03:14:30,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:14:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:30,118 INFO L182 omatonBuilderFactory]: Interpolants [123179#false, 123178#true, 123181#(<= main_~i~0 1), 123180#(<= main_~i~0 0), 123183#(<= main_~i~0 3), 123182#(<= main_~i~0 2), 123185#(<= main_~i~0 5), 123184#(<= main_~i~0 4), 123187#(<= main_~i~0 7), 123186#(<= main_~i~0 6), 123189#(<= main_~i~0 9), 123188#(<= main_~i~0 8), 123191#(<= main_~i~0 11), 123190#(<= main_~i~0 10), 123193#(<= main_~i~0 13), 123192#(<= main_~i~0 12), 123195#(<= main_~i~0 15), 123194#(<= main_~i~0 14), 123197#(<= main_~i~0 17), 123196#(<= main_~i~0 16), 123199#(<= main_~i~0 19), 123198#(<= main_~i~0 18), 123201#(<= main_~i~0 21), 123200#(<= main_~i~0 20), 123203#(<= main_~i~0 23), 123202#(<= main_~i~0 22), 123205#(<= main_~i~0 25), 123204#(<= main_~i~0 24), 123207#(<= main_~i~0 27), 123206#(<= main_~i~0 26), 123209#(<= main_~i~0 29), 123208#(<= main_~i~0 28), 123211#(<= main_~i~0 31), 123210#(<= main_~i~0 30), 123213#(<= main_~i~0 33), 123212#(<= main_~i~0 32), 123215#(<= main_~i~0 35), 123214#(<= main_~i~0 34), 123217#(<= main_~i~0 37), 123216#(<= main_~i~0 36), 123219#(<= main_~i~0 39), 123218#(<= main_~i~0 38), 123221#(<= main_~i~0 41), 123220#(<= main_~i~0 40), 123223#(<= main_~i~0 43), 123222#(<= main_~i~0 42), 123225#(<= main_~i~0 45), 123224#(<= main_~i~0 44), 123227#(<= main_~i~0 47), 123226#(<= main_~i~0 46), 123229#(<= main_~i~0 49), 123228#(<= main_~i~0 48), 123231#(<= main_~i~0 51), 123230#(<= main_~i~0 50), 123233#(<= main_~i~0 53), 123232#(<= main_~i~0 52), 123235#(<= main_~i~0 55), 123234#(<= main_~i~0 54), 123237#(<= main_~i~0 57), 123236#(<= main_~i~0 56), 123239#(<= main_~i~0 59), 123238#(<= main_~i~0 58), 123241#(<= main_~i~0 61), 123240#(<= main_~i~0 60), 123243#(<= main_~i~0 63), 123242#(<= main_~i~0 62), 123245#(<= main_~i~0 65), 123244#(<= main_~i~0 64), 123247#(<= main_~i~0 67), 123246#(<= main_~i~0 66), 123249#(<= main_~i~0 69), 123248#(<= main_~i~0 68), 123251#(<= main_~i~0 71), 123250#(<= main_~i~0 70), 123253#(<= main_~i~0 73), 123252#(<= main_~i~0 72), 123255#(<= main_~i~0 75), 123254#(<= main_~i~0 74), 123257#(<= main_~i~0 77), 123256#(<= main_~i~0 76), 123259#(<= main_~i~0 79), 123258#(<= main_~i~0 78), 123261#(<= main_~i~0 81), 123260#(<= main_~i~0 80), 123263#(<= main_~i~0 83), 123262#(<= main_~i~0 82), 123265#(<= main_~i~0 85), 123264#(<= main_~i~0 84), 123267#(<= main_~i~0 87), 123266#(<= main_~i~0 86), 123269#(<= main_~i~0 89), 123268#(<= main_~i~0 88), 123271#(<= main_~i~0 91), 123270#(<= main_~i~0 90), 123273#(<= main_~i~0 93), 123272#(<= main_~i~0 92), 123275#(<= main_~i~0 95), 123274#(<= main_~i~0 94), 123277#(<= main_~i~0 97), 123276#(<= main_~i~0 96), 123279#(<= main_~i~0 99), 123278#(<= main_~i~0 98), 123281#(<= main_~i~0 101), 123280#(<= main_~i~0 100), 123283#(<= main_~i~0 103), 123282#(<= main_~i~0 102), 123285#(<= main_~i~0 105), 123284#(<= main_~i~0 104), 123287#(<= main_~i~0 107), 123286#(<= main_~i~0 106), 123289#(<= main_~i~0 109), 123288#(<= main_~i~0 108), 123291#(<= main_~i~0 111), 123290#(<= main_~i~0 110), 123293#(<= main_~i~0 113), 123292#(<= main_~i~0 112), 123295#(<= main_~i~0 115), 123294#(<= main_~i~0 114), 123297#(<= main_~i~0 117), 123296#(<= main_~i~0 116), 123299#(<= main_~i~0 119), 123298#(<= main_~i~0 118), 123301#(<= main_~i~0 121), 123300#(<= main_~i~0 120), 123303#(<= main_~i~0 123), 123302#(<= main_~i~0 122), 123305#(<= main_~i~0 125), 123304#(<= main_~i~0 124), 123307#(<= main_~i~0 127), 123306#(<= main_~i~0 126), 123309#(<= main_~i~0 129), 123308#(<= main_~i~0 128), 123311#(<= main_~i~0 131), 123310#(<= main_~i~0 130), 123313#(<= main_~i~0 133), 123312#(<= main_~i~0 132), 123315#(and (<= 0 main_~i~0) (<= main_~i~0 134)), 123314#(<= main_~i~0 134), 123316#(and (<= 1 main_~i~0) (<= main_~i~0 135))] [2018-04-12 03:14:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 45495 backedges. 0 proven. 45495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:30,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-04-12 03:14:30,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-04-12 03:14:30,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9321, Invalid=9861, Unknown=0, NotChecked=0, Total=19182 [2018-04-12 03:14:30,121 INFO L87 Difference]: Start difference. First operand 688 states and 688 transitions. Second operand 139 states. [2018-04-12 03:14:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:14:35,324 INFO L93 Difference]: Finished difference Result 693 states and 693 transitions. [2018-04-12 03:14:35,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-04-12 03:14:35,324 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 682 [2018-04-12 03:14:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:14:35,325 INFO L225 Difference]: With dead ends: 693 [2018-04-12 03:14:35,325 INFO L226 Difference]: Without dead ends: 693 [2018-04-12 03:14:35,327 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9314 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=27951, Invalid=46851, Unknown=0, NotChecked=0, Total=74802 [2018-04-12 03:14:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-04-12 03:14:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2018-04-12 03:14:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-04-12 03:14:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 693 transitions. [2018-04-12 03:14:35,329 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 693 transitions. Word has length 682 [2018-04-12 03:14:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:14:35,330 INFO L459 AbstractCegarLoop]: Abstraction has 693 states and 693 transitions. [2018-04-12 03:14:35,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-04-12 03:14:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 693 transitions. [2018-04-12 03:14:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-04-12 03:14:35,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:14:35,332 INFO L355 BasicCegarLoop]: trace histogram [137, 136, 136, 136, 136, 1, 1, 1, 1, 1, 1] [2018-04-12 03:14:35,332 INFO L408 AbstractCegarLoop]: === Iteration 141 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:14:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1805739430, now seen corresponding path program 136 times [2018-04-12 03:14:35,333 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:14:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:14:35,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:14:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 46172 backedges. 0 proven. 46172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:41,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:14:41,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-04-12 03:14:41,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:14:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:41,018 INFO L182 omatonBuilderFactory]: Interpolants [124973#true, 124975#(<= main_~i~0 0), 124974#false, 124977#(<= main_~i~0 2), 124976#(<= main_~i~0 1), 124979#(<= main_~i~0 4), 124978#(<= main_~i~0 3), 124981#(<= main_~i~0 6), 124980#(<= main_~i~0 5), 124983#(<= main_~i~0 8), 124982#(<= main_~i~0 7), 124985#(<= main_~i~0 10), 124984#(<= main_~i~0 9), 124987#(<= main_~i~0 12), 124986#(<= main_~i~0 11), 124989#(<= main_~i~0 14), 124988#(<= main_~i~0 13), 124991#(<= main_~i~0 16), 124990#(<= main_~i~0 15), 124993#(<= main_~i~0 18), 124992#(<= main_~i~0 17), 124995#(<= main_~i~0 20), 124994#(<= main_~i~0 19), 124997#(<= main_~i~0 22), 124996#(<= main_~i~0 21), 124999#(<= main_~i~0 24), 124998#(<= main_~i~0 23), 125001#(<= main_~i~0 26), 125000#(<= main_~i~0 25), 125003#(<= main_~i~0 28), 125002#(<= main_~i~0 27), 125005#(<= main_~i~0 30), 125004#(<= main_~i~0 29), 125007#(<= main_~i~0 32), 125006#(<= main_~i~0 31), 125009#(<= main_~i~0 34), 125008#(<= main_~i~0 33), 125011#(<= main_~i~0 36), 125010#(<= main_~i~0 35), 125013#(<= main_~i~0 38), 125012#(<= main_~i~0 37), 125015#(<= main_~i~0 40), 125014#(<= main_~i~0 39), 125017#(<= main_~i~0 42), 125016#(<= main_~i~0 41), 125019#(<= main_~i~0 44), 125018#(<= main_~i~0 43), 125021#(<= main_~i~0 46), 125020#(<= main_~i~0 45), 125023#(<= main_~i~0 48), 125022#(<= main_~i~0 47), 125025#(<= main_~i~0 50), 125024#(<= main_~i~0 49), 125027#(<= main_~i~0 52), 125026#(<= main_~i~0 51), 125029#(<= main_~i~0 54), 125028#(<= main_~i~0 53), 125031#(<= main_~i~0 56), 125030#(<= main_~i~0 55), 125033#(<= main_~i~0 58), 125032#(<= main_~i~0 57), 125035#(<= main_~i~0 60), 125034#(<= main_~i~0 59), 125037#(<= main_~i~0 62), 125036#(<= main_~i~0 61), 125039#(<= main_~i~0 64), 125038#(<= main_~i~0 63), 125041#(<= main_~i~0 66), 125040#(<= main_~i~0 65), 125043#(<= main_~i~0 68), 125042#(<= main_~i~0 67), 125045#(<= main_~i~0 70), 125044#(<= main_~i~0 69), 125047#(<= main_~i~0 72), 125046#(<= main_~i~0 71), 125049#(<= main_~i~0 74), 125048#(<= main_~i~0 73), 125051#(<= main_~i~0 76), 125050#(<= main_~i~0 75), 125053#(<= main_~i~0 78), 125052#(<= main_~i~0 77), 125055#(<= main_~i~0 80), 125054#(<= main_~i~0 79), 125057#(<= main_~i~0 82), 125056#(<= main_~i~0 81), 125059#(<= main_~i~0 84), 125058#(<= main_~i~0 83), 125061#(<= main_~i~0 86), 125060#(<= main_~i~0 85), 125063#(<= main_~i~0 88), 125062#(<= main_~i~0 87), 125065#(<= main_~i~0 90), 125064#(<= main_~i~0 89), 125067#(<= main_~i~0 92), 125066#(<= main_~i~0 91), 125069#(<= main_~i~0 94), 125068#(<= main_~i~0 93), 125071#(<= main_~i~0 96), 125070#(<= main_~i~0 95), 125073#(<= main_~i~0 98), 125072#(<= main_~i~0 97), 125075#(<= main_~i~0 100), 125074#(<= main_~i~0 99), 125077#(<= main_~i~0 102), 125076#(<= main_~i~0 101), 125079#(<= main_~i~0 104), 125078#(<= main_~i~0 103), 125081#(<= main_~i~0 106), 125080#(<= main_~i~0 105), 125083#(<= main_~i~0 108), 125082#(<= main_~i~0 107), 125085#(<= main_~i~0 110), 125084#(<= main_~i~0 109), 125087#(<= main_~i~0 112), 125086#(<= main_~i~0 111), 125089#(<= main_~i~0 114), 125088#(<= main_~i~0 113), 125091#(<= main_~i~0 116), 125090#(<= main_~i~0 115), 125093#(<= main_~i~0 118), 125092#(<= main_~i~0 117), 125095#(<= main_~i~0 120), 125094#(<= main_~i~0 119), 125097#(<= main_~i~0 122), 125096#(<= main_~i~0 121), 125099#(<= main_~i~0 124), 125098#(<= main_~i~0 123), 125101#(<= main_~i~0 126), 125100#(<= main_~i~0 125), 125103#(<= main_~i~0 128), 125102#(<= main_~i~0 127), 125105#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 125104#(and (<= 0 main_~i~0) (<= main_~i~0 128)), 125107#(and (<= main_~i~0 131) (<= 3 main_~i~0)), 125106#(and (<= 2 main_~i~0) (<= main_~i~0 130)), 125109#(and (<= 5 main_~i~0) (<= main_~i~0 133)), 125108#(and (<= main_~i~0 132) (<= 4 main_~i~0)), 125111#(and (<= 7 main_~i~0) (<= main_~i~0 135)), 125110#(and (<= 6 main_~i~0) (<= main_~i~0 134)), 125112#(and (<= 8 main_~i~0) (<= main_~i~0 136))] [2018-04-12 03:14:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 46172 backedges. 0 proven. 46172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:41,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-04-12 03:14:41,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-04-12 03:14:41,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8534, Invalid=10926, Unknown=0, NotChecked=0, Total=19460 [2018-04-12 03:14:41,021 INFO L87 Difference]: Start difference. First operand 693 states and 693 transitions. Second operand 140 states. [2018-04-12 03:14:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:14:49,129 INFO L93 Difference]: Finished difference Result 698 states and 698 transitions. [2018-04-12 03:14:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-04-12 03:14:49,130 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 687 [2018-04-12 03:14:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:14:49,130 INFO L225 Difference]: With dead ends: 698 [2018-04-12 03:14:49,130 INFO L226 Difference]: Without dead ends: 698 [2018-04-12 03:14:49,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10347 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=26479, Invalid=49421, Unknown=0, NotChecked=0, Total=75900 [2018-04-12 03:14:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-04-12 03:14:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2018-04-12 03:14:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-12 03:14:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 698 transitions. [2018-04-12 03:14:49,134 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 698 transitions. Word has length 687 [2018-04-12 03:14:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:14:49,135 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 698 transitions. [2018-04-12 03:14:49,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-04-12 03:14:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 698 transitions. [2018-04-12 03:14:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2018-04-12 03:14:49,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:14:49,137 INFO L355 BasicCegarLoop]: trace histogram [138, 137, 137, 137, 137, 1, 1, 1, 1, 1, 1] [2018-04-12 03:14:49,137 INFO L408 AbstractCegarLoop]: === Iteration 142 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:14:49,137 INFO L82 PathProgramCache]: Analyzing trace with hash 686463767, now seen corresponding path program 137 times [2018-04-12 03:14:49,138 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:14:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:14:49,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:14:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 46854 backedges. 0 proven. 46854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:55,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:14:55,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-04-12 03:14:55,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:14:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:55,055 INFO L182 omatonBuilderFactory]: Interpolants [126781#true, 126783#(<= main_~i~0 0), 126782#false, 126785#(<= main_~i~0 2), 126784#(<= main_~i~0 1), 126787#(<= main_~i~0 4), 126786#(<= main_~i~0 3), 126789#(<= main_~i~0 6), 126788#(<= main_~i~0 5), 126791#(<= main_~i~0 8), 126790#(<= main_~i~0 7), 126793#(<= main_~i~0 10), 126792#(<= main_~i~0 9), 126795#(<= main_~i~0 12), 126794#(<= main_~i~0 11), 126797#(<= main_~i~0 14), 126796#(<= main_~i~0 13), 126799#(<= main_~i~0 16), 126798#(<= main_~i~0 15), 126801#(<= main_~i~0 18), 126800#(<= main_~i~0 17), 126803#(<= main_~i~0 20), 126802#(<= main_~i~0 19), 126805#(<= main_~i~0 22), 126804#(<= main_~i~0 21), 126807#(<= main_~i~0 24), 126806#(<= main_~i~0 23), 126809#(<= main_~i~0 26), 126808#(<= main_~i~0 25), 126811#(<= main_~i~0 28), 126810#(<= main_~i~0 27), 126813#(<= main_~i~0 30), 126812#(<= main_~i~0 29), 126815#(<= main_~i~0 32), 126814#(<= main_~i~0 31), 126817#(<= main_~i~0 34), 126816#(<= main_~i~0 33), 126819#(<= main_~i~0 36), 126818#(<= main_~i~0 35), 126821#(<= main_~i~0 38), 126820#(<= main_~i~0 37), 126823#(<= main_~i~0 40), 126822#(<= main_~i~0 39), 126825#(<= main_~i~0 42), 126824#(<= main_~i~0 41), 126827#(<= main_~i~0 44), 126826#(<= main_~i~0 43), 126829#(<= main_~i~0 46), 126828#(<= main_~i~0 45), 126831#(<= main_~i~0 48), 126830#(<= main_~i~0 47), 126833#(<= main_~i~0 50), 126832#(<= main_~i~0 49), 126835#(<= main_~i~0 52), 126834#(<= main_~i~0 51), 126837#(<= main_~i~0 54), 126836#(<= main_~i~0 53), 126839#(<= main_~i~0 56), 126838#(<= main_~i~0 55), 126841#(<= main_~i~0 58), 126840#(<= main_~i~0 57), 126843#(<= main_~i~0 60), 126842#(<= main_~i~0 59), 126845#(<= main_~i~0 62), 126844#(<= main_~i~0 61), 126847#(<= main_~i~0 64), 126846#(<= main_~i~0 63), 126849#(<= main_~i~0 66), 126848#(<= main_~i~0 65), 126851#(<= main_~i~0 68), 126850#(<= main_~i~0 67), 126853#(<= main_~i~0 70), 126852#(<= main_~i~0 69), 126855#(<= main_~i~0 72), 126854#(<= main_~i~0 71), 126857#(<= main_~i~0 74), 126856#(<= main_~i~0 73), 126859#(<= main_~i~0 76), 126858#(<= main_~i~0 75), 126861#(<= main_~i~0 78), 126860#(<= main_~i~0 77), 126863#(<= main_~i~0 80), 126862#(<= main_~i~0 79), 126865#(<= main_~i~0 82), 126864#(<= main_~i~0 81), 126867#(<= main_~i~0 84), 126866#(<= main_~i~0 83), 126869#(<= main_~i~0 86), 126868#(<= main_~i~0 85), 126871#(<= main_~i~0 88), 126870#(<= main_~i~0 87), 126873#(<= main_~i~0 90), 126872#(<= main_~i~0 89), 126875#(<= main_~i~0 92), 126874#(<= main_~i~0 91), 126877#(<= main_~i~0 94), 126876#(<= main_~i~0 93), 126879#(<= main_~i~0 96), 126878#(<= main_~i~0 95), 126881#(<= main_~i~0 98), 126880#(<= main_~i~0 97), 126883#(<= main_~i~0 100), 126882#(<= main_~i~0 99), 126885#(<= main_~i~0 102), 126884#(<= main_~i~0 101), 126887#(<= main_~i~0 104), 126886#(<= main_~i~0 103), 126889#(<= main_~i~0 106), 126888#(<= main_~i~0 105), 126891#(<= main_~i~0 108), 126890#(<= main_~i~0 107), 126893#(<= main_~i~0 110), 126892#(<= main_~i~0 109), 126895#(<= main_~i~0 112), 126894#(<= main_~i~0 111), 126897#(<= main_~i~0 114), 126896#(<= main_~i~0 113), 126899#(<= main_~i~0 116), 126898#(<= main_~i~0 115), 126901#(<= main_~i~0 118), 126900#(<= main_~i~0 117), 126903#(<= main_~i~0 120), 126902#(<= main_~i~0 119), 126905#(<= main_~i~0 122), 126904#(<= main_~i~0 121), 126907#(<= main_~i~0 124), 126906#(<= main_~i~0 123), 126909#(<= main_~i~0 126), 126908#(<= main_~i~0 125), 126911#(<= main_~i~0 128), 126910#(<= main_~i~0 127), 126913#(<= main_~i~0 130), 126912#(<= main_~i~0 129), 126915#(<= main_~i~0 132), 126914#(<= main_~i~0 131), 126917#(<= main_~i~0 134), 126916#(<= main_~i~0 133), 126919#(<= main_~i~0 136), 126918#(<= main_~i~0 135), 126921#(and (<= 1 main_~i~0) (<= main_~i~0 137)), 126920#(and (<= 0 main_~i~0) (<= main_~i~0 136))] [2018-04-12 03:14:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 46854 backedges. 0 proven. 46854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:14:55,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-04-12 03:14:55,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-04-12 03:14:55,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9596, Invalid=10144, Unknown=0, NotChecked=0, Total=19740 [2018-04-12 03:14:55,057 INFO L87 Difference]: Start difference. First operand 698 states and 698 transitions. Second operand 141 states. [2018-04-12 03:15:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:15:00,346 INFO L93 Difference]: Finished difference Result 703 states and 703 transitions. [2018-04-12 03:15:00,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-04-12 03:15:00,391 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 692 [2018-04-12 03:15:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:15:00,391 INFO L225 Difference]: With dead ends: 703 [2018-04-12 03:15:00,391 INFO L226 Difference]: Without dead ends: 703 [2018-04-12 03:15:00,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9589 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=28776, Invalid=48230, Unknown=0, NotChecked=0, Total=77006 [2018-04-12 03:15:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-04-12 03:15:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2018-04-12 03:15:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-04-12 03:15:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-04-12 03:15:00,396 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 692 [2018-04-12 03:15:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:15:00,397 INFO L459 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-04-12 03:15:00,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-04-12 03:15:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-04-12 03:15:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2018-04-12 03:15:00,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:15:00,399 INFO L355 BasicCegarLoop]: trace histogram [139, 138, 138, 138, 138, 1, 1, 1, 1, 1, 1] [2018-04-12 03:15:00,399 INFO L408 AbstractCegarLoop]: === Iteration 143 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:15:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2098322362, now seen corresponding path program 138 times [2018-04-12 03:15:00,399 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:15:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:15:00,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:15:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 47541 backedges. 0 proven. 47541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:06,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:15:06,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-04-12 03:15:06,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:15:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:06,500 INFO L182 omatonBuilderFactory]: Interpolants [128603#false, 128602#true, 128605#(<= main_~i~0 1), 128604#(<= main_~i~0 0), 128607#(<= main_~i~0 3), 128606#(<= main_~i~0 2), 128609#(<= main_~i~0 5), 128608#(<= main_~i~0 4), 128611#(<= main_~i~0 7), 128610#(<= main_~i~0 6), 128613#(<= main_~i~0 9), 128612#(<= main_~i~0 8), 128615#(<= main_~i~0 11), 128614#(<= main_~i~0 10), 128617#(<= main_~i~0 13), 128616#(<= main_~i~0 12), 128619#(<= main_~i~0 15), 128618#(<= main_~i~0 14), 128621#(<= main_~i~0 17), 128620#(<= main_~i~0 16), 128623#(<= main_~i~0 19), 128622#(<= main_~i~0 18), 128625#(<= main_~i~0 21), 128624#(<= main_~i~0 20), 128627#(<= main_~i~0 23), 128626#(<= main_~i~0 22), 128629#(<= main_~i~0 25), 128628#(<= main_~i~0 24), 128631#(<= main_~i~0 27), 128630#(<= main_~i~0 26), 128633#(<= main_~i~0 29), 128632#(<= main_~i~0 28), 128635#(<= main_~i~0 31), 128634#(<= main_~i~0 30), 128637#(<= main_~i~0 33), 128636#(<= main_~i~0 32), 128639#(<= main_~i~0 35), 128638#(<= main_~i~0 34), 128641#(<= main_~i~0 37), 128640#(<= main_~i~0 36), 128643#(<= main_~i~0 39), 128642#(<= main_~i~0 38), 128645#(<= main_~i~0 41), 128644#(<= main_~i~0 40), 128647#(<= main_~i~0 43), 128646#(<= main_~i~0 42), 128649#(<= main_~i~0 45), 128648#(<= main_~i~0 44), 128651#(<= main_~i~0 47), 128650#(<= main_~i~0 46), 128653#(<= main_~i~0 49), 128652#(<= main_~i~0 48), 128655#(<= main_~i~0 51), 128654#(<= main_~i~0 50), 128657#(<= main_~i~0 53), 128656#(<= main_~i~0 52), 128659#(<= main_~i~0 55), 128658#(<= main_~i~0 54), 128661#(<= main_~i~0 57), 128660#(<= main_~i~0 56), 128663#(<= main_~i~0 59), 128662#(<= main_~i~0 58), 128665#(<= main_~i~0 61), 128664#(<= main_~i~0 60), 128667#(<= main_~i~0 63), 128666#(<= main_~i~0 62), 128669#(<= main_~i~0 65), 128668#(<= main_~i~0 64), 128671#(<= main_~i~0 67), 128670#(<= main_~i~0 66), 128673#(<= main_~i~0 69), 128672#(<= main_~i~0 68), 128675#(<= main_~i~0 71), 128674#(<= main_~i~0 70), 128677#(<= main_~i~0 73), 128676#(<= main_~i~0 72), 128679#(<= main_~i~0 75), 128678#(<= main_~i~0 74), 128681#(<= main_~i~0 77), 128680#(<= main_~i~0 76), 128683#(<= main_~i~0 79), 128682#(<= main_~i~0 78), 128685#(<= main_~i~0 81), 128684#(<= main_~i~0 80), 128687#(<= main_~i~0 83), 128686#(<= main_~i~0 82), 128689#(<= main_~i~0 85), 128688#(<= main_~i~0 84), 128691#(<= main_~i~0 87), 128690#(<= main_~i~0 86), 128693#(<= main_~i~0 89), 128692#(<= main_~i~0 88), 128695#(<= main_~i~0 91), 128694#(<= main_~i~0 90), 128697#(<= main_~i~0 93), 128696#(<= main_~i~0 92), 128699#(<= main_~i~0 95), 128698#(<= main_~i~0 94), 128701#(<= main_~i~0 97), 128700#(<= main_~i~0 96), 128703#(<= main_~i~0 99), 128702#(<= main_~i~0 98), 128705#(<= main_~i~0 101), 128704#(<= main_~i~0 100), 128707#(<= main_~i~0 103), 128706#(<= main_~i~0 102), 128709#(<= main_~i~0 105), 128708#(<= main_~i~0 104), 128711#(<= main_~i~0 107), 128710#(<= main_~i~0 106), 128713#(<= main_~i~0 109), 128712#(<= main_~i~0 108), 128715#(<= main_~i~0 111), 128714#(<= main_~i~0 110), 128717#(<= main_~i~0 113), 128716#(<= main_~i~0 112), 128719#(<= main_~i~0 115), 128718#(<= main_~i~0 114), 128721#(<= main_~i~0 117), 128720#(<= main_~i~0 116), 128723#(<= main_~i~0 119), 128722#(<= main_~i~0 118), 128725#(<= main_~i~0 121), 128724#(<= main_~i~0 120), 128727#(<= main_~i~0 123), 128726#(<= main_~i~0 122), 128729#(<= main_~i~0 125), 128728#(<= main_~i~0 124), 128731#(<= main_~i~0 127), 128730#(<= main_~i~0 126), 128733#(<= main_~i~0 129), 128732#(<= main_~i~0 128), 128735#(<= main_~i~0 131), 128734#(<= main_~i~0 130), 128737#(<= main_~i~0 133), 128736#(<= main_~i~0 132), 128739#(<= main_~i~0 135), 128738#(<= main_~i~0 134), 128741#(and (<= 0 main_~i~0) (<= main_~i~0 136)), 128740#(<= main_~i~0 136), 128743#(and (<= 2 main_~i~0) (<= main_~i~0 138)), 128742#(and (<= 1 main_~i~0) (<= main_~i~0 137))] [2018-04-12 03:15:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 47541 backedges. 0 proven. 47541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:06,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-04-12 03:15:06,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-04-12 03:15:06,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9598, Invalid=10424, Unknown=0, NotChecked=0, Total=20022 [2018-04-12 03:15:06,504 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 142 states. [2018-04-12 03:15:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:15:12,383 INFO L93 Difference]: Finished difference Result 708 states and 708 transitions. [2018-04-12 03:15:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-04-12 03:15:12,383 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 697 [2018-04-12 03:15:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:15:12,383 INFO L225 Difference]: With dead ends: 708 [2018-04-12 03:15:12,383 INFO L226 Difference]: Without dead ends: 708 [2018-04-12 03:15:12,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9864 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=28917, Invalid=49203, Unknown=0, NotChecked=0, Total=78120 [2018-04-12 03:15:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-12 03:15:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-04-12 03:15:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-04-12 03:15:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 708 transitions. [2018-04-12 03:15:12,387 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 708 transitions. Word has length 697 [2018-04-12 03:15:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:15:12,388 INFO L459 AbstractCegarLoop]: Abstraction has 708 states and 708 transitions. [2018-04-12 03:15:12,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-04-12 03:15:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 708 transitions. [2018-04-12 03:15:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-04-12 03:15:12,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:15:12,391 INFO L355 BasicCegarLoop]: trace histogram [140, 139, 139, 139, 139, 1, 1, 1, 1, 1, 1] [2018-04-12 03:15:12,391 INFO L408 AbstractCegarLoop]: === Iteration 144 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:15:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash 183238775, now seen corresponding path program 139 times [2018-04-12 03:15:12,391 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:15:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:15:12,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:15:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 48233 backedges. 0 proven. 48233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:18,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:15:18,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-04-12 03:15:18,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:15:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:18,510 INFO L182 omatonBuilderFactory]: Interpolants [130561#(<= main_~i~0 123), 130560#(<= main_~i~0 122), 130563#(<= main_~i~0 125), 130562#(<= main_~i~0 124), 130565#(<= main_~i~0 127), 130564#(<= main_~i~0 126), 130567#(<= main_~i~0 129), 130566#(<= main_~i~0 128), 130569#(<= main_~i~0 131), 130568#(<= main_~i~0 130), 130571#(<= main_~i~0 133), 130570#(<= main_~i~0 132), 130573#(<= main_~i~0 135), 130572#(<= main_~i~0 134), 130575#(<= main_~i~0 137), 130574#(<= main_~i~0 136), 130577#(and (<= 0 main_~i~0) (<= main_~i~0 138)), 130576#(<= main_~i~0 138), 130578#(and (<= 1 main_~i~0) (<= main_~i~0 139)), 130437#false, 130436#true, 130439#(<= main_~i~0 1), 130438#(<= main_~i~0 0), 130441#(<= main_~i~0 3), 130440#(<= main_~i~0 2), 130443#(<= main_~i~0 5), 130442#(<= main_~i~0 4), 130445#(<= main_~i~0 7), 130444#(<= main_~i~0 6), 130447#(<= main_~i~0 9), 130446#(<= main_~i~0 8), 130449#(<= main_~i~0 11), 130448#(<= main_~i~0 10), 130451#(<= main_~i~0 13), 130450#(<= main_~i~0 12), 130453#(<= main_~i~0 15), 130452#(<= main_~i~0 14), 130455#(<= main_~i~0 17), 130454#(<= main_~i~0 16), 130457#(<= main_~i~0 19), 130456#(<= main_~i~0 18), 130459#(<= main_~i~0 21), 130458#(<= main_~i~0 20), 130461#(<= main_~i~0 23), 130460#(<= main_~i~0 22), 130463#(<= main_~i~0 25), 130462#(<= main_~i~0 24), 130465#(<= main_~i~0 27), 130464#(<= main_~i~0 26), 130467#(<= main_~i~0 29), 130466#(<= main_~i~0 28), 130469#(<= main_~i~0 31), 130468#(<= main_~i~0 30), 130471#(<= main_~i~0 33), 130470#(<= main_~i~0 32), 130473#(<= main_~i~0 35), 130472#(<= main_~i~0 34), 130475#(<= main_~i~0 37), 130474#(<= main_~i~0 36), 130477#(<= main_~i~0 39), 130476#(<= main_~i~0 38), 130479#(<= main_~i~0 41), 130478#(<= main_~i~0 40), 130481#(<= main_~i~0 43), 130480#(<= main_~i~0 42), 130483#(<= main_~i~0 45), 130482#(<= main_~i~0 44), 130485#(<= main_~i~0 47), 130484#(<= main_~i~0 46), 130487#(<= main_~i~0 49), 130486#(<= main_~i~0 48), 130489#(<= main_~i~0 51), 130488#(<= main_~i~0 50), 130491#(<= main_~i~0 53), 130490#(<= main_~i~0 52), 130493#(<= main_~i~0 55), 130492#(<= main_~i~0 54), 130495#(<= main_~i~0 57), 130494#(<= main_~i~0 56), 130497#(<= main_~i~0 59), 130496#(<= main_~i~0 58), 130499#(<= main_~i~0 61), 130498#(<= main_~i~0 60), 130501#(<= main_~i~0 63), 130500#(<= main_~i~0 62), 130503#(<= main_~i~0 65), 130502#(<= main_~i~0 64), 130505#(<= main_~i~0 67), 130504#(<= main_~i~0 66), 130507#(<= main_~i~0 69), 130506#(<= main_~i~0 68), 130509#(<= main_~i~0 71), 130508#(<= main_~i~0 70), 130511#(<= main_~i~0 73), 130510#(<= main_~i~0 72), 130513#(<= main_~i~0 75), 130512#(<= main_~i~0 74), 130515#(<= main_~i~0 77), 130514#(<= main_~i~0 76), 130517#(<= main_~i~0 79), 130516#(<= main_~i~0 78), 130519#(<= main_~i~0 81), 130518#(<= main_~i~0 80), 130521#(<= main_~i~0 83), 130520#(<= main_~i~0 82), 130523#(<= main_~i~0 85), 130522#(<= main_~i~0 84), 130525#(<= main_~i~0 87), 130524#(<= main_~i~0 86), 130527#(<= main_~i~0 89), 130526#(<= main_~i~0 88), 130529#(<= main_~i~0 91), 130528#(<= main_~i~0 90), 130531#(<= main_~i~0 93), 130530#(<= main_~i~0 92), 130533#(<= main_~i~0 95), 130532#(<= main_~i~0 94), 130535#(<= main_~i~0 97), 130534#(<= main_~i~0 96), 130537#(<= main_~i~0 99), 130536#(<= main_~i~0 98), 130539#(<= main_~i~0 101), 130538#(<= main_~i~0 100), 130541#(<= main_~i~0 103), 130540#(<= main_~i~0 102), 130543#(<= main_~i~0 105), 130542#(<= main_~i~0 104), 130545#(<= main_~i~0 107), 130544#(<= main_~i~0 106), 130547#(<= main_~i~0 109), 130546#(<= main_~i~0 108), 130549#(<= main_~i~0 111), 130548#(<= main_~i~0 110), 130551#(<= main_~i~0 113), 130550#(<= main_~i~0 112), 130553#(<= main_~i~0 115), 130552#(<= main_~i~0 114), 130555#(<= main_~i~0 117), 130554#(<= main_~i~0 116), 130557#(<= main_~i~0 119), 130556#(<= main_~i~0 118), 130559#(<= main_~i~0 121), 130558#(<= main_~i~0 120)] [2018-04-12 03:15:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 48233 backedges. 0 proven. 48233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:18,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-04-12 03:15:18,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-04-12 03:15:18,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9875, Invalid=10431, Unknown=0, NotChecked=0, Total=20306 [2018-04-12 03:15:18,513 INFO L87 Difference]: Start difference. First operand 708 states and 708 transitions. Second operand 143 states. [2018-04-12 03:15:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:15:24,055 INFO L93 Difference]: Finished difference Result 713 states and 713 transitions. [2018-04-12 03:15:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-04-12 03:15:24,055 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 702 [2018-04-12 03:15:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:15:24,055 INFO L225 Difference]: With dead ends: 713 [2018-04-12 03:15:24,055 INFO L226 Difference]: Without dead ends: 713 [2018-04-12 03:15:24,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9868 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=29613, Invalid=49629, Unknown=0, NotChecked=0, Total=79242 [2018-04-12 03:15:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-04-12 03:15:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2018-04-12 03:15:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-04-12 03:15:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 713 transitions. [2018-04-12 03:15:24,060 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 713 transitions. Word has length 702 [2018-04-12 03:15:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:15:24,061 INFO L459 AbstractCegarLoop]: Abstraction has 713 states and 713 transitions. [2018-04-12 03:15:24,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-04-12 03:15:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 713 transitions. [2018-04-12 03:15:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-04-12 03:15:24,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:15:24,063 INFO L355 BasicCegarLoop]: trace histogram [141, 140, 140, 140, 140, 1, 1, 1, 1, 1, 1] [2018-04-12 03:15:24,063 INFO L408 AbstractCegarLoop]: === Iteration 145 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:15:24,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1227547930, now seen corresponding path program 140 times [2018-04-12 03:15:24,064 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:15:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:15:24,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:15:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 48930 backedges. 0 proven. 48930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:30,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:15:30,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-04-12 03:15:30,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:15:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:30,248 INFO L182 omatonBuilderFactory]: Interpolants [132354#(<= main_~i~0 69), 132355#(<= main_~i~0 70), 132352#(<= main_~i~0 67), 132353#(<= main_~i~0 68), 132358#(<= main_~i~0 73), 132359#(<= main_~i~0 74), 132356#(<= main_~i~0 71), 132357#(<= main_~i~0 72), 132362#(<= main_~i~0 77), 132363#(<= main_~i~0 78), 132360#(<= main_~i~0 75), 132361#(<= main_~i~0 76), 132366#(<= main_~i~0 81), 132367#(<= main_~i~0 82), 132364#(<= main_~i~0 79), 132365#(<= main_~i~0 80), 132370#(<= main_~i~0 85), 132371#(<= main_~i~0 86), 132368#(<= main_~i~0 83), 132369#(<= main_~i~0 84), 132374#(<= main_~i~0 89), 132375#(<= main_~i~0 90), 132372#(<= main_~i~0 87), 132373#(<= main_~i~0 88), 132378#(<= main_~i~0 93), 132379#(<= main_~i~0 94), 132376#(<= main_~i~0 91), 132377#(<= main_~i~0 92), 132382#(<= main_~i~0 97), 132383#(<= main_~i~0 98), 132380#(<= main_~i~0 95), 132381#(<= main_~i~0 96), 132386#(<= main_~i~0 101), 132387#(<= main_~i~0 102), 132384#(<= main_~i~0 99), 132385#(<= main_~i~0 100), 132390#(<= main_~i~0 105), 132391#(<= main_~i~0 106), 132388#(<= main_~i~0 103), 132389#(<= main_~i~0 104), 132394#(<= main_~i~0 109), 132395#(<= main_~i~0 110), 132392#(<= main_~i~0 107), 132393#(<= main_~i~0 108), 132398#(<= main_~i~0 113), 132399#(<= main_~i~0 114), 132396#(<= main_~i~0 111), 132397#(<= main_~i~0 112), 132402#(<= main_~i~0 117), 132403#(<= main_~i~0 118), 132400#(<= main_~i~0 115), 132401#(<= main_~i~0 116), 132406#(<= main_~i~0 121), 132407#(<= main_~i~0 122), 132404#(<= main_~i~0 119), 132405#(<= main_~i~0 120), 132410#(<= main_~i~0 125), 132411#(<= main_~i~0 126), 132408#(<= main_~i~0 123), 132409#(<= main_~i~0 124), 132414#(<= main_~i~0 129), 132415#(<= main_~i~0 130), 132412#(<= main_~i~0 127), 132413#(<= main_~i~0 128), 132418#(<= main_~i~0 133), 132419#(<= main_~i~0 134), 132416#(<= main_~i~0 131), 132417#(<= main_~i~0 132), 132422#(and (<= 0 main_~i~0) (<= main_~i~0 136)), 132423#(and (<= 1 main_~i~0) (<= main_~i~0 137)), 132420#(<= main_~i~0 135), 132421#(<= main_~i~0 136), 132426#(and (<= 4 main_~i~0) (<= main_~i~0 140)), 132424#(and (<= 2 main_~i~0) (<= main_~i~0 138)), 132425#(and (<= main_~i~0 139) (<= 3 main_~i~0)), 132283#true, 132286#(<= main_~i~0 1), 132287#(<= main_~i~0 2), 132284#false, 132285#(<= main_~i~0 0), 132290#(<= main_~i~0 5), 132291#(<= main_~i~0 6), 132288#(<= main_~i~0 3), 132289#(<= main_~i~0 4), 132294#(<= main_~i~0 9), 132295#(<= main_~i~0 10), 132292#(<= main_~i~0 7), 132293#(<= main_~i~0 8), 132298#(<= main_~i~0 13), 132299#(<= main_~i~0 14), 132296#(<= main_~i~0 11), 132297#(<= main_~i~0 12), 132302#(<= main_~i~0 17), 132303#(<= main_~i~0 18), 132300#(<= main_~i~0 15), 132301#(<= main_~i~0 16), 132306#(<= main_~i~0 21), 132307#(<= main_~i~0 22), 132304#(<= main_~i~0 19), 132305#(<= main_~i~0 20), 132310#(<= main_~i~0 25), 132311#(<= main_~i~0 26), 132308#(<= main_~i~0 23), 132309#(<= main_~i~0 24), 132314#(<= main_~i~0 29), 132315#(<= main_~i~0 30), 132312#(<= main_~i~0 27), 132313#(<= main_~i~0 28), 132318#(<= main_~i~0 33), 132319#(<= main_~i~0 34), 132316#(<= main_~i~0 31), 132317#(<= main_~i~0 32), 132322#(<= main_~i~0 37), 132323#(<= main_~i~0 38), 132320#(<= main_~i~0 35), 132321#(<= main_~i~0 36), 132326#(<= main_~i~0 41), 132327#(<= main_~i~0 42), 132324#(<= main_~i~0 39), 132325#(<= main_~i~0 40), 132330#(<= main_~i~0 45), 132331#(<= main_~i~0 46), 132328#(<= main_~i~0 43), 132329#(<= main_~i~0 44), 132334#(<= main_~i~0 49), 132335#(<= main_~i~0 50), 132332#(<= main_~i~0 47), 132333#(<= main_~i~0 48), 132338#(<= main_~i~0 53), 132339#(<= main_~i~0 54), 132336#(<= main_~i~0 51), 132337#(<= main_~i~0 52), 132342#(<= main_~i~0 57), 132343#(<= main_~i~0 58), 132340#(<= main_~i~0 55), 132341#(<= main_~i~0 56), 132346#(<= main_~i~0 61), 132347#(<= main_~i~0 62), 132344#(<= main_~i~0 59), 132345#(<= main_~i~0 60), 132350#(<= main_~i~0 65), 132351#(<= main_~i~0 66), 132348#(<= main_~i~0 63), 132349#(<= main_~i~0 64)] [2018-04-12 03:15:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 48930 backedges. 0 proven. 48930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:30,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-04-12 03:15:30,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-04-12 03:15:30,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9602, Invalid=10990, Unknown=0, NotChecked=0, Total=20592 [2018-04-12 03:15:30,251 INFO L87 Difference]: Start difference. First operand 713 states and 713 transitions. Second operand 144 states. [2018-04-12 03:15:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:15:37,042 INFO L93 Difference]: Finished difference Result 718 states and 718 transitions. [2018-04-12 03:15:37,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-04-12 03:15:37,042 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 707 [2018-04-12 03:15:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:15:37,043 INFO L225 Difference]: With dead ends: 718 [2018-04-12 03:15:37,043 INFO L226 Difference]: Without dead ends: 718 [2018-04-12 03:15:37,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10417 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=29199, Invalid=51173, Unknown=0, NotChecked=0, Total=80372 [2018-04-12 03:15:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-04-12 03:15:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2018-04-12 03:15:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-04-12 03:15:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 718 transitions. [2018-04-12 03:15:37,048 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 718 transitions. Word has length 707 [2018-04-12 03:15:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:15:37,048 INFO L459 AbstractCegarLoop]: Abstraction has 718 states and 718 transitions. [2018-04-12 03:15:37,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-04-12 03:15:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 718 transitions. [2018-04-12 03:15:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2018-04-12 03:15:37,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:15:37,050 INFO L355 BasicCegarLoop]: trace histogram [142, 141, 141, 141, 141, 1, 1, 1, 1, 1, 1] [2018-04-12 03:15:37,050 INFO L408 AbstractCegarLoop]: === Iteration 146 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:15:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash 804662743, now seen corresponding path program 141 times [2018-04-12 03:15:37,051 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:15:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:15:37,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:15:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49632 backedges. 0 proven. 49632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:43,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:15:43,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-04-12 03:15:43,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:15:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:43,368 INFO L182 omatonBuilderFactory]: Interpolants [134146#(<= main_~i~0 1), 134147#(<= main_~i~0 2), 134144#false, 134145#(<= main_~i~0 0), 134150#(<= main_~i~0 5), 134151#(<= main_~i~0 6), 134148#(<= main_~i~0 3), 134149#(<= main_~i~0 4), 134154#(<= main_~i~0 9), 134155#(<= main_~i~0 10), 134152#(<= main_~i~0 7), 134153#(<= main_~i~0 8), 134158#(<= main_~i~0 13), 134159#(<= main_~i~0 14), 134156#(<= main_~i~0 11), 134157#(<= main_~i~0 12), 134162#(<= main_~i~0 17), 134163#(<= main_~i~0 18), 134160#(<= main_~i~0 15), 134161#(<= main_~i~0 16), 134166#(<= main_~i~0 21), 134167#(<= main_~i~0 22), 134164#(<= main_~i~0 19), 134165#(<= main_~i~0 20), 134170#(<= main_~i~0 25), 134171#(<= main_~i~0 26), 134168#(<= main_~i~0 23), 134169#(<= main_~i~0 24), 134174#(<= main_~i~0 29), 134175#(<= main_~i~0 30), 134172#(<= main_~i~0 27), 134173#(<= main_~i~0 28), 134178#(<= main_~i~0 33), 134179#(<= main_~i~0 34), 134176#(<= main_~i~0 31), 134177#(<= main_~i~0 32), 134182#(<= main_~i~0 37), 134183#(<= main_~i~0 38), 134180#(<= main_~i~0 35), 134181#(<= main_~i~0 36), 134186#(<= main_~i~0 41), 134187#(<= main_~i~0 42), 134184#(<= main_~i~0 39), 134185#(<= main_~i~0 40), 134190#(<= main_~i~0 45), 134191#(<= main_~i~0 46), 134188#(<= main_~i~0 43), 134189#(<= main_~i~0 44), 134194#(<= main_~i~0 49), 134195#(<= main_~i~0 50), 134192#(<= main_~i~0 47), 134193#(<= main_~i~0 48), 134198#(<= main_~i~0 53), 134199#(<= main_~i~0 54), 134196#(<= main_~i~0 51), 134197#(<= main_~i~0 52), 134202#(<= main_~i~0 57), 134203#(<= main_~i~0 58), 134200#(<= main_~i~0 55), 134201#(<= main_~i~0 56), 134206#(<= main_~i~0 61), 134207#(<= main_~i~0 62), 134204#(<= main_~i~0 59), 134205#(<= main_~i~0 60), 134210#(<= main_~i~0 65), 134211#(<= main_~i~0 66), 134208#(<= main_~i~0 63), 134209#(<= main_~i~0 64), 134214#(<= main_~i~0 69), 134215#(<= main_~i~0 70), 134212#(<= main_~i~0 67), 134213#(<= main_~i~0 68), 134218#(<= main_~i~0 73), 134219#(<= main_~i~0 74), 134216#(<= main_~i~0 71), 134217#(<= main_~i~0 72), 134222#(<= main_~i~0 77), 134223#(<= main_~i~0 78), 134220#(<= main_~i~0 75), 134221#(<= main_~i~0 76), 134226#(<= main_~i~0 81), 134227#(<= main_~i~0 82), 134224#(<= main_~i~0 79), 134225#(<= main_~i~0 80), 134230#(<= main_~i~0 85), 134231#(<= main_~i~0 86), 134228#(<= main_~i~0 83), 134229#(<= main_~i~0 84), 134234#(<= main_~i~0 89), 134235#(<= main_~i~0 90), 134232#(<= main_~i~0 87), 134233#(<= main_~i~0 88), 134238#(<= main_~i~0 93), 134239#(<= main_~i~0 94), 134236#(<= main_~i~0 91), 134237#(<= main_~i~0 92), 134242#(<= main_~i~0 97), 134243#(<= main_~i~0 98), 134240#(<= main_~i~0 95), 134241#(<= main_~i~0 96), 134246#(<= main_~i~0 101), 134247#(<= main_~i~0 102), 134244#(<= main_~i~0 99), 134245#(<= main_~i~0 100), 134250#(<= main_~i~0 105), 134251#(<= main_~i~0 106), 134248#(<= main_~i~0 103), 134249#(<= main_~i~0 104), 134254#(<= main_~i~0 109), 134255#(<= main_~i~0 110), 134252#(<= main_~i~0 107), 134253#(<= main_~i~0 108), 134258#(<= main_~i~0 113), 134259#(<= main_~i~0 114), 134256#(<= main_~i~0 111), 134257#(<= main_~i~0 112), 134262#(<= main_~i~0 117), 134263#(<= main_~i~0 118), 134260#(<= main_~i~0 115), 134261#(<= main_~i~0 116), 134266#(<= main_~i~0 121), 134267#(<= main_~i~0 122), 134264#(<= main_~i~0 119), 134265#(<= main_~i~0 120), 134270#(<= main_~i~0 125), 134271#(<= main_~i~0 126), 134268#(<= main_~i~0 123), 134269#(<= main_~i~0 124), 134274#(<= main_~i~0 129), 134275#(<= main_~i~0 130), 134272#(<= main_~i~0 127), 134273#(<= main_~i~0 128), 134278#(<= main_~i~0 133), 134279#(<= main_~i~0 134), 134276#(<= main_~i~0 131), 134277#(<= main_~i~0 132), 134282#(<= main_~i~0 137), 134283#(<= main_~i~0 138), 134280#(<= main_~i~0 135), 134281#(<= main_~i~0 136), 134286#(and (<= 0 main_~i~0) (<= main_~i~0 140)), 134287#(and (<= 1 main_~i~0) (<= main_~i~0 141)), 134284#(<= main_~i~0 139), 134285#(<= main_~i~0 140), 134143#true] [2018-04-12 03:15:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 49632 backedges. 0 proven. 49632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:43,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-04-12 03:15:43,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-04-12 03:15:43,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10158, Invalid=10722, Unknown=0, NotChecked=0, Total=20880 [2018-04-12 03:15:43,370 INFO L87 Difference]: Start difference. First operand 718 states and 718 transitions. Second operand 145 states. [2018-04-12 03:15:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:15:49,098 INFO L93 Difference]: Finished difference Result 723 states and 723 transitions. [2018-04-12 03:15:49,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-04-12 03:15:49,098 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 712 [2018-04-12 03:15:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:15:49,099 INFO L225 Difference]: With dead ends: 723 [2018-04-12 03:15:49,099 INFO L226 Difference]: Without dead ends: 723 [2018-04-12 03:15:49,101 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10151 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=30462, Invalid=51048, Unknown=0, NotChecked=0, Total=81510 [2018-04-12 03:15:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-04-12 03:15:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2018-04-12 03:15:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-04-12 03:15:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 723 transitions. [2018-04-12 03:15:49,105 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 723 transitions. Word has length 712 [2018-04-12 03:15:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:15:49,105 INFO L459 AbstractCegarLoop]: Abstraction has 723 states and 723 transitions. [2018-04-12 03:15:49,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-04-12 03:15:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 723 transitions. [2018-04-12 03:15:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2018-04-12 03:15:49,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:15:49,109 INFO L355 BasicCegarLoop]: trace histogram [143, 142, 142, 142, 142, 1, 1, 1, 1, 1, 1] [2018-04-12 03:15:49,109 INFO L408 AbstractCegarLoop]: === Iteration 147 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:15:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1779414650, now seen corresponding path program 142 times [2018-04-12 03:15:49,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:15:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:15:49,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:15:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 50339 backedges. 0 proven. 50339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:55,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:15:55,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-04-12 03:15:55,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:15:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:55,521 INFO L182 omatonBuilderFactory]: Interpolants [136018#(<= main_~i~0 0), 136019#(<= main_~i~0 1), 136016#true, 136017#false, 136022#(<= main_~i~0 4), 136023#(<= main_~i~0 5), 136020#(<= main_~i~0 2), 136021#(<= main_~i~0 3), 136026#(<= main_~i~0 8), 136027#(<= main_~i~0 9), 136024#(<= main_~i~0 6), 136025#(<= main_~i~0 7), 136030#(<= main_~i~0 12), 136031#(<= main_~i~0 13), 136028#(<= main_~i~0 10), 136029#(<= main_~i~0 11), 136034#(<= main_~i~0 16), 136035#(<= main_~i~0 17), 136032#(<= main_~i~0 14), 136033#(<= main_~i~0 15), 136038#(<= main_~i~0 20), 136039#(<= main_~i~0 21), 136036#(<= main_~i~0 18), 136037#(<= main_~i~0 19), 136042#(<= main_~i~0 24), 136043#(<= main_~i~0 25), 136040#(<= main_~i~0 22), 136041#(<= main_~i~0 23), 136046#(<= main_~i~0 28), 136047#(<= main_~i~0 29), 136044#(<= main_~i~0 26), 136045#(<= main_~i~0 27), 136050#(<= main_~i~0 32), 136051#(<= main_~i~0 33), 136048#(<= main_~i~0 30), 136049#(<= main_~i~0 31), 136054#(<= main_~i~0 36), 136055#(<= main_~i~0 37), 136052#(<= main_~i~0 34), 136053#(<= main_~i~0 35), 136058#(<= main_~i~0 40), 136059#(<= main_~i~0 41), 136056#(<= main_~i~0 38), 136057#(<= main_~i~0 39), 136062#(<= main_~i~0 44), 136063#(<= main_~i~0 45), 136060#(<= main_~i~0 42), 136061#(<= main_~i~0 43), 136066#(<= main_~i~0 48), 136067#(<= main_~i~0 49), 136064#(<= main_~i~0 46), 136065#(<= main_~i~0 47), 136070#(<= main_~i~0 52), 136071#(<= main_~i~0 53), 136068#(<= main_~i~0 50), 136069#(<= main_~i~0 51), 136074#(<= main_~i~0 56), 136075#(<= main_~i~0 57), 136072#(<= main_~i~0 54), 136073#(<= main_~i~0 55), 136078#(<= main_~i~0 60), 136079#(<= main_~i~0 61), 136076#(<= main_~i~0 58), 136077#(<= main_~i~0 59), 136082#(<= main_~i~0 64), 136083#(<= main_~i~0 65), 136080#(<= main_~i~0 62), 136081#(<= main_~i~0 63), 136086#(<= main_~i~0 68), 136087#(<= main_~i~0 69), 136084#(<= main_~i~0 66), 136085#(<= main_~i~0 67), 136090#(<= main_~i~0 72), 136091#(<= main_~i~0 73), 136088#(<= main_~i~0 70), 136089#(<= main_~i~0 71), 136094#(<= main_~i~0 76), 136095#(<= main_~i~0 77), 136092#(<= main_~i~0 74), 136093#(<= main_~i~0 75), 136098#(<= main_~i~0 80), 136099#(<= main_~i~0 81), 136096#(<= main_~i~0 78), 136097#(<= main_~i~0 79), 136102#(<= main_~i~0 84), 136103#(<= main_~i~0 85), 136100#(<= main_~i~0 82), 136101#(<= main_~i~0 83), 136106#(<= main_~i~0 88), 136107#(<= main_~i~0 89), 136104#(<= main_~i~0 86), 136105#(<= main_~i~0 87), 136110#(<= main_~i~0 92), 136111#(<= main_~i~0 93), 136108#(<= main_~i~0 90), 136109#(<= main_~i~0 91), 136114#(<= main_~i~0 96), 136115#(<= main_~i~0 97), 136112#(<= main_~i~0 94), 136113#(<= main_~i~0 95), 136118#(<= main_~i~0 100), 136119#(<= main_~i~0 101), 136116#(<= main_~i~0 98), 136117#(<= main_~i~0 99), 136122#(<= main_~i~0 104), 136123#(<= main_~i~0 105), 136120#(<= main_~i~0 102), 136121#(<= main_~i~0 103), 136126#(<= main_~i~0 108), 136127#(<= main_~i~0 109), 136124#(<= main_~i~0 106), 136125#(<= main_~i~0 107), 136130#(<= main_~i~0 112), 136131#(<= main_~i~0 113), 136128#(<= main_~i~0 110), 136129#(<= main_~i~0 111), 136134#(<= main_~i~0 116), 136135#(<= main_~i~0 117), 136132#(<= main_~i~0 114), 136133#(<= main_~i~0 115), 136138#(<= main_~i~0 120), 136139#(<= main_~i~0 121), 136136#(<= main_~i~0 118), 136137#(<= main_~i~0 119), 136142#(<= main_~i~0 124), 136143#(<= main_~i~0 125), 136140#(<= main_~i~0 122), 136141#(<= main_~i~0 123), 136146#(<= main_~i~0 128), 136147#(<= main_~i~0 129), 136144#(<= main_~i~0 126), 136145#(<= main_~i~0 127), 136150#(<= main_~i~0 132), 136151#(<= main_~i~0 133), 136148#(<= main_~i~0 130), 136149#(<= main_~i~0 131), 136154#(<= main_~i~0 136), 136155#(<= main_~i~0 137), 136152#(<= main_~i~0 134), 136153#(<= main_~i~0 135), 136158#(<= main_~i~0 140), 136159#(and (<= 0 main_~i~0) (<= main_~i~0 140)), 136156#(<= main_~i~0 138), 136157#(<= main_~i~0 139), 136160#(and (<= 1 main_~i~0) (<= main_~i~0 141)), 136161#(and (<= 2 main_~i~0) (<= main_~i~0 142))] [2018-04-12 03:15:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 50339 backedges. 0 proven. 50339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:15:55,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-04-12 03:15:55,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-04-12 03:15:55,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10160, Invalid=11010, Unknown=0, NotChecked=0, Total=21170 [2018-04-12 03:15:55,524 INFO L87 Difference]: Start difference. First operand 723 states and 723 transitions. Second operand 146 states. [2018-04-12 03:16:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:16:01,701 INFO L93 Difference]: Finished difference Result 728 states and 728 transitions. [2018-04-12 03:16:01,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-04-12 03:16:01,702 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 717 [2018-04-12 03:16:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:16:01,702 INFO L225 Difference]: With dead ends: 728 [2018-04-12 03:16:01,702 INFO L226 Difference]: Without dead ends: 728 [2018-04-12 03:16:01,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=30607, Invalid=52049, Unknown=0, NotChecked=0, Total=82656 [2018-04-12 03:16:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-04-12 03:16:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-04-12 03:16:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-04-12 03:16:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 728 transitions. [2018-04-12 03:16:01,707 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 728 transitions. Word has length 717 [2018-04-12 03:16:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:16:01,707 INFO L459 AbstractCegarLoop]: Abstraction has 728 states and 728 transitions. [2018-04-12 03:16:01,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-04-12 03:16:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 728 transitions. [2018-04-12 03:16:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-04-12 03:16:01,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:16:01,709 INFO L355 BasicCegarLoop]: trace histogram [144, 143, 143, 143, 143, 1, 1, 1, 1, 1, 1] [2018-04-12 03:16:01,709 INFO L408 AbstractCegarLoop]: === Iteration 148 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:16:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash 430908215, now seen corresponding path program 143 times [2018-04-12 03:16:01,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:16:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:16:01,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:16:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 51051 backedges. 0 proven. 51051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:08,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:16:08,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-04-12 03:16:08,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:16:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:08,286 INFO L182 omatonBuilderFactory]: Interpolants [137986#(<= main_~i~0 82), 137987#(<= main_~i~0 83), 137984#(<= main_~i~0 80), 137985#(<= main_~i~0 81), 137990#(<= main_~i~0 86), 137991#(<= main_~i~0 87), 137988#(<= main_~i~0 84), 137989#(<= main_~i~0 85), 137994#(<= main_~i~0 90), 137995#(<= main_~i~0 91), 137992#(<= main_~i~0 88), 137993#(<= main_~i~0 89), 137998#(<= main_~i~0 94), 137999#(<= main_~i~0 95), 137996#(<= main_~i~0 92), 137997#(<= main_~i~0 93), 138002#(<= main_~i~0 98), 138003#(<= main_~i~0 99), 138000#(<= main_~i~0 96), 138001#(<= main_~i~0 97), 138006#(<= main_~i~0 102), 138007#(<= main_~i~0 103), 138004#(<= main_~i~0 100), 138005#(<= main_~i~0 101), 138010#(<= main_~i~0 106), 138011#(<= main_~i~0 107), 138008#(<= main_~i~0 104), 138009#(<= main_~i~0 105), 138014#(<= main_~i~0 110), 138015#(<= main_~i~0 111), 138012#(<= main_~i~0 108), 138013#(<= main_~i~0 109), 138018#(<= main_~i~0 114), 138019#(<= main_~i~0 115), 138016#(<= main_~i~0 112), 138017#(<= main_~i~0 113), 138022#(<= main_~i~0 118), 138023#(<= main_~i~0 119), 138020#(<= main_~i~0 116), 138021#(<= main_~i~0 117), 138026#(<= main_~i~0 122), 138027#(<= main_~i~0 123), 138024#(<= main_~i~0 120), 138025#(<= main_~i~0 121), 138030#(<= main_~i~0 126), 138031#(<= main_~i~0 127), 138028#(<= main_~i~0 124), 138029#(<= main_~i~0 125), 138034#(<= main_~i~0 130), 138035#(<= main_~i~0 131), 138032#(<= main_~i~0 128), 138033#(<= main_~i~0 129), 138038#(<= main_~i~0 134), 138039#(<= main_~i~0 135), 138036#(<= main_~i~0 132), 138037#(<= main_~i~0 133), 138042#(<= main_~i~0 138), 138043#(<= main_~i~0 139), 138040#(<= main_~i~0 136), 138041#(<= main_~i~0 137), 138046#(<= main_~i~0 142), 138047#(and (<= 0 main_~i~0) (<= main_~i~0 142)), 138044#(<= main_~i~0 140), 138045#(<= main_~i~0 141), 138048#(and (<= 1 main_~i~0) (<= main_~i~0 143)), 137902#true, 137903#false, 137906#(<= main_~i~0 2), 137907#(<= main_~i~0 3), 137904#(<= main_~i~0 0), 137905#(<= main_~i~0 1), 137910#(<= main_~i~0 6), 137911#(<= main_~i~0 7), 137908#(<= main_~i~0 4), 137909#(<= main_~i~0 5), 137914#(<= main_~i~0 10), 137915#(<= main_~i~0 11), 137912#(<= main_~i~0 8), 137913#(<= main_~i~0 9), 137918#(<= main_~i~0 14), 137919#(<= main_~i~0 15), 137916#(<= main_~i~0 12), 137917#(<= main_~i~0 13), 137922#(<= main_~i~0 18), 137923#(<= main_~i~0 19), 137920#(<= main_~i~0 16), 137921#(<= main_~i~0 17), 137926#(<= main_~i~0 22), 137927#(<= main_~i~0 23), 137924#(<= main_~i~0 20), 137925#(<= main_~i~0 21), 137930#(<= main_~i~0 26), 137931#(<= main_~i~0 27), 137928#(<= main_~i~0 24), 137929#(<= main_~i~0 25), 137934#(<= main_~i~0 30), 137935#(<= main_~i~0 31), 137932#(<= main_~i~0 28), 137933#(<= main_~i~0 29), 137938#(<= main_~i~0 34), 137939#(<= main_~i~0 35), 137936#(<= main_~i~0 32), 137937#(<= main_~i~0 33), 137942#(<= main_~i~0 38), 137943#(<= main_~i~0 39), 137940#(<= main_~i~0 36), 137941#(<= main_~i~0 37), 137946#(<= main_~i~0 42), 137947#(<= main_~i~0 43), 137944#(<= main_~i~0 40), 137945#(<= main_~i~0 41), 137950#(<= main_~i~0 46), 137951#(<= main_~i~0 47), 137948#(<= main_~i~0 44), 137949#(<= main_~i~0 45), 137954#(<= main_~i~0 50), 137955#(<= main_~i~0 51), 137952#(<= main_~i~0 48), 137953#(<= main_~i~0 49), 137958#(<= main_~i~0 54), 137959#(<= main_~i~0 55), 137956#(<= main_~i~0 52), 137957#(<= main_~i~0 53), 137962#(<= main_~i~0 58), 137963#(<= main_~i~0 59), 137960#(<= main_~i~0 56), 137961#(<= main_~i~0 57), 137966#(<= main_~i~0 62), 137967#(<= main_~i~0 63), 137964#(<= main_~i~0 60), 137965#(<= main_~i~0 61), 137970#(<= main_~i~0 66), 137971#(<= main_~i~0 67), 137968#(<= main_~i~0 64), 137969#(<= main_~i~0 65), 137974#(<= main_~i~0 70), 137975#(<= main_~i~0 71), 137972#(<= main_~i~0 68), 137973#(<= main_~i~0 69), 137978#(<= main_~i~0 74), 137979#(<= main_~i~0 75), 137976#(<= main_~i~0 72), 137977#(<= main_~i~0 73), 137982#(<= main_~i~0 78), 137983#(<= main_~i~0 79), 137980#(<= main_~i~0 76), 137981#(<= main_~i~0 77)] [2018-04-12 03:16:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 51051 backedges. 0 proven. 51051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:08,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-04-12 03:16:08,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-04-12 03:16:08,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10445, Invalid=11017, Unknown=0, NotChecked=0, Total=21462 [2018-04-12 03:16:08,289 INFO L87 Difference]: Start difference. First operand 728 states and 728 transitions. Second operand 147 states. [2018-04-12 03:16:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:16:14,118 INFO L93 Difference]: Finished difference Result 733 states and 733 transitions. [2018-04-12 03:16:14,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-04-12 03:16:14,118 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 722 [2018-04-12 03:16:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:16:14,119 INFO L225 Difference]: With dead ends: 733 [2018-04-12 03:16:14,119 INFO L226 Difference]: Without dead ends: 733 [2018-04-12 03:16:14,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=31323, Invalid=52487, Unknown=0, NotChecked=0, Total=83810 [2018-04-12 03:16:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-04-12 03:16:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2018-04-12 03:16:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-04-12 03:16:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 733 transitions. [2018-04-12 03:16:14,123 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 733 transitions. Word has length 722 [2018-04-12 03:16:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:16:14,124 INFO L459 AbstractCegarLoop]: Abstraction has 733 states and 733 transitions. [2018-04-12 03:16:14,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-04-12 03:16:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 733 transitions. [2018-04-12 03:16:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-04-12 03:16:14,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:16:14,126 INFO L355 BasicCegarLoop]: trace histogram [145, 144, 144, 144, 144, 1, 1, 1, 1, 1, 1] [2018-04-12 03:16:14,126 INFO L408 AbstractCegarLoop]: === Iteration 149 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:16:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1235636186, now seen corresponding path program 144 times [2018-04-12 03:16:14,126 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:16:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:16:14,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:16:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 51768 backedges. 0 proven. 51768 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:20,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:16:20,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-04-12 03:16:20,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:16:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:20,625 INFO L182 omatonBuilderFactory]: Interpolants [139802#false, 139803#(<= main_~i~0 0), 139801#true, 139806#(<= main_~i~0 3), 139807#(<= main_~i~0 4), 139804#(<= main_~i~0 1), 139805#(<= main_~i~0 2), 139810#(<= main_~i~0 7), 139811#(<= main_~i~0 8), 139808#(<= main_~i~0 5), 139809#(<= main_~i~0 6), 139814#(<= main_~i~0 11), 139815#(<= main_~i~0 12), 139812#(<= main_~i~0 9), 139813#(<= main_~i~0 10), 139818#(<= main_~i~0 15), 139819#(<= main_~i~0 16), 139816#(<= main_~i~0 13), 139817#(<= main_~i~0 14), 139822#(<= main_~i~0 19), 139823#(<= main_~i~0 20), 139820#(<= main_~i~0 17), 139821#(<= main_~i~0 18), 139826#(<= main_~i~0 23), 139827#(<= main_~i~0 24), 139824#(<= main_~i~0 21), 139825#(<= main_~i~0 22), 139830#(<= main_~i~0 27), 139831#(<= main_~i~0 28), 139828#(<= main_~i~0 25), 139829#(<= main_~i~0 26), 139834#(<= main_~i~0 31), 139835#(<= main_~i~0 32), 139832#(<= main_~i~0 29), 139833#(<= main_~i~0 30), 139838#(<= main_~i~0 35), 139839#(<= main_~i~0 36), 139836#(<= main_~i~0 33), 139837#(<= main_~i~0 34), 139842#(<= main_~i~0 39), 139843#(<= main_~i~0 40), 139840#(<= main_~i~0 37), 139841#(<= main_~i~0 38), 139846#(<= main_~i~0 43), 139847#(<= main_~i~0 44), 139844#(<= main_~i~0 41), 139845#(<= main_~i~0 42), 139850#(<= main_~i~0 47), 139851#(<= main_~i~0 48), 139848#(<= main_~i~0 45), 139849#(<= main_~i~0 46), 139854#(<= main_~i~0 51), 139855#(<= main_~i~0 52), 139852#(<= main_~i~0 49), 139853#(<= main_~i~0 50), 139858#(<= main_~i~0 55), 139859#(<= main_~i~0 56), 139856#(<= main_~i~0 53), 139857#(<= main_~i~0 54), 139862#(<= main_~i~0 59), 139863#(<= main_~i~0 60), 139860#(<= main_~i~0 57), 139861#(<= main_~i~0 58), 139866#(<= main_~i~0 63), 139867#(<= main_~i~0 64), 139864#(<= main_~i~0 61), 139865#(<= main_~i~0 62), 139870#(<= main_~i~0 67), 139871#(<= main_~i~0 68), 139868#(<= main_~i~0 65), 139869#(<= main_~i~0 66), 139874#(<= main_~i~0 71), 139875#(<= main_~i~0 72), 139872#(<= main_~i~0 69), 139873#(<= main_~i~0 70), 139878#(<= main_~i~0 75), 139879#(<= main_~i~0 76), 139876#(<= main_~i~0 73), 139877#(<= main_~i~0 74), 139882#(<= main_~i~0 79), 139883#(<= main_~i~0 80), 139880#(<= main_~i~0 77), 139881#(<= main_~i~0 78), 139886#(<= main_~i~0 83), 139887#(<= main_~i~0 84), 139884#(<= main_~i~0 81), 139885#(<= main_~i~0 82), 139890#(<= main_~i~0 87), 139891#(<= main_~i~0 88), 139888#(<= main_~i~0 85), 139889#(<= main_~i~0 86), 139894#(<= main_~i~0 91), 139895#(<= main_~i~0 92), 139892#(<= main_~i~0 89), 139893#(<= main_~i~0 90), 139898#(<= main_~i~0 95), 139899#(<= main_~i~0 96), 139896#(<= main_~i~0 93), 139897#(<= main_~i~0 94), 139902#(<= main_~i~0 99), 139903#(<= main_~i~0 100), 139900#(<= main_~i~0 97), 139901#(<= main_~i~0 98), 139906#(<= main_~i~0 103), 139907#(<= main_~i~0 104), 139904#(<= main_~i~0 101), 139905#(<= main_~i~0 102), 139910#(<= main_~i~0 107), 139911#(<= main_~i~0 108), 139908#(<= main_~i~0 105), 139909#(<= main_~i~0 106), 139914#(<= main_~i~0 111), 139915#(<= main_~i~0 112), 139912#(<= main_~i~0 109), 139913#(<= main_~i~0 110), 139918#(<= main_~i~0 115), 139919#(<= main_~i~0 116), 139916#(<= main_~i~0 113), 139917#(<= main_~i~0 114), 139922#(<= main_~i~0 119), 139923#(<= main_~i~0 120), 139920#(<= main_~i~0 117), 139921#(<= main_~i~0 118), 139926#(<= main_~i~0 123), 139927#(<= main_~i~0 124), 139924#(<= main_~i~0 121), 139925#(<= main_~i~0 122), 139930#(<= main_~i~0 127), 139931#(<= main_~i~0 128), 139928#(<= main_~i~0 125), 139929#(<= main_~i~0 126), 139934#(and (<= 2 main_~i~0) (<= main_~i~0 130)), 139935#(and (<= main_~i~0 131) (<= 3 main_~i~0)), 139932#(and (<= 0 main_~i~0) (<= main_~i~0 128)), 139933#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 139938#(and (<= 6 main_~i~0) (<= main_~i~0 134)), 139939#(and (<= 7 main_~i~0) (<= main_~i~0 135)), 139936#(and (<= main_~i~0 132) (<= 4 main_~i~0)), 139937#(and (<= 5 main_~i~0) (<= main_~i~0 133)), 139942#(and (<= main_~i~0 138) (<= 10 main_~i~0)), 139943#(and (<= main_~i~0 139) (<= 11 main_~i~0)), 139940#(and (<= 8 main_~i~0) (<= main_~i~0 136)), 139941#(and (<= 9 main_~i~0) (<= main_~i~0 137)), 139946#(and (<= 14 main_~i~0) (<= main_~i~0 142)), 139947#(and (<= main_~i~0 143) (<= 15 main_~i~0)), 139944#(and (<= 12 main_~i~0) (<= main_~i~0 140)), 139945#(and (<= 13 main_~i~0) (<= main_~i~0 141)), 139948#(and (<= main_~i~0 144) (<= 16 main_~i~0))] [2018-04-12 03:16:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 51768 backedges. 0 proven. 51768 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:20,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-04-12 03:16:20,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-04-12 03:16:20,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8550, Invalid=13206, Unknown=0, NotChecked=0, Total=21756 [2018-04-12 03:16:20,628 INFO L87 Difference]: Start difference. First operand 733 states and 733 transitions. Second operand 148 states. [2018-04-12 03:16:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:16:33,040 INFO L93 Difference]: Finished difference Result 738 states and 738 transitions. [2018-04-12 03:16:33,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-04-12 03:16:33,041 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 727 [2018-04-12 03:16:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:16:33,041 INFO L225 Difference]: With dead ends: 738 [2018-04-12 03:16:33,041 INFO L226 Difference]: Without dead ends: 738 [2018-04-12 03:16:33,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12503 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=27543, Invalid=57429, Unknown=0, NotChecked=0, Total=84972 [2018-04-12 03:16:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-04-12 03:16:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2018-04-12 03:16:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-04-12 03:16:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 738 transitions. [2018-04-12 03:16:33,045 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 738 transitions. Word has length 727 [2018-04-12 03:16:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:16:33,045 INFO L459 AbstractCegarLoop]: Abstraction has 738 states and 738 transitions. [2018-04-12 03:16:33,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-04-12 03:16:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 738 transitions. [2018-04-12 03:16:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2018-04-12 03:16:33,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:16:33,048 INFO L355 BasicCegarLoop]: trace histogram [146, 145, 145, 145, 145, 1, 1, 1, 1, 1, 1] [2018-04-12 03:16:33,048 INFO L408 AbstractCegarLoop]: === Iteration 150 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:16:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash -230891369, now seen corresponding path program 145 times [2018-04-12 03:16:33,048 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:16:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:16:33,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:16:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 52490 backedges. 0 proven. 52490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:39,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:16:39,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-04-12 03:16:39,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:16:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:39,826 INFO L182 omatonBuilderFactory]: Interpolants [141826#(<= main_~i~0 111), 141827#(<= main_~i~0 112), 141824#(<= main_~i~0 109), 141825#(<= main_~i~0 110), 141830#(<= main_~i~0 115), 141831#(<= main_~i~0 116), 141828#(<= main_~i~0 113), 141829#(<= main_~i~0 114), 141834#(<= main_~i~0 119), 141835#(<= main_~i~0 120), 141832#(<= main_~i~0 117), 141833#(<= main_~i~0 118), 141838#(<= main_~i~0 123), 141839#(<= main_~i~0 124), 141836#(<= main_~i~0 121), 141837#(<= main_~i~0 122), 141842#(<= main_~i~0 127), 141843#(<= main_~i~0 128), 141840#(<= main_~i~0 125), 141841#(<= main_~i~0 126), 141846#(<= main_~i~0 131), 141847#(<= main_~i~0 132), 141844#(<= main_~i~0 129), 141845#(<= main_~i~0 130), 141850#(<= main_~i~0 135), 141851#(<= main_~i~0 136), 141848#(<= main_~i~0 133), 141849#(<= main_~i~0 134), 141854#(<= main_~i~0 139), 141855#(<= main_~i~0 140), 141852#(<= main_~i~0 137), 141853#(<= main_~i~0 138), 141858#(<= main_~i~0 143), 141859#(<= main_~i~0 144), 141856#(<= main_~i~0 141), 141857#(<= main_~i~0 142), 141860#(and (<= 0 main_~i~0) (<= main_~i~0 144)), 141861#(and (<= 1 main_~i~0) (<= main_~i~0 145)), 141714#false, 141715#(<= main_~i~0 0), 141713#true, 141718#(<= main_~i~0 3), 141719#(<= main_~i~0 4), 141716#(<= main_~i~0 1), 141717#(<= main_~i~0 2), 141722#(<= main_~i~0 7), 141723#(<= main_~i~0 8), 141720#(<= main_~i~0 5), 141721#(<= main_~i~0 6), 141726#(<= main_~i~0 11), 141727#(<= main_~i~0 12), 141724#(<= main_~i~0 9), 141725#(<= main_~i~0 10), 141730#(<= main_~i~0 15), 141731#(<= main_~i~0 16), 141728#(<= main_~i~0 13), 141729#(<= main_~i~0 14), 141734#(<= main_~i~0 19), 141735#(<= main_~i~0 20), 141732#(<= main_~i~0 17), 141733#(<= main_~i~0 18), 141738#(<= main_~i~0 23), 141739#(<= main_~i~0 24), 141736#(<= main_~i~0 21), 141737#(<= main_~i~0 22), 141742#(<= main_~i~0 27), 141743#(<= main_~i~0 28), 141740#(<= main_~i~0 25), 141741#(<= main_~i~0 26), 141746#(<= main_~i~0 31), 141747#(<= main_~i~0 32), 141744#(<= main_~i~0 29), 141745#(<= main_~i~0 30), 141750#(<= main_~i~0 35), 141751#(<= main_~i~0 36), 141748#(<= main_~i~0 33), 141749#(<= main_~i~0 34), 141754#(<= main_~i~0 39), 141755#(<= main_~i~0 40), 141752#(<= main_~i~0 37), 141753#(<= main_~i~0 38), 141758#(<= main_~i~0 43), 141759#(<= main_~i~0 44), 141756#(<= main_~i~0 41), 141757#(<= main_~i~0 42), 141762#(<= main_~i~0 47), 141763#(<= main_~i~0 48), 141760#(<= main_~i~0 45), 141761#(<= main_~i~0 46), 141766#(<= main_~i~0 51), 141767#(<= main_~i~0 52), 141764#(<= main_~i~0 49), 141765#(<= main_~i~0 50), 141770#(<= main_~i~0 55), 141771#(<= main_~i~0 56), 141768#(<= main_~i~0 53), 141769#(<= main_~i~0 54), 141774#(<= main_~i~0 59), 141775#(<= main_~i~0 60), 141772#(<= main_~i~0 57), 141773#(<= main_~i~0 58), 141778#(<= main_~i~0 63), 141779#(<= main_~i~0 64), 141776#(<= main_~i~0 61), 141777#(<= main_~i~0 62), 141782#(<= main_~i~0 67), 141783#(<= main_~i~0 68), 141780#(<= main_~i~0 65), 141781#(<= main_~i~0 66), 141786#(<= main_~i~0 71), 141787#(<= main_~i~0 72), 141784#(<= main_~i~0 69), 141785#(<= main_~i~0 70), 141790#(<= main_~i~0 75), 141791#(<= main_~i~0 76), 141788#(<= main_~i~0 73), 141789#(<= main_~i~0 74), 141794#(<= main_~i~0 79), 141795#(<= main_~i~0 80), 141792#(<= main_~i~0 77), 141793#(<= main_~i~0 78), 141798#(<= main_~i~0 83), 141799#(<= main_~i~0 84), 141796#(<= main_~i~0 81), 141797#(<= main_~i~0 82), 141802#(<= main_~i~0 87), 141803#(<= main_~i~0 88), 141800#(<= main_~i~0 85), 141801#(<= main_~i~0 86), 141806#(<= main_~i~0 91), 141807#(<= main_~i~0 92), 141804#(<= main_~i~0 89), 141805#(<= main_~i~0 90), 141810#(<= main_~i~0 95), 141811#(<= main_~i~0 96), 141808#(<= main_~i~0 93), 141809#(<= main_~i~0 94), 141814#(<= main_~i~0 99), 141815#(<= main_~i~0 100), 141812#(<= main_~i~0 97), 141813#(<= main_~i~0 98), 141818#(<= main_~i~0 103), 141819#(<= main_~i~0 104), 141816#(<= main_~i~0 101), 141817#(<= main_~i~0 102), 141822#(<= main_~i~0 107), 141823#(<= main_~i~0 108), 141820#(<= main_~i~0 105), 141821#(<= main_~i~0 106)] [2018-04-12 03:16:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 52490 backedges. 0 proven. 52490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:39,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-04-12 03:16:39,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-04-12 03:16:39,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10736, Invalid=11316, Unknown=0, NotChecked=0, Total=22052 [2018-04-12 03:16:39,828 INFO L87 Difference]: Start difference. First operand 738 states and 738 transitions. Second operand 149 states. [2018-04-12 03:16:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:16:45,753 INFO L93 Difference]: Finished difference Result 743 states and 743 transitions. [2018-04-12 03:16:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-04-12 03:16:45,754 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 732 [2018-04-12 03:16:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:16:45,754 INFO L225 Difference]: With dead ends: 743 [2018-04-12 03:16:45,754 INFO L226 Difference]: Without dead ends: 743 [2018-04-12 03:16:45,757 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10729 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=32196, Invalid=53946, Unknown=0, NotChecked=0, Total=86142 [2018-04-12 03:16:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-04-12 03:16:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2018-04-12 03:16:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-04-12 03:16:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 743 transitions. [2018-04-12 03:16:45,759 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 743 transitions. Word has length 732 [2018-04-12 03:16:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:16:45,760 INFO L459 AbstractCegarLoop]: Abstraction has 743 states and 743 transitions. [2018-04-12 03:16:45,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-04-12 03:16:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 743 transitions. [2018-04-12 03:16:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2018-04-12 03:16:45,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:16:45,762 INFO L355 BasicCegarLoop]: trace histogram [147, 146, 146, 146, 146, 1, 1, 1, 1, 1, 1] [2018-04-12 03:16:45,762 INFO L408 AbstractCegarLoop]: === Iteration 151 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:16:45,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1437290182, now seen corresponding path program 146 times [2018-04-12 03:16:45,763 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:16:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:16:45,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:16:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 53217 backedges. 0 proven. 53217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:52,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:16:52,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-04-12 03:16:52,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:16:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:52,627 INFO L182 omatonBuilderFactory]: Interpolants [143638#true, 143639#false, 143642#(<= main_~i~0 2), 143643#(<= main_~i~0 3), 143640#(<= main_~i~0 0), 143641#(<= main_~i~0 1), 143646#(<= main_~i~0 6), 143647#(<= main_~i~0 7), 143644#(<= main_~i~0 4), 143645#(<= main_~i~0 5), 143650#(<= main_~i~0 10), 143651#(<= main_~i~0 11), 143648#(<= main_~i~0 8), 143649#(<= main_~i~0 9), 143654#(<= main_~i~0 14), 143655#(<= main_~i~0 15), 143652#(<= main_~i~0 12), 143653#(<= main_~i~0 13), 143658#(<= main_~i~0 18), 143659#(<= main_~i~0 19), 143656#(<= main_~i~0 16), 143657#(<= main_~i~0 17), 143662#(<= main_~i~0 22), 143663#(<= main_~i~0 23), 143660#(<= main_~i~0 20), 143661#(<= main_~i~0 21), 143666#(<= main_~i~0 26), 143667#(<= main_~i~0 27), 143664#(<= main_~i~0 24), 143665#(<= main_~i~0 25), 143670#(<= main_~i~0 30), 143671#(<= main_~i~0 31), 143668#(<= main_~i~0 28), 143669#(<= main_~i~0 29), 143674#(<= main_~i~0 34), 143675#(<= main_~i~0 35), 143672#(<= main_~i~0 32), 143673#(<= main_~i~0 33), 143678#(<= main_~i~0 38), 143679#(<= main_~i~0 39), 143676#(<= main_~i~0 36), 143677#(<= main_~i~0 37), 143682#(<= main_~i~0 42), 143683#(<= main_~i~0 43), 143680#(<= main_~i~0 40), 143681#(<= main_~i~0 41), 143686#(<= main_~i~0 46), 143687#(<= main_~i~0 47), 143684#(<= main_~i~0 44), 143685#(<= main_~i~0 45), 143690#(<= main_~i~0 50), 143691#(<= main_~i~0 51), 143688#(<= main_~i~0 48), 143689#(<= main_~i~0 49), 143694#(<= main_~i~0 54), 143695#(<= main_~i~0 55), 143692#(<= main_~i~0 52), 143693#(<= main_~i~0 53), 143698#(<= main_~i~0 58), 143699#(<= main_~i~0 59), 143696#(<= main_~i~0 56), 143697#(<= main_~i~0 57), 143702#(<= main_~i~0 62), 143703#(<= main_~i~0 63), 143700#(<= main_~i~0 60), 143701#(<= main_~i~0 61), 143706#(<= main_~i~0 66), 143707#(<= main_~i~0 67), 143704#(<= main_~i~0 64), 143705#(<= main_~i~0 65), 143710#(<= main_~i~0 70), 143711#(<= main_~i~0 71), 143708#(<= main_~i~0 68), 143709#(<= main_~i~0 69), 143714#(<= main_~i~0 74), 143715#(<= main_~i~0 75), 143712#(<= main_~i~0 72), 143713#(<= main_~i~0 73), 143718#(<= main_~i~0 78), 143719#(<= main_~i~0 79), 143716#(<= main_~i~0 76), 143717#(<= main_~i~0 77), 143722#(<= main_~i~0 82), 143723#(<= main_~i~0 83), 143720#(<= main_~i~0 80), 143721#(<= main_~i~0 81), 143726#(<= main_~i~0 86), 143727#(<= main_~i~0 87), 143724#(<= main_~i~0 84), 143725#(<= main_~i~0 85), 143730#(<= main_~i~0 90), 143731#(<= main_~i~0 91), 143728#(<= main_~i~0 88), 143729#(<= main_~i~0 89), 143734#(<= main_~i~0 94), 143735#(<= main_~i~0 95), 143732#(<= main_~i~0 92), 143733#(<= main_~i~0 93), 143738#(<= main_~i~0 98), 143739#(<= main_~i~0 99), 143736#(<= main_~i~0 96), 143737#(<= main_~i~0 97), 143742#(<= main_~i~0 102), 143743#(<= main_~i~0 103), 143740#(<= main_~i~0 100), 143741#(<= main_~i~0 101), 143746#(<= main_~i~0 106), 143747#(<= main_~i~0 107), 143744#(<= main_~i~0 104), 143745#(<= main_~i~0 105), 143750#(<= main_~i~0 110), 143751#(<= main_~i~0 111), 143748#(<= main_~i~0 108), 143749#(<= main_~i~0 109), 143754#(<= main_~i~0 114), 143755#(<= main_~i~0 115), 143752#(<= main_~i~0 112), 143753#(<= main_~i~0 113), 143758#(<= main_~i~0 118), 143759#(<= main_~i~0 119), 143756#(<= main_~i~0 116), 143757#(<= main_~i~0 117), 143762#(<= main_~i~0 122), 143763#(<= main_~i~0 123), 143760#(<= main_~i~0 120), 143761#(<= main_~i~0 121), 143766#(<= main_~i~0 126), 143767#(<= main_~i~0 127), 143764#(<= main_~i~0 124), 143765#(<= main_~i~0 125), 143770#(<= main_~i~0 130), 143771#(<= main_~i~0 131), 143768#(<= main_~i~0 128), 143769#(<= main_~i~0 129), 143774#(<= main_~i~0 134), 143775#(<= main_~i~0 135), 143772#(<= main_~i~0 132), 143773#(<= main_~i~0 133), 143778#(<= main_~i~0 138), 143779#(<= main_~i~0 139), 143776#(<= main_~i~0 136), 143777#(<= main_~i~0 137), 143782#(<= main_~i~0 142), 143783#(<= main_~i~0 143), 143780#(<= main_~i~0 140), 143781#(<= main_~i~0 141), 143786#(and (<= 1 main_~i~0) (<= main_~i~0 145)), 143787#(and (<= 2 main_~i~0) (<= main_~i~0 146)), 143784#(<= main_~i~0 144), 143785#(and (<= 0 main_~i~0) (<= main_~i~0 144))] [2018-04-12 03:16:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 53217 backedges. 0 proven. 53217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:16:52,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-04-12 03:16:52,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-04-12 03:16:52,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10738, Invalid=11612, Unknown=0, NotChecked=0, Total=22350 [2018-04-12 03:16:52,631 INFO L87 Difference]: Start difference. First operand 743 states and 743 transitions. Second operand 150 states. [2018-04-12 03:16:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:16:59,280 INFO L93 Difference]: Finished difference Result 748 states and 748 transitions. [2018-04-12 03:16:59,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-04-12 03:16:59,280 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 737 [2018-04-12 03:16:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:16:59,280 INFO L225 Difference]: With dead ends: 748 [2018-04-12 03:16:59,280 INFO L226 Difference]: Without dead ends: 748 [2018-04-12 03:16:59,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11020 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=32345, Invalid=54975, Unknown=0, NotChecked=0, Total=87320 [2018-04-12 03:16:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-04-12 03:16:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2018-04-12 03:16:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-04-12 03:16:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 748 transitions. [2018-04-12 03:16:59,285 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 748 transitions. Word has length 737 [2018-04-12 03:16:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:16:59,286 INFO L459 AbstractCegarLoop]: Abstraction has 748 states and 748 transitions. [2018-04-12 03:16:59,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-04-12 03:16:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 748 transitions. [2018-04-12 03:16:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2018-04-12 03:16:59,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:16:59,289 INFO L355 BasicCegarLoop]: trace histogram [148, 147, 147, 147, 147, 1, 1, 1, 1, 1, 1] [2018-04-12 03:16:59,289 INFO L408 AbstractCegarLoop]: === Iteration 152 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:16:59,290 INFO L82 PathProgramCache]: Analyzing trace with hash -330996233, now seen corresponding path program 147 times [2018-04-12 03:16:59,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:16:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:16:59,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:17:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 53949 backedges. 0 proven. 53949 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:06,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:17:06,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-04-12 03:17:06,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:17:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:06,422 INFO L182 omatonBuilderFactory]: Interpolants [145666#(<= main_~i~0 88), 145667#(<= main_~i~0 89), 145664#(<= main_~i~0 86), 145665#(<= main_~i~0 87), 145670#(<= main_~i~0 92), 145671#(<= main_~i~0 93), 145668#(<= main_~i~0 90), 145669#(<= main_~i~0 91), 145674#(<= main_~i~0 96), 145675#(<= main_~i~0 97), 145672#(<= main_~i~0 94), 145673#(<= main_~i~0 95), 145678#(<= main_~i~0 100), 145679#(<= main_~i~0 101), 145676#(<= main_~i~0 98), 145677#(<= main_~i~0 99), 145682#(<= main_~i~0 104), 145683#(<= main_~i~0 105), 145680#(<= main_~i~0 102), 145681#(<= main_~i~0 103), 145686#(<= main_~i~0 108), 145687#(<= main_~i~0 109), 145684#(<= main_~i~0 106), 145685#(<= main_~i~0 107), 145690#(<= main_~i~0 112), 145691#(<= main_~i~0 113), 145688#(<= main_~i~0 110), 145689#(<= main_~i~0 111), 145694#(<= main_~i~0 116), 145695#(<= main_~i~0 117), 145692#(<= main_~i~0 114), 145693#(<= main_~i~0 115), 145698#(<= main_~i~0 120), 145699#(<= main_~i~0 121), 145696#(<= main_~i~0 118), 145697#(<= main_~i~0 119), 145702#(<= main_~i~0 124), 145703#(<= main_~i~0 125), 145700#(<= main_~i~0 122), 145701#(<= main_~i~0 123), 145706#(<= main_~i~0 128), 145707#(<= main_~i~0 129), 145704#(<= main_~i~0 126), 145705#(<= main_~i~0 127), 145710#(<= main_~i~0 132), 145711#(<= main_~i~0 133), 145708#(<= main_~i~0 130), 145709#(<= main_~i~0 131), 145714#(<= main_~i~0 136), 145715#(<= main_~i~0 137), 145712#(<= main_~i~0 134), 145713#(<= main_~i~0 135), 145718#(<= main_~i~0 140), 145719#(<= main_~i~0 141), 145716#(<= main_~i~0 138), 145717#(<= main_~i~0 139), 145722#(<= main_~i~0 144), 145723#(<= main_~i~0 145), 145720#(<= main_~i~0 142), 145721#(<= main_~i~0 143), 145726#(and (<= 1 main_~i~0) (<= main_~i~0 147)), 145724#(<= main_~i~0 146), 145725#(and (<= main_~i~0 146) (<= 0 main_~i~0)), 145578#(<= main_~i~0 0), 145579#(<= main_~i~0 1), 145576#true, 145577#false, 145582#(<= main_~i~0 4), 145583#(<= main_~i~0 5), 145580#(<= main_~i~0 2), 145581#(<= main_~i~0 3), 145586#(<= main_~i~0 8), 145587#(<= main_~i~0 9), 145584#(<= main_~i~0 6), 145585#(<= main_~i~0 7), 145590#(<= main_~i~0 12), 145591#(<= main_~i~0 13), 145588#(<= main_~i~0 10), 145589#(<= main_~i~0 11), 145594#(<= main_~i~0 16), 145595#(<= main_~i~0 17), 145592#(<= main_~i~0 14), 145593#(<= main_~i~0 15), 145598#(<= main_~i~0 20), 145599#(<= main_~i~0 21), 145596#(<= main_~i~0 18), 145597#(<= main_~i~0 19), 145602#(<= main_~i~0 24), 145603#(<= main_~i~0 25), 145600#(<= main_~i~0 22), 145601#(<= main_~i~0 23), 145606#(<= main_~i~0 28), 145607#(<= main_~i~0 29), 145604#(<= main_~i~0 26), 145605#(<= main_~i~0 27), 145610#(<= main_~i~0 32), 145611#(<= main_~i~0 33), 145608#(<= main_~i~0 30), 145609#(<= main_~i~0 31), 145614#(<= main_~i~0 36), 145615#(<= main_~i~0 37), 145612#(<= main_~i~0 34), 145613#(<= main_~i~0 35), 145618#(<= main_~i~0 40), 145619#(<= main_~i~0 41), 145616#(<= main_~i~0 38), 145617#(<= main_~i~0 39), 145622#(<= main_~i~0 44), 145623#(<= main_~i~0 45), 145620#(<= main_~i~0 42), 145621#(<= main_~i~0 43), 145626#(<= main_~i~0 48), 145627#(<= main_~i~0 49), 145624#(<= main_~i~0 46), 145625#(<= main_~i~0 47), 145630#(<= main_~i~0 52), 145631#(<= main_~i~0 53), 145628#(<= main_~i~0 50), 145629#(<= main_~i~0 51), 145634#(<= main_~i~0 56), 145635#(<= main_~i~0 57), 145632#(<= main_~i~0 54), 145633#(<= main_~i~0 55), 145638#(<= main_~i~0 60), 145639#(<= main_~i~0 61), 145636#(<= main_~i~0 58), 145637#(<= main_~i~0 59), 145642#(<= main_~i~0 64), 145643#(<= main_~i~0 65), 145640#(<= main_~i~0 62), 145641#(<= main_~i~0 63), 145646#(<= main_~i~0 68), 145647#(<= main_~i~0 69), 145644#(<= main_~i~0 66), 145645#(<= main_~i~0 67), 145650#(<= main_~i~0 72), 145651#(<= main_~i~0 73), 145648#(<= main_~i~0 70), 145649#(<= main_~i~0 71), 145654#(<= main_~i~0 76), 145655#(<= main_~i~0 77), 145652#(<= main_~i~0 74), 145653#(<= main_~i~0 75), 145658#(<= main_~i~0 80), 145659#(<= main_~i~0 81), 145656#(<= main_~i~0 78), 145657#(<= main_~i~0 79), 145662#(<= main_~i~0 84), 145663#(<= main_~i~0 85), 145660#(<= main_~i~0 82), 145661#(<= main_~i~0 83)] [2018-04-12 03:17:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 53949 backedges. 0 proven. 53949 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:06,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-04-12 03:17:06,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-04-12 03:17:06,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11031, Invalid=11619, Unknown=0, NotChecked=0, Total=22650 [2018-04-12 03:17:06,425 INFO L87 Difference]: Start difference. First operand 748 states and 748 transitions. Second operand 151 states. [2018-04-12 03:17:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:17:12,555 INFO L93 Difference]: Finished difference Result 753 states and 753 transitions. [2018-04-12 03:17:12,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-04-12 03:17:12,555 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 742 [2018-04-12 03:17:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:17:12,555 INFO L225 Difference]: With dead ends: 753 [2018-04-12 03:17:12,556 INFO L226 Difference]: Without dead ends: 753 [2018-04-12 03:17:12,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11024 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=33081, Invalid=55425, Unknown=0, NotChecked=0, Total=88506 [2018-04-12 03:17:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-04-12 03:17:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-04-12 03:17:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-04-12 03:17:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 753 transitions. [2018-04-12 03:17:12,560 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 753 transitions. Word has length 742 [2018-04-12 03:17:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:17:12,561 INFO L459 AbstractCegarLoop]: Abstraction has 753 states and 753 transitions. [2018-04-12 03:17:12,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-04-12 03:17:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 753 transitions. [2018-04-12 03:17:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-04-12 03:17:12,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:17:12,563 INFO L355 BasicCegarLoop]: trace histogram [149, 148, 148, 148, 148, 1, 1, 1, 1, 1, 1] [2018-04-12 03:17:12,563 INFO L408 AbstractCegarLoop]: === Iteration 153 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:17:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash -117496474, now seen corresponding path program 148 times [2018-04-12 03:17:12,563 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:17:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:17:12,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:17:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 54686 backedges. 0 proven. 54686 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:19,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:17:19,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-04-12 03:17:19,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:17:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:19,524 INFO L182 omatonBuilderFactory]: Interpolants [147527#true, 147530#(<= main_~i~0 1), 147531#(<= main_~i~0 2), 147528#false, 147529#(<= main_~i~0 0), 147534#(<= main_~i~0 5), 147535#(<= main_~i~0 6), 147532#(<= main_~i~0 3), 147533#(<= main_~i~0 4), 147538#(<= main_~i~0 9), 147539#(<= main_~i~0 10), 147536#(<= main_~i~0 7), 147537#(<= main_~i~0 8), 147542#(<= main_~i~0 13), 147543#(<= main_~i~0 14), 147540#(<= main_~i~0 11), 147541#(<= main_~i~0 12), 147546#(<= main_~i~0 17), 147547#(<= main_~i~0 18), 147544#(<= main_~i~0 15), 147545#(<= main_~i~0 16), 147550#(<= main_~i~0 21), 147551#(<= main_~i~0 22), 147548#(<= main_~i~0 19), 147549#(<= main_~i~0 20), 147554#(<= main_~i~0 25), 147555#(<= main_~i~0 26), 147552#(<= main_~i~0 23), 147553#(<= main_~i~0 24), 147558#(<= main_~i~0 29), 147559#(<= main_~i~0 30), 147556#(<= main_~i~0 27), 147557#(<= main_~i~0 28), 147562#(<= main_~i~0 33), 147563#(<= main_~i~0 34), 147560#(<= main_~i~0 31), 147561#(<= main_~i~0 32), 147566#(<= main_~i~0 37), 147567#(<= main_~i~0 38), 147564#(<= main_~i~0 35), 147565#(<= main_~i~0 36), 147570#(<= main_~i~0 41), 147571#(<= main_~i~0 42), 147568#(<= main_~i~0 39), 147569#(<= main_~i~0 40), 147574#(<= main_~i~0 45), 147575#(<= main_~i~0 46), 147572#(<= main_~i~0 43), 147573#(<= main_~i~0 44), 147578#(<= main_~i~0 49), 147579#(<= main_~i~0 50), 147576#(<= main_~i~0 47), 147577#(<= main_~i~0 48), 147582#(<= main_~i~0 53), 147583#(<= main_~i~0 54), 147580#(<= main_~i~0 51), 147581#(<= main_~i~0 52), 147586#(<= main_~i~0 57), 147587#(<= main_~i~0 58), 147584#(<= main_~i~0 55), 147585#(<= main_~i~0 56), 147590#(<= main_~i~0 61), 147591#(<= main_~i~0 62), 147588#(<= main_~i~0 59), 147589#(<= main_~i~0 60), 147594#(<= main_~i~0 65), 147595#(<= main_~i~0 66), 147592#(<= main_~i~0 63), 147593#(<= main_~i~0 64), 147598#(<= main_~i~0 69), 147599#(<= main_~i~0 70), 147596#(<= main_~i~0 67), 147597#(<= main_~i~0 68), 147602#(<= main_~i~0 73), 147603#(<= main_~i~0 74), 147600#(<= main_~i~0 71), 147601#(<= main_~i~0 72), 147606#(<= main_~i~0 77), 147607#(<= main_~i~0 78), 147604#(<= main_~i~0 75), 147605#(<= main_~i~0 76), 147610#(<= main_~i~0 81), 147611#(<= main_~i~0 82), 147608#(<= main_~i~0 79), 147609#(<= main_~i~0 80), 147614#(<= main_~i~0 85), 147615#(<= main_~i~0 86), 147612#(<= main_~i~0 83), 147613#(<= main_~i~0 84), 147618#(<= main_~i~0 89), 147619#(<= main_~i~0 90), 147616#(<= main_~i~0 87), 147617#(<= main_~i~0 88), 147622#(<= main_~i~0 93), 147623#(<= main_~i~0 94), 147620#(<= main_~i~0 91), 147621#(<= main_~i~0 92), 147626#(<= main_~i~0 97), 147627#(<= main_~i~0 98), 147624#(<= main_~i~0 95), 147625#(<= main_~i~0 96), 147630#(<= main_~i~0 101), 147631#(<= main_~i~0 102), 147628#(<= main_~i~0 99), 147629#(<= main_~i~0 100), 147634#(<= main_~i~0 105), 147635#(<= main_~i~0 106), 147632#(<= main_~i~0 103), 147633#(<= main_~i~0 104), 147638#(<= main_~i~0 109), 147639#(<= main_~i~0 110), 147636#(<= main_~i~0 107), 147637#(<= main_~i~0 108), 147642#(<= main_~i~0 113), 147643#(<= main_~i~0 114), 147640#(<= main_~i~0 111), 147641#(<= main_~i~0 112), 147646#(<= main_~i~0 117), 147647#(<= main_~i~0 118), 147644#(<= main_~i~0 115), 147645#(<= main_~i~0 116), 147650#(<= main_~i~0 121), 147651#(<= main_~i~0 122), 147648#(<= main_~i~0 119), 147649#(<= main_~i~0 120), 147654#(<= main_~i~0 125), 147655#(<= main_~i~0 126), 147652#(<= main_~i~0 123), 147653#(<= main_~i~0 124), 147658#(<= main_~i~0 129), 147659#(<= main_~i~0 130), 147656#(<= main_~i~0 127), 147657#(<= main_~i~0 128), 147662#(<= main_~i~0 133), 147663#(<= main_~i~0 134), 147660#(<= main_~i~0 131), 147661#(<= main_~i~0 132), 147666#(<= main_~i~0 137), 147667#(<= main_~i~0 138), 147664#(<= main_~i~0 135), 147665#(<= main_~i~0 136), 147670#(<= main_~i~0 141), 147671#(<= main_~i~0 142), 147668#(<= main_~i~0 139), 147669#(<= main_~i~0 140), 147674#(and (<= 0 main_~i~0) (<= main_~i~0 144)), 147675#(and (<= 1 main_~i~0) (<= main_~i~0 145)), 147672#(<= main_~i~0 143), 147673#(<= main_~i~0 144), 147678#(and (<= 4 main_~i~0) (<= main_~i~0 148)), 147676#(and (<= 2 main_~i~0) (<= main_~i~0 146)), 147677#(and (<= main_~i~0 147) (<= 3 main_~i~0))] [2018-04-12 03:17:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 54686 backedges. 0 proven. 54686 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:19,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-04-12 03:17:19,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-04-12 03:17:19,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10742, Invalid=12210, Unknown=0, NotChecked=0, Total=22952 [2018-04-12 03:17:19,527 INFO L87 Difference]: Start difference. First operand 753 states and 753 transitions. Second operand 152 states. [2018-04-12 03:17:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:17:27,206 INFO L93 Difference]: Finished difference Result 758 states and 758 transitions. [2018-04-12 03:17:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-04-12 03:17:27,207 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 747 [2018-04-12 03:17:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:17:27,207 INFO L225 Difference]: With dead ends: 758 [2018-04-12 03:17:27,207 INFO L226 Difference]: Without dead ends: 758 [2018-04-12 03:17:27,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11605 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=32643, Invalid=57057, Unknown=0, NotChecked=0, Total=89700 [2018-04-12 03:17:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-04-12 03:17:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2018-04-12 03:17:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-04-12 03:17:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 758 transitions. [2018-04-12 03:17:27,213 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 758 transitions. Word has length 747 [2018-04-12 03:17:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:17:27,213 INFO L459 AbstractCegarLoop]: Abstraction has 758 states and 758 transitions. [2018-04-12 03:17:27,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-04-12 03:17:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 758 transitions. [2018-04-12 03:17:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-04-12 03:17:27,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:17:27,216 INFO L355 BasicCegarLoop]: trace histogram [150, 149, 149, 149, 149, 1, 1, 1, 1, 1, 1] [2018-04-12 03:17:27,216 INFO L408 AbstractCegarLoop]: === Iteration 154 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:17:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1561414825, now seen corresponding path program 149 times [2018-04-12 03:17:27,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:17:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:17:27,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:17:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 55428 backedges. 0 proven. 55428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:34,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:17:34,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-04-12 03:17:34,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:17:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:34,389 INFO L182 omatonBuilderFactory]: Interpolants [149506#(<= main_~i~0 13), 149507#(<= main_~i~0 14), 149504#(<= main_~i~0 11), 149505#(<= main_~i~0 12), 149510#(<= main_~i~0 17), 149511#(<= main_~i~0 18), 149508#(<= main_~i~0 15), 149509#(<= main_~i~0 16), 149514#(<= main_~i~0 21), 149515#(<= main_~i~0 22), 149512#(<= main_~i~0 19), 149513#(<= main_~i~0 20), 149518#(<= main_~i~0 25), 149519#(<= main_~i~0 26), 149516#(<= main_~i~0 23), 149517#(<= main_~i~0 24), 149522#(<= main_~i~0 29), 149523#(<= main_~i~0 30), 149520#(<= main_~i~0 27), 149521#(<= main_~i~0 28), 149526#(<= main_~i~0 33), 149527#(<= main_~i~0 34), 149524#(<= main_~i~0 31), 149525#(<= main_~i~0 32), 149530#(<= main_~i~0 37), 149531#(<= main_~i~0 38), 149528#(<= main_~i~0 35), 149529#(<= main_~i~0 36), 149534#(<= main_~i~0 41), 149535#(<= main_~i~0 42), 149532#(<= main_~i~0 39), 149533#(<= main_~i~0 40), 149538#(<= main_~i~0 45), 149539#(<= main_~i~0 46), 149536#(<= main_~i~0 43), 149537#(<= main_~i~0 44), 149542#(<= main_~i~0 49), 149543#(<= main_~i~0 50), 149540#(<= main_~i~0 47), 149541#(<= main_~i~0 48), 149546#(<= main_~i~0 53), 149547#(<= main_~i~0 54), 149544#(<= main_~i~0 51), 149545#(<= main_~i~0 52), 149550#(<= main_~i~0 57), 149551#(<= main_~i~0 58), 149548#(<= main_~i~0 55), 149549#(<= main_~i~0 56), 149554#(<= main_~i~0 61), 149555#(<= main_~i~0 62), 149552#(<= main_~i~0 59), 149553#(<= main_~i~0 60), 149558#(<= main_~i~0 65), 149559#(<= main_~i~0 66), 149556#(<= main_~i~0 63), 149557#(<= main_~i~0 64), 149562#(<= main_~i~0 69), 149563#(<= main_~i~0 70), 149560#(<= main_~i~0 67), 149561#(<= main_~i~0 68), 149566#(<= main_~i~0 73), 149567#(<= main_~i~0 74), 149564#(<= main_~i~0 71), 149565#(<= main_~i~0 72), 149570#(<= main_~i~0 77), 149571#(<= main_~i~0 78), 149568#(<= main_~i~0 75), 149569#(<= main_~i~0 76), 149574#(<= main_~i~0 81), 149575#(<= main_~i~0 82), 149572#(<= main_~i~0 79), 149573#(<= main_~i~0 80), 149578#(<= main_~i~0 85), 149579#(<= main_~i~0 86), 149576#(<= main_~i~0 83), 149577#(<= main_~i~0 84), 149582#(<= main_~i~0 89), 149583#(<= main_~i~0 90), 149580#(<= main_~i~0 87), 149581#(<= main_~i~0 88), 149586#(<= main_~i~0 93), 149587#(<= main_~i~0 94), 149584#(<= main_~i~0 91), 149585#(<= main_~i~0 92), 149590#(<= main_~i~0 97), 149591#(<= main_~i~0 98), 149588#(<= main_~i~0 95), 149589#(<= main_~i~0 96), 149594#(<= main_~i~0 101), 149595#(<= main_~i~0 102), 149592#(<= main_~i~0 99), 149593#(<= main_~i~0 100), 149598#(<= main_~i~0 105), 149599#(<= main_~i~0 106), 149596#(<= main_~i~0 103), 149597#(<= main_~i~0 104), 149602#(<= main_~i~0 109), 149603#(<= main_~i~0 110), 149600#(<= main_~i~0 107), 149601#(<= main_~i~0 108), 149606#(<= main_~i~0 113), 149607#(<= main_~i~0 114), 149604#(<= main_~i~0 111), 149605#(<= main_~i~0 112), 149610#(<= main_~i~0 117), 149611#(<= main_~i~0 118), 149608#(<= main_~i~0 115), 149609#(<= main_~i~0 116), 149614#(<= main_~i~0 121), 149615#(<= main_~i~0 122), 149612#(<= main_~i~0 119), 149613#(<= main_~i~0 120), 149618#(<= main_~i~0 125), 149619#(<= main_~i~0 126), 149616#(<= main_~i~0 123), 149617#(<= main_~i~0 124), 149622#(<= main_~i~0 129), 149623#(<= main_~i~0 130), 149620#(<= main_~i~0 127), 149621#(<= main_~i~0 128), 149626#(<= main_~i~0 133), 149627#(<= main_~i~0 134), 149624#(<= main_~i~0 131), 149625#(<= main_~i~0 132), 149630#(<= main_~i~0 137), 149631#(<= main_~i~0 138), 149628#(<= main_~i~0 135), 149629#(<= main_~i~0 136), 149634#(<= main_~i~0 141), 149635#(<= main_~i~0 142), 149632#(<= main_~i~0 139), 149633#(<= main_~i~0 140), 149638#(<= main_~i~0 145), 149639#(<= main_~i~0 146), 149636#(<= main_~i~0 143), 149637#(<= main_~i~0 144), 149642#(and (<= 0 main_~i~0) (<= main_~i~0 148)), 149643#(and (<= 1 main_~i~0) (<= main_~i~0 149)), 149640#(<= main_~i~0 147), 149641#(<= main_~i~0 148), 149491#true, 149494#(<= main_~i~0 1), 149495#(<= main_~i~0 2), 149492#false, 149493#(<= main_~i~0 0), 149498#(<= main_~i~0 5), 149499#(<= main_~i~0 6), 149496#(<= main_~i~0 3), 149497#(<= main_~i~0 4), 149502#(<= main_~i~0 9), 149503#(<= main_~i~0 10), 149500#(<= main_~i~0 7), 149501#(<= main_~i~0 8)] [2018-04-12 03:17:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 55428 backedges. 0 proven. 55428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:34,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-04-12 03:17:34,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-04-12 03:17:34,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11330, Invalid=11926, Unknown=0, NotChecked=0, Total=23256 [2018-04-12 03:17:34,391 INFO L87 Difference]: Start difference. First operand 758 states and 758 transitions. Second operand 153 states. [2018-04-12 03:17:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:17:40,695 INFO L93 Difference]: Finished difference Result 763 states and 763 transitions. [2018-04-12 03:17:40,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-04-12 03:17:40,695 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 752 [2018-04-12 03:17:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:17:40,695 INFO L225 Difference]: With dead ends: 763 [2018-04-12 03:17:40,696 INFO L226 Difference]: Without dead ends: 763 [2018-04-12 03:17:40,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11323 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=33978, Invalid=56924, Unknown=0, NotChecked=0, Total=90902 [2018-04-12 03:17:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-04-12 03:17:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2018-04-12 03:17:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-04-12 03:17:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 763 transitions. [2018-04-12 03:17:40,700 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 763 transitions. Word has length 752 [2018-04-12 03:17:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:17:40,700 INFO L459 AbstractCegarLoop]: Abstraction has 763 states and 763 transitions. [2018-04-12 03:17:40,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-04-12 03:17:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 763 transitions. [2018-04-12 03:17:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2018-04-12 03:17:40,702 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:17:40,703 INFO L355 BasicCegarLoop]: trace histogram [151, 150, 150, 150, 150, 1, 1, 1, 1, 1, 1] [2018-04-12 03:17:40,703 INFO L408 AbstractCegarLoop]: === Iteration 155 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:17:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash 217003014, now seen corresponding path program 150 times [2018-04-12 03:17:40,703 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:17:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:17:40,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:17:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 56175 backedges. 0 proven. 56175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:47,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:17:47,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-04-12 03:17:47,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:17:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:47,918 INFO L182 omatonBuilderFactory]: Interpolants [151554#(<= main_~i~0 84), 151555#(<= main_~i~0 85), 151552#(<= main_~i~0 82), 151553#(<= main_~i~0 83), 151558#(<= main_~i~0 88), 151559#(<= main_~i~0 89), 151556#(<= main_~i~0 86), 151557#(<= main_~i~0 87), 151562#(<= main_~i~0 92), 151563#(<= main_~i~0 93), 151560#(<= main_~i~0 90), 151561#(<= main_~i~0 91), 151566#(<= main_~i~0 96), 151567#(<= main_~i~0 97), 151564#(<= main_~i~0 94), 151565#(<= main_~i~0 95), 151570#(<= main_~i~0 100), 151571#(<= main_~i~0 101), 151568#(<= main_~i~0 98), 151569#(<= main_~i~0 99), 151574#(<= main_~i~0 104), 151575#(<= main_~i~0 105), 151572#(<= main_~i~0 102), 151573#(<= main_~i~0 103), 151578#(<= main_~i~0 108), 151579#(<= main_~i~0 109), 151576#(<= main_~i~0 106), 151577#(<= main_~i~0 107), 151582#(<= main_~i~0 112), 151583#(<= main_~i~0 113), 151580#(<= main_~i~0 110), 151581#(<= main_~i~0 111), 151586#(<= main_~i~0 116), 151587#(<= main_~i~0 117), 151584#(<= main_~i~0 114), 151585#(<= main_~i~0 115), 151590#(<= main_~i~0 120), 151591#(<= main_~i~0 121), 151588#(<= main_~i~0 118), 151589#(<= main_~i~0 119), 151594#(<= main_~i~0 124), 151595#(<= main_~i~0 125), 151592#(<= main_~i~0 122), 151593#(<= main_~i~0 123), 151598#(<= main_~i~0 128), 151599#(<= main_~i~0 129), 151596#(<= main_~i~0 126), 151597#(<= main_~i~0 127), 151602#(<= main_~i~0 132), 151603#(<= main_~i~0 133), 151600#(<= main_~i~0 130), 151601#(<= main_~i~0 131), 151606#(<= main_~i~0 136), 151607#(<= main_~i~0 137), 151604#(<= main_~i~0 134), 151605#(<= main_~i~0 135), 151610#(<= main_~i~0 140), 151611#(<= main_~i~0 141), 151608#(<= main_~i~0 138), 151609#(<= main_~i~0 139), 151614#(<= main_~i~0 144), 151615#(<= main_~i~0 145), 151612#(<= main_~i~0 142), 151613#(<= main_~i~0 143), 151618#(<= main_~i~0 148), 151619#(and (<= 0 main_~i~0) (<= main_~i~0 148)), 151616#(<= main_~i~0 146), 151617#(<= main_~i~0 147), 151620#(and (<= 1 main_~i~0) (<= main_~i~0 149)), 151621#(and (<= 2 main_~i~0) (<= main_~i~0 150)), 151470#(<= main_~i~0 0), 151471#(<= main_~i~0 1), 151468#true, 151469#false, 151474#(<= main_~i~0 4), 151475#(<= main_~i~0 5), 151472#(<= main_~i~0 2), 151473#(<= main_~i~0 3), 151478#(<= main_~i~0 8), 151479#(<= main_~i~0 9), 151476#(<= main_~i~0 6), 151477#(<= main_~i~0 7), 151482#(<= main_~i~0 12), 151483#(<= main_~i~0 13), 151480#(<= main_~i~0 10), 151481#(<= main_~i~0 11), 151486#(<= main_~i~0 16), 151487#(<= main_~i~0 17), 151484#(<= main_~i~0 14), 151485#(<= main_~i~0 15), 151490#(<= main_~i~0 20), 151491#(<= main_~i~0 21), 151488#(<= main_~i~0 18), 151489#(<= main_~i~0 19), 151494#(<= main_~i~0 24), 151495#(<= main_~i~0 25), 151492#(<= main_~i~0 22), 151493#(<= main_~i~0 23), 151498#(<= main_~i~0 28), 151499#(<= main_~i~0 29), 151496#(<= main_~i~0 26), 151497#(<= main_~i~0 27), 151502#(<= main_~i~0 32), 151503#(<= main_~i~0 33), 151500#(<= main_~i~0 30), 151501#(<= main_~i~0 31), 151506#(<= main_~i~0 36), 151507#(<= main_~i~0 37), 151504#(<= main_~i~0 34), 151505#(<= main_~i~0 35), 151510#(<= main_~i~0 40), 151511#(<= main_~i~0 41), 151508#(<= main_~i~0 38), 151509#(<= main_~i~0 39), 151514#(<= main_~i~0 44), 151515#(<= main_~i~0 45), 151512#(<= main_~i~0 42), 151513#(<= main_~i~0 43), 151518#(<= main_~i~0 48), 151519#(<= main_~i~0 49), 151516#(<= main_~i~0 46), 151517#(<= main_~i~0 47), 151522#(<= main_~i~0 52), 151523#(<= main_~i~0 53), 151520#(<= main_~i~0 50), 151521#(<= main_~i~0 51), 151526#(<= main_~i~0 56), 151527#(<= main_~i~0 57), 151524#(<= main_~i~0 54), 151525#(<= main_~i~0 55), 151530#(<= main_~i~0 60), 151531#(<= main_~i~0 61), 151528#(<= main_~i~0 58), 151529#(<= main_~i~0 59), 151534#(<= main_~i~0 64), 151535#(<= main_~i~0 65), 151532#(<= main_~i~0 62), 151533#(<= main_~i~0 63), 151538#(<= main_~i~0 68), 151539#(<= main_~i~0 69), 151536#(<= main_~i~0 66), 151537#(<= main_~i~0 67), 151542#(<= main_~i~0 72), 151543#(<= main_~i~0 73), 151540#(<= main_~i~0 70), 151541#(<= main_~i~0 71), 151546#(<= main_~i~0 76), 151547#(<= main_~i~0 77), 151544#(<= main_~i~0 74), 151545#(<= main_~i~0 75), 151550#(<= main_~i~0 80), 151551#(<= main_~i~0 81), 151548#(<= main_~i~0 78), 151549#(<= main_~i~0 79)] [2018-04-12 03:17:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 56175 backedges. 0 proven. 56175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:17:47,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-04-12 03:17:47,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-04-12 03:17:47,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11332, Invalid=12230, Unknown=0, NotChecked=0, Total=23562 [2018-04-12 03:17:47,921 INFO L87 Difference]: Start difference. First operand 763 states and 763 transitions. Second operand 154 states. [2018-04-12 03:17:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:17:54,870 INFO L93 Difference]: Finished difference Result 768 states and 768 transitions. [2018-04-12 03:17:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-04-12 03:17:54,870 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 757 [2018-04-12 03:17:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:17:54,871 INFO L225 Difference]: With dead ends: 768 [2018-04-12 03:17:54,871 INFO L226 Difference]: Without dead ends: 768 [2018-04-12 03:17:54,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11622 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=34131, Invalid=57981, Unknown=0, NotChecked=0, Total=92112 [2018-04-12 03:17:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-04-12 03:17:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2018-04-12 03:17:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-04-12 03:17:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 768 transitions. [2018-04-12 03:17:54,876 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 768 transitions. Word has length 757 [2018-04-12 03:17:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:17:54,876 INFO L459 AbstractCegarLoop]: Abstraction has 768 states and 768 transitions. [2018-04-12 03:17:54,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-04-12 03:17:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 768 transitions. [2018-04-12 03:17:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2018-04-12 03:17:54,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:17:54,879 INFO L355 BasicCegarLoop]: trace histogram [152, 151, 151, 151, 151, 1, 1, 1, 1, 1, 1] [2018-04-12 03:17:54,879 INFO L408 AbstractCegarLoop]: === Iteration 156 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:17:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2044643511, now seen corresponding path program 151 times [2018-04-12 03:17:54,879 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:17:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:17:54,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-12 03:17:55,870 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-12 03:17:55,873 INFO L168 Benchmark]: Toolchain (without parser) took 764352.79 ms. Allocated memory was 477.1 MB in the beginning and 2.3 GB in the end (delta: 1.8 GB). Free memory was 416.6 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-04-12 03:17:55,874 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 477.1 MB. Free memory is still 441.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 03:17:55,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.79 ms. Allocated memory is still 477.1 MB. Free memory was 416.6 MB in the beginning and 407.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. [2018-04-12 03:17:55,875 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 ms. Allocated memory is still 477.1 MB. Free memory was 407.6 MB in the beginning and 405.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 03:17:55,875 INFO L168 Benchmark]: RCFGBuilder took 219.71 ms. Allocated memory was 477.1 MB in the beginning and 607.1 MB in the end (delta: 130.0 MB). Free memory was 405.0 MB in the beginning and 570.8 MB in the end (delta: -165.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. [2018-04-12 03:17:55,875 INFO L168 Benchmark]: TraceAbstraction took 763946.49 ms. Allocated memory was 607.1 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 570.8 MB in the beginning and 1.5 GB in the end (delta: -939.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-04-12 03:17:55,876 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 477.1 MB. Free memory is still 441.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.79 ms. Allocated memory is still 477.1 MB. Free memory was 416.6 MB in the beginning and 407.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.45 ms. Allocated memory is still 477.1 MB. Free memory was 407.6 MB in the beginning and 405.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 219.71 ms. Allocated memory was 477.1 MB in the beginning and 607.1 MB in the end (delta: 130.0 MB). Free memory was 405.0 MB in the beginning and 570.8 MB in the end (delta: -165.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 763946.49 ms. Allocated memory was 607.1 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 570.8 MB in the beginning and 1.5 GB in the end (delta: -939.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_03-17-55-882.csv Completed graceful shutdown