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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:44:12,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:44:12,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:44:12,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:44:12,189 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:44:12,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:44:12,191 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:44:12,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:44:12,194 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:44:12,195 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:44:12,196 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:44:12,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:44:12,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:44:12,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:44:12,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:44:12,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:44:12,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:44:12,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:44:12,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:44:12,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:44:12,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:44:12,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:44:12,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:44:12,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:44:12,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:44:12,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:44:12,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:44:12,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:44:12,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:44:12,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:44:12,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:44:12,212 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-10 15:44:12,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:44:12,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:44:12,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:44:12,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:44:12,229 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:44:12,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:44:12,230 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:44:12,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:44:12,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:44:12,230 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:44:12,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:44:12,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:44:12,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:44:12,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-04-10 15:44:12,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:44:12,266 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:44:12,270 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:44:12,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:44:12,272 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:44:12,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-04-10 15:44:12,586 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0fe3a3e2a [2018-04-10 15:44:12,682 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:44:12,682 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:44:12,683 INFO L168 CDTParser]: Scanning array3_false-valid-deref.i [2018-04-10 15:44:12,684 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:44:12,684 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:44:12,684 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:44:12,684 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in array3_false-valid-deref.i [2018-04-10 15:44:12,684 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in array3_false-valid-deref.i [2018-04-10 15:44:12,684 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:44:12,684 INFO L233 ultiparseSymbolTable]: [2018-04-10 15:44:12,698 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0fe3a3e2a [2018-04-10 15:44:12,700 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:44:12,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:44:12,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:44:12,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:44:12,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:44:12,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ecbfaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12, skipping insertion in model container [2018-04-10 15:44:12,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,719 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:44:12,728 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:44:12,819 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:44:12,831 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:44:12,834 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 6 non ball SCCs. Number of states in SCCs 6. [2018-04-10 15:44:12,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12 WrapperNode [2018-04-10 15:44:12,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:44:12,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:44:12,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:44:12,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:44:12,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (1/1) ... [2018-04-10 15:44:12,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:44:12,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:44:12,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:44:12,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:44:12,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (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-10 15:44:12,896 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:44:12,896 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:44:12,896 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-10 15:44:12,896 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:44:12,896 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:44:12,896 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 15:44:12,896 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-10 15:44:12,896 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:44:12,897 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:44:12,897 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:44:13,043 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:44:13,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:44:13 BoogieIcfgContainer [2018-04-10 15:44:13,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:44:13,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:44:13,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:44:13,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:44:13,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:44:12" (1/3) ... [2018-04-10 15:44:13,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7862832f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:44:13, skipping insertion in model container [2018-04-10 15:44:13,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:12" (2/3) ... [2018-04-10 15:44:13,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7862832f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:44:13, skipping insertion in model container [2018-04-10 15:44:13,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:44:13" (3/3) ... [2018-04-10 15:44:13,049 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-04-10 15:44:13,057 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:44:13,062 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-04-10 15:44:13,084 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:44:13,084 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:44:13,084 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:44:13,084 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-10 15:44:13,084 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-10 15:44:13,084 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:44:13,085 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:44:13,085 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:44:13,085 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:44:13,085 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:44:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-04-10 15:44:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 15:44:13,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:13,104 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:13,104 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1214141712, now seen corresponding path program 1 times [2018-04-10 15:44:13,145 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:13,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:13,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-10 15:44:13,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:13,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:44:13,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:13,234 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-10 15:44:13,234 INFO L182 omatonBuilderFactory]: Interpolants [32#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 33#(and (<= main_~i~0 1023) (<= 0 main_~i~0)), 30#true, 31#false] [2018-04-10 15:44:13,234 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-10 15:44:13,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:44:13,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:44:13,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:44:13,247 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-04-10 15:44:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:13,307 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-10 15:44:13,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:44:13,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 15:44:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:13,314 INFO L225 Difference]: With dead ends: 44 [2018-04-10 15:44:13,314 INFO L226 Difference]: Without dead ends: 31 [2018-04-10 15:44:13,316 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:44:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-10 15:44:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-10 15:44:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-10 15:44:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-10 15:44:13,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2018-04-10 15:44:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:13,339 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-10 15:44:13,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:44:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-10 15:44:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 15:44:13,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:13,340 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:13,340 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1902176386, now seen corresponding path program 1 times [2018-04-10 15:44:13,341 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:13,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 15:44:13,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:13,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:44:13,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:13,399 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-10 15:44:13,400 INFO L182 omatonBuilderFactory]: Interpolants [112#(<= 1 main_~i~0), 113#(and (<= main_~i~0 1023) (<= 1 main_~i~0)), 109#true, 110#false, 111#(<= 0 main_~i~0)] [2018-04-10 15:44:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 15:44:13,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:13,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:13,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:13,402 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-04-10 15:44:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:13,453 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-04-10 15:44:13,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:44:13,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 15:44:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:13,455 INFO L225 Difference]: With dead ends: 30 [2018-04-10 15:44:13,455 INFO L226 Difference]: Without dead ends: 30 [2018-04-10 15:44:13,456 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-04-10 15:44:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-04-10 15:44:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-04-10 15:44:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-04-10 15:44:13,459 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2018-04-10 15:44:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:13,459 INFO L459 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-04-10 15:44:13,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-04-10 15:44:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 15:44:13,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:13,461 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:13,461 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1035544172, now seen corresponding path program 1 times [2018-04-10 15:44:13,462 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:13,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:13,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 15:44:13,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:13,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-10 15:44:13,524 INFO L182 omatonBuilderFactory]: Interpolants [176#(<= main_~i~0 1), 177#(<= main_~i~0 2), 173#true, 174#false, 175#(<= main_~i~0 0)] [2018-04-10 15:44:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:13,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:13,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:13,525 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-04-10 15:44:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:13,571 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-04-10 15:44:13,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:44:13,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 15:44:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:13,572 INFO L225 Difference]: With dead ends: 44 [2018-04-10 15:44:13,572 INFO L226 Difference]: Without dead ends: 44 [2018-04-10 15:44:13,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-10 15:44:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-04-10 15:44:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-10 15:44:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-04-10 15:44:13,576 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-04-10 15:44:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:13,576 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-04-10 15:44:13,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-04-10 15:44:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:44:13,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:13,577 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:13,577 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1402074139, now seen corresponding path program 2 times [2018-04-10 15:44:13,578 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:13,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:13,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 15:44:13,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:13,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-10 15:44:13,618 INFO L182 omatonBuilderFactory]: Interpolants [256#false, 257#(<= main_~i~0 0), 258#(<= main_~i~0 1), 259#(<= main_~i~0 2), 260#(<= main_~i~0 3), 255#true] [2018-04-10 15:44:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:44:13,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:44:13,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:44:13,619 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-04-10 15:44:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:13,665 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-10 15:44:13,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:44:13,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-10 15:44:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:13,666 INFO L225 Difference]: With dead ends: 53 [2018-04-10 15:44:13,666 INFO L226 Difference]: Without dead ends: 53 [2018-04-10 15:44:13,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:44:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-10 15:44:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-04-10 15:44:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-10 15:44:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-04-10 15:44:13,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2018-04-10 15:44:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:13,669 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-04-10 15:44:13,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:44:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-04-10 15:44:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 15:44:13,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:13,670 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:13,670 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1121029342, now seen corresponding path program 3 times [2018-04-10 15:44:13,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:13,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:13,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 15:44:13,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:13,738 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-10 15:44:13,738 INFO L182 omatonBuilderFactory]: Interpolants [352#false, 353#(<= main_~i~0 0), 354#(<= main_~i~0 1), 355#(<= main_~i~0 2), 356#(<= main_~i~0 3), 357#(<= main_~i~0 4), 351#true] [2018-04-10 15:44:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:44:13,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:44:13,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:44:13,739 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 7 states. [2018-04-10 15:44:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:13,780 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-04-10 15:44:13,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:44:13,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-04-10 15:44:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:13,781 INFO L225 Difference]: With dead ends: 62 [2018-04-10 15:44:13,782 INFO L226 Difference]: Without dead ends: 62 [2018-04-10 15:44:13,782 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:44:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-10 15:44:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2018-04-10 15:44:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-10 15:44:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-04-10 15:44:13,786 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2018-04-10 15:44:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:13,786 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-04-10 15:44:13,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:44:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-04-10 15:44:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 15:44:13,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:13,787 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:13,787 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash 153741655, now seen corresponding path program 4 times [2018-04-10 15:44:13,788 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:13,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:13,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 15:44:13,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:13,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-10 15:44:13,849 INFO L182 omatonBuilderFactory]: Interpolants [464#(<= main_~i~0 1), 465#(<= main_~i~0 2), 466#(<= main_~i~0 3), 467#(<= main_~i~0 4), 468#(<= main_~i~0 5), 461#true, 462#false, 463#(<= main_~i~0 0)] [2018-04-10 15:44:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:44:13,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:44:13,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:44:13,850 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 8 states. [2018-04-10 15:44:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:13,910 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-04-10 15:44:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:44:13,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-04-10 15:44:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:13,912 INFO L225 Difference]: With dead ends: 71 [2018-04-10 15:44:13,913 INFO L226 Difference]: Without dead ends: 71 [2018-04-10 15:44:13,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:44:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-10 15:44:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-04-10 15:44:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-10 15:44:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-04-10 15:44:13,918 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-04-10 15:44:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:13,918 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-04-10 15:44:13,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:44:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-04-10 15:44:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 15:44:13,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:13,920 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:13,920 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -90349232, now seen corresponding path program 5 times [2018-04-10 15:44:13,921 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:13,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:13,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 15:44:13,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:13,980 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-10 15:44:13,981 INFO L182 omatonBuilderFactory]: Interpolants [592#(<= main_~i~0 5), 593#(<= main_~i~0 6), 585#true, 586#false, 587#(<= main_~i~0 0), 588#(<= main_~i~0 1), 589#(<= main_~i~0 2), 590#(<= main_~i~0 3), 591#(<= main_~i~0 4)] [2018-04-10 15:44:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:13,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:44:13,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:44:13,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:44:13,982 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 9 states. [2018-04-10 15:44:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:14,065 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-04-10 15:44:14,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:44:14,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-10 15:44:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:14,067 INFO L225 Difference]: With dead ends: 80 [2018-04-10 15:44:14,067 INFO L226 Difference]: Without dead ends: 80 [2018-04-10 15:44:14,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:44:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-10 15:44:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2018-04-10 15:44:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 15:44:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-04-10 15:44:14,069 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-04-10 15:44:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:14,070 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-04-10 15:44:14,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:44:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-04-10 15:44:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-10 15:44:14,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:14,070 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:14,071 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1791871799, now seen corresponding path program 6 times [2018-04-10 15:44:14,071 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:14,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:14,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 15:44:14,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:14,157 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-10 15:44:14,157 INFO L182 omatonBuilderFactory]: Interpolants [723#true, 724#false, 725#(<= main_~i~0 0), 726#(<= main_~i~0 1), 727#(<= main_~i~0 2), 728#(<= main_~i~0 3), 729#(<= main_~i~0 4), 730#(<= main_~i~0 5), 731#(<= main_~i~0 6), 732#(<= main_~i~0 7)] [2018-04-10 15:44:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:44:14,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:44:14,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:44:14,157 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2018-04-10 15:44:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:14,263 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-04-10 15:44:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:44:14,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-04-10 15:44:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:14,264 INFO L225 Difference]: With dead ends: 89 [2018-04-10 15:44:14,264 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 15:44:14,264 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:44:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 15:44:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 53. [2018-04-10 15:44:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-10 15:44:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-04-10 15:44:14,272 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2018-04-10 15:44:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:14,272 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-04-10 15:44:14,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:44:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-04-10 15:44:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 15:44:14,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:14,273 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:14,273 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1775150018, now seen corresponding path program 7 times [2018-04-10 15:44:14,274 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:14,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:14,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 15:44:14,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:14,360 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-10 15:44:14,360 INFO L182 omatonBuilderFactory]: Interpolants [880#(<= main_~i~0 3), 881#(<= main_~i~0 4), 882#(<= main_~i~0 5), 883#(<= main_~i~0 6), 884#(<= main_~i~0 7), 885#(<= main_~i~0 8), 875#true, 876#false, 877#(<= main_~i~0 0), 878#(<= main_~i~0 1), 879#(<= main_~i~0 2)] [2018-04-10 15:44:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:44:14,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:44:14,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:44:14,361 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 11 states. [2018-04-10 15:44:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:14,446 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-04-10 15:44:14,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:44:14,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-04-10 15:44:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:14,447 INFO L225 Difference]: With dead ends: 98 [2018-04-10 15:44:14,447 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 15:44:14,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:44:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 15:44:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 57. [2018-04-10 15:44:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-10 15:44:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-04-10 15:44:14,451 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2018-04-10 15:44:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:14,452 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-04-10 15:44:14,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:44:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-04-10 15:44:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 15:44:14,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:14,453 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:14,453 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1405555141, now seen corresponding path program 8 times [2018-04-10 15:44:14,454 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:14,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:14,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 15:44:14,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:14,561 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-10 15:44:14,561 INFO L182 omatonBuilderFactory]: Interpolants [1041#true, 1042#false, 1043#(<= main_~i~0 0), 1044#(<= main_~i~0 1), 1045#(<= main_~i~0 2), 1046#(<= main_~i~0 3), 1047#(<= main_~i~0 4), 1048#(<= main_~i~0 5), 1049#(<= main_~i~0 6), 1050#(<= main_~i~0 7), 1051#(<= main_~i~0 8), 1052#(<= main_~i~0 9)] [2018-04-10 15:44:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 15:44:14,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 15:44:14,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-10 15:44:14,562 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2018-04-10 15:44:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:14,645 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-04-10 15:44:14,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:44:14,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-10 15:44:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:14,646 INFO L225 Difference]: With dead ends: 107 [2018-04-10 15:44:14,646 INFO L226 Difference]: Without dead ends: 107 [2018-04-10 15:44:14,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-10 15:44:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-10 15:44:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 61. [2018-04-10 15:44:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-10 15:44:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-04-10 15:44:14,649 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2018-04-10 15:44:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:14,650 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-04-10 15:44:14,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 15:44:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-04-10 15:44:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 15:44:14,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:14,650 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:14,651 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:14,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1021881292, now seen corresponding path program 9 times [2018-04-10 15:44:14,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:14,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:14,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 15:44:14,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:14,742 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-10 15:44:14,742 INFO L182 omatonBuilderFactory]: Interpolants [1221#true, 1222#false, 1223#(<= main_~i~0 0), 1224#(<= main_~i~0 1), 1225#(<= main_~i~0 2), 1226#(<= main_~i~0 3), 1227#(<= main_~i~0 4), 1228#(<= main_~i~0 5), 1229#(<= main_~i~0 6), 1230#(<= main_~i~0 7), 1231#(<= main_~i~0 8), 1232#(<= main_~i~0 9), 1233#(<= main_~i~0 10)] [2018-04-10 15:44:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:44:14,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:44:14,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:44:14,743 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 13 states. [2018-04-10 15:44:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:14,825 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-04-10 15:44:14,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:44:14,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-04-10 15:44:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:14,826 INFO L225 Difference]: With dead ends: 116 [2018-04-10 15:44:14,826 INFO L226 Difference]: Without dead ends: 116 [2018-04-10 15:44:14,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:44:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-10 15:44:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 65. [2018-04-10 15:44:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 15:44:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-04-10 15:44:14,830 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2018-04-10 15:44:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:14,831 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-04-10 15:44:14,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:44:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-04-10 15:44:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 15:44:14,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:14,832 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:14,832 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash -672131667, now seen corresponding path program 10 times [2018-04-10 15:44:14,833 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:14,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:14,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 15:44:14,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:14,958 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-10 15:44:14,958 INFO L182 omatonBuilderFactory]: Interpolants [1415#true, 1416#false, 1417#(<= main_~i~0 0), 1418#(<= main_~i~0 1), 1419#(<= main_~i~0 2), 1420#(<= main_~i~0 3), 1421#(<= main_~i~0 4), 1422#(<= main_~i~0 5), 1423#(<= main_~i~0 6), 1424#(<= main_~i~0 7), 1425#(<= main_~i~0 8), 1426#(<= main_~i~0 9), 1427#(<= main_~i~0 10), 1428#(<= main_~i~0 11)] [2018-04-10 15:44:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:14,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 15:44:14,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 15:44:14,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:44:14,959 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2018-04-10 15:44:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:15,027 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-04-10 15:44:15,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:44:15,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-04-10 15:44:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:15,028 INFO L225 Difference]: With dead ends: 125 [2018-04-10 15:44:15,028 INFO L226 Difference]: Without dead ends: 125 [2018-04-10 15:44:15,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:44:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-10 15:44:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 69. [2018-04-10 15:44:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-10 15:44:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-04-10 15:44:15,031 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2018-04-10 15:44:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:15,031 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-04-10 15:44:15,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 15:44:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-04-10 15:44:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 15:44:15,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:15,032 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:15,032 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1730769574, now seen corresponding path program 11 times [2018-04-10 15:44:15,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:15,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:15,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 15:44:15,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:15,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-10 15:44:15,135 INFO L182 omatonBuilderFactory]: Interpolants [1632#(<= main_~i~0 7), 1633#(<= main_~i~0 8), 1634#(<= main_~i~0 9), 1635#(<= main_~i~0 10), 1636#(<= main_~i~0 11), 1637#(<= main_~i~0 12), 1623#true, 1624#false, 1625#(<= main_~i~0 0), 1626#(<= main_~i~0 1), 1627#(<= main_~i~0 2), 1628#(<= main_~i~0 3), 1629#(<= main_~i~0 4), 1630#(<= main_~i~0 5), 1631#(<= main_~i~0 6)] [2018-04-10 15:44:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 15:44:15,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 15:44:15,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:44:15,136 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 15 states. [2018-04-10 15:44:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:15,208 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-04-10 15:44:15,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 15:44:15,208 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-04-10 15:44:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:15,209 INFO L225 Difference]: With dead ends: 134 [2018-04-10 15:44:15,209 INFO L226 Difference]: Without dead ends: 134 [2018-04-10 15:44:15,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:44:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-10 15:44:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 73. [2018-04-10 15:44:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-10 15:44:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-04-10 15:44:15,211 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2018-04-10 15:44:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:15,211 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-04-10 15:44:15,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 15:44:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-04-10 15:44:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 15:44:15,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:15,212 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:15,212 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash -804672737, now seen corresponding path program 12 times [2018-04-10 15:44:15,213 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:15,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:15,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 15:44:15,339 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:15,339 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-10 15:44:15,339 INFO L182 omatonBuilderFactory]: Interpolants [1856#(<= main_~i~0 9), 1857#(<= main_~i~0 10), 1858#(<= main_~i~0 11), 1859#(<= main_~i~0 12), 1860#(<= main_~i~0 13), 1845#true, 1846#false, 1847#(<= main_~i~0 0), 1848#(<= main_~i~0 1), 1849#(<= main_~i~0 2), 1850#(<= main_~i~0 3), 1851#(<= main_~i~0 4), 1852#(<= main_~i~0 5), 1853#(<= main_~i~0 6), 1854#(<= main_~i~0 7), 1855#(<= main_~i~0 8)] [2018-04-10 15:44:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:44:15,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:44:15,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:44:15,340 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2018-04-10 15:44:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:15,457 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-04-10 15:44:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:44:15,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-04-10 15:44:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:15,458 INFO L225 Difference]: With dead ends: 143 [2018-04-10 15:44:15,458 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 15:44:15,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:44:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 15:44:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 77. [2018-04-10 15:44:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-10 15:44:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-04-10 15:44:15,462 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 72 [2018-04-10 15:44:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:15,462 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-04-10 15:44:15,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:44:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-04-10 15:44:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-10 15:44:15,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:15,463 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:15,463 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash -457769192, now seen corresponding path program 13 times [2018-04-10 15:44:15,464 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:15,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:15,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 15:44:15,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:15,621 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-10 15:44:15,621 INFO L182 omatonBuilderFactory]: Interpolants [2081#true, 2082#false, 2083#(<= main_~i~0 0), 2084#(<= main_~i~0 1), 2085#(<= main_~i~0 2), 2086#(<= main_~i~0 3), 2087#(<= main_~i~0 4), 2088#(<= main_~i~0 5), 2089#(<= main_~i~0 6), 2090#(<= main_~i~0 7), 2091#(<= main_~i~0 8), 2092#(<= main_~i~0 9), 2093#(<= main_~i~0 10), 2094#(<= main_~i~0 11), 2095#(<= main_~i~0 12), 2096#(<= main_~i~0 13), 2097#(<= main_~i~0 14)] [2018-04-10 15:44:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:44:15,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:44:15,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:44:15,622 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 17 states. [2018-04-10 15:44:15,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:15,701 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-04-10 15:44:15,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 15:44:15,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-04-10 15:44:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:15,702 INFO L225 Difference]: With dead ends: 152 [2018-04-10 15:44:15,702 INFO L226 Difference]: Without dead ends: 152 [2018-04-10 15:44:15,703 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:44:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-10 15:44:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 81. [2018-04-10 15:44:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 15:44:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-04-10 15:44:15,704 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2018-04-10 15:44:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:15,704 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-04-10 15:44:15,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:44:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-04-10 15:44:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-10 15:44:15,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:15,705 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:15,705 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2050469521, now seen corresponding path program 14 times [2018-04-10 15:44:15,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:15,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:15,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 15:44:15,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:15,840 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-10 15:44:15,840 INFO L182 omatonBuilderFactory]: Interpolants [2336#(<= main_~i~0 3), 2337#(<= main_~i~0 4), 2338#(<= main_~i~0 5), 2339#(<= main_~i~0 6), 2340#(<= main_~i~0 7), 2341#(<= main_~i~0 8), 2342#(<= main_~i~0 9), 2343#(<= main_~i~0 10), 2344#(<= main_~i~0 11), 2345#(<= main_~i~0 12), 2346#(<= main_~i~0 13), 2347#(<= main_~i~0 14), 2348#(<= main_~i~0 15), 2331#true, 2332#false, 2333#(<= main_~i~0 0), 2334#(<= main_~i~0 1), 2335#(<= main_~i~0 2)] [2018-04-10 15:44:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:15,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:44:15,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:44:15,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:44:15,841 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 18 states. [2018-04-10 15:44:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:15,937 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2018-04-10 15:44:15,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:44:15,937 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2018-04-10 15:44:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:15,937 INFO L225 Difference]: With dead ends: 161 [2018-04-10 15:44:15,938 INFO L226 Difference]: Without dead ends: 161 [2018-04-10 15:44:15,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:44:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-10 15:44:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 85. [2018-04-10 15:44:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-10 15:44:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-10 15:44:15,939 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2018-04-10 15:44:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:15,940 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-10 15:44:15,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:44:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-10 15:44:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 15:44:15,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:15,941 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:15,941 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash -126748278, now seen corresponding path program 15 times [2018-04-10 15:44:15,941 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:15,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:16,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 15:44:16,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:16,062 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-10 15:44:16,062 INFO L182 omatonBuilderFactory]: Interpolants [2595#true, 2596#false, 2597#(<= main_~i~0 0), 2598#(<= main_~i~0 1), 2599#(<= main_~i~0 2), 2600#(<= main_~i~0 3), 2601#(<= main_~i~0 4), 2602#(<= main_~i~0 5), 2603#(<= main_~i~0 6), 2604#(<= main_~i~0 7), 2605#(<= main_~i~0 8), 2606#(<= main_~i~0 9), 2607#(<= main_~i~0 10), 2608#(<= main_~i~0 11), 2609#(<= main_~i~0 12), 2610#(<= main_~i~0 13), 2611#(<= main_~i~0 14), 2612#(<= main_~i~0 15), 2613#(<= main_~i~0 16)] [2018-04-10 15:44:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:44:16,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:44:16,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:44:16,062 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 19 states. [2018-04-10 15:44:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:16,155 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-04-10 15:44:16,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 15:44:16,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-04-10 15:44:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:16,156 INFO L225 Difference]: With dead ends: 170 [2018-04-10 15:44:16,156 INFO L226 Difference]: Without dead ends: 170 [2018-04-10 15:44:16,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:44:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-10 15:44:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 89. [2018-04-10 15:44:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-10 15:44:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-04-10 15:44:16,159 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-04-10 15:44:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:16,159 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-04-10 15:44:16,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:44:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-04-10 15:44:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 15:44:16,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:16,160 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:16,160 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash -366206973, now seen corresponding path program 16 times [2018-04-10 15:44:16,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:16,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:16,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 15:44:16,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:16,307 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-10 15:44:16,307 INFO L182 omatonBuilderFactory]: Interpolants [2880#(<= main_~i~0 5), 2881#(<= main_~i~0 6), 2882#(<= main_~i~0 7), 2883#(<= main_~i~0 8), 2884#(<= main_~i~0 9), 2885#(<= main_~i~0 10), 2886#(<= main_~i~0 11), 2887#(<= main_~i~0 12), 2888#(<= main_~i~0 13), 2889#(<= main_~i~0 14), 2890#(<= main_~i~0 15), 2891#(<= main_~i~0 16), 2892#(<= main_~i~0 17), 2873#true, 2874#false, 2875#(<= main_~i~0 0), 2876#(<= main_~i~0 1), 2877#(<= main_~i~0 2), 2878#(<= main_~i~0 3), 2879#(<= main_~i~0 4)] [2018-04-10 15:44:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 15:44:16,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 15:44:16,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-10 15:44:16,308 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 20 states. [2018-04-10 15:44:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:16,417 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2018-04-10 15:44:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 15:44:16,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-04-10 15:44:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:16,419 INFO L225 Difference]: With dead ends: 179 [2018-04-10 15:44:16,419 INFO L226 Difference]: Without dead ends: 179 [2018-04-10 15:44:16,419 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-10 15:44:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-10 15:44:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 93. [2018-04-10 15:44:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-10 15:44:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-04-10 15:44:16,422 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 88 [2018-04-10 15:44:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:16,422 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-04-10 15:44:16,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 15:44:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-04-10 15:44:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-10 15:44:16,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:16,423 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:16,423 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:16,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1928568324, now seen corresponding path program 17 times [2018-04-10 15:44:16,424 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:16,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:16,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 15:44:16,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:16,568 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-10 15:44:16,568 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= main_~i~0 1), 3169#(<= main_~i~0 2), 3170#(<= main_~i~0 3), 3171#(<= main_~i~0 4), 3172#(<= main_~i~0 5), 3173#(<= main_~i~0 6), 3174#(<= main_~i~0 7), 3175#(<= main_~i~0 8), 3176#(<= main_~i~0 9), 3177#(<= main_~i~0 10), 3178#(<= main_~i~0 11), 3179#(<= main_~i~0 12), 3180#(<= main_~i~0 13), 3181#(<= main_~i~0 14), 3182#(<= main_~i~0 15), 3183#(<= main_~i~0 16), 3184#(<= main_~i~0 17), 3185#(<= main_~i~0 18), 3165#true, 3166#false, 3167#(<= main_~i~0 0)] [2018-04-10 15:44:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 15:44:16,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 15:44:16,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:44:16,569 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 21 states. [2018-04-10 15:44:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:16,698 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-04-10 15:44:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:44:16,698 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-04-10 15:44:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:16,699 INFO L225 Difference]: With dead ends: 188 [2018-04-10 15:44:16,699 INFO L226 Difference]: Without dead ends: 188 [2018-04-10 15:44:16,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:44:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-10 15:44:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 97. [2018-04-10 15:44:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-10 15:44:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-04-10 15:44:16,702 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2018-04-10 15:44:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:16,702 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-04-10 15:44:16,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 15:44:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-04-10 15:44:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-10 15:44:16,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:16,703 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:16,703 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1637416821, now seen corresponding path program 18 times [2018-04-10 15:44:16,703 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:16,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:16,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 15:44:16,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:16,884 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-10 15:44:16,884 INFO L182 omatonBuilderFactory]: Interpolants [3488#(<= main_~i~0 15), 3489#(<= main_~i~0 16), 3490#(<= main_~i~0 17), 3491#(<= main_~i~0 18), 3492#(<= main_~i~0 19), 3471#true, 3472#false, 3473#(<= main_~i~0 0), 3474#(<= main_~i~0 1), 3475#(<= main_~i~0 2), 3476#(<= main_~i~0 3), 3477#(<= main_~i~0 4), 3478#(<= main_~i~0 5), 3479#(<= main_~i~0 6), 3480#(<= main_~i~0 7), 3481#(<= main_~i~0 8), 3482#(<= main_~i~0 9), 3483#(<= main_~i~0 10), 3484#(<= main_~i~0 11), 3485#(<= main_~i~0 12), 3486#(<= main_~i~0 13), 3487#(<= main_~i~0 14)] [2018-04-10 15:44:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:16,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 15:44:16,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 15:44:16,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:44:16,885 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 22 states. [2018-04-10 15:44:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:17,001 INFO L93 Difference]: Finished difference Result 197 states and 215 transitions. [2018-04-10 15:44:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:44:17,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2018-04-10 15:44:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:17,002 INFO L225 Difference]: With dead ends: 197 [2018-04-10 15:44:17,002 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 15:44:17,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:44:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 15:44:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 101. [2018-04-10 15:44:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-10 15:44:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-04-10 15:44:17,004 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 96 [2018-04-10 15:44:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:17,005 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-04-10 15:44:17,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 15:44:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-04-10 15:44:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-10 15:44:17,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:17,006 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:17,006 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:17,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1153943442, now seen corresponding path program 19 times [2018-04-10 15:44:17,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:17,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:17,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:17,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 15:44:17,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:17,182 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-10 15:44:17,182 INFO L182 omatonBuilderFactory]: Interpolants [3808#(<= main_~i~0 15), 3809#(<= main_~i~0 16), 3810#(<= main_~i~0 17), 3811#(<= main_~i~0 18), 3812#(<= main_~i~0 19), 3813#(<= main_~i~0 20), 3791#true, 3792#false, 3793#(<= main_~i~0 0), 3794#(<= main_~i~0 1), 3795#(<= main_~i~0 2), 3796#(<= main_~i~0 3), 3797#(<= main_~i~0 4), 3798#(<= main_~i~0 5), 3799#(<= main_~i~0 6), 3800#(<= main_~i~0 7), 3801#(<= main_~i~0 8), 3802#(<= main_~i~0 9), 3803#(<= main_~i~0 10), 3804#(<= main_~i~0 11), 3805#(<= main_~i~0 12), 3806#(<= main_~i~0 13), 3807#(<= main_~i~0 14)] [2018-04-10 15:44:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:17,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:44:17,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:44:17,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:44:17,183 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 23 states. [2018-04-10 15:44:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:17,308 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2018-04-10 15:44:17,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:44:17,308 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-04-10 15:44:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:17,309 INFO L225 Difference]: With dead ends: 206 [2018-04-10 15:44:17,309 INFO L226 Difference]: Without dead ends: 206 [2018-04-10 15:44:17,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:44:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-10 15:44:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 105. [2018-04-10 15:44:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-10 15:44:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-04-10 15:44:17,312 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2018-04-10 15:44:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:17,312 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-04-10 15:44:17,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:44:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-04-10 15:44:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-10 15:44:17,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:17,313 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:17,313 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1345342695, now seen corresponding path program 20 times [2018-04-10 15:44:17,313 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:17,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:17,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:17,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 15:44:17,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:17,518 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-10 15:44:17,518 INFO L182 omatonBuilderFactory]: Interpolants [4128#(<= main_~i~0 1), 4129#(<= main_~i~0 2), 4130#(<= main_~i~0 3), 4131#(<= main_~i~0 4), 4132#(<= main_~i~0 5), 4133#(<= main_~i~0 6), 4134#(<= main_~i~0 7), 4135#(<= main_~i~0 8), 4136#(<= main_~i~0 9), 4137#(<= main_~i~0 10), 4138#(<= main_~i~0 11), 4139#(<= main_~i~0 12), 4140#(<= main_~i~0 13), 4141#(<= main_~i~0 14), 4142#(<= main_~i~0 15), 4143#(<= main_~i~0 16), 4144#(<= main_~i~0 17), 4145#(<= main_~i~0 18), 4146#(<= main_~i~0 19), 4147#(<= main_~i~0 20), 4148#(<= main_~i~0 21), 4125#true, 4126#false, 4127#(<= main_~i~0 0)] [2018-04-10 15:44:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:17,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 15:44:17,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 15:44:17,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:44:17,519 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 24 states. [2018-04-10 15:44:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:17,630 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2018-04-10 15:44:17,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 15:44:17,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 104 [2018-04-10 15:44:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:17,631 INFO L225 Difference]: With dead ends: 215 [2018-04-10 15:44:17,631 INFO L226 Difference]: Without dead ends: 215 [2018-04-10 15:44:17,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:44:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-10 15:44:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 109. [2018-04-10 15:44:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-10 15:44:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-04-10 15:44:17,635 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2018-04-10 15:44:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:17,635 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-04-10 15:44:17,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 15:44:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-04-10 15:44:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-10 15:44:17,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:17,636 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:17,636 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:17,637 INFO L82 PathProgramCache]: Analyzing trace with hash -911770400, now seen corresponding path program 21 times [2018-04-10 15:44:17,637 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:17,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:17,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:17,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 15:44:17,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:17,847 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-10 15:44:17,847 INFO L182 omatonBuilderFactory]: Interpolants [4480#(<= main_~i~0 5), 4481#(<= main_~i~0 6), 4482#(<= main_~i~0 7), 4483#(<= main_~i~0 8), 4484#(<= main_~i~0 9), 4485#(<= main_~i~0 10), 4486#(<= main_~i~0 11), 4487#(<= main_~i~0 12), 4488#(<= main_~i~0 13), 4489#(<= main_~i~0 14), 4490#(<= main_~i~0 15), 4491#(<= main_~i~0 16), 4492#(<= main_~i~0 17), 4493#(<= main_~i~0 18), 4494#(<= main_~i~0 19), 4495#(<= main_~i~0 20), 4496#(<= main_~i~0 21), 4497#(<= main_~i~0 22), 4473#true, 4474#false, 4475#(<= main_~i~0 0), 4476#(<= main_~i~0 1), 4477#(<= main_~i~0 2), 4478#(<= main_~i~0 3), 4479#(<= main_~i~0 4)] [2018-04-10 15:44:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:17,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:44:17,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:44:17,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:44:17,848 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 25 states. [2018-04-10 15:44:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:17,965 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2018-04-10 15:44:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:44:17,965 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 108 [2018-04-10 15:44:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:17,966 INFO L225 Difference]: With dead ends: 224 [2018-04-10 15:44:17,966 INFO L226 Difference]: Without dead ends: 224 [2018-04-10 15:44:17,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:44:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-10 15:44:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 113. [2018-04-10 15:44:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-10 15:44:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-04-10 15:44:17,969 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 108 [2018-04-10 15:44:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:17,969 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-04-10 15:44:17,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:44:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-04-10 15:44:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-10 15:44:17,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:17,969 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:17,969 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:17,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1403258969, now seen corresponding path program 22 times [2018-04-10 15:44:17,970 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:17,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:18,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:18,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 15:44:18,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:18,188 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-10 15:44:18,188 INFO L182 omatonBuilderFactory]: Interpolants [4835#true, 4836#false, 4837#(<= main_~i~0 0), 4838#(<= main_~i~0 1), 4839#(<= main_~i~0 2), 4840#(<= main_~i~0 3), 4841#(<= main_~i~0 4), 4842#(<= main_~i~0 5), 4843#(<= main_~i~0 6), 4844#(<= main_~i~0 7), 4845#(<= main_~i~0 8), 4846#(<= main_~i~0 9), 4847#(<= main_~i~0 10), 4848#(<= main_~i~0 11), 4849#(<= main_~i~0 12), 4850#(<= main_~i~0 13), 4851#(<= main_~i~0 14), 4852#(<= main_~i~0 15), 4853#(<= main_~i~0 16), 4854#(<= main_~i~0 17), 4855#(<= main_~i~0 18), 4856#(<= main_~i~0 19), 4857#(<= main_~i~0 20), 4858#(<= main_~i~0 21), 4859#(<= main_~i~0 22), 4860#(<= main_~i~0 23)] [2018-04-10 15:44:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:18,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:44:18,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:44:18,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:44:18,189 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 26 states. [2018-04-10 15:44:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:18,317 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-04-10 15:44:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 15:44:18,317 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2018-04-10 15:44:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:18,318 INFO L225 Difference]: With dead ends: 233 [2018-04-10 15:44:18,318 INFO L226 Difference]: Without dead ends: 233 [2018-04-10 15:44:18,318 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:44:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-10 15:44:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 117. [2018-04-10 15:44:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-10 15:44:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-04-10 15:44:18,320 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 112 [2018-04-10 15:44:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:18,320 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-04-10 15:44:18,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:44:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-04-10 15:44:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-04-10 15:44:18,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:18,320 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:18,321 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 755773266, now seen corresponding path program 23 times [2018-04-10 15:44:18,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:18,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:18,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:18,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 15:44:18,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:18,595 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-10 15:44:18,595 INFO L182 omatonBuilderFactory]: Interpolants [5211#true, 5212#false, 5213#(<= main_~i~0 0), 5214#(<= main_~i~0 1), 5215#(<= main_~i~0 2), 5216#(<= main_~i~0 3), 5217#(<= main_~i~0 4), 5218#(<= main_~i~0 5), 5219#(<= main_~i~0 6), 5220#(<= main_~i~0 7), 5221#(<= main_~i~0 8), 5222#(<= main_~i~0 9), 5223#(<= main_~i~0 10), 5224#(<= main_~i~0 11), 5225#(<= main_~i~0 12), 5226#(<= main_~i~0 13), 5227#(<= main_~i~0 14), 5228#(<= main_~i~0 15), 5229#(<= main_~i~0 16), 5230#(<= main_~i~0 17), 5231#(<= main_~i~0 18), 5232#(<= main_~i~0 19), 5233#(<= main_~i~0 20), 5234#(<= main_~i~0 21), 5235#(<= main_~i~0 22), 5236#(<= main_~i~0 23), 5237#(<= main_~i~0 24)] [2018-04-10 15:44:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:18,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 15:44:18,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 15:44:18,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:44:18,597 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 27 states. [2018-04-10 15:44:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:18,811 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-10 15:44:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:44:18,811 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 116 [2018-04-10 15:44:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:18,812 INFO L225 Difference]: With dead ends: 242 [2018-04-10 15:44:18,813 INFO L226 Difference]: Without dead ends: 242 [2018-04-10 15:44:18,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:44:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-10 15:44:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 121. [2018-04-10 15:44:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-10 15:44:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-04-10 15:44:18,815 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2018-04-10 15:44:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:18,816 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-04-10 15:44:18,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 15:44:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-04-10 15:44:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-04-10 15:44:18,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:18,817 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:18,817 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash 933638603, now seen corresponding path program 24 times [2018-04-10 15:44:18,817 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:18,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:19,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:19,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 15:44:19,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:19,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-10 15:44:19,108 INFO L182 omatonBuilderFactory]: Interpolants [5601#true, 5602#false, 5603#(<= main_~i~0 0), 5604#(<= main_~i~0 1), 5605#(<= main_~i~0 2), 5606#(<= main_~i~0 3), 5607#(<= main_~i~0 4), 5608#(<= main_~i~0 5), 5609#(<= main_~i~0 6), 5610#(<= main_~i~0 7), 5611#(<= main_~i~0 8), 5612#(<= main_~i~0 9), 5613#(<= main_~i~0 10), 5614#(<= main_~i~0 11), 5615#(<= main_~i~0 12), 5616#(<= main_~i~0 13), 5617#(<= main_~i~0 14), 5618#(<= main_~i~0 15), 5619#(<= main_~i~0 16), 5620#(<= main_~i~0 17), 5621#(<= main_~i~0 18), 5622#(<= main_~i~0 19), 5623#(<= main_~i~0 20), 5624#(<= main_~i~0 21), 5625#(<= main_~i~0 22), 5626#(<= main_~i~0 23), 5627#(<= main_~i~0 24), 5628#(<= main_~i~0 25)] [2018-04-10 15:44:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:19,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 15:44:19,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 15:44:19,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:44:19,110 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 28 states. [2018-04-10 15:44:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:19,308 INFO L93 Difference]: Finished difference Result 251 states and 275 transitions. [2018-04-10 15:44:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:44:19,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 120 [2018-04-10 15:44:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:19,309 INFO L225 Difference]: With dead ends: 251 [2018-04-10 15:44:19,309 INFO L226 Difference]: Without dead ends: 251 [2018-04-10 15:44:19,310 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:44:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-10 15:44:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 125. [2018-04-10 15:44:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-10 15:44:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-04-10 15:44:19,312 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 120 [2018-04-10 15:44:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:19,313 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-04-10 15:44:19,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 15:44:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-04-10 15:44:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-10 15:44:19,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:19,313 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:19,314 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:19,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2011672636, now seen corresponding path program 25 times [2018-04-10 15:44:19,314 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:19,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:19,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:19,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 15:44:19,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:19,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-10 15:44:19,646 INFO L182 omatonBuilderFactory]: Interpolants [6016#(<= main_~i~0 9), 6017#(<= main_~i~0 10), 6018#(<= main_~i~0 11), 6019#(<= main_~i~0 12), 6020#(<= main_~i~0 13), 6021#(<= main_~i~0 14), 6022#(<= main_~i~0 15), 6023#(<= main_~i~0 16), 6024#(<= main_~i~0 17), 6025#(<= main_~i~0 18), 6026#(<= main_~i~0 19), 6027#(<= main_~i~0 20), 6028#(<= main_~i~0 21), 6029#(<= main_~i~0 22), 6030#(<= main_~i~0 23), 6031#(<= main_~i~0 24), 6032#(<= main_~i~0 25), 6033#(<= main_~i~0 26), 6005#true, 6006#false, 6007#(<= main_~i~0 0), 6008#(<= main_~i~0 1), 6009#(<= main_~i~0 2), 6010#(<= main_~i~0 3), 6011#(<= main_~i~0 4), 6012#(<= main_~i~0 5), 6013#(<= main_~i~0 6), 6014#(<= main_~i~0 7), 6015#(<= main_~i~0 8)] [2018-04-10 15:44:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:19,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:44:19,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:44:19,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:44:19,647 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 29 states. [2018-04-10 15:44:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:19,864 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2018-04-10 15:44:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 15:44:19,864 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-04-10 15:44:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:19,865 INFO L225 Difference]: With dead ends: 260 [2018-04-10 15:44:19,865 INFO L226 Difference]: Without dead ends: 260 [2018-04-10 15:44:19,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:44:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-10 15:44:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 129. [2018-04-10 15:44:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 15:44:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-04-10 15:44:19,868 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-04-10 15:44:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:19,868 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-04-10 15:44:19,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:44:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-04-10 15:44:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-04-10 15:44:19,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:19,869 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:19,869 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:19,869 INFO L82 PathProgramCache]: Analyzing trace with hash -169293507, now seen corresponding path program 26 times [2018-04-10 15:44:19,870 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:19,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:20,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:20,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 15:44:20,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:20,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-10 15:44:20,225 INFO L182 omatonBuilderFactory]: Interpolants [6423#true, 6424#false, 6425#(<= main_~i~0 0), 6426#(<= main_~i~0 1), 6427#(<= main_~i~0 2), 6428#(<= main_~i~0 3), 6429#(<= main_~i~0 4), 6430#(<= main_~i~0 5), 6431#(<= main_~i~0 6), 6432#(<= main_~i~0 7), 6433#(<= main_~i~0 8), 6434#(<= main_~i~0 9), 6435#(<= main_~i~0 10), 6436#(<= main_~i~0 11), 6437#(<= main_~i~0 12), 6438#(<= main_~i~0 13), 6439#(<= main_~i~0 14), 6440#(<= main_~i~0 15), 6441#(<= main_~i~0 16), 6442#(<= main_~i~0 17), 6443#(<= main_~i~0 18), 6444#(<= main_~i~0 19), 6445#(<= main_~i~0 20), 6446#(<= main_~i~0 21), 6447#(<= main_~i~0 22), 6448#(<= main_~i~0 23), 6449#(<= main_~i~0 24), 6450#(<= main_~i~0 25), 6451#(<= main_~i~0 26), 6452#(<= main_~i~0 27)] [2018-04-10 15:44:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:20,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:44:20,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:44:20,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:44:20,226 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 30 states. [2018-04-10 15:44:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:20,445 INFO L93 Difference]: Finished difference Result 269 states and 295 transitions. [2018-04-10 15:44:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:44:20,445 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 128 [2018-04-10 15:44:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:20,446 INFO L225 Difference]: With dead ends: 269 [2018-04-10 15:44:20,446 INFO L226 Difference]: Without dead ends: 269 [2018-04-10 15:44:20,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:44:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-10 15:44:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 133. [2018-04-10 15:44:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 15:44:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-04-10 15:44:20,449 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2018-04-10 15:44:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:20,449 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-04-10 15:44:20,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 15:44:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-04-10 15:44:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-10 15:44:20,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:20,450 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:20,450 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1417814474, now seen corresponding path program 27 times [2018-04-10 15:44:20,451 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:20,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:20,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:20,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-10 15:44:20,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:20,769 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-10 15:44:20,769 INFO L182 omatonBuilderFactory]: Interpolants [6855#true, 6856#false, 6857#(<= main_~i~0 0), 6858#(<= main_~i~0 1), 6859#(<= main_~i~0 2), 6860#(<= main_~i~0 3), 6861#(<= main_~i~0 4), 6862#(<= main_~i~0 5), 6863#(<= main_~i~0 6), 6864#(<= main_~i~0 7), 6865#(<= main_~i~0 8), 6866#(<= main_~i~0 9), 6867#(<= main_~i~0 10), 6868#(<= main_~i~0 11), 6869#(<= main_~i~0 12), 6870#(<= main_~i~0 13), 6871#(<= main_~i~0 14), 6872#(<= main_~i~0 15), 6873#(<= main_~i~0 16), 6874#(<= main_~i~0 17), 6875#(<= main_~i~0 18), 6876#(<= main_~i~0 19), 6877#(<= main_~i~0 20), 6878#(<= main_~i~0 21), 6879#(<= main_~i~0 22), 6880#(<= main_~i~0 23), 6881#(<= main_~i~0 24), 6882#(<= main_~i~0 25), 6883#(<= main_~i~0 26), 6884#(<= main_~i~0 27), 6885#(<= main_~i~0 28)] [2018-04-10 15:44:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:20,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 15:44:20,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 15:44:20,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-10 15:44:20,770 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-04-10 15:44:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:21,054 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2018-04-10 15:44:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 15:44:21,054 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 132 [2018-04-10 15:44:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:21,056 INFO L225 Difference]: With dead ends: 278 [2018-04-10 15:44:21,056 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 15:44:21,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-10 15:44:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 15:44:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 137. [2018-04-10 15:44:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-10 15:44:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-04-10 15:44:21,059 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-04-10 15:44:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:21,060 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-04-10 15:44:21,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 15:44:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-04-10 15:44:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-04-10 15:44:21,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:21,060 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:21,061 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1239560529, now seen corresponding path program 28 times [2018-04-10 15:44:21,061 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:21,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:21,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:21,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 15:44:21,412 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:21,413 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-10 15:44:21,413 INFO L182 omatonBuilderFactory]: Interpolants [7301#true, 7302#false, 7303#(<= main_~i~0 0), 7304#(<= main_~i~0 1), 7305#(<= main_~i~0 2), 7306#(<= main_~i~0 3), 7307#(<= main_~i~0 4), 7308#(<= main_~i~0 5), 7309#(<= main_~i~0 6), 7310#(<= main_~i~0 7), 7311#(<= main_~i~0 8), 7312#(<= main_~i~0 9), 7313#(<= main_~i~0 10), 7314#(<= main_~i~0 11), 7315#(<= main_~i~0 12), 7316#(<= main_~i~0 13), 7317#(<= main_~i~0 14), 7318#(<= main_~i~0 15), 7319#(<= main_~i~0 16), 7320#(<= main_~i~0 17), 7321#(<= main_~i~0 18), 7322#(<= main_~i~0 19), 7323#(<= main_~i~0 20), 7324#(<= main_~i~0 21), 7325#(<= main_~i~0 22), 7326#(<= main_~i~0 23), 7327#(<= main_~i~0 24), 7328#(<= main_~i~0 25), 7329#(<= main_~i~0 26), 7330#(<= main_~i~0 27), 7331#(<= main_~i~0 28), 7332#(<= main_~i~0 29)] [2018-04-10 15:44:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:21,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 15:44:21,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 15:44:21,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:44:21,414 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 32 states. [2018-04-10 15:44:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:21,639 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2018-04-10 15:44:21,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 15:44:21,639 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 136 [2018-04-10 15:44:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:21,640 INFO L225 Difference]: With dead ends: 287 [2018-04-10 15:44:21,640 INFO L226 Difference]: Without dead ends: 287 [2018-04-10 15:44:21,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:44:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-10 15:44:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 141. [2018-04-10 15:44:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-10 15:44:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-04-10 15:44:21,643 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 136 [2018-04-10 15:44:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:21,643 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-04-10 15:44:21,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 15:44:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-04-10 15:44:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-04-10 15:44:21,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:21,644 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:21,644 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1779508568, now seen corresponding path program 29 times [2018-04-10 15:44:21,644 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:21,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:22,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:22,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-10 15:44:22,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:22,089 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-10 15:44:22,089 INFO L182 omatonBuilderFactory]: Interpolants [7761#true, 7762#false, 7763#(<= main_~i~0 0), 7764#(<= main_~i~0 1), 7765#(<= main_~i~0 2), 7766#(<= main_~i~0 3), 7767#(<= main_~i~0 4), 7768#(<= main_~i~0 5), 7769#(<= main_~i~0 6), 7770#(<= main_~i~0 7), 7771#(<= main_~i~0 8), 7772#(<= main_~i~0 9), 7773#(<= main_~i~0 10), 7774#(<= main_~i~0 11), 7775#(<= main_~i~0 12), 7776#(<= main_~i~0 13), 7777#(<= main_~i~0 14), 7778#(<= main_~i~0 15), 7779#(<= main_~i~0 16), 7780#(<= main_~i~0 17), 7781#(<= main_~i~0 18), 7782#(<= main_~i~0 19), 7783#(<= main_~i~0 20), 7784#(<= main_~i~0 21), 7785#(<= main_~i~0 22), 7786#(<= main_~i~0 23), 7787#(<= main_~i~0 24), 7788#(<= main_~i~0 25), 7789#(<= main_~i~0 26), 7790#(<= main_~i~0 27), 7791#(<= main_~i~0 28), 7792#(<= main_~i~0 29), 7793#(<= main_~i~0 30)] [2018-04-10 15:44:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:22,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 15:44:22,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 15:44:22,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 15:44:22,091 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 33 states. [2018-04-10 15:44:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:22,341 INFO L93 Difference]: Finished difference Result 296 states and 325 transitions. [2018-04-10 15:44:22,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 15:44:22,341 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 140 [2018-04-10 15:44:22,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:22,342 INFO L225 Difference]: With dead ends: 296 [2018-04-10 15:44:22,342 INFO L226 Difference]: Without dead ends: 296 [2018-04-10 15:44:22,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 15:44:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-10 15:44:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 145. [2018-04-10 15:44:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 15:44:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-04-10 15:44:22,346 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2018-04-10 15:44:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:22,346 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-04-10 15:44:22,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 15:44:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-04-10 15:44:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-04-10 15:44:22,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:22,347 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:22,347 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash -839433695, now seen corresponding path program 30 times [2018-04-10 15:44:22,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:22,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:22,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:22,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 15:44:22,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:22,729 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-10 15:44:22,729 INFO L182 omatonBuilderFactory]: Interpolants [8256#(<= main_~i~0 19), 8257#(<= main_~i~0 20), 8258#(<= main_~i~0 21), 8259#(<= main_~i~0 22), 8260#(<= main_~i~0 23), 8261#(<= main_~i~0 24), 8262#(<= main_~i~0 25), 8263#(<= main_~i~0 26), 8264#(<= main_~i~0 27), 8265#(<= main_~i~0 28), 8266#(<= main_~i~0 29), 8267#(<= main_~i~0 30), 8268#(<= main_~i~0 31), 8235#true, 8236#false, 8237#(<= main_~i~0 0), 8238#(<= main_~i~0 1), 8239#(<= main_~i~0 2), 8240#(<= main_~i~0 3), 8241#(<= main_~i~0 4), 8242#(<= main_~i~0 5), 8243#(<= main_~i~0 6), 8244#(<= main_~i~0 7), 8245#(<= main_~i~0 8), 8246#(<= main_~i~0 9), 8247#(<= main_~i~0 10), 8248#(<= main_~i~0 11), 8249#(<= main_~i~0 12), 8250#(<= main_~i~0 13), 8251#(<= main_~i~0 14), 8252#(<= main_~i~0 15), 8253#(<= main_~i~0 16), 8254#(<= main_~i~0 17), 8255#(<= main_~i~0 18)] [2018-04-10 15:44:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:22,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 15:44:22,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 15:44:22,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 15:44:22,731 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 34 states. [2018-04-10 15:44:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:23,002 INFO L93 Difference]: Finished difference Result 305 states and 335 transitions. [2018-04-10 15:44:23,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 15:44:23,002 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 144 [2018-04-10 15:44:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:23,016 INFO L225 Difference]: With dead ends: 305 [2018-04-10 15:44:23,016 INFO L226 Difference]: Without dead ends: 305 [2018-04-10 15:44:23,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 15:44:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-10 15:44:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 149. [2018-04-10 15:44:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-10 15:44:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-04-10 15:44:23,020 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2018-04-10 15:44:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:23,020 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-04-10 15:44:23,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 15:44:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-04-10 15:44:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-04-10 15:44:23,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:23,021 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:23,021 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1948075290, now seen corresponding path program 31 times [2018-04-10 15:44:23,022 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:23,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:23,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:23,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-10 15:44:23,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:23,449 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-10 15:44:23,449 INFO L182 omatonBuilderFactory]: Interpolants [8723#true, 8724#false, 8725#(<= main_~i~0 0), 8726#(<= main_~i~0 1), 8727#(<= main_~i~0 2), 8728#(<= main_~i~0 3), 8729#(<= main_~i~0 4), 8730#(<= main_~i~0 5), 8731#(<= main_~i~0 6), 8732#(<= main_~i~0 7), 8733#(<= main_~i~0 8), 8734#(<= main_~i~0 9), 8735#(<= main_~i~0 10), 8736#(<= main_~i~0 11), 8737#(<= main_~i~0 12), 8738#(<= main_~i~0 13), 8739#(<= main_~i~0 14), 8740#(<= main_~i~0 15), 8741#(<= main_~i~0 16), 8742#(<= main_~i~0 17), 8743#(<= main_~i~0 18), 8744#(<= main_~i~0 19), 8745#(<= main_~i~0 20), 8746#(<= main_~i~0 21), 8747#(<= main_~i~0 22), 8748#(<= main_~i~0 23), 8749#(<= main_~i~0 24), 8750#(<= main_~i~0 25), 8751#(<= main_~i~0 26), 8752#(<= main_~i~0 27), 8753#(<= main_~i~0 28), 8754#(<= main_~i~0 29), 8755#(<= main_~i~0 30), 8756#(<= main_~i~0 31), 8757#(<= main_~i~0 32)] [2018-04-10 15:44:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:23,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:44:23,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:44:23,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:44:23,451 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 35 states. [2018-04-10 15:44:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:23,688 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2018-04-10 15:44:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:44:23,689 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 148 [2018-04-10 15:44:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:23,690 INFO L225 Difference]: With dead ends: 314 [2018-04-10 15:44:23,690 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 15:44:23,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:44:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 15:44:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 153. [2018-04-10 15:44:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 15:44:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-04-10 15:44:23,696 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 148 [2018-04-10 15:44:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:23,697 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-04-10 15:44:23,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:44:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-04-10 15:44:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-10 15:44:23,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:23,698 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:23,698 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:23,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1054399597, now seen corresponding path program 32 times [2018-04-10 15:44:23,698 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:23,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:24,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:24,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 15:44:24,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:24,189 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-10 15:44:24,189 INFO L182 omatonBuilderFactory]: Interpolants [9225#true, 9226#false, 9227#(<= main_~i~0 0), 9228#(<= main_~i~0 1), 9229#(<= main_~i~0 2), 9230#(<= main_~i~0 3), 9231#(<= main_~i~0 4), 9232#(<= main_~i~0 5), 9233#(<= main_~i~0 6), 9234#(<= main_~i~0 7), 9235#(<= main_~i~0 8), 9236#(<= main_~i~0 9), 9237#(<= main_~i~0 10), 9238#(<= main_~i~0 11), 9239#(<= main_~i~0 12), 9240#(<= main_~i~0 13), 9241#(<= main_~i~0 14), 9242#(<= main_~i~0 15), 9243#(<= main_~i~0 16), 9244#(<= main_~i~0 17), 9245#(<= main_~i~0 18), 9246#(<= main_~i~0 19), 9247#(<= main_~i~0 20), 9248#(<= main_~i~0 21), 9249#(<= main_~i~0 22), 9250#(<= main_~i~0 23), 9251#(<= main_~i~0 24), 9252#(<= main_~i~0 25), 9253#(<= main_~i~0 26), 9254#(<= main_~i~0 27), 9255#(<= main_~i~0 28), 9256#(<= main_~i~0 29), 9257#(<= main_~i~0 30), 9258#(<= main_~i~0 31), 9259#(<= main_~i~0 32), 9260#(<= main_~i~0 33)] [2018-04-10 15:44:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:24,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 15:44:24,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 15:44:24,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 15:44:24,190 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 36 states. [2018-04-10 15:44:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:24,385 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-04-10 15:44:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 15:44:24,385 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 152 [2018-04-10 15:44:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:24,386 INFO L225 Difference]: With dead ends: 323 [2018-04-10 15:44:24,386 INFO L226 Difference]: Without dead ends: 323 [2018-04-10 15:44:24,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 15:44:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-10 15:44:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 157. [2018-04-10 15:44:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-10 15:44:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-04-10 15:44:24,389 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 152 [2018-04-10 15:44:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:24,389 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-04-10 15:44:24,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 15:44:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-04-10 15:44:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-04-10 15:44:24,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:24,390 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:24,390 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:24,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1598349940, now seen corresponding path program 33 times [2018-04-10 15:44:24,391 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:24,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:24,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:24,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-10 15:44:24,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:24,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-10 15:44:24,897 INFO L182 omatonBuilderFactory]: Interpolants [9741#true, 9742#false, 9743#(<= main_~i~0 0), 9744#(<= main_~i~0 1), 9745#(<= main_~i~0 2), 9746#(<= main_~i~0 3), 9747#(<= main_~i~0 4), 9748#(<= main_~i~0 5), 9749#(<= main_~i~0 6), 9750#(<= main_~i~0 7), 9751#(<= main_~i~0 8), 9752#(<= main_~i~0 9), 9753#(<= main_~i~0 10), 9754#(<= main_~i~0 11), 9755#(<= main_~i~0 12), 9756#(<= main_~i~0 13), 9757#(<= main_~i~0 14), 9758#(<= main_~i~0 15), 9759#(<= main_~i~0 16), 9760#(<= main_~i~0 17), 9761#(<= main_~i~0 18), 9762#(<= main_~i~0 19), 9763#(<= main_~i~0 20), 9764#(<= main_~i~0 21), 9765#(<= main_~i~0 22), 9766#(<= main_~i~0 23), 9767#(<= main_~i~0 24), 9768#(<= main_~i~0 25), 9769#(<= main_~i~0 26), 9770#(<= main_~i~0 27), 9771#(<= main_~i~0 28), 9772#(<= main_~i~0 29), 9773#(<= main_~i~0 30), 9774#(<= main_~i~0 31), 9775#(<= main_~i~0 32), 9776#(<= main_~i~0 33), 9777#(<= main_~i~0 34)] [2018-04-10 15:44:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:24,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:44:24,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:44:24,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:44:24,898 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 37 states. [2018-04-10 15:44:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:25,153 INFO L93 Difference]: Finished difference Result 332 states and 365 transitions. [2018-04-10 15:44:25,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 15:44:25,154 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 156 [2018-04-10 15:44:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:25,155 INFO L225 Difference]: With dead ends: 332 [2018-04-10 15:44:25,155 INFO L226 Difference]: Without dead ends: 332 [2018-04-10 15:44:25,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:44:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-10 15:44:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 161. [2018-04-10 15:44:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 15:44:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-04-10 15:44:25,159 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 156 [2018-04-10 15:44:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:25,160 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-04-10 15:44:25,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:44:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-04-10 15:44:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-04-10 15:44:25,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:25,161 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:25,161 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1096774405, now seen corresponding path program 34 times [2018-04-10 15:44:25,162 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:25,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:25,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:25,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 15:44:25,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:25,683 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-10 15:44:25,683 INFO L182 omatonBuilderFactory]: Interpolants [10304#(<= main_~i~0 31), 10305#(<= main_~i~0 32), 10306#(<= main_~i~0 33), 10307#(<= main_~i~0 34), 10308#(<= main_~i~0 35), 10271#true, 10272#false, 10273#(<= main_~i~0 0), 10274#(<= main_~i~0 1), 10275#(<= main_~i~0 2), 10276#(<= main_~i~0 3), 10277#(<= main_~i~0 4), 10278#(<= main_~i~0 5), 10279#(<= main_~i~0 6), 10280#(<= main_~i~0 7), 10281#(<= main_~i~0 8), 10282#(<= main_~i~0 9), 10283#(<= main_~i~0 10), 10284#(<= main_~i~0 11), 10285#(<= main_~i~0 12), 10286#(<= main_~i~0 13), 10287#(<= main_~i~0 14), 10288#(<= main_~i~0 15), 10289#(<= main_~i~0 16), 10290#(<= main_~i~0 17), 10291#(<= main_~i~0 18), 10292#(<= main_~i~0 19), 10293#(<= main_~i~0 20), 10294#(<= main_~i~0 21), 10295#(<= main_~i~0 22), 10296#(<= main_~i~0 23), 10297#(<= main_~i~0 24), 10298#(<= main_~i~0 25), 10299#(<= main_~i~0 26), 10300#(<= main_~i~0 27), 10301#(<= main_~i~0 28), 10302#(<= main_~i~0 29), 10303#(<= main_~i~0 30)] [2018-04-10 15:44:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:25,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 15:44:25,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 15:44:25,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:44:25,684 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 38 states. [2018-04-10 15:44:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:25,934 INFO L93 Difference]: Finished difference Result 341 states and 375 transitions. [2018-04-10 15:44:25,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 15:44:25,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 160 [2018-04-10 15:44:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:25,935 INFO L225 Difference]: With dead ends: 341 [2018-04-10 15:44:25,935 INFO L226 Difference]: Without dead ends: 341 [2018-04-10 15:44:25,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:44:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-10 15:44:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 165. [2018-04-10 15:44:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-10 15:44:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-04-10 15:44:25,938 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 160 [2018-04-10 15:44:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:25,939 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-04-10 15:44:25,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 15:44:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-04-10 15:44:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-04-10 15:44:25,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:25,940 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:25,940 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:25,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1535482882, now seen corresponding path program 35 times [2018-04-10 15:44:25,941 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:25,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:26,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:26,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-10 15:44:26,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:26,316 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-10 15:44:26,316 INFO L182 omatonBuilderFactory]: Interpolants [10816#false, 10817#(<= main_~i~0 0), 10818#(<= main_~i~0 1), 10819#(<= main_~i~0 2), 10820#(<= main_~i~0 3), 10821#(<= main_~i~0 4), 10822#(<= main_~i~0 5), 10823#(<= main_~i~0 6), 10824#(<= main_~i~0 7), 10825#(<= main_~i~0 8), 10826#(<= main_~i~0 9), 10827#(<= main_~i~0 10), 10828#(<= main_~i~0 11), 10829#(<= main_~i~0 12), 10830#(<= main_~i~0 13), 10831#(<= main_~i~0 14), 10832#(<= main_~i~0 15), 10833#(<= main_~i~0 16), 10834#(<= main_~i~0 17), 10835#(<= main_~i~0 18), 10836#(<= main_~i~0 19), 10837#(<= main_~i~0 20), 10838#(<= main_~i~0 21), 10839#(<= main_~i~0 22), 10840#(<= main_~i~0 23), 10841#(<= main_~i~0 24), 10842#(<= main_~i~0 25), 10843#(<= main_~i~0 26), 10844#(<= main_~i~0 27), 10845#(<= main_~i~0 28), 10846#(<= main_~i~0 29), 10847#(<= main_~i~0 30), 10848#(<= main_~i~0 31), 10849#(<= main_~i~0 32), 10850#(<= main_~i~0 33), 10851#(<= main_~i~0 34), 10852#(<= main_~i~0 35), 10853#(<= main_~i~0 36), 10815#true] [2018-04-10 15:44:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:26,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 15:44:26,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 15:44:26,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:44:26,317 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 39 states. [2018-04-10 15:44:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:26,524 INFO L93 Difference]: Finished difference Result 350 states and 385 transitions. [2018-04-10 15:44:26,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 15:44:26,524 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 164 [2018-04-10 15:44:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:26,525 INFO L225 Difference]: With dead ends: 350 [2018-04-10 15:44:26,525 INFO L226 Difference]: Without dead ends: 350 [2018-04-10 15:44:26,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:44:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-10 15:44:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 169. [2018-04-10 15:44:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-10 15:44:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-04-10 15:44:26,527 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-04-10 15:44:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:26,528 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-04-10 15:44:26,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 15:44:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-04-10 15:44:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-04-10 15:44:26,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:26,529 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:26,529 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 777138295, now seen corresponding path program 36 times [2018-04-10 15:44:26,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:26,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:26,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:26,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 15:44:26,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:26,959 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-10 15:44:26,959 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= main_~i~0 17), 11393#(<= main_~i~0 18), 11394#(<= main_~i~0 19), 11395#(<= main_~i~0 20), 11396#(<= main_~i~0 21), 11397#(<= main_~i~0 22), 11398#(<= main_~i~0 23), 11399#(<= main_~i~0 24), 11400#(<= main_~i~0 25), 11401#(<= main_~i~0 26), 11402#(<= main_~i~0 27), 11403#(<= main_~i~0 28), 11404#(<= main_~i~0 29), 11405#(<= main_~i~0 30), 11406#(<= main_~i~0 31), 11407#(<= main_~i~0 32), 11408#(<= main_~i~0 33), 11409#(<= main_~i~0 34), 11410#(<= main_~i~0 35), 11411#(<= main_~i~0 36), 11412#(<= main_~i~0 37), 11373#true, 11374#false, 11375#(<= main_~i~0 0), 11376#(<= main_~i~0 1), 11377#(<= main_~i~0 2), 11378#(<= main_~i~0 3), 11379#(<= main_~i~0 4), 11380#(<= main_~i~0 5), 11381#(<= main_~i~0 6), 11382#(<= main_~i~0 7), 11383#(<= main_~i~0 8), 11384#(<= main_~i~0 9), 11385#(<= main_~i~0 10), 11386#(<= main_~i~0 11), 11387#(<= main_~i~0 12), 11388#(<= main_~i~0 13), 11389#(<= main_~i~0 14), 11390#(<= main_~i~0 15), 11391#(<= main_~i~0 16)] [2018-04-10 15:44:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:26,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 15:44:26,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 15:44:26,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 15:44:26,960 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 40 states. [2018-04-10 15:44:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:27,177 INFO L93 Difference]: Finished difference Result 359 states and 395 transitions. [2018-04-10 15:44:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 15:44:27,178 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 168 [2018-04-10 15:44:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:27,179 INFO L225 Difference]: With dead ends: 359 [2018-04-10 15:44:27,179 INFO L226 Difference]: Without dead ends: 359 [2018-04-10 15:44:27,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 15:44:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-10 15:44:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 173. [2018-04-10 15:44:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-10 15:44:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-04-10 15:44:27,182 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 168 [2018-04-10 15:44:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:27,182 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-04-10 15:44:27,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 15:44:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-04-10 15:44:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 15:44:27,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:27,183 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:27,183 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 906827888, now seen corresponding path program 37 times [2018-04-10 15:44:27,184 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:27,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2897 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:27,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:27,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-10 15:44:27,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:27,684 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-10 15:44:27,684 INFO L182 omatonBuilderFactory]: Interpolants [11968#(<= main_~i~0 21), 11969#(<= main_~i~0 22), 11970#(<= main_~i~0 23), 11971#(<= main_~i~0 24), 11972#(<= main_~i~0 25), 11973#(<= main_~i~0 26), 11974#(<= main_~i~0 27), 11975#(<= main_~i~0 28), 11976#(<= main_~i~0 29), 11977#(<= main_~i~0 30), 11978#(<= main_~i~0 31), 11979#(<= main_~i~0 32), 11980#(<= main_~i~0 33), 11981#(<= main_~i~0 34), 11982#(<= main_~i~0 35), 11983#(<= main_~i~0 36), 11984#(<= main_~i~0 37), 11985#(<= main_~i~0 38), 11945#true, 11946#false, 11947#(<= main_~i~0 0), 11948#(<= main_~i~0 1), 11949#(<= main_~i~0 2), 11950#(<= main_~i~0 3), 11951#(<= main_~i~0 4), 11952#(<= main_~i~0 5), 11953#(<= main_~i~0 6), 11954#(<= main_~i~0 7), 11955#(<= main_~i~0 8), 11956#(<= main_~i~0 9), 11957#(<= main_~i~0 10), 11958#(<= main_~i~0 11), 11959#(<= main_~i~0 12), 11960#(<= main_~i~0 13), 11961#(<= main_~i~0 14), 11962#(<= main_~i~0 15), 11963#(<= main_~i~0 16), 11964#(<= main_~i~0 17), 11965#(<= main_~i~0 18), 11966#(<= main_~i~0 19), 11967#(<= main_~i~0 20)] [2018-04-10 15:44:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2897 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:27,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:44:27,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:44:27,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:44:27,685 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 41 states. [2018-04-10 15:44:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:27,911 INFO L93 Difference]: Finished difference Result 368 states and 405 transitions. [2018-04-10 15:44:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 15:44:27,912 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-04-10 15:44:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:27,912 INFO L225 Difference]: With dead ends: 368 [2018-04-10 15:44:27,913 INFO L226 Difference]: Without dead ends: 368 [2018-04-10 15:44:27,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:44:27,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-10 15:44:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 177. [2018-04-10 15:44:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-10 15:44:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-04-10 15:44:27,915 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 172 [2018-04-10 15:44:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:27,915 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-04-10 15:44:27,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:44:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-04-10 15:44:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-04-10 15:44:27,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:27,915 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:27,916 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1783538711, now seen corresponding path program 38 times [2018-04-10 15:44:27,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:27,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3051 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:28,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:28,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 15:44:28,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:28,432 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-10 15:44:28,432 INFO L182 omatonBuilderFactory]: Interpolants [12544#(<= main_~i~0 11), 12545#(<= main_~i~0 12), 12546#(<= main_~i~0 13), 12547#(<= main_~i~0 14), 12548#(<= main_~i~0 15), 12549#(<= main_~i~0 16), 12550#(<= main_~i~0 17), 12551#(<= main_~i~0 18), 12552#(<= main_~i~0 19), 12553#(<= main_~i~0 20), 12554#(<= main_~i~0 21), 12555#(<= main_~i~0 22), 12556#(<= main_~i~0 23), 12557#(<= main_~i~0 24), 12558#(<= main_~i~0 25), 12559#(<= main_~i~0 26), 12560#(<= main_~i~0 27), 12561#(<= main_~i~0 28), 12562#(<= main_~i~0 29), 12563#(<= main_~i~0 30), 12564#(<= main_~i~0 31), 12565#(<= main_~i~0 32), 12566#(<= main_~i~0 33), 12567#(<= main_~i~0 34), 12568#(<= main_~i~0 35), 12569#(<= main_~i~0 36), 12570#(<= main_~i~0 37), 12571#(<= main_~i~0 38), 12572#(<= main_~i~0 39), 12531#true, 12532#false, 12533#(<= main_~i~0 0), 12534#(<= main_~i~0 1), 12535#(<= main_~i~0 2), 12536#(<= main_~i~0 3), 12537#(<= main_~i~0 4), 12538#(<= main_~i~0 5), 12539#(<= main_~i~0 6), 12540#(<= main_~i~0 7), 12541#(<= main_~i~0 8), 12542#(<= main_~i~0 9), 12543#(<= main_~i~0 10)] [2018-04-10 15:44:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3051 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:28,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 15:44:28,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 15:44:28,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:44:28,433 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 42 states. [2018-04-10 15:44:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:28,678 INFO L93 Difference]: Finished difference Result 377 states and 415 transitions. [2018-04-10 15:44:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 15:44:28,679 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 176 [2018-04-10 15:44:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:28,679 INFO L225 Difference]: With dead ends: 377 [2018-04-10 15:44:28,680 INFO L226 Difference]: Without dead ends: 377 [2018-04-10 15:44:28,680 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:44:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-10 15:44:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 181. [2018-04-10 15:44:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-10 15:44:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-04-10 15:44:28,682 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2018-04-10 15:44:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:28,682 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-04-10 15:44:28,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 15:44:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-04-10 15:44:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-10 15:44:28,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:28,683 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:28,683 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:28,683 INFO L82 PathProgramCache]: Analyzing trace with hash 975518434, now seen corresponding path program 39 times [2018-04-10 15:44:28,683 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:28,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3209 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:29,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:29,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-10 15:44:29,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:29,156 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-10 15:44:29,157 INFO L182 omatonBuilderFactory]: Interpolants [13131#true, 13132#false, 13133#(<= main_~i~0 0), 13134#(<= main_~i~0 1), 13135#(<= main_~i~0 2), 13136#(<= main_~i~0 3), 13137#(<= main_~i~0 4), 13138#(<= main_~i~0 5), 13139#(<= main_~i~0 6), 13140#(<= main_~i~0 7), 13141#(<= main_~i~0 8), 13142#(<= main_~i~0 9), 13143#(<= main_~i~0 10), 13144#(<= main_~i~0 11), 13145#(<= main_~i~0 12), 13146#(<= main_~i~0 13), 13147#(<= main_~i~0 14), 13148#(<= main_~i~0 15), 13149#(<= main_~i~0 16), 13150#(<= main_~i~0 17), 13151#(<= main_~i~0 18), 13152#(<= main_~i~0 19), 13153#(<= main_~i~0 20), 13154#(<= main_~i~0 21), 13155#(<= main_~i~0 22), 13156#(<= main_~i~0 23), 13157#(<= main_~i~0 24), 13158#(<= main_~i~0 25), 13159#(<= main_~i~0 26), 13160#(<= main_~i~0 27), 13161#(<= main_~i~0 28), 13162#(<= main_~i~0 29), 13163#(<= main_~i~0 30), 13164#(<= main_~i~0 31), 13165#(<= main_~i~0 32), 13166#(<= main_~i~0 33), 13167#(<= main_~i~0 34), 13168#(<= main_~i~0 35), 13169#(<= main_~i~0 36), 13170#(<= main_~i~0 37), 13171#(<= main_~i~0 38), 13172#(<= main_~i~0 39), 13173#(<= main_~i~0 40)] [2018-04-10 15:44:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3209 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:29,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 15:44:29,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 15:44:29,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:44:29,157 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 43 states. [2018-04-10 15:44:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:29,450 INFO L93 Difference]: Finished difference Result 386 states and 425 transitions. [2018-04-10 15:44:29,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 15:44:29,451 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 180 [2018-04-10 15:44:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:29,452 INFO L225 Difference]: With dead ends: 386 [2018-04-10 15:44:29,452 INFO L226 Difference]: Without dead ends: 386 [2018-04-10 15:44:29,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:44:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-10 15:44:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 185. [2018-04-10 15:44:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 15:44:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-10 15:44:29,454 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 180 [2018-04-10 15:44:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:29,454 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-10 15:44:29,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 15:44:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-10 15:44:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-10 15:44:29,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:29,454 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:29,454 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:29,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1288768165, now seen corresponding path program 40 times [2018-04-10 15:44:29,455 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:29,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:29,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:29,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-10 15:44:29,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:29,951 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-10 15:44:29,951 INFO L182 omatonBuilderFactory]: Interpolants [13760#(<= main_~i~0 13), 13761#(<= main_~i~0 14), 13762#(<= main_~i~0 15), 13763#(<= main_~i~0 16), 13764#(<= main_~i~0 17), 13765#(<= main_~i~0 18), 13766#(<= main_~i~0 19), 13767#(<= main_~i~0 20), 13768#(<= main_~i~0 21), 13769#(<= main_~i~0 22), 13770#(<= main_~i~0 23), 13771#(<= main_~i~0 24), 13772#(<= main_~i~0 25), 13773#(<= main_~i~0 26), 13774#(<= main_~i~0 27), 13775#(<= main_~i~0 28), 13776#(<= main_~i~0 29), 13777#(<= main_~i~0 30), 13778#(<= main_~i~0 31), 13779#(<= main_~i~0 32), 13780#(<= main_~i~0 33), 13781#(<= main_~i~0 34), 13782#(<= main_~i~0 35), 13783#(<= main_~i~0 36), 13784#(<= main_~i~0 37), 13785#(<= main_~i~0 38), 13786#(<= main_~i~0 39), 13787#(<= main_~i~0 40), 13788#(<= main_~i~0 41), 13745#true, 13746#false, 13747#(<= main_~i~0 0), 13748#(<= main_~i~0 1), 13749#(<= main_~i~0 2), 13750#(<= main_~i~0 3), 13751#(<= main_~i~0 4), 13752#(<= main_~i~0 5), 13753#(<= main_~i~0 6), 13754#(<= main_~i~0 7), 13755#(<= main_~i~0 8), 13756#(<= main_~i~0 9), 13757#(<= main_~i~0 10), 13758#(<= main_~i~0 11), 13759#(<= main_~i~0 12)] [2018-04-10 15:44:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:29,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 15:44:29,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 15:44:29,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:44:29,952 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 44 states. [2018-04-10 15:44:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:30,220 INFO L93 Difference]: Finished difference Result 395 states and 435 transitions. [2018-04-10 15:44:30,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 15:44:30,220 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 184 [2018-04-10 15:44:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:30,221 INFO L225 Difference]: With dead ends: 395 [2018-04-10 15:44:30,221 INFO L226 Difference]: Without dead ends: 395 [2018-04-10 15:44:30,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:44:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-10 15:44:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 189. [2018-04-10 15:44:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-10 15:44:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-04-10 15:44:30,223 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-04-10 15:44:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:30,223 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-04-10 15:44:30,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 15:44:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-04-10 15:44:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-10 15:44:30,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:30,224 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:30,224 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1015755948, now seen corresponding path program 41 times [2018-04-10 15:44:30,224 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:30,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:30,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:30,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-10 15:44:30,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:30,738 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-10 15:44:30,738 INFO L182 omatonBuilderFactory]: Interpolants [14400#(<= main_~i~0 25), 14401#(<= main_~i~0 26), 14402#(<= main_~i~0 27), 14403#(<= main_~i~0 28), 14404#(<= main_~i~0 29), 14405#(<= main_~i~0 30), 14406#(<= main_~i~0 31), 14407#(<= main_~i~0 32), 14408#(<= main_~i~0 33), 14409#(<= main_~i~0 34), 14410#(<= main_~i~0 35), 14411#(<= main_~i~0 36), 14412#(<= main_~i~0 37), 14413#(<= main_~i~0 38), 14414#(<= main_~i~0 39), 14415#(<= main_~i~0 40), 14416#(<= main_~i~0 41), 14417#(<= main_~i~0 42), 14373#true, 14374#false, 14375#(<= main_~i~0 0), 14376#(<= main_~i~0 1), 14377#(<= main_~i~0 2), 14378#(<= main_~i~0 3), 14379#(<= main_~i~0 4), 14380#(<= main_~i~0 5), 14381#(<= main_~i~0 6), 14382#(<= main_~i~0 7), 14383#(<= main_~i~0 8), 14384#(<= main_~i~0 9), 14385#(<= main_~i~0 10), 14386#(<= main_~i~0 11), 14387#(<= main_~i~0 12), 14388#(<= main_~i~0 13), 14389#(<= main_~i~0 14), 14390#(<= main_~i~0 15), 14391#(<= main_~i~0 16), 14392#(<= main_~i~0 17), 14393#(<= main_~i~0 18), 14394#(<= main_~i~0 19), 14395#(<= main_~i~0 20), 14396#(<= main_~i~0 21), 14397#(<= main_~i~0 22), 14398#(<= main_~i~0 23), 14399#(<= main_~i~0 24)] [2018-04-10 15:44:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:30,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 15:44:30,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 15:44:30,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 15:44:30,739 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 45 states. [2018-04-10 15:44:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:31,011 INFO L93 Difference]: Finished difference Result 404 states and 445 transitions. [2018-04-10 15:44:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 15:44:31,011 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 188 [2018-04-10 15:44:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:31,012 INFO L225 Difference]: With dead ends: 404 [2018-04-10 15:44:31,012 INFO L226 Difference]: Without dead ends: 404 [2018-04-10 15:44:31,012 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 15:44:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-10 15:44:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 193. [2018-04-10 15:44:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 15:44:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-04-10 15:44:31,014 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2018-04-10 15:44:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:31,015 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-04-10 15:44:31,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 15:44:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-04-10 15:44:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-10 15:44:31,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:31,015 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:31,015 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -260244275, now seen corresponding path program 42 times [2018-04-10 15:44:31,016 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:31,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3707 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:31,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:31,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-10 15:44:31,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:31,547 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-10 15:44:31,547 INFO L182 omatonBuilderFactory]: Interpolants [15040#(<= main_~i~0 23), 15041#(<= main_~i~0 24), 15042#(<= main_~i~0 25), 15043#(<= main_~i~0 26), 15044#(<= main_~i~0 27), 15045#(<= main_~i~0 28), 15046#(<= main_~i~0 29), 15047#(<= main_~i~0 30), 15048#(<= main_~i~0 31), 15049#(<= main_~i~0 32), 15050#(<= main_~i~0 33), 15051#(<= main_~i~0 34), 15052#(<= main_~i~0 35), 15053#(<= main_~i~0 36), 15054#(<= main_~i~0 37), 15055#(<= main_~i~0 38), 15056#(<= main_~i~0 39), 15057#(<= main_~i~0 40), 15058#(<= main_~i~0 41), 15059#(<= main_~i~0 42), 15060#(<= main_~i~0 43), 15015#true, 15016#false, 15017#(<= main_~i~0 0), 15018#(<= main_~i~0 1), 15019#(<= main_~i~0 2), 15020#(<= main_~i~0 3), 15021#(<= main_~i~0 4), 15022#(<= main_~i~0 5), 15023#(<= main_~i~0 6), 15024#(<= main_~i~0 7), 15025#(<= main_~i~0 8), 15026#(<= main_~i~0 9), 15027#(<= main_~i~0 10), 15028#(<= main_~i~0 11), 15029#(<= main_~i~0 12), 15030#(<= main_~i~0 13), 15031#(<= main_~i~0 14), 15032#(<= main_~i~0 15), 15033#(<= main_~i~0 16), 15034#(<= main_~i~0 17), 15035#(<= main_~i~0 18), 15036#(<= main_~i~0 19), 15037#(<= main_~i~0 20), 15038#(<= main_~i~0 21), 15039#(<= main_~i~0 22)] [2018-04-10 15:44:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3707 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:31,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 15:44:31,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 15:44:31,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:44:31,548 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 46 states. [2018-04-10 15:44:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:31,810 INFO L93 Difference]: Finished difference Result 413 states and 455 transitions. [2018-04-10 15:44:31,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 15:44:31,811 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 192 [2018-04-10 15:44:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:31,812 INFO L225 Difference]: With dead ends: 413 [2018-04-10 15:44:31,812 INFO L226 Difference]: Without dead ends: 413 [2018-04-10 15:44:31,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:44:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-10 15:44:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 197. [2018-04-10 15:44:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 15:44:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-04-10 15:44:31,814 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 192 [2018-04-10 15:44:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:31,814 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-04-10 15:44:31,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 15:44:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-04-10 15:44:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-04-10 15:44:31,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:31,815 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:31,815 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:31,815 INFO L82 PathProgramCache]: Analyzing trace with hash 313379270, now seen corresponding path program 43 times [2018-04-10 15:44:31,815 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:31,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3881 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:32,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:32,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-10 15:44:32,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:32,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-10 15:44:32,390 INFO L182 omatonBuilderFactory]: Interpolants [15680#(<= main_~i~0 7), 15681#(<= main_~i~0 8), 15682#(<= main_~i~0 9), 15683#(<= main_~i~0 10), 15684#(<= main_~i~0 11), 15685#(<= main_~i~0 12), 15686#(<= main_~i~0 13), 15687#(<= main_~i~0 14), 15688#(<= main_~i~0 15), 15689#(<= main_~i~0 16), 15690#(<= main_~i~0 17), 15691#(<= main_~i~0 18), 15692#(<= main_~i~0 19), 15693#(<= main_~i~0 20), 15694#(<= main_~i~0 21), 15695#(<= main_~i~0 22), 15696#(<= main_~i~0 23), 15697#(<= main_~i~0 24), 15698#(<= main_~i~0 25), 15699#(<= main_~i~0 26), 15700#(<= main_~i~0 27), 15701#(<= main_~i~0 28), 15702#(<= main_~i~0 29), 15703#(<= main_~i~0 30), 15704#(<= main_~i~0 31), 15705#(<= main_~i~0 32), 15706#(<= main_~i~0 33), 15707#(<= main_~i~0 34), 15708#(<= main_~i~0 35), 15709#(<= main_~i~0 36), 15710#(<= main_~i~0 37), 15711#(<= main_~i~0 38), 15712#(<= main_~i~0 39), 15713#(<= main_~i~0 40), 15714#(<= main_~i~0 41), 15715#(<= main_~i~0 42), 15716#(<= main_~i~0 43), 15717#(<= main_~i~0 44), 15671#true, 15672#false, 15673#(<= main_~i~0 0), 15674#(<= main_~i~0 1), 15675#(<= main_~i~0 2), 15676#(<= main_~i~0 3), 15677#(<= main_~i~0 4), 15678#(<= main_~i~0 5), 15679#(<= main_~i~0 6)] [2018-04-10 15:44:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3881 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:32,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 15:44:32,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 15:44:32,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:44:32,391 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 47 states. [2018-04-10 15:44:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:32,715 INFO L93 Difference]: Finished difference Result 422 states and 465 transitions. [2018-04-10 15:44:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 15:44:32,715 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 196 [2018-04-10 15:44:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:32,716 INFO L225 Difference]: With dead ends: 422 [2018-04-10 15:44:32,716 INFO L226 Difference]: Without dead ends: 422 [2018-04-10 15:44:32,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:44:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-10 15:44:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 201. [2018-04-10 15:44:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-10 15:44:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-04-10 15:44:32,718 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 196 [2018-04-10 15:44:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:32,718 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-04-10 15:44:32,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 15:44:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-04-10 15:44:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-04-10 15:44:32,719 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:32,719 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:32,719 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash -447909313, now seen corresponding path program 44 times [2018-04-10 15:44:32,720 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:32,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:33,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:33,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 15:44:33,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:33,310 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-10 15:44:33,310 INFO L182 omatonBuilderFactory]: Interpolants [16384#(<= main_~i~0 41), 16385#(<= main_~i~0 42), 16386#(<= main_~i~0 43), 16387#(<= main_~i~0 44), 16388#(<= main_~i~0 45), 16341#true, 16342#false, 16343#(<= main_~i~0 0), 16344#(<= main_~i~0 1), 16345#(<= main_~i~0 2), 16346#(<= main_~i~0 3), 16347#(<= main_~i~0 4), 16348#(<= main_~i~0 5), 16349#(<= main_~i~0 6), 16350#(<= main_~i~0 7), 16351#(<= main_~i~0 8), 16352#(<= main_~i~0 9), 16353#(<= main_~i~0 10), 16354#(<= main_~i~0 11), 16355#(<= main_~i~0 12), 16356#(<= main_~i~0 13), 16357#(<= main_~i~0 14), 16358#(<= main_~i~0 15), 16359#(<= main_~i~0 16), 16360#(<= main_~i~0 17), 16361#(<= main_~i~0 18), 16362#(<= main_~i~0 19), 16363#(<= main_~i~0 20), 16364#(<= main_~i~0 21), 16365#(<= main_~i~0 22), 16366#(<= main_~i~0 23), 16367#(<= main_~i~0 24), 16368#(<= main_~i~0 25), 16369#(<= main_~i~0 26), 16370#(<= main_~i~0 27), 16371#(<= main_~i~0 28), 16372#(<= main_~i~0 29), 16373#(<= main_~i~0 30), 16374#(<= main_~i~0 31), 16375#(<= main_~i~0 32), 16376#(<= main_~i~0 33), 16377#(<= main_~i~0 34), 16378#(<= main_~i~0 35), 16379#(<= main_~i~0 36), 16380#(<= main_~i~0 37), 16381#(<= main_~i~0 38), 16382#(<= main_~i~0 39), 16383#(<= main_~i~0 40)] [2018-04-10 15:44:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:33,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 15:44:33,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 15:44:33,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 15:44:33,311 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 48 states. [2018-04-10 15:44:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:33,588 INFO L93 Difference]: Finished difference Result 431 states and 475 transitions. [2018-04-10 15:44:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 15:44:33,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 200 [2018-04-10 15:44:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:33,590 INFO L225 Difference]: With dead ends: 431 [2018-04-10 15:44:33,590 INFO L226 Difference]: Without dead ends: 431 [2018-04-10 15:44:33,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 15:44:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-10 15:44:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 205. [2018-04-10 15:44:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-10 15:44:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-04-10 15:44:33,592 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 200 [2018-04-10 15:44:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:33,592 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-04-10 15:44:33,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 15:44:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-04-10 15:44:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-04-10 15:44:33,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:33,592 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:33,592 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1769851336, now seen corresponding path program 45 times [2018-04-10 15:44:33,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:33,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:34,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:34,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-10 15:44:34,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:34,181 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-10 15:44:34,181 INFO L182 omatonBuilderFactory]: Interpolants [17025#true, 17026#false, 17027#(<= main_~i~0 0), 17028#(<= main_~i~0 1), 17029#(<= main_~i~0 2), 17030#(<= main_~i~0 3), 17031#(<= main_~i~0 4), 17032#(<= main_~i~0 5), 17033#(<= main_~i~0 6), 17034#(<= main_~i~0 7), 17035#(<= main_~i~0 8), 17036#(<= main_~i~0 9), 17037#(<= main_~i~0 10), 17038#(<= main_~i~0 11), 17039#(<= main_~i~0 12), 17040#(<= main_~i~0 13), 17041#(<= main_~i~0 14), 17042#(<= main_~i~0 15), 17043#(<= main_~i~0 16), 17044#(<= main_~i~0 17), 17045#(<= main_~i~0 18), 17046#(<= main_~i~0 19), 17047#(<= main_~i~0 20), 17048#(<= main_~i~0 21), 17049#(<= main_~i~0 22), 17050#(<= main_~i~0 23), 17051#(<= main_~i~0 24), 17052#(<= main_~i~0 25), 17053#(<= main_~i~0 26), 17054#(<= main_~i~0 27), 17055#(<= main_~i~0 28), 17056#(<= main_~i~0 29), 17057#(<= main_~i~0 30), 17058#(<= main_~i~0 31), 17059#(<= main_~i~0 32), 17060#(<= main_~i~0 33), 17061#(<= main_~i~0 34), 17062#(<= main_~i~0 35), 17063#(<= main_~i~0 36), 17064#(<= main_~i~0 37), 17065#(<= main_~i~0 38), 17066#(<= main_~i~0 39), 17067#(<= main_~i~0 40), 17068#(<= main_~i~0 41), 17069#(<= main_~i~0 42), 17070#(<= main_~i~0 43), 17071#(<= main_~i~0 44), 17072#(<= main_~i~0 45), 17073#(<= main_~i~0 46)] [2018-04-10 15:44:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:34,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:44:34,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:44:34,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:44:34,182 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 49 states. [2018-04-10 15:44:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:34,571 INFO L93 Difference]: Finished difference Result 440 states and 485 transitions. [2018-04-10 15:44:34,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 15:44:34,572 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 204 [2018-04-10 15:44:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:34,572 INFO L225 Difference]: With dead ends: 440 [2018-04-10 15:44:34,573 INFO L226 Difference]: Without dead ends: 440 [2018-04-10 15:44:34,573 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:44:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-10 15:44:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 209. [2018-04-10 15:44:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-10 15:44:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-04-10 15:44:34,575 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-04-10 15:44:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:34,575 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-04-10 15:44:34,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:44:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-04-10 15:44:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-04-10 15:44:34,576 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:34,577 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:34,577 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1465013681, now seen corresponding path program 46 times [2018-04-10 15:44:34,577 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:34,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4427 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:35,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:35,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 15:44:35,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:35,246 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-10 15:44:35,246 INFO L182 omatonBuilderFactory]: Interpolants [17723#true, 17724#false, 17725#(<= main_~i~0 0), 17726#(<= main_~i~0 1), 17727#(<= main_~i~0 2), 17728#(<= main_~i~0 3), 17729#(<= main_~i~0 4), 17730#(<= main_~i~0 5), 17731#(<= main_~i~0 6), 17732#(<= main_~i~0 7), 17733#(<= main_~i~0 8), 17734#(<= main_~i~0 9), 17735#(<= main_~i~0 10), 17736#(<= main_~i~0 11), 17737#(<= main_~i~0 12), 17738#(<= main_~i~0 13), 17739#(<= main_~i~0 14), 17740#(<= main_~i~0 15), 17741#(<= main_~i~0 16), 17742#(<= main_~i~0 17), 17743#(<= main_~i~0 18), 17744#(<= main_~i~0 19), 17745#(<= main_~i~0 20), 17746#(<= main_~i~0 21), 17747#(<= main_~i~0 22), 17748#(<= main_~i~0 23), 17749#(<= main_~i~0 24), 17750#(<= main_~i~0 25), 17751#(<= main_~i~0 26), 17752#(<= main_~i~0 27), 17753#(<= main_~i~0 28), 17754#(<= main_~i~0 29), 17755#(<= main_~i~0 30), 17756#(<= main_~i~0 31), 17757#(<= main_~i~0 32), 17758#(<= main_~i~0 33), 17759#(<= main_~i~0 34), 17760#(<= main_~i~0 35), 17761#(<= main_~i~0 36), 17762#(<= main_~i~0 37), 17763#(<= main_~i~0 38), 17764#(<= main_~i~0 39), 17765#(<= main_~i~0 40), 17766#(<= main_~i~0 41), 17767#(<= main_~i~0 42), 17768#(<= main_~i~0 43), 17769#(<= main_~i~0 44), 17770#(<= main_~i~0 45), 17771#(<= main_~i~0 46), 17772#(<= main_~i~0 47)] [2018-04-10 15:44:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4427 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:35,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 15:44:35,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 15:44:35,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:44:35,247 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 50 states. [2018-04-10 15:44:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:35,628 INFO L93 Difference]: Finished difference Result 449 states and 495 transitions. [2018-04-10 15:44:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 15:44:35,628 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 208 [2018-04-10 15:44:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:35,629 INFO L225 Difference]: With dead ends: 449 [2018-04-10 15:44:35,630 INFO L226 Difference]: Without dead ends: 449 [2018-04-10 15:44:35,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:44:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-10 15:44:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 213. [2018-04-10 15:44:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 15:44:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-04-10 15:44:35,633 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 208 [2018-04-10 15:44:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:35,633 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-04-10 15:44:35,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 15:44:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-04-10 15:44:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-10 15:44:35,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:35,634 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:35,634 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash -341569366, now seen corresponding path program 47 times [2018-04-10 15:44:35,634 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:35,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:36,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:36,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-10 15:44:36,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:36,340 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-10 15:44:36,341 INFO L182 omatonBuilderFactory]: Interpolants [18435#true, 18436#false, 18437#(<= main_~i~0 0), 18438#(<= main_~i~0 1), 18439#(<= main_~i~0 2), 18440#(<= main_~i~0 3), 18441#(<= main_~i~0 4), 18442#(<= main_~i~0 5), 18443#(<= main_~i~0 6), 18444#(<= main_~i~0 7), 18445#(<= main_~i~0 8), 18446#(<= main_~i~0 9), 18447#(<= main_~i~0 10), 18448#(<= main_~i~0 11), 18449#(<= main_~i~0 12), 18450#(<= main_~i~0 13), 18451#(<= main_~i~0 14), 18452#(<= main_~i~0 15), 18453#(<= main_~i~0 16), 18454#(<= main_~i~0 17), 18455#(<= main_~i~0 18), 18456#(<= main_~i~0 19), 18457#(<= main_~i~0 20), 18458#(<= main_~i~0 21), 18459#(<= main_~i~0 22), 18460#(<= main_~i~0 23), 18461#(<= main_~i~0 24), 18462#(<= main_~i~0 25), 18463#(<= main_~i~0 26), 18464#(<= main_~i~0 27), 18465#(<= main_~i~0 28), 18466#(<= main_~i~0 29), 18467#(<= main_~i~0 30), 18468#(<= main_~i~0 31), 18469#(<= main_~i~0 32), 18470#(<= main_~i~0 33), 18471#(<= main_~i~0 34), 18472#(<= main_~i~0 35), 18473#(<= main_~i~0 36), 18474#(<= main_~i~0 37), 18475#(<= main_~i~0 38), 18476#(<= main_~i~0 39), 18477#(<= main_~i~0 40), 18478#(<= main_~i~0 41), 18479#(<= main_~i~0 42), 18480#(<= main_~i~0 43), 18481#(<= main_~i~0 44), 18482#(<= main_~i~0 45), 18483#(<= main_~i~0 46), 18484#(<= main_~i~0 47), 18485#(<= main_~i~0 48)] [2018-04-10 15:44:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:36,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 15:44:36,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 15:44:36,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:44:36,341 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 51 states. [2018-04-10 15:44:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:36,767 INFO L93 Difference]: Finished difference Result 458 states and 505 transitions. [2018-04-10 15:44:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 15:44:36,768 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 212 [2018-04-10 15:44:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:36,768 INFO L225 Difference]: With dead ends: 458 [2018-04-10 15:44:36,769 INFO L226 Difference]: Without dead ends: 458 [2018-04-10 15:44:36,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:44:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-10 15:44:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 217. [2018-04-10 15:44:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-10 15:44:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-04-10 15:44:36,771 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 212 [2018-04-10 15:44:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:36,771 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-04-10 15:44:36,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 15:44:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-04-10 15:44:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-04-10 15:44:36,772 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:36,772 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:36,772 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash 977119011, now seen corresponding path program 48 times [2018-04-10 15:44:36,772 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:36,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4811 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:37,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:37,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-10 15:44:37,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:37,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-10 15:44:37,477 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= main_~i~0 37), 19201#(<= main_~i~0 38), 19202#(<= main_~i~0 39), 19203#(<= main_~i~0 40), 19204#(<= main_~i~0 41), 19205#(<= main_~i~0 42), 19206#(<= main_~i~0 43), 19207#(<= main_~i~0 44), 19208#(<= main_~i~0 45), 19209#(<= main_~i~0 46), 19210#(<= main_~i~0 47), 19211#(<= main_~i~0 48), 19212#(<= main_~i~0 49), 19161#true, 19162#false, 19163#(<= main_~i~0 0), 19164#(<= main_~i~0 1), 19165#(<= main_~i~0 2), 19166#(<= main_~i~0 3), 19167#(<= main_~i~0 4), 19168#(<= main_~i~0 5), 19169#(<= main_~i~0 6), 19170#(<= main_~i~0 7), 19171#(<= main_~i~0 8), 19172#(<= main_~i~0 9), 19173#(<= main_~i~0 10), 19174#(<= main_~i~0 11), 19175#(<= main_~i~0 12), 19176#(<= main_~i~0 13), 19177#(<= main_~i~0 14), 19178#(<= main_~i~0 15), 19179#(<= main_~i~0 16), 19180#(<= main_~i~0 17), 19181#(<= main_~i~0 18), 19182#(<= main_~i~0 19), 19183#(<= main_~i~0 20), 19184#(<= main_~i~0 21), 19185#(<= main_~i~0 22), 19186#(<= main_~i~0 23), 19187#(<= main_~i~0 24), 19188#(<= main_~i~0 25), 19189#(<= main_~i~0 26), 19190#(<= main_~i~0 27), 19191#(<= main_~i~0 28), 19192#(<= main_~i~0 29), 19193#(<= main_~i~0 30), 19194#(<= main_~i~0 31), 19195#(<= main_~i~0 32), 19196#(<= main_~i~0 33), 19197#(<= main_~i~0 34), 19198#(<= main_~i~0 35), 19199#(<= main_~i~0 36)] [2018-04-10 15:44:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4811 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:37,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 15:44:37,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 15:44:37,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 15:44:37,478 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 52 states. [2018-04-10 15:44:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:37,861 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions. [2018-04-10 15:44:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 15:44:37,861 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 216 [2018-04-10 15:44:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:37,862 INFO L225 Difference]: With dead ends: 467 [2018-04-10 15:44:37,862 INFO L226 Difference]: Without dead ends: 467 [2018-04-10 15:44:37,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 15:44:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-10 15:44:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 221. [2018-04-10 15:44:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 15:44:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-04-10 15:44:37,865 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 216 [2018-04-10 15:44:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:37,865 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-04-10 15:44:37,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 15:44:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-04-10 15:44:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-04-10 15:44:37,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:37,866 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:37,866 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash -591046372, now seen corresponding path program 49 times [2018-04-10 15:44:37,866 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:37,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:38,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:38,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-10 15:44:38,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:38,562 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-10 15:44:38,563 INFO L182 omatonBuilderFactory]: Interpolants [19901#true, 19902#false, 19903#(<= main_~i~0 0), 19904#(<= main_~i~0 1), 19905#(<= main_~i~0 2), 19906#(<= main_~i~0 3), 19907#(<= main_~i~0 4), 19908#(<= main_~i~0 5), 19909#(<= main_~i~0 6), 19910#(<= main_~i~0 7), 19911#(<= main_~i~0 8), 19912#(<= main_~i~0 9), 19913#(<= main_~i~0 10), 19914#(<= main_~i~0 11), 19915#(<= main_~i~0 12), 19916#(<= main_~i~0 13), 19917#(<= main_~i~0 14), 19918#(<= main_~i~0 15), 19919#(<= main_~i~0 16), 19920#(<= main_~i~0 17), 19921#(<= main_~i~0 18), 19922#(<= main_~i~0 19), 19923#(<= main_~i~0 20), 19924#(<= main_~i~0 21), 19925#(<= main_~i~0 22), 19926#(<= main_~i~0 23), 19927#(<= main_~i~0 24), 19928#(<= main_~i~0 25), 19929#(<= main_~i~0 26), 19930#(<= main_~i~0 27), 19931#(<= main_~i~0 28), 19932#(<= main_~i~0 29), 19933#(<= main_~i~0 30), 19934#(<= main_~i~0 31), 19935#(<= main_~i~0 32), 19936#(<= main_~i~0 33), 19937#(<= main_~i~0 34), 19938#(<= main_~i~0 35), 19939#(<= main_~i~0 36), 19940#(<= main_~i~0 37), 19941#(<= main_~i~0 38), 19942#(<= main_~i~0 39), 19943#(<= main_~i~0 40), 19944#(<= main_~i~0 41), 19945#(<= main_~i~0 42), 19946#(<= main_~i~0 43), 19947#(<= main_~i~0 44), 19948#(<= main_~i~0 45), 19949#(<= main_~i~0 46), 19950#(<= main_~i~0 47), 19951#(<= main_~i~0 48), 19952#(<= main_~i~0 49), 19953#(<= main_~i~0 50)] [2018-04-10 15:44:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:38,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:44:38,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:44:38,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:44:38,563 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 53 states. [2018-04-10 15:44:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:39,015 INFO L93 Difference]: Finished difference Result 476 states and 525 transitions. [2018-04-10 15:44:39,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 15:44:39,015 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 220 [2018-04-10 15:44:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:39,017 INFO L225 Difference]: With dead ends: 476 [2018-04-10 15:44:39,017 INFO L226 Difference]: Without dead ends: 476 [2018-04-10 15:44:39,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:44:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-04-10 15:44:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 225. [2018-04-10 15:44:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-10 15:44:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-04-10 15:44:39,021 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 220 [2018-04-10 15:44:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:39,021 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-04-10 15:44:39,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:44:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-04-10 15:44:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-04-10 15:44:39,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:39,023 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:39,023 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1346279787, now seen corresponding path program 50 times [2018-04-10 15:44:39,024 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:39,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5211 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:39,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:39,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-10 15:44:39,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:39,798 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-10 15:44:39,798 INFO L182 omatonBuilderFactory]: Interpolants [20655#true, 20656#false, 20657#(<= main_~i~0 0), 20658#(<= main_~i~0 1), 20659#(<= main_~i~0 2), 20660#(<= main_~i~0 3), 20661#(<= main_~i~0 4), 20662#(<= main_~i~0 5), 20663#(<= main_~i~0 6), 20664#(<= main_~i~0 7), 20665#(<= main_~i~0 8), 20666#(<= main_~i~0 9), 20667#(<= main_~i~0 10), 20668#(<= main_~i~0 11), 20669#(<= main_~i~0 12), 20670#(<= main_~i~0 13), 20671#(<= main_~i~0 14), 20672#(<= main_~i~0 15), 20673#(<= main_~i~0 16), 20674#(<= main_~i~0 17), 20675#(<= main_~i~0 18), 20676#(<= main_~i~0 19), 20677#(<= main_~i~0 20), 20678#(<= main_~i~0 21), 20679#(<= main_~i~0 22), 20680#(<= main_~i~0 23), 20681#(<= main_~i~0 24), 20682#(<= main_~i~0 25), 20683#(<= main_~i~0 26), 20684#(<= main_~i~0 27), 20685#(<= main_~i~0 28), 20686#(<= main_~i~0 29), 20687#(<= main_~i~0 30), 20688#(<= main_~i~0 31), 20689#(<= main_~i~0 32), 20690#(<= main_~i~0 33), 20691#(<= main_~i~0 34), 20692#(<= main_~i~0 35), 20693#(<= main_~i~0 36), 20694#(<= main_~i~0 37), 20695#(<= main_~i~0 38), 20696#(<= main_~i~0 39), 20697#(<= main_~i~0 40), 20698#(<= main_~i~0 41), 20699#(<= main_~i~0 42), 20700#(<= main_~i~0 43), 20701#(<= main_~i~0 44), 20702#(<= main_~i~0 45), 20703#(<= main_~i~0 46), 20704#(<= main_~i~0 47), 20705#(<= main_~i~0 48), 20706#(<= main_~i~0 49), 20707#(<= main_~i~0 50), 20708#(<= main_~i~0 51)] [2018-04-10 15:44:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5211 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:39,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-10 15:44:39,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-10 15:44:39,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 15:44:39,799 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 54 states. [2018-04-10 15:44:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:40,199 INFO L93 Difference]: Finished difference Result 485 states and 535 transitions. [2018-04-10 15:44:40,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 15:44:40,199 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 224 [2018-04-10 15:44:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:40,200 INFO L225 Difference]: With dead ends: 485 [2018-04-10 15:44:40,200 INFO L226 Difference]: Without dead ends: 485 [2018-04-10 15:44:40,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 15:44:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-10 15:44:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 229. [2018-04-10 15:44:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 15:44:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-04-10 15:44:40,202 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 224 [2018-04-10 15:44:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:40,203 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-04-10 15:44:40,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-10 15:44:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-04-10 15:44:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-04-10 15:44:40,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:40,203 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:40,203 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1654132622, now seen corresponding path program 51 times [2018-04-10 15:44:40,204 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:40,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:40,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:40,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-10 15:44:40,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:40,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-10 15:44:40,993 INFO L182 omatonBuilderFactory]: Interpolants [21423#true, 21424#false, 21425#(<= main_~i~0 0), 21426#(<= main_~i~0 1), 21427#(<= main_~i~0 2), 21428#(<= main_~i~0 3), 21429#(<= main_~i~0 4), 21430#(<= main_~i~0 5), 21431#(<= main_~i~0 6), 21432#(<= main_~i~0 7), 21433#(<= main_~i~0 8), 21434#(<= main_~i~0 9), 21435#(<= main_~i~0 10), 21436#(<= main_~i~0 11), 21437#(<= main_~i~0 12), 21438#(<= main_~i~0 13), 21439#(<= main_~i~0 14), 21440#(<= main_~i~0 15), 21441#(<= main_~i~0 16), 21442#(<= main_~i~0 17), 21443#(<= main_~i~0 18), 21444#(<= main_~i~0 19), 21445#(<= main_~i~0 20), 21446#(<= main_~i~0 21), 21447#(<= main_~i~0 22), 21448#(<= main_~i~0 23), 21449#(<= main_~i~0 24), 21450#(<= main_~i~0 25), 21451#(<= main_~i~0 26), 21452#(<= main_~i~0 27), 21453#(<= main_~i~0 28), 21454#(<= main_~i~0 29), 21455#(<= main_~i~0 30), 21456#(<= main_~i~0 31), 21457#(<= main_~i~0 32), 21458#(<= main_~i~0 33), 21459#(<= main_~i~0 34), 21460#(<= main_~i~0 35), 21461#(<= main_~i~0 36), 21462#(<= main_~i~0 37), 21463#(<= main_~i~0 38), 21464#(<= main_~i~0 39), 21465#(<= main_~i~0 40), 21466#(<= main_~i~0 41), 21467#(<= main_~i~0 42), 21468#(<= main_~i~0 43), 21469#(<= main_~i~0 44), 21470#(<= main_~i~0 45), 21471#(<= main_~i~0 46), 21472#(<= main_~i~0 47), 21473#(<= main_~i~0 48), 21474#(<= main_~i~0 49), 21475#(<= main_~i~0 50), 21476#(<= main_~i~0 51), 21477#(<= main_~i~0 52)] [2018-04-10 15:44:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:40,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 15:44:40,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 15:44:40,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:44:40,994 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 55 states. [2018-04-10 15:44:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:41,428 INFO L93 Difference]: Finished difference Result 494 states and 545 transitions. [2018-04-10 15:44:41,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 15:44:41,428 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 228 [2018-04-10 15:44:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:41,429 INFO L225 Difference]: With dead ends: 494 [2018-04-10 15:44:41,429 INFO L226 Difference]: Without dead ends: 494 [2018-04-10 15:44:41,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:44:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-10 15:44:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 233. [2018-04-10 15:44:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-10 15:44:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-04-10 15:44:41,433 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-04-10 15:44:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:41,433 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-04-10 15:44:41,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 15:44:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-04-10 15:44:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 15:44:41,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:41,435 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:41,435 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash 126850055, now seen corresponding path program 52 times [2018-04-10 15:44:41,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:41,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5627 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:42,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:42,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-10 15:44:42,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:42,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-10 15:44:42,257 INFO L182 omatonBuilderFactory]: Interpolants [22205#true, 22206#false, 22207#(<= main_~i~0 0), 22208#(<= main_~i~0 1), 22209#(<= main_~i~0 2), 22210#(<= main_~i~0 3), 22211#(<= main_~i~0 4), 22212#(<= main_~i~0 5), 22213#(<= main_~i~0 6), 22214#(<= main_~i~0 7), 22215#(<= main_~i~0 8), 22216#(<= main_~i~0 9), 22217#(<= main_~i~0 10), 22218#(<= main_~i~0 11), 22219#(<= main_~i~0 12), 22220#(<= main_~i~0 13), 22221#(<= main_~i~0 14), 22222#(<= main_~i~0 15), 22223#(<= main_~i~0 16), 22224#(<= main_~i~0 17), 22225#(<= main_~i~0 18), 22226#(<= main_~i~0 19), 22227#(<= main_~i~0 20), 22228#(<= main_~i~0 21), 22229#(<= main_~i~0 22), 22230#(<= main_~i~0 23), 22231#(<= main_~i~0 24), 22232#(<= main_~i~0 25), 22233#(<= main_~i~0 26), 22234#(<= main_~i~0 27), 22235#(<= main_~i~0 28), 22236#(<= main_~i~0 29), 22237#(<= main_~i~0 30), 22238#(<= main_~i~0 31), 22239#(<= main_~i~0 32), 22240#(<= main_~i~0 33), 22241#(<= main_~i~0 34), 22242#(<= main_~i~0 35), 22243#(<= main_~i~0 36), 22244#(<= main_~i~0 37), 22245#(<= main_~i~0 38), 22246#(<= main_~i~0 39), 22247#(<= main_~i~0 40), 22248#(<= main_~i~0 41), 22249#(<= main_~i~0 42), 22250#(<= main_~i~0 43), 22251#(<= main_~i~0 44), 22252#(<= main_~i~0 45), 22253#(<= main_~i~0 46), 22254#(<= main_~i~0 47), 22255#(<= main_~i~0 48), 22256#(<= main_~i~0 49), 22257#(<= main_~i~0 50), 22258#(<= main_~i~0 51), 22259#(<= main_~i~0 52), 22260#(<= main_~i~0 53)] [2018-04-10 15:44:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5627 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:42,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 15:44:42,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 15:44:42,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 15:44:42,258 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 56 states. [2018-04-10 15:44:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:42,779 INFO L93 Difference]: Finished difference Result 503 states and 555 transitions. [2018-04-10 15:44:42,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 15:44:42,779 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 232 [2018-04-10 15:44:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:42,780 INFO L225 Difference]: With dead ends: 503 [2018-04-10 15:44:42,781 INFO L226 Difference]: Without dead ends: 503 [2018-04-10 15:44:42,781 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 15:44:42,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-10 15:44:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 237. [2018-04-10 15:44:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-10 15:44:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-04-10 15:44:42,782 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 232 [2018-04-10 15:44:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:42,783 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-04-10 15:44:42,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 15:44:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-04-10 15:44:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-04-10 15:44:42,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:42,783 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:42,783 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1546767360, now seen corresponding path program 53 times [2018-04-10 15:44:42,784 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:42,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:43,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:43,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-10 15:44:43,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:44:43,609 INFO L182 omatonBuilderFactory]: Interpolants [23040#(<= main_~i~0 37), 23041#(<= main_~i~0 38), 23042#(<= main_~i~0 39), 23043#(<= main_~i~0 40), 23044#(<= main_~i~0 41), 23045#(<= main_~i~0 42), 23046#(<= main_~i~0 43), 23047#(<= main_~i~0 44), 23048#(<= main_~i~0 45), 23049#(<= main_~i~0 46), 23050#(<= main_~i~0 47), 23051#(<= main_~i~0 48), 23052#(<= main_~i~0 49), 23053#(<= main_~i~0 50), 23054#(<= main_~i~0 51), 23055#(<= main_~i~0 52), 23056#(<= main_~i~0 53), 23057#(<= main_~i~0 54), 23001#true, 23002#false, 23003#(<= main_~i~0 0), 23004#(<= main_~i~0 1), 23005#(<= main_~i~0 2), 23006#(<= main_~i~0 3), 23007#(<= main_~i~0 4), 23008#(<= main_~i~0 5), 23009#(<= main_~i~0 6), 23010#(<= main_~i~0 7), 23011#(<= main_~i~0 8), 23012#(<= main_~i~0 9), 23013#(<= main_~i~0 10), 23014#(<= main_~i~0 11), 23015#(<= main_~i~0 12), 23016#(<= main_~i~0 13), 23017#(<= main_~i~0 14), 23018#(<= main_~i~0 15), 23019#(<= main_~i~0 16), 23020#(<= main_~i~0 17), 23021#(<= main_~i~0 18), 23022#(<= main_~i~0 19), 23023#(<= main_~i~0 20), 23024#(<= main_~i~0 21), 23025#(<= main_~i~0 22), 23026#(<= main_~i~0 23), 23027#(<= main_~i~0 24), 23028#(<= main_~i~0 25), 23029#(<= main_~i~0 26), 23030#(<= main_~i~0 27), 23031#(<= main_~i~0 28), 23032#(<= main_~i~0 29), 23033#(<= main_~i~0 30), 23034#(<= main_~i~0 31), 23035#(<= main_~i~0 32), 23036#(<= main_~i~0 33), 23037#(<= main_~i~0 34), 23038#(<= main_~i~0 35), 23039#(<= main_~i~0 36)] [2018-04-10 15:44:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:43,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 15:44:43,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 15:44:43,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 15:44:43,610 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 57 states. [2018-04-10 15:44:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:44,052 INFO L93 Difference]: Finished difference Result 512 states and 565 transitions. [2018-04-10 15:44:44,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 15:44:44,052 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 236 [2018-04-10 15:44:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:44,053 INFO L225 Difference]: With dead ends: 512 [2018-04-10 15:44:44,053 INFO L226 Difference]: Without dead ends: 512 [2018-04-10 15:44:44,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 15:44:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-04-10 15:44:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 241. [2018-04-10 15:44:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-10 15:44:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-04-10 15:44:44,055 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 236 [2018-04-10 15:44:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:44,055 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-04-10 15:44:44,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 15:44:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-04-10 15:44:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-04-10 15:44:44,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:44,056 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:44,056 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1084608647, now seen corresponding path program 54 times [2018-04-10 15:44:44,057 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:44,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:44,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:44,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-10 15:44:44,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:44,896 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-10 15:44:44,897 INFO L182 omatonBuilderFactory]: Interpolants [23811#true, 23812#false, 23813#(<= main_~i~0 0), 23814#(<= main_~i~0 1), 23815#(<= main_~i~0 2), 23816#(<= main_~i~0 3), 23817#(<= main_~i~0 4), 23818#(<= main_~i~0 5), 23819#(<= main_~i~0 6), 23820#(<= main_~i~0 7), 23821#(<= main_~i~0 8), 23822#(<= main_~i~0 9), 23823#(<= main_~i~0 10), 23824#(<= main_~i~0 11), 23825#(<= main_~i~0 12), 23826#(<= main_~i~0 13), 23827#(<= main_~i~0 14), 23828#(<= main_~i~0 15), 23829#(<= main_~i~0 16), 23830#(<= main_~i~0 17), 23831#(<= main_~i~0 18), 23832#(<= main_~i~0 19), 23833#(<= main_~i~0 20), 23834#(<= main_~i~0 21), 23835#(<= main_~i~0 22), 23836#(<= main_~i~0 23), 23837#(<= main_~i~0 24), 23838#(<= main_~i~0 25), 23839#(<= main_~i~0 26), 23840#(<= main_~i~0 27), 23841#(<= main_~i~0 28), 23842#(<= main_~i~0 29), 23843#(<= main_~i~0 30), 23844#(<= main_~i~0 31), 23845#(<= main_~i~0 32), 23846#(<= main_~i~0 33), 23847#(<= main_~i~0 34), 23848#(<= main_~i~0 35), 23849#(<= main_~i~0 36), 23850#(<= main_~i~0 37), 23851#(<= main_~i~0 38), 23852#(<= main_~i~0 39), 23853#(<= main_~i~0 40), 23854#(<= main_~i~0 41), 23855#(<= main_~i~0 42), 23856#(<= main_~i~0 43), 23857#(<= main_~i~0 44), 23858#(<= main_~i~0 45), 23859#(<= main_~i~0 46), 23860#(<= main_~i~0 47), 23861#(<= main_~i~0 48), 23862#(<= main_~i~0 49), 23863#(<= main_~i~0 50), 23864#(<= main_~i~0 51), 23865#(<= main_~i~0 52), 23866#(<= main_~i~0 53), 23867#(<= main_~i~0 54), 23868#(<= main_~i~0 55)] [2018-04-10 15:44:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:44,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 15:44:44,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 15:44:44,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:44:44,897 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 58 states. [2018-04-10 15:44:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:45,455 INFO L93 Difference]: Finished difference Result 521 states and 575 transitions. [2018-04-10 15:44:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 15:44:45,456 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 240 [2018-04-10 15:44:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:45,457 INFO L225 Difference]: With dead ends: 521 [2018-04-10 15:44:45,457 INFO L226 Difference]: Without dead ends: 521 [2018-04-10 15:44:45,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:44:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-04-10 15:44:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 245. [2018-04-10 15:44:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-10 15:44:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-04-10 15:44:45,459 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 240 [2018-04-10 15:44:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:45,459 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-04-10 15:44:45,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 15:44:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-04-10 15:44:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-04-10 15:44:45,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:45,460 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:45,460 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -182860174, now seen corresponding path program 55 times [2018-04-10 15:44:45,460 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:45,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:46,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:46,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-10 15:44:46,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:46,328 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-10 15:44:46,329 INFO L182 omatonBuilderFactory]: Interpolants [24635#true, 24636#false, 24637#(<= main_~i~0 0), 24638#(<= main_~i~0 1), 24639#(<= main_~i~0 2), 24640#(<= main_~i~0 3), 24641#(<= main_~i~0 4), 24642#(<= main_~i~0 5), 24643#(<= main_~i~0 6), 24644#(<= main_~i~0 7), 24645#(<= main_~i~0 8), 24646#(<= main_~i~0 9), 24647#(<= main_~i~0 10), 24648#(<= main_~i~0 11), 24649#(<= main_~i~0 12), 24650#(<= main_~i~0 13), 24651#(<= main_~i~0 14), 24652#(<= main_~i~0 15), 24653#(<= main_~i~0 16), 24654#(<= main_~i~0 17), 24655#(<= main_~i~0 18), 24656#(<= main_~i~0 19), 24657#(<= main_~i~0 20), 24658#(<= main_~i~0 21), 24659#(<= main_~i~0 22), 24660#(<= main_~i~0 23), 24661#(<= main_~i~0 24), 24662#(<= main_~i~0 25), 24663#(<= main_~i~0 26), 24664#(<= main_~i~0 27), 24665#(<= main_~i~0 28), 24666#(<= main_~i~0 29), 24667#(<= main_~i~0 30), 24668#(<= main_~i~0 31), 24669#(<= main_~i~0 32), 24670#(<= main_~i~0 33), 24671#(<= main_~i~0 34), 24672#(<= main_~i~0 35), 24673#(<= main_~i~0 36), 24674#(<= main_~i~0 37), 24675#(<= main_~i~0 38), 24676#(<= main_~i~0 39), 24677#(<= main_~i~0 40), 24678#(<= main_~i~0 41), 24679#(<= main_~i~0 42), 24680#(<= main_~i~0 43), 24681#(<= main_~i~0 44), 24682#(<= main_~i~0 45), 24683#(<= main_~i~0 46), 24684#(<= main_~i~0 47), 24685#(<= main_~i~0 48), 24686#(<= main_~i~0 49), 24687#(<= main_~i~0 50), 24688#(<= main_~i~0 51), 24689#(<= main_~i~0 52), 24690#(<= main_~i~0 53), 24691#(<= main_~i~0 54), 24692#(<= main_~i~0 55), 24693#(<= main_~i~0 56)] [2018-04-10 15:44:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:46,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 15:44:46,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 15:44:46,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:44:46,329 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 59 states. [2018-04-10 15:44:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:46,912 INFO L93 Difference]: Finished difference Result 530 states and 585 transitions. [2018-04-10 15:44:46,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 15:44:46,912 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 244 [2018-04-10 15:44:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:46,913 INFO L225 Difference]: With dead ends: 530 [2018-04-10 15:44:46,913 INFO L226 Difference]: Without dead ends: 530 [2018-04-10 15:44:46,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:44:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-04-10 15:44:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 249. [2018-04-10 15:44:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-10 15:44:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-04-10 15:44:46,915 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-04-10 15:44:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:46,915 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-04-10 15:44:46,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 15:44:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-04-10 15:44:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-04-10 15:44:46,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:46,916 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:46,916 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2100086549, now seen corresponding path program 56 times [2018-04-10 15:44:46,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:46,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6507 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:47,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:47,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-10 15:44:47,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:47,856 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-10 15:44:47,856 INFO L182 omatonBuilderFactory]: Interpolants [25473#true, 25474#false, 25475#(<= main_~i~0 0), 25476#(<= main_~i~0 1), 25477#(<= main_~i~0 2), 25478#(<= main_~i~0 3), 25479#(<= main_~i~0 4), 25480#(<= main_~i~0 5), 25481#(<= main_~i~0 6), 25482#(<= main_~i~0 7), 25483#(<= main_~i~0 8), 25484#(<= main_~i~0 9), 25485#(<= main_~i~0 10), 25486#(<= main_~i~0 11), 25487#(<= main_~i~0 12), 25488#(<= main_~i~0 13), 25489#(<= main_~i~0 14), 25490#(<= main_~i~0 15), 25491#(<= main_~i~0 16), 25492#(<= main_~i~0 17), 25493#(<= main_~i~0 18), 25494#(<= main_~i~0 19), 25495#(<= main_~i~0 20), 25496#(<= main_~i~0 21), 25497#(<= main_~i~0 22), 25498#(<= main_~i~0 23), 25499#(<= main_~i~0 24), 25500#(<= main_~i~0 25), 25501#(<= main_~i~0 26), 25502#(<= main_~i~0 27), 25503#(<= main_~i~0 28), 25504#(<= main_~i~0 29), 25505#(<= main_~i~0 30), 25506#(<= main_~i~0 31), 25507#(<= main_~i~0 32), 25508#(<= main_~i~0 33), 25509#(<= main_~i~0 34), 25510#(<= main_~i~0 35), 25511#(<= main_~i~0 36), 25512#(<= main_~i~0 37), 25513#(<= main_~i~0 38), 25514#(<= main_~i~0 39), 25515#(<= main_~i~0 40), 25516#(<= main_~i~0 41), 25517#(<= main_~i~0 42), 25518#(<= main_~i~0 43), 25519#(<= main_~i~0 44), 25520#(<= main_~i~0 45), 25521#(<= main_~i~0 46), 25522#(<= main_~i~0 47), 25523#(<= main_~i~0 48), 25524#(<= main_~i~0 49), 25525#(<= main_~i~0 50), 25526#(<= main_~i~0 51), 25527#(<= main_~i~0 52), 25528#(<= main_~i~0 53), 25529#(<= main_~i~0 54), 25530#(<= main_~i~0 55), 25531#(<= main_~i~0 56), 25532#(<= main_~i~0 57)] [2018-04-10 15:44:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6507 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:47,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 15:44:47,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 15:44:47,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 15:44:47,857 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 60 states. [2018-04-10 15:44:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:48,480 INFO L93 Difference]: Finished difference Result 539 states and 595 transitions. [2018-04-10 15:44:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 15:44:48,480 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 248 [2018-04-10 15:44:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:48,481 INFO L225 Difference]: With dead ends: 539 [2018-04-10 15:44:48,481 INFO L226 Difference]: Without dead ends: 539 [2018-04-10 15:44:48,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 15:44:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-10 15:44:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 253. [2018-04-10 15:44:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-10 15:44:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-04-10 15:44:48,483 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 248 [2018-04-10 15:44:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:48,484 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-04-10 15:44:48,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 15:44:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-04-10 15:44:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-10 15:44:48,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:48,484 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:48,484 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash -651376924, now seen corresponding path program 57 times [2018-04-10 15:44:48,485 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:48,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6737 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:49,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:49,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-10 15:44:49,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:49,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-10 15:44:49,422 INFO L182 omatonBuilderFactory]: Interpolants [26368#(<= main_~i~0 41), 26369#(<= main_~i~0 42), 26370#(<= main_~i~0 43), 26371#(<= main_~i~0 44), 26372#(<= main_~i~0 45), 26373#(<= main_~i~0 46), 26374#(<= main_~i~0 47), 26375#(<= main_~i~0 48), 26376#(<= main_~i~0 49), 26377#(<= main_~i~0 50), 26378#(<= main_~i~0 51), 26379#(<= main_~i~0 52), 26380#(<= main_~i~0 53), 26381#(<= main_~i~0 54), 26382#(<= main_~i~0 55), 26383#(<= main_~i~0 56), 26384#(<= main_~i~0 57), 26385#(<= main_~i~0 58), 26325#true, 26326#false, 26327#(<= main_~i~0 0), 26328#(<= main_~i~0 1), 26329#(<= main_~i~0 2), 26330#(<= main_~i~0 3), 26331#(<= main_~i~0 4), 26332#(<= main_~i~0 5), 26333#(<= main_~i~0 6), 26334#(<= main_~i~0 7), 26335#(<= main_~i~0 8), 26336#(<= main_~i~0 9), 26337#(<= main_~i~0 10), 26338#(<= main_~i~0 11), 26339#(<= main_~i~0 12), 26340#(<= main_~i~0 13), 26341#(<= main_~i~0 14), 26342#(<= main_~i~0 15), 26343#(<= main_~i~0 16), 26344#(<= main_~i~0 17), 26345#(<= main_~i~0 18), 26346#(<= main_~i~0 19), 26347#(<= main_~i~0 20), 26348#(<= main_~i~0 21), 26349#(<= main_~i~0 22), 26350#(<= main_~i~0 23), 26351#(<= main_~i~0 24), 26352#(<= main_~i~0 25), 26353#(<= main_~i~0 26), 26354#(<= main_~i~0 27), 26355#(<= main_~i~0 28), 26356#(<= main_~i~0 29), 26357#(<= main_~i~0 30), 26358#(<= main_~i~0 31), 26359#(<= main_~i~0 32), 26360#(<= main_~i~0 33), 26361#(<= main_~i~0 34), 26362#(<= main_~i~0 35), 26363#(<= main_~i~0 36), 26364#(<= main_~i~0 37), 26365#(<= main_~i~0 38), 26366#(<= main_~i~0 39), 26367#(<= main_~i~0 40)] [2018-04-10 15:44:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6737 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:49,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 15:44:49,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 15:44:49,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:44:49,423 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 61 states. [2018-04-10 15:44:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:49,917 INFO L93 Difference]: Finished difference Result 548 states and 605 transitions. [2018-04-10 15:44:49,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 15:44:49,917 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 252 [2018-04-10 15:44:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:49,919 INFO L225 Difference]: With dead ends: 548 [2018-04-10 15:44:49,919 INFO L226 Difference]: Without dead ends: 548 [2018-04-10 15:44:49,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:44:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-10 15:44:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 257. [2018-04-10 15:44:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-10 15:44:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-04-10 15:44:49,921 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 252 [2018-04-10 15:44:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:49,921 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-04-10 15:44:49,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 15:44:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-04-10 15:44:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-04-10 15:44:49,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:49,922 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:49,922 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:49,922 INFO L82 PathProgramCache]: Analyzing trace with hash 732737629, now seen corresponding path program 58 times [2018-04-10 15:44:49,923 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:49,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:50,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:50,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-10 15:44:50,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:50,883 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-10 15:44:50,883 INFO L182 omatonBuilderFactory]: Interpolants [27191#true, 27192#false, 27193#(<= main_~i~0 0), 27194#(<= main_~i~0 1), 27195#(<= main_~i~0 2), 27196#(<= main_~i~0 3), 27197#(<= main_~i~0 4), 27198#(<= main_~i~0 5), 27199#(<= main_~i~0 6), 27200#(<= main_~i~0 7), 27201#(<= main_~i~0 8), 27202#(<= main_~i~0 9), 27203#(<= main_~i~0 10), 27204#(<= main_~i~0 11), 27205#(<= main_~i~0 12), 27206#(<= main_~i~0 13), 27207#(<= main_~i~0 14), 27208#(<= main_~i~0 15), 27209#(<= main_~i~0 16), 27210#(<= main_~i~0 17), 27211#(<= main_~i~0 18), 27212#(<= main_~i~0 19), 27213#(<= main_~i~0 20), 27214#(<= main_~i~0 21), 27215#(<= main_~i~0 22), 27216#(<= main_~i~0 23), 27217#(<= main_~i~0 24), 27218#(<= main_~i~0 25), 27219#(<= main_~i~0 26), 27220#(<= main_~i~0 27), 27221#(<= main_~i~0 28), 27222#(<= main_~i~0 29), 27223#(<= main_~i~0 30), 27224#(<= main_~i~0 31), 27225#(<= main_~i~0 32), 27226#(<= main_~i~0 33), 27227#(<= main_~i~0 34), 27228#(<= main_~i~0 35), 27229#(<= main_~i~0 36), 27230#(<= main_~i~0 37), 27231#(<= main_~i~0 38), 27232#(<= main_~i~0 39), 27233#(<= main_~i~0 40), 27234#(<= main_~i~0 41), 27235#(<= main_~i~0 42), 27236#(<= main_~i~0 43), 27237#(<= main_~i~0 44), 27238#(<= main_~i~0 45), 27239#(<= main_~i~0 46), 27240#(<= main_~i~0 47), 27241#(<= main_~i~0 48), 27242#(<= main_~i~0 49), 27243#(<= main_~i~0 50), 27244#(<= main_~i~0 51), 27245#(<= main_~i~0 52), 27246#(<= main_~i~0 53), 27247#(<= main_~i~0 54), 27248#(<= main_~i~0 55), 27249#(<= main_~i~0 56), 27250#(<= main_~i~0 57), 27251#(<= main_~i~0 58), 27252#(<= main_~i~0 59)] [2018-04-10 15:44:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:50,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 15:44:50,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 15:44:50,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 15:44:50,884 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 62 states. [2018-04-10 15:44:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:51,515 INFO L93 Difference]: Finished difference Result 557 states and 615 transitions. [2018-04-10 15:44:51,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 15:44:51,515 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 256 [2018-04-10 15:44:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:51,516 INFO L225 Difference]: With dead ends: 557 [2018-04-10 15:44:51,516 INFO L226 Difference]: Without dead ends: 557 [2018-04-10 15:44:51,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 15:44:51,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-04-10 15:44:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 261. [2018-04-10 15:44:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-10 15:44:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-04-10 15:44:51,519 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 256 [2018-04-10 15:44:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:51,519 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-04-10 15:44:51,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 15:44:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-04-10 15:44:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-04-10 15:44:51,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:51,520 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:51,520 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:51,520 INFO L82 PathProgramCache]: Analyzing trace with hash 12137814, now seen corresponding path program 59 times [2018-04-10 15:44:51,521 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:51,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:52,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:52,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-10 15:44:52,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:52,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-10 15:44:52,618 INFO L182 omatonBuilderFactory]: Interpolants [28071#true, 28072#false, 28073#(<= main_~i~0 0), 28074#(<= main_~i~0 1), 28075#(<= main_~i~0 2), 28076#(<= main_~i~0 3), 28077#(<= main_~i~0 4), 28078#(<= main_~i~0 5), 28079#(<= main_~i~0 6), 28080#(<= main_~i~0 7), 28081#(<= main_~i~0 8), 28082#(<= main_~i~0 9), 28083#(<= main_~i~0 10), 28084#(<= main_~i~0 11), 28085#(<= main_~i~0 12), 28086#(<= main_~i~0 13), 28087#(<= main_~i~0 14), 28088#(<= main_~i~0 15), 28089#(<= main_~i~0 16), 28090#(<= main_~i~0 17), 28091#(<= main_~i~0 18), 28092#(<= main_~i~0 19), 28093#(<= main_~i~0 20), 28094#(<= main_~i~0 21), 28095#(<= main_~i~0 22), 28096#(<= main_~i~0 23), 28097#(<= main_~i~0 24), 28098#(<= main_~i~0 25), 28099#(<= main_~i~0 26), 28100#(<= main_~i~0 27), 28101#(<= main_~i~0 28), 28102#(<= main_~i~0 29), 28103#(<= main_~i~0 30), 28104#(<= main_~i~0 31), 28105#(<= main_~i~0 32), 28106#(<= main_~i~0 33), 28107#(<= main_~i~0 34), 28108#(<= main_~i~0 35), 28109#(<= main_~i~0 36), 28110#(<= main_~i~0 37), 28111#(<= main_~i~0 38), 28112#(<= main_~i~0 39), 28113#(<= main_~i~0 40), 28114#(<= main_~i~0 41), 28115#(<= main_~i~0 42), 28116#(<= main_~i~0 43), 28117#(<= main_~i~0 44), 28118#(<= main_~i~0 45), 28119#(<= main_~i~0 46), 28120#(<= main_~i~0 47), 28121#(<= main_~i~0 48), 28122#(<= main_~i~0 49), 28123#(<= main_~i~0 50), 28124#(<= main_~i~0 51), 28125#(<= main_~i~0 52), 28126#(<= main_~i~0 53), 28127#(<= main_~i~0 54), 28128#(<= main_~i~0 55), 28129#(<= main_~i~0 56), 28130#(<= main_~i~0 57), 28131#(<= main_~i~0 58), 28132#(<= main_~i~0 59), 28133#(<= main_~i~0 60)] [2018-04-10 15:44:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:52,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 15:44:52,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 15:44:52,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 15:44:52,619 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 63 states. [2018-04-10 15:44:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:53,224 INFO L93 Difference]: Finished difference Result 566 states and 625 transitions. [2018-04-10 15:44:53,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 15:44:53,224 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 260 [2018-04-10 15:44:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:53,225 INFO L225 Difference]: With dead ends: 566 [2018-04-10 15:44:53,226 INFO L226 Difference]: Without dead ends: 566 [2018-04-10 15:44:53,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 15:44:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-04-10 15:44:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 265. [2018-04-10 15:44:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-10 15:44:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-04-10 15:44:53,228 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 260 [2018-04-10 15:44:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:53,228 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-04-10 15:44:53,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 15:44:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-04-10 15:44:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-04-10 15:44:53,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:53,229 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:53,229 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1046964785, now seen corresponding path program 60 times [2018-04-10 15:44:53,230 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:53,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7451 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:54,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:54,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-10 15:44:54,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:54,277 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-10 15:44:54,277 INFO L182 omatonBuilderFactory]: Interpolants [28965#true, 28966#false, 28967#(<= main_~i~0 0), 28968#(<= main_~i~0 1), 28969#(<= main_~i~0 2), 28970#(<= main_~i~0 3), 28971#(<= main_~i~0 4), 28972#(<= main_~i~0 5), 28973#(<= main_~i~0 6), 28974#(<= main_~i~0 7), 28975#(<= main_~i~0 8), 28976#(<= main_~i~0 9), 28977#(<= main_~i~0 10), 28978#(<= main_~i~0 11), 28979#(<= main_~i~0 12), 28980#(<= main_~i~0 13), 28981#(<= main_~i~0 14), 28982#(<= main_~i~0 15), 28983#(<= main_~i~0 16), 28984#(<= main_~i~0 17), 28985#(<= main_~i~0 18), 28986#(<= main_~i~0 19), 28987#(<= main_~i~0 20), 28988#(<= main_~i~0 21), 28989#(<= main_~i~0 22), 28990#(<= main_~i~0 23), 28991#(<= main_~i~0 24), 28992#(<= main_~i~0 25), 28993#(<= main_~i~0 26), 28994#(<= main_~i~0 27), 28995#(<= main_~i~0 28), 28996#(<= main_~i~0 29), 28997#(<= main_~i~0 30), 28998#(<= main_~i~0 31), 28999#(<= main_~i~0 32), 29000#(<= main_~i~0 33), 29001#(<= main_~i~0 34), 29002#(<= main_~i~0 35), 29003#(<= main_~i~0 36), 29004#(<= main_~i~0 37), 29005#(<= main_~i~0 38), 29006#(<= main_~i~0 39), 29007#(<= main_~i~0 40), 29008#(<= main_~i~0 41), 29009#(<= main_~i~0 42), 29010#(<= main_~i~0 43), 29011#(<= main_~i~0 44), 29012#(<= main_~i~0 45), 29013#(<= main_~i~0 46), 29014#(<= main_~i~0 47), 29015#(<= main_~i~0 48), 29016#(<= main_~i~0 49), 29017#(<= main_~i~0 50), 29018#(<= main_~i~0 51), 29019#(<= main_~i~0 52), 29020#(<= main_~i~0 53), 29021#(<= main_~i~0 54), 29022#(<= main_~i~0 55), 29023#(<= main_~i~0 56), 29024#(<= main_~i~0 57), 29025#(<= main_~i~0 58), 29026#(<= main_~i~0 59), 29027#(<= main_~i~0 60), 29028#(<= main_~i~0 61)] [2018-04-10 15:44:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7451 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:54,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 15:44:54,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 15:44:54,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 15:44:54,279 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 64 states. [2018-04-10 15:44:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:54,936 INFO L93 Difference]: Finished difference Result 575 states and 635 transitions. [2018-04-10 15:44:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 15:44:54,936 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 264 [2018-04-10 15:44:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:54,937 INFO L225 Difference]: With dead ends: 575 [2018-04-10 15:44:54,937 INFO L226 Difference]: Without dead ends: 575 [2018-04-10 15:44:54,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 15:44:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-10 15:44:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 269. [2018-04-10 15:44:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-10 15:44:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-04-10 15:44:54,940 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 264 [2018-04-10 15:44:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:54,940 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-04-10 15:44:54,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 15:44:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-04-10 15:44:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-04-10 15:44:54,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:54,941 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:54,941 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1248924104, now seen corresponding path program 61 times [2018-04-10 15:44:54,942 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:54,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7697 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:56,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:56,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-10 15:44:56,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:56,014 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-10 15:44:56,014 INFO L182 omatonBuilderFactory]: Interpolants [29873#true, 29874#false, 29875#(<= main_~i~0 0), 29876#(<= main_~i~0 1), 29877#(<= main_~i~0 2), 29878#(<= main_~i~0 3), 29879#(<= main_~i~0 4), 29880#(<= main_~i~0 5), 29881#(<= main_~i~0 6), 29882#(<= main_~i~0 7), 29883#(<= main_~i~0 8), 29884#(<= main_~i~0 9), 29885#(<= main_~i~0 10), 29886#(<= main_~i~0 11), 29887#(<= main_~i~0 12), 29888#(<= main_~i~0 13), 29889#(<= main_~i~0 14), 29890#(<= main_~i~0 15), 29891#(<= main_~i~0 16), 29892#(<= main_~i~0 17), 29893#(<= main_~i~0 18), 29894#(<= main_~i~0 19), 29895#(<= main_~i~0 20), 29896#(<= main_~i~0 21), 29897#(<= main_~i~0 22), 29898#(<= main_~i~0 23), 29899#(<= main_~i~0 24), 29900#(<= main_~i~0 25), 29901#(<= main_~i~0 26), 29902#(<= main_~i~0 27), 29903#(<= main_~i~0 28), 29904#(<= main_~i~0 29), 29905#(<= main_~i~0 30), 29906#(<= main_~i~0 31), 29907#(<= main_~i~0 32), 29908#(<= main_~i~0 33), 29909#(<= main_~i~0 34), 29910#(<= main_~i~0 35), 29911#(<= main_~i~0 36), 29912#(<= main_~i~0 37), 29913#(<= main_~i~0 38), 29914#(<= main_~i~0 39), 29915#(<= main_~i~0 40), 29916#(<= main_~i~0 41), 29917#(<= main_~i~0 42), 29918#(<= main_~i~0 43), 29919#(<= main_~i~0 44), 29920#(<= main_~i~0 45), 29921#(<= main_~i~0 46), 29922#(<= main_~i~0 47), 29923#(<= main_~i~0 48), 29924#(<= main_~i~0 49), 29925#(<= main_~i~0 50), 29926#(<= main_~i~0 51), 29927#(<= main_~i~0 52), 29928#(<= main_~i~0 53), 29929#(<= main_~i~0 54), 29930#(<= main_~i~0 55), 29931#(<= main_~i~0 56), 29932#(<= main_~i~0 57), 29933#(<= main_~i~0 58), 29934#(<= main_~i~0 59), 29935#(<= main_~i~0 60), 29936#(<= main_~i~0 61), 29937#(<= main_~i~0 62)] [2018-04-10 15:44:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7697 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:56,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 15:44:56,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 15:44:56,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:44:56,015 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 65 states. [2018-04-10 15:44:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:56,682 INFO L93 Difference]: Finished difference Result 584 states and 645 transitions. [2018-04-10 15:44:56,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 15:44:56,682 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 268 [2018-04-10 15:44:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:56,683 INFO L225 Difference]: With dead ends: 584 [2018-04-10 15:44:56,683 INFO L226 Difference]: Without dead ends: 584 [2018-04-10 15:44:56,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:44:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-04-10 15:44:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 273. [2018-04-10 15:44:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-10 15:44:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-04-10 15:44:56,685 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 268 [2018-04-10 15:44:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:56,685 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-04-10 15:44:56,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 15:44:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-04-10 15:44:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-10 15:44:56,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:56,686 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:56,686 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2051598657, now seen corresponding path program 62 times [2018-04-10 15:44:56,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:56,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7947 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:57,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:57,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-10 15:44:57,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:57,782 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-10 15:44:57,782 INFO L182 omatonBuilderFactory]: Interpolants [30848#(<= main_~i~0 51), 30849#(<= main_~i~0 52), 30850#(<= main_~i~0 53), 30851#(<= main_~i~0 54), 30852#(<= main_~i~0 55), 30853#(<= main_~i~0 56), 30854#(<= main_~i~0 57), 30855#(<= main_~i~0 58), 30856#(<= main_~i~0 59), 30857#(<= main_~i~0 60), 30858#(<= main_~i~0 61), 30859#(<= main_~i~0 62), 30860#(<= main_~i~0 63), 30795#true, 30796#false, 30797#(<= main_~i~0 0), 30798#(<= main_~i~0 1), 30799#(<= main_~i~0 2), 30800#(<= main_~i~0 3), 30801#(<= main_~i~0 4), 30802#(<= main_~i~0 5), 30803#(<= main_~i~0 6), 30804#(<= main_~i~0 7), 30805#(<= main_~i~0 8), 30806#(<= main_~i~0 9), 30807#(<= main_~i~0 10), 30808#(<= main_~i~0 11), 30809#(<= main_~i~0 12), 30810#(<= main_~i~0 13), 30811#(<= main_~i~0 14), 30812#(<= main_~i~0 15), 30813#(<= main_~i~0 16), 30814#(<= main_~i~0 17), 30815#(<= main_~i~0 18), 30816#(<= main_~i~0 19), 30817#(<= main_~i~0 20), 30818#(<= main_~i~0 21), 30819#(<= main_~i~0 22), 30820#(<= main_~i~0 23), 30821#(<= main_~i~0 24), 30822#(<= main_~i~0 25), 30823#(<= main_~i~0 26), 30824#(<= main_~i~0 27), 30825#(<= main_~i~0 28), 30826#(<= main_~i~0 29), 30827#(<= main_~i~0 30), 30828#(<= main_~i~0 31), 30829#(<= main_~i~0 32), 30830#(<= main_~i~0 33), 30831#(<= main_~i~0 34), 30832#(<= main_~i~0 35), 30833#(<= main_~i~0 36), 30834#(<= main_~i~0 37), 30835#(<= main_~i~0 38), 30836#(<= main_~i~0 39), 30837#(<= main_~i~0 40), 30838#(<= main_~i~0 41), 30839#(<= main_~i~0 42), 30840#(<= main_~i~0 43), 30841#(<= main_~i~0 44), 30842#(<= main_~i~0 45), 30843#(<= main_~i~0 46), 30844#(<= main_~i~0 47), 30845#(<= main_~i~0 48), 30846#(<= main_~i~0 49), 30847#(<= main_~i~0 50)] [2018-04-10 15:44:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7947 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:57,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 15:44:57,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 15:44:57,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:44:57,783 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 66 states. [2018-04-10 15:44:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:58,429 INFO L93 Difference]: Finished difference Result 593 states and 655 transitions. [2018-04-10 15:44:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 15:44:58,429 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 272 [2018-04-10 15:44:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:58,431 INFO L225 Difference]: With dead ends: 593 [2018-04-10 15:44:58,431 INFO L226 Difference]: Without dead ends: 593 [2018-04-10 15:44:58,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:44:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-04-10 15:44:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 277. [2018-04-10 15:44:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-04-10 15:44:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-04-10 15:44:58,433 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 272 [2018-04-10 15:44:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:58,433 INFO L459 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-04-10 15:44:58,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 15:44:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-04-10 15:44:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-04-10 15:44:58,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:58,434 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:58,435 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:44:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1022993350, now seen corresponding path program 63 times [2018-04-10 15:44:58,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:58,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8201 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:59,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:59,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-10 15:44:59,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:59,555 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-10 15:44:59,556 INFO L182 omatonBuilderFactory]: Interpolants [31744#(<= main_~i~0 11), 31745#(<= main_~i~0 12), 31746#(<= main_~i~0 13), 31747#(<= main_~i~0 14), 31748#(<= main_~i~0 15), 31749#(<= main_~i~0 16), 31750#(<= main_~i~0 17), 31751#(<= main_~i~0 18), 31752#(<= main_~i~0 19), 31753#(<= main_~i~0 20), 31754#(<= main_~i~0 21), 31755#(<= main_~i~0 22), 31756#(<= main_~i~0 23), 31757#(<= main_~i~0 24), 31758#(<= main_~i~0 25), 31759#(<= main_~i~0 26), 31760#(<= main_~i~0 27), 31761#(<= main_~i~0 28), 31762#(<= main_~i~0 29), 31763#(<= main_~i~0 30), 31764#(<= main_~i~0 31), 31765#(<= main_~i~0 32), 31766#(<= main_~i~0 33), 31767#(<= main_~i~0 34), 31768#(<= main_~i~0 35), 31769#(<= main_~i~0 36), 31770#(<= main_~i~0 37), 31771#(<= main_~i~0 38), 31772#(<= main_~i~0 39), 31773#(<= main_~i~0 40), 31774#(<= main_~i~0 41), 31775#(<= main_~i~0 42), 31776#(<= main_~i~0 43), 31777#(<= main_~i~0 44), 31778#(<= main_~i~0 45), 31779#(<= main_~i~0 46), 31780#(<= main_~i~0 47), 31781#(<= main_~i~0 48), 31782#(<= main_~i~0 49), 31783#(<= main_~i~0 50), 31784#(<= main_~i~0 51), 31785#(<= main_~i~0 52), 31786#(<= main_~i~0 53), 31787#(<= main_~i~0 54), 31788#(<= main_~i~0 55), 31789#(<= main_~i~0 56), 31790#(<= main_~i~0 57), 31791#(<= main_~i~0 58), 31792#(<= main_~i~0 59), 31793#(<= main_~i~0 60), 31794#(<= main_~i~0 61), 31795#(<= main_~i~0 62), 31796#(<= main_~i~0 63), 31797#(<= main_~i~0 64), 31731#true, 31732#false, 31733#(<= main_~i~0 0), 31734#(<= main_~i~0 1), 31735#(<= main_~i~0 2), 31736#(<= main_~i~0 3), 31737#(<= main_~i~0 4), 31738#(<= main_~i~0 5), 31739#(<= main_~i~0 6), 31740#(<= main_~i~0 7), 31741#(<= main_~i~0 8), 31742#(<= main_~i~0 9), 31743#(<= main_~i~0 10)] [2018-04-10 15:44:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8201 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:44:59,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 15:44:59,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 15:44:59,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:44:59,556 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 67 states. [2018-04-10 15:45:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:00,238 INFO L93 Difference]: Finished difference Result 602 states and 665 transitions. [2018-04-10 15:45:00,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 15:45:00,239 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 276 [2018-04-10 15:45:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:00,240 INFO L225 Difference]: With dead ends: 602 [2018-04-10 15:45:00,240 INFO L226 Difference]: Without dead ends: 602 [2018-04-10 15:45:00,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:45:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-04-10 15:45:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 281. [2018-04-10 15:45:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-10 15:45:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-04-10 15:45:00,242 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 276 [2018-04-10 15:45:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:00,242 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-04-10 15:45:00,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 15:45:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-04-10 15:45:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-04-10 15:45:00,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:00,243 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:00,243 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1183864141, now seen corresponding path program 64 times [2018-04-10 15:45:00,243 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:00,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8459 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:01,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:01,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-10 15:45:01,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:01,611 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-10 15:45:01,611 INFO L182 omatonBuilderFactory]: Interpolants [32681#true, 32682#false, 32683#(<= main_~i~0 0), 32684#(<= main_~i~0 1), 32685#(<= main_~i~0 2), 32686#(<= main_~i~0 3), 32687#(<= main_~i~0 4), 32688#(<= main_~i~0 5), 32689#(<= main_~i~0 6), 32690#(<= main_~i~0 7), 32691#(<= main_~i~0 8), 32692#(<= main_~i~0 9), 32693#(<= main_~i~0 10), 32694#(<= main_~i~0 11), 32695#(<= main_~i~0 12), 32696#(<= main_~i~0 13), 32697#(<= main_~i~0 14), 32698#(<= main_~i~0 15), 32699#(<= main_~i~0 16), 32700#(<= main_~i~0 17), 32701#(<= main_~i~0 18), 32702#(<= main_~i~0 19), 32703#(<= main_~i~0 20), 32704#(<= main_~i~0 21), 32705#(<= main_~i~0 22), 32706#(<= main_~i~0 23), 32707#(<= main_~i~0 24), 32708#(<= main_~i~0 25), 32709#(<= main_~i~0 26), 32710#(<= main_~i~0 27), 32711#(<= main_~i~0 28), 32712#(<= main_~i~0 29), 32713#(<= main_~i~0 30), 32714#(<= main_~i~0 31), 32715#(<= main_~i~0 32), 32716#(<= main_~i~0 33), 32717#(<= main_~i~0 34), 32718#(<= main_~i~0 35), 32719#(<= main_~i~0 36), 32720#(<= main_~i~0 37), 32721#(<= main_~i~0 38), 32722#(<= main_~i~0 39), 32723#(<= main_~i~0 40), 32724#(<= main_~i~0 41), 32725#(<= main_~i~0 42), 32726#(<= main_~i~0 43), 32727#(<= main_~i~0 44), 32728#(<= main_~i~0 45), 32729#(<= main_~i~0 46), 32730#(<= main_~i~0 47), 32731#(<= main_~i~0 48), 32732#(<= main_~i~0 49), 32733#(<= main_~i~0 50), 32734#(<= main_~i~0 51), 32735#(<= main_~i~0 52), 32736#(<= main_~i~0 53), 32737#(<= main_~i~0 54), 32738#(<= main_~i~0 55), 32739#(<= main_~i~0 56), 32740#(<= main_~i~0 57), 32741#(<= main_~i~0 58), 32742#(<= main_~i~0 59), 32743#(<= main_~i~0 60), 32744#(<= main_~i~0 61), 32745#(<= main_~i~0 62), 32746#(<= main_~i~0 63), 32747#(<= main_~i~0 64), 32748#(<= main_~i~0 65)] [2018-04-10 15:45:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8459 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:01,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 15:45:01,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 15:45:01,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 15:45:01,612 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 68 states. [2018-04-10 15:45:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:02,568 INFO L93 Difference]: Finished difference Result 611 states and 675 transitions. [2018-04-10 15:45:02,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 15:45:02,568 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 280 [2018-04-10 15:45:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:02,569 INFO L225 Difference]: With dead ends: 611 [2018-04-10 15:45:02,569 INFO L226 Difference]: Without dead ends: 611 [2018-04-10 15:45:02,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 15:45:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-04-10 15:45:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 285. [2018-04-10 15:45:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-10 15:45:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-04-10 15:45:02,572 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 280 [2018-04-10 15:45:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:02,572 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-04-10 15:45:02,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-10 15:45:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-04-10 15:45:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-04-10 15:45:02,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:02,573 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:02,573 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1523903316, now seen corresponding path program 65 times [2018-04-10 15:45:02,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:02,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8721 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:03,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:03,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-10 15:45:03,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:03,822 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-10 15:45:03,822 INFO L182 omatonBuilderFactory]: Interpolants [33664#(<= main_~i~0 17), 33665#(<= main_~i~0 18), 33666#(<= main_~i~0 19), 33667#(<= main_~i~0 20), 33668#(<= main_~i~0 21), 33669#(<= main_~i~0 22), 33670#(<= main_~i~0 23), 33671#(<= main_~i~0 24), 33672#(<= main_~i~0 25), 33673#(<= main_~i~0 26), 33674#(<= main_~i~0 27), 33675#(<= main_~i~0 28), 33676#(<= main_~i~0 29), 33677#(<= main_~i~0 30), 33678#(<= main_~i~0 31), 33679#(<= main_~i~0 32), 33680#(<= main_~i~0 33), 33681#(<= main_~i~0 34), 33682#(<= main_~i~0 35), 33683#(<= main_~i~0 36), 33684#(<= main_~i~0 37), 33685#(<= main_~i~0 38), 33686#(<= main_~i~0 39), 33687#(<= main_~i~0 40), 33688#(<= main_~i~0 41), 33689#(<= main_~i~0 42), 33690#(<= main_~i~0 43), 33691#(<= main_~i~0 44), 33692#(<= main_~i~0 45), 33693#(<= main_~i~0 46), 33694#(<= main_~i~0 47), 33695#(<= main_~i~0 48), 33696#(<= main_~i~0 49), 33697#(<= main_~i~0 50), 33698#(<= main_~i~0 51), 33699#(<= main_~i~0 52), 33700#(<= main_~i~0 53), 33701#(<= main_~i~0 54), 33702#(<= main_~i~0 55), 33703#(<= main_~i~0 56), 33704#(<= main_~i~0 57), 33705#(<= main_~i~0 58), 33706#(<= main_~i~0 59), 33707#(<= main_~i~0 60), 33708#(<= main_~i~0 61), 33709#(<= main_~i~0 62), 33710#(<= main_~i~0 63), 33711#(<= main_~i~0 64), 33712#(<= main_~i~0 65), 33713#(<= main_~i~0 66), 33645#true, 33646#false, 33647#(<= main_~i~0 0), 33648#(<= main_~i~0 1), 33649#(<= main_~i~0 2), 33650#(<= main_~i~0 3), 33651#(<= main_~i~0 4), 33652#(<= main_~i~0 5), 33653#(<= main_~i~0 6), 33654#(<= main_~i~0 7), 33655#(<= main_~i~0 8), 33656#(<= main_~i~0 9), 33657#(<= main_~i~0 10), 33658#(<= main_~i~0 11), 33659#(<= main_~i~0 12), 33660#(<= main_~i~0 13), 33661#(<= main_~i~0 14), 33662#(<= main_~i~0 15), 33663#(<= main_~i~0 16)] [2018-04-10 15:45:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8721 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:03,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 15:45:03,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 15:45:03,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 15:45:03,823 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 69 states. [2018-04-10 15:45:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:04,608 INFO L93 Difference]: Finished difference Result 620 states and 685 transitions. [2018-04-10 15:45:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-10 15:45:04,609 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 284 [2018-04-10 15:45:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:04,610 INFO L225 Difference]: With dead ends: 620 [2018-04-10 15:45:04,610 INFO L226 Difference]: Without dead ends: 620 [2018-04-10 15:45:04,610 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 15:45:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-04-10 15:45:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 289. [2018-04-10 15:45:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-10 15:45:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-04-10 15:45:04,612 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-04-10 15:45:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:04,612 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-04-10 15:45:04,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 15:45:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-04-10 15:45:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-04-10 15:45:04,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:04,613 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:04,613 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash 280943141, now seen corresponding path program 66 times [2018-04-10 15:45:04,614 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:04,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8987 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:05,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:05,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-10 15:45:05,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:05,856 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-10 15:45:05,856 INFO L182 omatonBuilderFactory]: Interpolants [34688#(<= main_~i~0 63), 34689#(<= main_~i~0 64), 34690#(<= main_~i~0 65), 34691#(<= main_~i~0 66), 34692#(<= main_~i~0 67), 34623#true, 34624#false, 34625#(<= main_~i~0 0), 34626#(<= main_~i~0 1), 34627#(<= main_~i~0 2), 34628#(<= main_~i~0 3), 34629#(<= main_~i~0 4), 34630#(<= main_~i~0 5), 34631#(<= main_~i~0 6), 34632#(<= main_~i~0 7), 34633#(<= main_~i~0 8), 34634#(<= main_~i~0 9), 34635#(<= main_~i~0 10), 34636#(<= main_~i~0 11), 34637#(<= main_~i~0 12), 34638#(<= main_~i~0 13), 34639#(<= main_~i~0 14), 34640#(<= main_~i~0 15), 34641#(<= main_~i~0 16), 34642#(<= main_~i~0 17), 34643#(<= main_~i~0 18), 34644#(<= main_~i~0 19), 34645#(<= main_~i~0 20), 34646#(<= main_~i~0 21), 34647#(<= main_~i~0 22), 34648#(<= main_~i~0 23), 34649#(<= main_~i~0 24), 34650#(<= main_~i~0 25), 34651#(<= main_~i~0 26), 34652#(<= main_~i~0 27), 34653#(<= main_~i~0 28), 34654#(<= main_~i~0 29), 34655#(<= main_~i~0 30), 34656#(<= main_~i~0 31), 34657#(<= main_~i~0 32), 34658#(<= main_~i~0 33), 34659#(<= main_~i~0 34), 34660#(<= main_~i~0 35), 34661#(<= main_~i~0 36), 34662#(<= main_~i~0 37), 34663#(<= main_~i~0 38), 34664#(<= main_~i~0 39), 34665#(<= main_~i~0 40), 34666#(<= main_~i~0 41), 34667#(<= main_~i~0 42), 34668#(<= main_~i~0 43), 34669#(<= main_~i~0 44), 34670#(<= main_~i~0 45), 34671#(<= main_~i~0 46), 34672#(<= main_~i~0 47), 34673#(<= main_~i~0 48), 34674#(<= main_~i~0 49), 34675#(<= main_~i~0 50), 34676#(<= main_~i~0 51), 34677#(<= main_~i~0 52), 34678#(<= main_~i~0 53), 34679#(<= main_~i~0 54), 34680#(<= main_~i~0 55), 34681#(<= main_~i~0 56), 34682#(<= main_~i~0 57), 34683#(<= main_~i~0 58), 34684#(<= main_~i~0 59), 34685#(<= main_~i~0 60), 34686#(<= main_~i~0 61), 34687#(<= main_~i~0 62)] [2018-04-10 15:45:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8987 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:05,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-10 15:45:05,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-10 15:45:05,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 15:45:05,857 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 70 states. [2018-04-10 15:45:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:06,689 INFO L93 Difference]: Finished difference Result 629 states and 695 transitions. [2018-04-10 15:45:06,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-10 15:45:06,690 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 288 [2018-04-10 15:45:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:06,691 INFO L225 Difference]: With dead ends: 629 [2018-04-10 15:45:06,691 INFO L226 Difference]: Without dead ends: 629 [2018-04-10 15:45:06,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 15:45:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-04-10 15:45:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 293. [2018-04-10 15:45:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-10 15:45:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-04-10 15:45:06,694 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 288 [2018-04-10 15:45:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:06,694 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-04-10 15:45:06,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-10 15:45:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-04-10 15:45:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-10 15:45:06,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:06,695 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:06,695 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:06,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1502690078, now seen corresponding path program 67 times [2018-04-10 15:45:06,695 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:06,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9257 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:07,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:07,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-10 15:45:07,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:07,974 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-10 15:45:07,974 INFO L182 omatonBuilderFactory]: Interpolants [35615#true, 35616#false, 35617#(<= main_~i~0 0), 35618#(<= main_~i~0 1), 35619#(<= main_~i~0 2), 35620#(<= main_~i~0 3), 35621#(<= main_~i~0 4), 35622#(<= main_~i~0 5), 35623#(<= main_~i~0 6), 35624#(<= main_~i~0 7), 35625#(<= main_~i~0 8), 35626#(<= main_~i~0 9), 35627#(<= main_~i~0 10), 35628#(<= main_~i~0 11), 35629#(<= main_~i~0 12), 35630#(<= main_~i~0 13), 35631#(<= main_~i~0 14), 35632#(<= main_~i~0 15), 35633#(<= main_~i~0 16), 35634#(<= main_~i~0 17), 35635#(<= main_~i~0 18), 35636#(<= main_~i~0 19), 35637#(<= main_~i~0 20), 35638#(<= main_~i~0 21), 35639#(<= main_~i~0 22), 35640#(<= main_~i~0 23), 35641#(<= main_~i~0 24), 35642#(<= main_~i~0 25), 35643#(<= main_~i~0 26), 35644#(<= main_~i~0 27), 35645#(<= main_~i~0 28), 35646#(<= main_~i~0 29), 35647#(<= main_~i~0 30), 35648#(<= main_~i~0 31), 35649#(<= main_~i~0 32), 35650#(<= main_~i~0 33), 35651#(<= main_~i~0 34), 35652#(<= main_~i~0 35), 35653#(<= main_~i~0 36), 35654#(<= main_~i~0 37), 35655#(<= main_~i~0 38), 35656#(<= main_~i~0 39), 35657#(<= main_~i~0 40), 35658#(<= main_~i~0 41), 35659#(<= main_~i~0 42), 35660#(<= main_~i~0 43), 35661#(<= main_~i~0 44), 35662#(<= main_~i~0 45), 35663#(<= main_~i~0 46), 35664#(<= main_~i~0 47), 35665#(<= main_~i~0 48), 35666#(<= main_~i~0 49), 35667#(<= main_~i~0 50), 35668#(<= main_~i~0 51), 35669#(<= main_~i~0 52), 35670#(<= main_~i~0 53), 35671#(<= main_~i~0 54), 35672#(<= main_~i~0 55), 35673#(<= main_~i~0 56), 35674#(<= main_~i~0 57), 35675#(<= main_~i~0 58), 35676#(<= main_~i~0 59), 35677#(<= main_~i~0 60), 35678#(<= main_~i~0 61), 35679#(<= main_~i~0 62), 35680#(<= main_~i~0 63), 35681#(<= main_~i~0 64), 35682#(<= main_~i~0 65), 35683#(<= main_~i~0 66), 35684#(<= main_~i~0 67), 35685#(<= main_~i~0 68)] [2018-04-10 15:45:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9257 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:07,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 15:45:07,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 15:45:07,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 15:45:07,975 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 71 states. [2018-04-10 15:45:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:08,900 INFO L93 Difference]: Finished difference Result 638 states and 705 transitions. [2018-04-10 15:45:08,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 15:45:08,901 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 292 [2018-04-10 15:45:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:08,902 INFO L225 Difference]: With dead ends: 638 [2018-04-10 15:45:08,902 INFO L226 Difference]: Without dead ends: 638 [2018-04-10 15:45:08,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 15:45:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-10 15:45:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 297. [2018-04-10 15:45:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 15:45:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-04-10 15:45:08,904 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 292 [2018-04-10 15:45:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:08,905 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-04-10 15:45:08,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 15:45:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-04-10 15:45:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-04-10 15:45:08,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:08,906 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:08,906 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1072199575, now seen corresponding path program 68 times [2018-04-10 15:45:08,906 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:08,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9531 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:10,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:10,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-10 15:45:10,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:10,254 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-10 15:45:10,254 INFO L182 omatonBuilderFactory]: Interpolants [36621#true, 36622#false, 36623#(<= main_~i~0 0), 36624#(<= main_~i~0 1), 36625#(<= main_~i~0 2), 36626#(<= main_~i~0 3), 36627#(<= main_~i~0 4), 36628#(<= main_~i~0 5), 36629#(<= main_~i~0 6), 36630#(<= main_~i~0 7), 36631#(<= main_~i~0 8), 36632#(<= main_~i~0 9), 36633#(<= main_~i~0 10), 36634#(<= main_~i~0 11), 36635#(<= main_~i~0 12), 36636#(<= main_~i~0 13), 36637#(<= main_~i~0 14), 36638#(<= main_~i~0 15), 36639#(<= main_~i~0 16), 36640#(<= main_~i~0 17), 36641#(<= main_~i~0 18), 36642#(<= main_~i~0 19), 36643#(<= main_~i~0 20), 36644#(<= main_~i~0 21), 36645#(<= main_~i~0 22), 36646#(<= main_~i~0 23), 36647#(<= main_~i~0 24), 36648#(<= main_~i~0 25), 36649#(<= main_~i~0 26), 36650#(<= main_~i~0 27), 36651#(<= main_~i~0 28), 36652#(<= main_~i~0 29), 36653#(<= main_~i~0 30), 36654#(<= main_~i~0 31), 36655#(<= main_~i~0 32), 36656#(<= main_~i~0 33), 36657#(<= main_~i~0 34), 36658#(<= main_~i~0 35), 36659#(<= main_~i~0 36), 36660#(<= main_~i~0 37), 36661#(<= main_~i~0 38), 36662#(<= main_~i~0 39), 36663#(<= main_~i~0 40), 36664#(<= main_~i~0 41), 36665#(<= main_~i~0 42), 36666#(<= main_~i~0 43), 36667#(<= main_~i~0 44), 36668#(<= main_~i~0 45), 36669#(<= main_~i~0 46), 36670#(<= main_~i~0 47), 36671#(<= main_~i~0 48), 36672#(<= main_~i~0 49), 36673#(<= main_~i~0 50), 36674#(<= main_~i~0 51), 36675#(<= main_~i~0 52), 36676#(<= main_~i~0 53), 36677#(<= main_~i~0 54), 36678#(<= main_~i~0 55), 36679#(<= main_~i~0 56), 36680#(<= main_~i~0 57), 36681#(<= main_~i~0 58), 36682#(<= main_~i~0 59), 36683#(<= main_~i~0 60), 36684#(<= main_~i~0 61), 36685#(<= main_~i~0 62), 36686#(<= main_~i~0 63), 36687#(<= main_~i~0 64), 36688#(<= main_~i~0 65), 36689#(<= main_~i~0 66), 36690#(<= main_~i~0 67), 36691#(<= main_~i~0 68), 36692#(<= main_~i~0 69)] [2018-04-10 15:45:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9531 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:10,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 15:45:10,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 15:45:10,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:45:10,255 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 72 states. [2018-04-10 15:45:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:11,272 INFO L93 Difference]: Finished difference Result 647 states and 715 transitions. [2018-04-10 15:45:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-10 15:45:11,272 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 296 [2018-04-10 15:45:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:11,273 INFO L225 Difference]: With dead ends: 647 [2018-04-10 15:45:11,273 INFO L226 Difference]: Without dead ends: 647 [2018-04-10 15:45:11,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:45:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-04-10 15:45:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 301. [2018-04-10 15:45:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-04-10 15:45:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-04-10 15:45:11,276 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 296 [2018-04-10 15:45:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:11,276 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-04-10 15:45:11,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 15:45:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-04-10 15:45:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-04-10 15:45:11,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:11,277 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:11,277 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1995100048, now seen corresponding path program 69 times [2018-04-10 15:45:11,277 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:11,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9809 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:12,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:12,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-10 15:45:12,659 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:12,659 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-10 15:45:12,659 INFO L182 omatonBuilderFactory]: Interpolants [37641#true, 37642#false, 37643#(<= main_~i~0 0), 37644#(<= main_~i~0 1), 37645#(<= main_~i~0 2), 37646#(<= main_~i~0 3), 37647#(<= main_~i~0 4), 37648#(<= main_~i~0 5), 37649#(<= main_~i~0 6), 37650#(<= main_~i~0 7), 37651#(<= main_~i~0 8), 37652#(<= main_~i~0 9), 37653#(<= main_~i~0 10), 37654#(<= main_~i~0 11), 37655#(<= main_~i~0 12), 37656#(<= main_~i~0 13), 37657#(<= main_~i~0 14), 37658#(<= main_~i~0 15), 37659#(<= main_~i~0 16), 37660#(<= main_~i~0 17), 37661#(<= main_~i~0 18), 37662#(<= main_~i~0 19), 37663#(<= main_~i~0 20), 37664#(<= main_~i~0 21), 37665#(<= main_~i~0 22), 37666#(<= main_~i~0 23), 37667#(<= main_~i~0 24), 37668#(<= main_~i~0 25), 37669#(<= main_~i~0 26), 37670#(<= main_~i~0 27), 37671#(<= main_~i~0 28), 37672#(<= main_~i~0 29), 37673#(<= main_~i~0 30), 37674#(<= main_~i~0 31), 37675#(<= main_~i~0 32), 37676#(<= main_~i~0 33), 37677#(<= main_~i~0 34), 37678#(<= main_~i~0 35), 37679#(<= main_~i~0 36), 37680#(<= main_~i~0 37), 37681#(<= main_~i~0 38), 37682#(<= main_~i~0 39), 37683#(<= main_~i~0 40), 37684#(<= main_~i~0 41), 37685#(<= main_~i~0 42), 37686#(<= main_~i~0 43), 37687#(<= main_~i~0 44), 37688#(<= main_~i~0 45), 37689#(<= main_~i~0 46), 37690#(<= main_~i~0 47), 37691#(<= main_~i~0 48), 37692#(<= main_~i~0 49), 37693#(<= main_~i~0 50), 37694#(<= main_~i~0 51), 37695#(<= main_~i~0 52), 37696#(<= main_~i~0 53), 37697#(<= main_~i~0 54), 37698#(<= main_~i~0 55), 37699#(<= main_~i~0 56), 37700#(<= main_~i~0 57), 37701#(<= main_~i~0 58), 37702#(<= main_~i~0 59), 37703#(<= main_~i~0 60), 37704#(<= main_~i~0 61), 37705#(<= main_~i~0 62), 37706#(<= main_~i~0 63), 37707#(<= main_~i~0 64), 37708#(<= main_~i~0 65), 37709#(<= main_~i~0 66), 37710#(<= main_~i~0 67), 37711#(<= main_~i~0 68), 37712#(<= main_~i~0 69), 37713#(<= main_~i~0 70)] [2018-04-10 15:45:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9809 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:12,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-10 15:45:12,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-10 15:45:12,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 15:45:12,660 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 73 states. [2018-04-10 15:45:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:13,758 INFO L93 Difference]: Finished difference Result 656 states and 725 transitions. [2018-04-10 15:45:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-10 15:45:13,758 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 300 [2018-04-10 15:45:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:13,759 INFO L225 Difference]: With dead ends: 656 [2018-04-10 15:45:13,759 INFO L226 Difference]: Without dead ends: 656 [2018-04-10 15:45:13,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 15:45:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-04-10 15:45:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 305. [2018-04-10 15:45:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-10 15:45:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-04-10 15:45:13,762 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 300 [2018-04-10 15:45:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:13,762 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-04-10 15:45:13,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-10 15:45:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-04-10 15:45:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-04-10 15:45:13,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:13,763 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:13,763 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash 882803465, now seen corresponding path program 70 times [2018-04-10 15:45:13,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:13,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10091 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:15,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:15,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-10 15:45:15,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:15,173 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-10 15:45:15,173 INFO L182 omatonBuilderFactory]: Interpolants [38675#true, 38676#false, 38677#(<= main_~i~0 0), 38678#(<= main_~i~0 1), 38679#(<= main_~i~0 2), 38680#(<= main_~i~0 3), 38681#(<= main_~i~0 4), 38682#(<= main_~i~0 5), 38683#(<= main_~i~0 6), 38684#(<= main_~i~0 7), 38685#(<= main_~i~0 8), 38686#(<= main_~i~0 9), 38687#(<= main_~i~0 10), 38688#(<= main_~i~0 11), 38689#(<= main_~i~0 12), 38690#(<= main_~i~0 13), 38691#(<= main_~i~0 14), 38692#(<= main_~i~0 15), 38693#(<= main_~i~0 16), 38694#(<= main_~i~0 17), 38695#(<= main_~i~0 18), 38696#(<= main_~i~0 19), 38697#(<= main_~i~0 20), 38698#(<= main_~i~0 21), 38699#(<= main_~i~0 22), 38700#(<= main_~i~0 23), 38701#(<= main_~i~0 24), 38702#(<= main_~i~0 25), 38703#(<= main_~i~0 26), 38704#(<= main_~i~0 27), 38705#(<= main_~i~0 28), 38706#(<= main_~i~0 29), 38707#(<= main_~i~0 30), 38708#(<= main_~i~0 31), 38709#(<= main_~i~0 32), 38710#(<= main_~i~0 33), 38711#(<= main_~i~0 34), 38712#(<= main_~i~0 35), 38713#(<= main_~i~0 36), 38714#(<= main_~i~0 37), 38715#(<= main_~i~0 38), 38716#(<= main_~i~0 39), 38717#(<= main_~i~0 40), 38718#(<= main_~i~0 41), 38719#(<= main_~i~0 42), 38720#(<= main_~i~0 43), 38721#(<= main_~i~0 44), 38722#(<= main_~i~0 45), 38723#(<= main_~i~0 46), 38724#(<= main_~i~0 47), 38725#(<= main_~i~0 48), 38726#(<= main_~i~0 49), 38727#(<= main_~i~0 50), 38728#(<= main_~i~0 51), 38729#(<= main_~i~0 52), 38730#(<= main_~i~0 53), 38731#(<= main_~i~0 54), 38732#(<= main_~i~0 55), 38733#(<= main_~i~0 56), 38734#(<= main_~i~0 57), 38735#(<= main_~i~0 58), 38736#(<= main_~i~0 59), 38737#(<= main_~i~0 60), 38738#(<= main_~i~0 61), 38739#(<= main_~i~0 62), 38740#(<= main_~i~0 63), 38741#(<= main_~i~0 64), 38742#(<= main_~i~0 65), 38743#(<= main_~i~0 66), 38744#(<= main_~i~0 67), 38745#(<= main_~i~0 68), 38746#(<= main_~i~0 69), 38747#(<= main_~i~0 70), 38748#(<= main_~i~0 71)] [2018-04-10 15:45:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10091 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:15,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 15:45:15,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 15:45:15,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 15:45:15,175 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 74 states. [2018-04-10 15:45:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:16,191 INFO L93 Difference]: Finished difference Result 665 states and 735 transitions. [2018-04-10 15:45:16,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-10 15:45:16,191 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 304 [2018-04-10 15:45:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:16,192 INFO L225 Difference]: With dead ends: 665 [2018-04-10 15:45:16,192 INFO L226 Difference]: Without dead ends: 665 [2018-04-10 15:45:16,192 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 15:45:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-10 15:45:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 309. [2018-04-10 15:45:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-04-10 15:45:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-04-10 15:45:16,194 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 304 [2018-04-10 15:45:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:16,195 INFO L459 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-04-10 15:45:16,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 15:45:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-04-10 15:45:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-04-10 15:45:16,196 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:16,196 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:16,196 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1041640958, now seen corresponding path program 71 times [2018-04-10 15:45:16,196 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:16,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:17,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:17,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-10 15:45:17,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:17,668 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-10 15:45:17,668 INFO L182 omatonBuilderFactory]: Interpolants [39723#true, 39724#false, 39725#(<= main_~i~0 0), 39726#(<= main_~i~0 1), 39727#(<= main_~i~0 2), 39728#(<= main_~i~0 3), 39729#(<= main_~i~0 4), 39730#(<= main_~i~0 5), 39731#(<= main_~i~0 6), 39732#(<= main_~i~0 7), 39733#(<= main_~i~0 8), 39734#(<= main_~i~0 9), 39735#(<= main_~i~0 10), 39736#(<= main_~i~0 11), 39737#(<= main_~i~0 12), 39738#(<= main_~i~0 13), 39739#(<= main_~i~0 14), 39740#(<= main_~i~0 15), 39741#(<= main_~i~0 16), 39742#(<= main_~i~0 17), 39743#(<= main_~i~0 18), 39744#(<= main_~i~0 19), 39745#(<= main_~i~0 20), 39746#(<= main_~i~0 21), 39747#(<= main_~i~0 22), 39748#(<= main_~i~0 23), 39749#(<= main_~i~0 24), 39750#(<= main_~i~0 25), 39751#(<= main_~i~0 26), 39752#(<= main_~i~0 27), 39753#(<= main_~i~0 28), 39754#(<= main_~i~0 29), 39755#(<= main_~i~0 30), 39756#(<= main_~i~0 31), 39757#(<= main_~i~0 32), 39758#(<= main_~i~0 33), 39759#(<= main_~i~0 34), 39760#(<= main_~i~0 35), 39761#(<= main_~i~0 36), 39762#(<= main_~i~0 37), 39763#(<= main_~i~0 38), 39764#(<= main_~i~0 39), 39765#(<= main_~i~0 40), 39766#(<= main_~i~0 41), 39767#(<= main_~i~0 42), 39768#(<= main_~i~0 43), 39769#(<= main_~i~0 44), 39770#(<= main_~i~0 45), 39771#(<= main_~i~0 46), 39772#(<= main_~i~0 47), 39773#(<= main_~i~0 48), 39774#(<= main_~i~0 49), 39775#(<= main_~i~0 50), 39776#(<= main_~i~0 51), 39777#(<= main_~i~0 52), 39778#(<= main_~i~0 53), 39779#(<= main_~i~0 54), 39780#(<= main_~i~0 55), 39781#(<= main_~i~0 56), 39782#(<= main_~i~0 57), 39783#(<= main_~i~0 58), 39784#(<= main_~i~0 59), 39785#(<= main_~i~0 60), 39786#(<= main_~i~0 61), 39787#(<= main_~i~0 62), 39788#(<= main_~i~0 63), 39789#(<= main_~i~0 64), 39790#(<= main_~i~0 65), 39791#(<= main_~i~0 66), 39792#(<= main_~i~0 67), 39793#(<= main_~i~0 68), 39794#(<= main_~i~0 69), 39795#(<= main_~i~0 70), 39796#(<= main_~i~0 71), 39797#(<= main_~i~0 72)] [2018-04-10 15:45:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:17,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-10 15:45:17,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-10 15:45:17,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:45:17,669 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 75 states. [2018-04-10 15:45:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:18,709 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2018-04-10 15:45:18,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-10 15:45:18,709 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 308 [2018-04-10 15:45:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:18,710 INFO L225 Difference]: With dead ends: 674 [2018-04-10 15:45:18,710 INFO L226 Difference]: Without dead ends: 674 [2018-04-10 15:45:18,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:45:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-04-10 15:45:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 313. [2018-04-10 15:45:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-10 15:45:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-04-10 15:45:18,713 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 308 [2018-04-10 15:45:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:18,713 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-04-10 15:45:18,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-10 15:45:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-04-10 15:45:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-10 15:45:18,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:18,714 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:18,714 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:18,714 INFO L82 PathProgramCache]: Analyzing trace with hash 177405051, now seen corresponding path program 72 times [2018-04-10 15:45:18,715 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:18,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10667 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:20,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:20,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-10 15:45:20,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:20,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-10 15:45:20,166 INFO L182 omatonBuilderFactory]: Interpolants [40832#(<= main_~i~0 45), 40833#(<= main_~i~0 46), 40834#(<= main_~i~0 47), 40835#(<= main_~i~0 48), 40836#(<= main_~i~0 49), 40837#(<= main_~i~0 50), 40838#(<= main_~i~0 51), 40839#(<= main_~i~0 52), 40840#(<= main_~i~0 53), 40841#(<= main_~i~0 54), 40842#(<= main_~i~0 55), 40843#(<= main_~i~0 56), 40844#(<= main_~i~0 57), 40845#(<= main_~i~0 58), 40846#(<= main_~i~0 59), 40847#(<= main_~i~0 60), 40848#(<= main_~i~0 61), 40849#(<= main_~i~0 62), 40850#(<= main_~i~0 63), 40851#(<= main_~i~0 64), 40852#(<= main_~i~0 65), 40853#(<= main_~i~0 66), 40854#(<= main_~i~0 67), 40855#(<= main_~i~0 68), 40856#(<= main_~i~0 69), 40857#(<= main_~i~0 70), 40858#(<= main_~i~0 71), 40859#(<= main_~i~0 72), 40860#(<= main_~i~0 73), 40785#true, 40786#false, 40787#(<= main_~i~0 0), 40788#(<= main_~i~0 1), 40789#(<= main_~i~0 2), 40790#(<= main_~i~0 3), 40791#(<= main_~i~0 4), 40792#(<= main_~i~0 5), 40793#(<= main_~i~0 6), 40794#(<= main_~i~0 7), 40795#(<= main_~i~0 8), 40796#(<= main_~i~0 9), 40797#(<= main_~i~0 10), 40798#(<= main_~i~0 11), 40799#(<= main_~i~0 12), 40800#(<= main_~i~0 13), 40801#(<= main_~i~0 14), 40802#(<= main_~i~0 15), 40803#(<= main_~i~0 16), 40804#(<= main_~i~0 17), 40805#(<= main_~i~0 18), 40806#(<= main_~i~0 19), 40807#(<= main_~i~0 20), 40808#(<= main_~i~0 21), 40809#(<= main_~i~0 22), 40810#(<= main_~i~0 23), 40811#(<= main_~i~0 24), 40812#(<= main_~i~0 25), 40813#(<= main_~i~0 26), 40814#(<= main_~i~0 27), 40815#(<= main_~i~0 28), 40816#(<= main_~i~0 29), 40817#(<= main_~i~0 30), 40818#(<= main_~i~0 31), 40819#(<= main_~i~0 32), 40820#(<= main_~i~0 33), 40821#(<= main_~i~0 34), 40822#(<= main_~i~0 35), 40823#(<= main_~i~0 36), 40824#(<= main_~i~0 37), 40825#(<= main_~i~0 38), 40826#(<= main_~i~0 39), 40827#(<= main_~i~0 40), 40828#(<= main_~i~0 41), 40829#(<= main_~i~0 42), 40830#(<= main_~i~0 43), 40831#(<= main_~i~0 44)] [2018-04-10 15:45:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10667 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:20,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-10 15:45:20,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-10 15:45:20,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 15:45:20,167 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 76 states. [2018-04-10 15:45:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:21,084 INFO L93 Difference]: Finished difference Result 683 states and 755 transitions. [2018-04-10 15:45:21,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-10 15:45:21,084 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 312 [2018-04-10 15:45:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:21,086 INFO L225 Difference]: With dead ends: 683 [2018-04-10 15:45:21,086 INFO L226 Difference]: Without dead ends: 683 [2018-04-10 15:45:21,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 15:45:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-10 15:45:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 317. [2018-04-10 15:45:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-04-10 15:45:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-04-10 15:45:21,088 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 312 [2018-04-10 15:45:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:21,088 INFO L459 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-04-10 15:45:21,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-10 15:45:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-04-10 15:45:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-04-10 15:45:21,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:21,089 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:21,089 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash 759186036, now seen corresponding path program 73 times [2018-04-10 15:45:21,090 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:21,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10961 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:22,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:22,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-10 15:45:22,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:22,601 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-10 15:45:22,601 INFO L182 omatonBuilderFactory]: Interpolants [41861#true, 41862#false, 41863#(<= main_~i~0 0), 41864#(<= main_~i~0 1), 41865#(<= main_~i~0 2), 41866#(<= main_~i~0 3), 41867#(<= main_~i~0 4), 41868#(<= main_~i~0 5), 41869#(<= main_~i~0 6), 41870#(<= main_~i~0 7), 41871#(<= main_~i~0 8), 41872#(<= main_~i~0 9), 41873#(<= main_~i~0 10), 41874#(<= main_~i~0 11), 41875#(<= main_~i~0 12), 41876#(<= main_~i~0 13), 41877#(<= main_~i~0 14), 41878#(<= main_~i~0 15), 41879#(<= main_~i~0 16), 41880#(<= main_~i~0 17), 41881#(<= main_~i~0 18), 41882#(<= main_~i~0 19), 41883#(<= main_~i~0 20), 41884#(<= main_~i~0 21), 41885#(<= main_~i~0 22), 41886#(<= main_~i~0 23), 41887#(<= main_~i~0 24), 41888#(<= main_~i~0 25), 41889#(<= main_~i~0 26), 41890#(<= main_~i~0 27), 41891#(<= main_~i~0 28), 41892#(<= main_~i~0 29), 41893#(<= main_~i~0 30), 41894#(<= main_~i~0 31), 41895#(<= main_~i~0 32), 41896#(<= main_~i~0 33), 41897#(<= main_~i~0 34), 41898#(<= main_~i~0 35), 41899#(<= main_~i~0 36), 41900#(<= main_~i~0 37), 41901#(<= main_~i~0 38), 41902#(<= main_~i~0 39), 41903#(<= main_~i~0 40), 41904#(<= main_~i~0 41), 41905#(<= main_~i~0 42), 41906#(<= main_~i~0 43), 41907#(<= main_~i~0 44), 41908#(<= main_~i~0 45), 41909#(<= main_~i~0 46), 41910#(<= main_~i~0 47), 41911#(<= main_~i~0 48), 41912#(<= main_~i~0 49), 41913#(<= main_~i~0 50), 41914#(<= main_~i~0 51), 41915#(<= main_~i~0 52), 41916#(<= main_~i~0 53), 41917#(<= main_~i~0 54), 41918#(<= main_~i~0 55), 41919#(<= main_~i~0 56), 41920#(<= main_~i~0 57), 41921#(<= main_~i~0 58), 41922#(<= main_~i~0 59), 41923#(<= main_~i~0 60), 41924#(<= main_~i~0 61), 41925#(<= main_~i~0 62), 41926#(<= main_~i~0 63), 41927#(<= main_~i~0 64), 41928#(<= main_~i~0 65), 41929#(<= main_~i~0 66), 41930#(<= main_~i~0 67), 41931#(<= main_~i~0 68), 41932#(<= main_~i~0 69), 41933#(<= main_~i~0 70), 41934#(<= main_~i~0 71), 41935#(<= main_~i~0 72), 41936#(<= main_~i~0 73), 41937#(<= main_~i~0 74)] [2018-04-10 15:45:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10961 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:22,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-10 15:45:22,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-10 15:45:22,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 15:45:22,603 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 77 states. [2018-04-10 15:45:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:23,926 INFO L93 Difference]: Finished difference Result 692 states and 765 transitions. [2018-04-10 15:45:23,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 15:45:23,926 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 316 [2018-04-10 15:45:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:23,927 INFO L225 Difference]: With dead ends: 692 [2018-04-10 15:45:23,927 INFO L226 Difference]: Without dead ends: 692 [2018-04-10 15:45:23,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 15:45:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-04-10 15:45:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 321. [2018-04-10 15:45:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-10 15:45:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-04-10 15:45:23,930 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 316 [2018-04-10 15:45:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:23,930 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-04-10 15:45:23,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-10 15:45:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-04-10 15:45:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-04-10 15:45:23,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:23,931 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:23,931 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 192406509, now seen corresponding path program 74 times [2018-04-10 15:45:23,931 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:23,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11259 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:25,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:25,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-10 15:45:25,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:25,597 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-10 15:45:25,597 INFO L182 omatonBuilderFactory]: Interpolants [43008#(<= main_~i~0 55), 43009#(<= main_~i~0 56), 43010#(<= main_~i~0 57), 43011#(<= main_~i~0 58), 43012#(<= main_~i~0 59), 43013#(<= main_~i~0 60), 43014#(<= main_~i~0 61), 43015#(<= main_~i~0 62), 43016#(<= main_~i~0 63), 43017#(<= main_~i~0 64), 43018#(<= main_~i~0 65), 43019#(<= main_~i~0 66), 43020#(<= main_~i~0 67), 43021#(<= main_~i~0 68), 43022#(<= main_~i~0 69), 43023#(<= main_~i~0 70), 43024#(<= main_~i~0 71), 43025#(<= main_~i~0 72), 43026#(<= main_~i~0 73), 43027#(<= main_~i~0 74), 43028#(<= main_~i~0 75), 42951#true, 42952#false, 42953#(<= main_~i~0 0), 42954#(<= main_~i~0 1), 42955#(<= main_~i~0 2), 42956#(<= main_~i~0 3), 42957#(<= main_~i~0 4), 42958#(<= main_~i~0 5), 42959#(<= main_~i~0 6), 42960#(<= main_~i~0 7), 42961#(<= main_~i~0 8), 42962#(<= main_~i~0 9), 42963#(<= main_~i~0 10), 42964#(<= main_~i~0 11), 42965#(<= main_~i~0 12), 42966#(<= main_~i~0 13), 42967#(<= main_~i~0 14), 42968#(<= main_~i~0 15), 42969#(<= main_~i~0 16), 42970#(<= main_~i~0 17), 42971#(<= main_~i~0 18), 42972#(<= main_~i~0 19), 42973#(<= main_~i~0 20), 42974#(<= main_~i~0 21), 42975#(<= main_~i~0 22), 42976#(<= main_~i~0 23), 42977#(<= main_~i~0 24), 42978#(<= main_~i~0 25), 42979#(<= main_~i~0 26), 42980#(<= main_~i~0 27), 42981#(<= main_~i~0 28), 42982#(<= main_~i~0 29), 42983#(<= main_~i~0 30), 42984#(<= main_~i~0 31), 42985#(<= main_~i~0 32), 42986#(<= main_~i~0 33), 42987#(<= main_~i~0 34), 42988#(<= main_~i~0 35), 42989#(<= main_~i~0 36), 42990#(<= main_~i~0 37), 42991#(<= main_~i~0 38), 42992#(<= main_~i~0 39), 42993#(<= main_~i~0 40), 42994#(<= main_~i~0 41), 42995#(<= main_~i~0 42), 42996#(<= main_~i~0 43), 42997#(<= main_~i~0 44), 42998#(<= main_~i~0 45), 42999#(<= main_~i~0 46), 43000#(<= main_~i~0 47), 43001#(<= main_~i~0 48), 43002#(<= main_~i~0 49), 43003#(<= main_~i~0 50), 43004#(<= main_~i~0 51), 43005#(<= main_~i~0 52), 43006#(<= main_~i~0 53), 43007#(<= main_~i~0 54)] [2018-04-10 15:45:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11259 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:25,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 15:45:25,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 15:45:25,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 15:45:25,599 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 78 states. [2018-04-10 15:45:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:26,665 INFO L93 Difference]: Finished difference Result 701 states and 775 transitions. [2018-04-10 15:45:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-10 15:45:26,665 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 320 [2018-04-10 15:45:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:26,666 INFO L225 Difference]: With dead ends: 701 [2018-04-10 15:45:26,666 INFO L226 Difference]: Without dead ends: 701 [2018-04-10 15:45:26,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 15:45:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-10 15:45:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 325. [2018-04-10 15:45:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-10 15:45:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-04-10 15:45:26,669 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 320 [2018-04-10 15:45:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:26,669 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-04-10 15:45:26,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 15:45:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-04-10 15:45:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-04-10 15:45:26,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:26,670 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:26,670 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash -643817242, now seen corresponding path program 75 times [2018-04-10 15:45:26,670 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:26,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11561 backedges. 0 proven. 11552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:28,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:28,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-10 15:45:28,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:28,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-10 15:45:28,230 INFO L182 omatonBuilderFactory]: Interpolants [44055#true, 44056#false, 44057#(<= main_~i~0 0), 44058#(<= main_~i~0 1), 44059#(<= main_~i~0 2), 44060#(<= main_~i~0 3), 44061#(<= main_~i~0 4), 44062#(<= main_~i~0 5), 44063#(<= main_~i~0 6), 44064#(<= main_~i~0 7), 44065#(<= main_~i~0 8), 44066#(<= main_~i~0 9), 44067#(<= main_~i~0 10), 44068#(<= main_~i~0 11), 44069#(<= main_~i~0 12), 44070#(<= main_~i~0 13), 44071#(<= main_~i~0 14), 44072#(<= main_~i~0 15), 44073#(<= main_~i~0 16), 44074#(<= main_~i~0 17), 44075#(<= main_~i~0 18), 44076#(<= main_~i~0 19), 44077#(<= main_~i~0 20), 44078#(<= main_~i~0 21), 44079#(<= main_~i~0 22), 44080#(<= main_~i~0 23), 44081#(<= main_~i~0 24), 44082#(<= main_~i~0 25), 44083#(<= main_~i~0 26), 44084#(<= main_~i~0 27), 44085#(<= main_~i~0 28), 44086#(<= main_~i~0 29), 44087#(<= main_~i~0 30), 44088#(<= main_~i~0 31), 44089#(<= main_~i~0 32), 44090#(<= main_~i~0 33), 44091#(<= main_~i~0 34), 44092#(<= main_~i~0 35), 44093#(<= main_~i~0 36), 44094#(<= main_~i~0 37), 44095#(<= main_~i~0 38), 44096#(<= main_~i~0 39), 44097#(<= main_~i~0 40), 44098#(<= main_~i~0 41), 44099#(<= main_~i~0 42), 44100#(<= main_~i~0 43), 44101#(<= main_~i~0 44), 44102#(<= main_~i~0 45), 44103#(<= main_~i~0 46), 44104#(<= main_~i~0 47), 44105#(<= main_~i~0 48), 44106#(<= main_~i~0 49), 44107#(<= main_~i~0 50), 44108#(<= main_~i~0 51), 44109#(<= main_~i~0 52), 44110#(<= main_~i~0 53), 44111#(<= main_~i~0 54), 44112#(<= main_~i~0 55), 44113#(<= main_~i~0 56), 44114#(<= main_~i~0 57), 44115#(<= main_~i~0 58), 44116#(<= main_~i~0 59), 44117#(<= main_~i~0 60), 44118#(<= main_~i~0 61), 44119#(<= main_~i~0 62), 44120#(<= main_~i~0 63), 44121#(<= main_~i~0 64), 44122#(<= main_~i~0 65), 44123#(<= main_~i~0 66), 44124#(<= main_~i~0 67), 44125#(<= main_~i~0 68), 44126#(<= main_~i~0 69), 44127#(<= main_~i~0 70), 44128#(<= main_~i~0 71), 44129#(<= main_~i~0 72), 44130#(<= main_~i~0 73), 44131#(<= main_~i~0 74), 44132#(<= main_~i~0 75), 44133#(<= main_~i~0 76)] [2018-04-10 15:45:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11561 backedges. 0 proven. 11552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:28,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-10 15:45:28,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-10 15:45:28,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 15:45:28,231 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 79 states. [2018-04-10 15:45:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:29,443 INFO L93 Difference]: Finished difference Result 710 states and 785 transitions. [2018-04-10 15:45:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-10 15:45:29,443 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 324 [2018-04-10 15:45:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:29,444 INFO L225 Difference]: With dead ends: 710 [2018-04-10 15:45:29,445 INFO L226 Difference]: Without dead ends: 710 [2018-04-10 15:45:29,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 15:45:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-04-10 15:45:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 329. [2018-04-10 15:45:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-04-10 15:45:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-04-10 15:45:29,447 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 324 [2018-04-10 15:45:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:29,447 INFO L459 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-04-10 15:45:29,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-10 15:45:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-04-10 15:45:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-04-10 15:45:29,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:29,448 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:29,448 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:29,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1359005345, now seen corresponding path program 76 times [2018-04-10 15:45:29,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:29,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11867 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:30,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:30,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-10 15:45:30,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:30,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-10 15:45:30,897 INFO L182 omatonBuilderFactory]: Interpolants [45184#(<= main_~i~0 9), 45185#(<= main_~i~0 10), 45186#(<= main_~i~0 11), 45187#(<= main_~i~0 12), 45188#(<= main_~i~0 13), 45189#(<= main_~i~0 14), 45190#(<= main_~i~0 15), 45191#(<= main_~i~0 16), 45192#(<= main_~i~0 17), 45193#(<= main_~i~0 18), 45194#(<= main_~i~0 19), 45195#(<= main_~i~0 20), 45196#(<= main_~i~0 21), 45197#(<= main_~i~0 22), 45198#(<= main_~i~0 23), 45199#(<= main_~i~0 24), 45200#(<= main_~i~0 25), 45201#(<= main_~i~0 26), 45202#(<= main_~i~0 27), 45203#(<= main_~i~0 28), 45204#(<= main_~i~0 29), 45205#(<= main_~i~0 30), 45206#(<= main_~i~0 31), 45207#(<= main_~i~0 32), 45208#(<= main_~i~0 33), 45209#(<= main_~i~0 34), 45210#(<= main_~i~0 35), 45211#(<= main_~i~0 36), 45212#(<= main_~i~0 37), 45213#(<= main_~i~0 38), 45214#(<= main_~i~0 39), 45215#(<= main_~i~0 40), 45216#(<= main_~i~0 41), 45217#(<= main_~i~0 42), 45218#(<= main_~i~0 43), 45219#(<= main_~i~0 44), 45220#(<= main_~i~0 45), 45221#(<= main_~i~0 46), 45222#(<= main_~i~0 47), 45223#(<= main_~i~0 48), 45224#(<= main_~i~0 49), 45225#(<= main_~i~0 50), 45226#(<= main_~i~0 51), 45227#(<= main_~i~0 52), 45228#(<= main_~i~0 53), 45229#(<= main_~i~0 54), 45230#(<= main_~i~0 55), 45231#(<= main_~i~0 56), 45232#(<= main_~i~0 57), 45233#(<= main_~i~0 58), 45234#(<= main_~i~0 59), 45235#(<= main_~i~0 60), 45236#(<= main_~i~0 61), 45237#(<= main_~i~0 62), 45238#(<= main_~i~0 63), 45239#(<= main_~i~0 64), 45240#(<= main_~i~0 65), 45241#(<= main_~i~0 66), 45242#(<= main_~i~0 67), 45243#(<= main_~i~0 68), 45244#(<= main_~i~0 69), 45245#(<= main_~i~0 70), 45246#(<= main_~i~0 71), 45247#(<= main_~i~0 72), 45248#(<= main_~i~0 73), 45249#(<= main_~i~0 74), 45250#(<= main_~i~0 75), 45251#(<= main_~i~0 76), 45252#(<= main_~i~0 77), 45173#true, 45174#false, 45175#(<= main_~i~0 0), 45176#(<= main_~i~0 1), 45177#(<= main_~i~0 2), 45178#(<= main_~i~0 3), 45179#(<= main_~i~0 4), 45180#(<= main_~i~0 5), 45181#(<= main_~i~0 6), 45182#(<= main_~i~0 7), 45183#(<= main_~i~0 8)] [2018-04-10 15:45:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11867 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:30,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-10 15:45:30,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-10 15:45:30,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 15:45:30,898 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 80 states. [2018-04-10 15:45:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:31,944 INFO L93 Difference]: Finished difference Result 719 states and 795 transitions. [2018-04-10 15:45:31,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-10 15:45:31,944 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 328 [2018-04-10 15:45:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:31,945 INFO L225 Difference]: With dead ends: 719 [2018-04-10 15:45:31,945 INFO L226 Difference]: Without dead ends: 719 [2018-04-10 15:45:31,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 15:45:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-04-10 15:45:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 333. [2018-04-10 15:45:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-10 15:45:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-04-10 15:45:31,948 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 328 [2018-04-10 15:45:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:31,948 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-04-10 15:45:31,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-10 15:45:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-04-10 15:45:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-10 15:45:31,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:31,949 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:31,949 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash 364604760, now seen corresponding path program 77 times [2018-04-10 15:45:31,950 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:31,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12177 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:33,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:33,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-10 15:45:33,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:33,517 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-10 15:45:33,517 INFO L182 omatonBuilderFactory]: Interpolants [46336#(<= main_~i~0 29), 46337#(<= main_~i~0 30), 46338#(<= main_~i~0 31), 46339#(<= main_~i~0 32), 46340#(<= main_~i~0 33), 46341#(<= main_~i~0 34), 46342#(<= main_~i~0 35), 46343#(<= main_~i~0 36), 46344#(<= main_~i~0 37), 46345#(<= main_~i~0 38), 46346#(<= main_~i~0 39), 46347#(<= main_~i~0 40), 46348#(<= main_~i~0 41), 46349#(<= main_~i~0 42), 46350#(<= main_~i~0 43), 46351#(<= main_~i~0 44), 46352#(<= main_~i~0 45), 46353#(<= main_~i~0 46), 46354#(<= main_~i~0 47), 46355#(<= main_~i~0 48), 46356#(<= main_~i~0 49), 46357#(<= main_~i~0 50), 46358#(<= main_~i~0 51), 46359#(<= main_~i~0 52), 46360#(<= main_~i~0 53), 46361#(<= main_~i~0 54), 46362#(<= main_~i~0 55), 46363#(<= main_~i~0 56), 46364#(<= main_~i~0 57), 46365#(<= main_~i~0 58), 46366#(<= main_~i~0 59), 46367#(<= main_~i~0 60), 46368#(<= main_~i~0 61), 46369#(<= main_~i~0 62), 46370#(<= main_~i~0 63), 46371#(<= main_~i~0 64), 46372#(<= main_~i~0 65), 46373#(<= main_~i~0 66), 46374#(<= main_~i~0 67), 46375#(<= main_~i~0 68), 46376#(<= main_~i~0 69), 46377#(<= main_~i~0 70), 46378#(<= main_~i~0 71), 46379#(<= main_~i~0 72), 46380#(<= main_~i~0 73), 46381#(<= main_~i~0 74), 46382#(<= main_~i~0 75), 46383#(<= main_~i~0 76), 46384#(<= main_~i~0 77), 46385#(<= main_~i~0 78), 46305#true, 46306#false, 46307#(<= main_~i~0 0), 46308#(<= main_~i~0 1), 46309#(<= main_~i~0 2), 46310#(<= main_~i~0 3), 46311#(<= main_~i~0 4), 46312#(<= main_~i~0 5), 46313#(<= main_~i~0 6), 46314#(<= main_~i~0 7), 46315#(<= main_~i~0 8), 46316#(<= main_~i~0 9), 46317#(<= main_~i~0 10), 46318#(<= main_~i~0 11), 46319#(<= main_~i~0 12), 46320#(<= main_~i~0 13), 46321#(<= main_~i~0 14), 46322#(<= main_~i~0 15), 46323#(<= main_~i~0 16), 46324#(<= main_~i~0 17), 46325#(<= main_~i~0 18), 46326#(<= main_~i~0 19), 46327#(<= main_~i~0 20), 46328#(<= main_~i~0 21), 46329#(<= main_~i~0 22), 46330#(<= main_~i~0 23), 46331#(<= main_~i~0 24), 46332#(<= main_~i~0 25), 46333#(<= main_~i~0 26), 46334#(<= main_~i~0 27), 46335#(<= main_~i~0 28)] [2018-04-10 15:45:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12177 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:33,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-10 15:45:33,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-10 15:45:33,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:45:33,518 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 81 states. [2018-04-10 15:45:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:34,478 INFO L93 Difference]: Finished difference Result 728 states and 805 transitions. [2018-04-10 15:45:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-10 15:45:34,478 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 332 [2018-04-10 15:45:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:34,480 INFO L225 Difference]: With dead ends: 728 [2018-04-10 15:45:34,480 INFO L226 Difference]: Without dead ends: 728 [2018-04-10 15:45:34,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:45:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-04-10 15:45:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 337. [2018-04-10 15:45:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-10 15:45:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-04-10 15:45:34,482 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 332 [2018-04-10 15:45:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:34,482 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-04-10 15:45:34,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-10 15:45:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-04-10 15:45:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-04-10 15:45:34,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:34,484 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:34,484 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1696924463, now seen corresponding path program 78 times [2018-04-10 15:45:34,485 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:34,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12491 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:36,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:36,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-10 15:45:36,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:36,058 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-10 15:45:36,058 INFO L182 omatonBuilderFactory]: Interpolants [47488#(<= main_~i~0 35), 47489#(<= main_~i~0 36), 47490#(<= main_~i~0 37), 47491#(<= main_~i~0 38), 47492#(<= main_~i~0 39), 47493#(<= main_~i~0 40), 47494#(<= main_~i~0 41), 47495#(<= main_~i~0 42), 47496#(<= main_~i~0 43), 47497#(<= main_~i~0 44), 47498#(<= main_~i~0 45), 47499#(<= main_~i~0 46), 47500#(<= main_~i~0 47), 47501#(<= main_~i~0 48), 47502#(<= main_~i~0 49), 47503#(<= main_~i~0 50), 47504#(<= main_~i~0 51), 47505#(<= main_~i~0 52), 47506#(<= main_~i~0 53), 47507#(<= main_~i~0 54), 47508#(<= main_~i~0 55), 47509#(<= main_~i~0 56), 47510#(<= main_~i~0 57), 47511#(<= main_~i~0 58), 47512#(<= main_~i~0 59), 47513#(<= main_~i~0 60), 47514#(<= main_~i~0 61), 47515#(<= main_~i~0 62), 47516#(<= main_~i~0 63), 47517#(<= main_~i~0 64), 47518#(<= main_~i~0 65), 47519#(<= main_~i~0 66), 47520#(<= main_~i~0 67), 47521#(<= main_~i~0 68), 47522#(<= main_~i~0 69), 47523#(<= main_~i~0 70), 47524#(<= main_~i~0 71), 47525#(<= main_~i~0 72), 47526#(<= main_~i~0 73), 47527#(<= main_~i~0 74), 47528#(<= main_~i~0 75), 47529#(<= main_~i~0 76), 47530#(<= main_~i~0 77), 47531#(<= main_~i~0 78), 47532#(<= main_~i~0 79), 47451#true, 47452#false, 47453#(<= main_~i~0 0), 47454#(<= main_~i~0 1), 47455#(<= main_~i~0 2), 47456#(<= main_~i~0 3), 47457#(<= main_~i~0 4), 47458#(<= main_~i~0 5), 47459#(<= main_~i~0 6), 47460#(<= main_~i~0 7), 47461#(<= main_~i~0 8), 47462#(<= main_~i~0 9), 47463#(<= main_~i~0 10), 47464#(<= main_~i~0 11), 47465#(<= main_~i~0 12), 47466#(<= main_~i~0 13), 47467#(<= main_~i~0 14), 47468#(<= main_~i~0 15), 47469#(<= main_~i~0 16), 47470#(<= main_~i~0 17), 47471#(<= main_~i~0 18), 47472#(<= main_~i~0 19), 47473#(<= main_~i~0 20), 47474#(<= main_~i~0 21), 47475#(<= main_~i~0 22), 47476#(<= main_~i~0 23), 47477#(<= main_~i~0 24), 47478#(<= main_~i~0 25), 47479#(<= main_~i~0 26), 47480#(<= main_~i~0 27), 47481#(<= main_~i~0 28), 47482#(<= main_~i~0 29), 47483#(<= main_~i~0 30), 47484#(<= main_~i~0 31), 47485#(<= main_~i~0 32), 47486#(<= main_~i~0 33), 47487#(<= main_~i~0 34)] [2018-04-10 15:45:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12491 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:36,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-10 15:45:36,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-10 15:45:36,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 15:45:36,059 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 82 states. [2018-04-10 15:45:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:36,998 INFO L93 Difference]: Finished difference Result 737 states and 815 transitions. [2018-04-10 15:45:36,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-10 15:45:36,999 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 336 [2018-04-10 15:45:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:37,000 INFO L225 Difference]: With dead ends: 737 [2018-04-10 15:45:37,000 INFO L226 Difference]: Without dead ends: 737 [2018-04-10 15:45:37,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 15:45:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-04-10 15:45:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 341. [2018-04-10 15:45:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-10 15:45:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-04-10 15:45:37,002 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 336 [2018-04-10 15:45:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:37,002 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-04-10 15:45:37,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-10 15:45:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-04-10 15:45:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-04-10 15:45:37,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:37,004 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:37,004 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:37,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1581524938, now seen corresponding path program 79 times [2018-04-10 15:45:37,004 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:37,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12809 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:38,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:38,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-10 15:45:38,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:38,621 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-10 15:45:38,621 INFO L182 omatonBuilderFactory]: Interpolants [48640#(<= main_~i~0 27), 48641#(<= main_~i~0 28), 48642#(<= main_~i~0 29), 48643#(<= main_~i~0 30), 48644#(<= main_~i~0 31), 48645#(<= main_~i~0 32), 48646#(<= main_~i~0 33), 48647#(<= main_~i~0 34), 48648#(<= main_~i~0 35), 48649#(<= main_~i~0 36), 48650#(<= main_~i~0 37), 48651#(<= main_~i~0 38), 48652#(<= main_~i~0 39), 48653#(<= main_~i~0 40), 48654#(<= main_~i~0 41), 48655#(<= main_~i~0 42), 48656#(<= main_~i~0 43), 48657#(<= main_~i~0 44), 48658#(<= main_~i~0 45), 48659#(<= main_~i~0 46), 48660#(<= main_~i~0 47), 48661#(<= main_~i~0 48), 48662#(<= main_~i~0 49), 48663#(<= main_~i~0 50), 48664#(<= main_~i~0 51), 48665#(<= main_~i~0 52), 48666#(<= main_~i~0 53), 48667#(<= main_~i~0 54), 48668#(<= main_~i~0 55), 48669#(<= main_~i~0 56), 48670#(<= main_~i~0 57), 48671#(<= main_~i~0 58), 48672#(<= main_~i~0 59), 48673#(<= main_~i~0 60), 48674#(<= main_~i~0 61), 48675#(<= main_~i~0 62), 48676#(<= main_~i~0 63), 48677#(<= main_~i~0 64), 48678#(<= main_~i~0 65), 48679#(<= main_~i~0 66), 48680#(<= main_~i~0 67), 48681#(<= main_~i~0 68), 48682#(<= main_~i~0 69), 48683#(<= main_~i~0 70), 48684#(<= main_~i~0 71), 48685#(<= main_~i~0 72), 48686#(<= main_~i~0 73), 48687#(<= main_~i~0 74), 48688#(<= main_~i~0 75), 48689#(<= main_~i~0 76), 48690#(<= main_~i~0 77), 48691#(<= main_~i~0 78), 48692#(<= main_~i~0 79), 48693#(<= main_~i~0 80), 48611#true, 48612#false, 48613#(<= main_~i~0 0), 48614#(<= main_~i~0 1), 48615#(<= main_~i~0 2), 48616#(<= main_~i~0 3), 48617#(<= main_~i~0 4), 48618#(<= main_~i~0 5), 48619#(<= main_~i~0 6), 48620#(<= main_~i~0 7), 48621#(<= main_~i~0 8), 48622#(<= main_~i~0 9), 48623#(<= main_~i~0 10), 48624#(<= main_~i~0 11), 48625#(<= main_~i~0 12), 48626#(<= main_~i~0 13), 48627#(<= main_~i~0 14), 48628#(<= main_~i~0 15), 48629#(<= main_~i~0 16), 48630#(<= main_~i~0 17), 48631#(<= main_~i~0 18), 48632#(<= main_~i~0 19), 48633#(<= main_~i~0 20), 48634#(<= main_~i~0 21), 48635#(<= main_~i~0 22), 48636#(<= main_~i~0 23), 48637#(<= main_~i~0 24), 48638#(<= main_~i~0 25), 48639#(<= main_~i~0 26)] [2018-04-10 15:45:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12809 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:38,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-10 15:45:38,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-10 15:45:38,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 15:45:38,622 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 83 states. [2018-04-10 15:45:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:39,611 INFO L93 Difference]: Finished difference Result 746 states and 825 transitions. [2018-04-10 15:45:39,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 15:45:39,611 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 340 [2018-04-10 15:45:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:39,612 INFO L225 Difference]: With dead ends: 746 [2018-04-10 15:45:39,612 INFO L226 Difference]: Without dead ends: 746 [2018-04-10 15:45:39,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 15:45:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-04-10 15:45:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 345. [2018-04-10 15:45:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-10 15:45:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-04-10 15:45:39,615 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 340 [2018-04-10 15:45:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:39,615 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-04-10 15:45:39,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-10 15:45:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-04-10 15:45:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-04-10 15:45:39,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:39,616 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:39,616 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:39,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1564660157, now seen corresponding path program 80 times [2018-04-10 15:45:39,616 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:39,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 13131 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:41,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:41,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-10 15:45:41,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:41,321 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-10 15:45:41,321 INFO L182 omatonBuilderFactory]: Interpolants [49792#(<= main_~i~0 5), 49793#(<= main_~i~0 6), 49794#(<= main_~i~0 7), 49795#(<= main_~i~0 8), 49796#(<= main_~i~0 9), 49797#(<= main_~i~0 10), 49798#(<= main_~i~0 11), 49799#(<= main_~i~0 12), 49800#(<= main_~i~0 13), 49801#(<= main_~i~0 14), 49802#(<= main_~i~0 15), 49803#(<= main_~i~0 16), 49804#(<= main_~i~0 17), 49805#(<= main_~i~0 18), 49806#(<= main_~i~0 19), 49807#(<= main_~i~0 20), 49808#(<= main_~i~0 21), 49809#(<= main_~i~0 22), 49810#(<= main_~i~0 23), 49811#(<= main_~i~0 24), 49812#(<= main_~i~0 25), 49813#(<= main_~i~0 26), 49814#(<= main_~i~0 27), 49815#(<= main_~i~0 28), 49816#(<= main_~i~0 29), 49817#(<= main_~i~0 30), 49818#(<= main_~i~0 31), 49819#(<= main_~i~0 32), 49820#(<= main_~i~0 33), 49821#(<= main_~i~0 34), 49822#(<= main_~i~0 35), 49823#(<= main_~i~0 36), 49824#(<= main_~i~0 37), 49825#(<= main_~i~0 38), 49826#(<= main_~i~0 39), 49827#(<= main_~i~0 40), 49828#(<= main_~i~0 41), 49829#(<= main_~i~0 42), 49830#(<= main_~i~0 43), 49831#(<= main_~i~0 44), 49832#(<= main_~i~0 45), 49833#(<= main_~i~0 46), 49834#(<= main_~i~0 47), 49835#(<= main_~i~0 48), 49836#(<= main_~i~0 49), 49837#(<= main_~i~0 50), 49838#(<= main_~i~0 51), 49839#(<= main_~i~0 52), 49840#(<= main_~i~0 53), 49841#(<= main_~i~0 54), 49842#(<= main_~i~0 55), 49843#(<= main_~i~0 56), 49844#(<= main_~i~0 57), 49845#(<= main_~i~0 58), 49846#(<= main_~i~0 59), 49847#(<= main_~i~0 60), 49848#(<= main_~i~0 61), 49849#(<= main_~i~0 62), 49850#(<= main_~i~0 63), 49851#(<= main_~i~0 64), 49852#(<= main_~i~0 65), 49853#(<= main_~i~0 66), 49854#(<= main_~i~0 67), 49855#(<= main_~i~0 68), 49856#(<= main_~i~0 69), 49857#(<= main_~i~0 70), 49858#(<= main_~i~0 71), 49859#(<= main_~i~0 72), 49860#(<= main_~i~0 73), 49861#(<= main_~i~0 74), 49862#(<= main_~i~0 75), 49863#(<= main_~i~0 76), 49864#(<= main_~i~0 77), 49865#(<= main_~i~0 78), 49866#(<= main_~i~0 79), 49867#(<= main_~i~0 80), 49868#(<= main_~i~0 81), 49785#true, 49786#false, 49787#(<= main_~i~0 0), 49788#(<= main_~i~0 1), 49789#(<= main_~i~0 2), 49790#(<= main_~i~0 3), 49791#(<= main_~i~0 4)] [2018-04-10 15:45:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 13131 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:41,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-10 15:45:41,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-10 15:45:41,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-10 15:45:41,322 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 84 states. [2018-04-10 15:45:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:42,643 INFO L93 Difference]: Finished difference Result 755 states and 835 transitions. [2018-04-10 15:45:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-10 15:45:42,643 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 344 [2018-04-10 15:45:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:42,644 INFO L225 Difference]: With dead ends: 755 [2018-04-10 15:45:42,644 INFO L226 Difference]: Without dead ends: 755 [2018-04-10 15:45:42,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-10 15:45:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-04-10 15:45:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 349. [2018-04-10 15:45:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-10 15:45:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-04-10 15:45:42,647 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 344 [2018-04-10 15:45:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:42,647 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-04-10 15:45:42,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-10 15:45:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-04-10 15:45:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-04-10 15:45:42,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:42,648 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:42,648 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1575768124, now seen corresponding path program 81 times [2018-04-10 15:45:42,648 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:42,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 13457 backedges. 0 proven. 13448 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:44,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:44,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-10 15:45:44,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:44,392 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-10 15:45:44,392 INFO L182 omatonBuilderFactory]: Interpolants [50973#true, 50974#false, 50975#(<= main_~i~0 0), 50976#(<= main_~i~0 1), 50977#(<= main_~i~0 2), 50978#(<= main_~i~0 3), 50979#(<= main_~i~0 4), 50980#(<= main_~i~0 5), 50981#(<= main_~i~0 6), 50982#(<= main_~i~0 7), 50983#(<= main_~i~0 8), 50984#(<= main_~i~0 9), 50985#(<= main_~i~0 10), 50986#(<= main_~i~0 11), 50987#(<= main_~i~0 12), 50988#(<= main_~i~0 13), 50989#(<= main_~i~0 14), 50990#(<= main_~i~0 15), 50991#(<= main_~i~0 16), 50992#(<= main_~i~0 17), 50993#(<= main_~i~0 18), 50994#(<= main_~i~0 19), 50995#(<= main_~i~0 20), 50996#(<= main_~i~0 21), 50997#(<= main_~i~0 22), 50998#(<= main_~i~0 23), 50999#(<= main_~i~0 24), 51000#(<= main_~i~0 25), 51001#(<= main_~i~0 26), 51002#(<= main_~i~0 27), 51003#(<= main_~i~0 28), 51004#(<= main_~i~0 29), 51005#(<= main_~i~0 30), 51006#(<= main_~i~0 31), 51007#(<= main_~i~0 32), 51008#(<= main_~i~0 33), 51009#(<= main_~i~0 34), 51010#(<= main_~i~0 35), 51011#(<= main_~i~0 36), 51012#(<= main_~i~0 37), 51013#(<= main_~i~0 38), 51014#(<= main_~i~0 39), 51015#(<= main_~i~0 40), 51016#(<= main_~i~0 41), 51017#(<= main_~i~0 42), 51018#(<= main_~i~0 43), 51019#(<= main_~i~0 44), 51020#(<= main_~i~0 45), 51021#(<= main_~i~0 46), 51022#(<= main_~i~0 47), 51023#(<= main_~i~0 48), 51024#(<= main_~i~0 49), 51025#(<= main_~i~0 50), 51026#(<= main_~i~0 51), 51027#(<= main_~i~0 52), 51028#(<= main_~i~0 53), 51029#(<= main_~i~0 54), 51030#(<= main_~i~0 55), 51031#(<= main_~i~0 56), 51032#(<= main_~i~0 57), 51033#(<= main_~i~0 58), 51034#(<= main_~i~0 59), 51035#(<= main_~i~0 60), 51036#(<= main_~i~0 61), 51037#(<= main_~i~0 62), 51038#(<= main_~i~0 63), 51039#(<= main_~i~0 64), 51040#(<= main_~i~0 65), 51041#(<= main_~i~0 66), 51042#(<= main_~i~0 67), 51043#(<= main_~i~0 68), 51044#(<= main_~i~0 69), 51045#(<= main_~i~0 70), 51046#(<= main_~i~0 71), 51047#(<= main_~i~0 72), 51048#(<= main_~i~0 73), 51049#(<= main_~i~0 74), 51050#(<= main_~i~0 75), 51051#(<= main_~i~0 76), 51052#(<= main_~i~0 77), 51053#(<= main_~i~0 78), 51054#(<= main_~i~0 79), 51055#(<= main_~i~0 80), 51056#(<= main_~i~0 81), 51057#(<= main_~i~0 82)] [2018-04-10 15:45:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13457 backedges. 0 proven. 13448 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:44,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-10 15:45:44,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-10 15:45:44,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 15:45:44,393 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 85 states. [2018-04-10 15:45:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:45,798 INFO L93 Difference]: Finished difference Result 764 states and 845 transitions. [2018-04-10 15:45:45,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-10 15:45:45,798 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 348 [2018-04-10 15:45:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:45,799 INFO L225 Difference]: With dead ends: 764 [2018-04-10 15:45:45,799 INFO L226 Difference]: Without dead ends: 764 [2018-04-10 15:45:45,800 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 15:45:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-04-10 15:45:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 353. [2018-04-10 15:45:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-10 15:45:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-04-10 15:45:45,802 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 348 [2018-04-10 15:45:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:45,802 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-04-10 15:45:45,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-10 15:45:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-04-10 15:45:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-10 15:45:45,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:45,803 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:45,803 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash -933769803, now seen corresponding path program 82 times [2018-04-10 15:45:45,803 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:45,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13787 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:47,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:47,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-10 15:45:47,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:47,480 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-10 15:45:47,481 INFO L182 omatonBuilderFactory]: Interpolants [52224#(<= main_~i~0 47), 52225#(<= main_~i~0 48), 52226#(<= main_~i~0 49), 52227#(<= main_~i~0 50), 52228#(<= main_~i~0 51), 52229#(<= main_~i~0 52), 52230#(<= main_~i~0 53), 52231#(<= main_~i~0 54), 52232#(<= main_~i~0 55), 52233#(<= main_~i~0 56), 52234#(<= main_~i~0 57), 52235#(<= main_~i~0 58), 52236#(<= main_~i~0 59), 52237#(<= main_~i~0 60), 52238#(<= main_~i~0 61), 52239#(<= main_~i~0 62), 52240#(<= main_~i~0 63), 52241#(<= main_~i~0 64), 52242#(<= main_~i~0 65), 52243#(<= main_~i~0 66), 52244#(<= main_~i~0 67), 52245#(<= main_~i~0 68), 52246#(<= main_~i~0 69), 52247#(<= main_~i~0 70), 52248#(<= main_~i~0 71), 52249#(<= main_~i~0 72), 52250#(<= main_~i~0 73), 52251#(<= main_~i~0 74), 52252#(<= main_~i~0 75), 52253#(<= main_~i~0 76), 52254#(<= main_~i~0 77), 52255#(<= main_~i~0 78), 52256#(<= main_~i~0 79), 52257#(<= main_~i~0 80), 52258#(<= main_~i~0 81), 52259#(<= main_~i~0 82), 52260#(<= main_~i~0 83), 52175#true, 52176#false, 52177#(<= main_~i~0 0), 52178#(<= main_~i~0 1), 52179#(<= main_~i~0 2), 52180#(<= main_~i~0 3), 52181#(<= main_~i~0 4), 52182#(<= main_~i~0 5), 52183#(<= main_~i~0 6), 52184#(<= main_~i~0 7), 52185#(<= main_~i~0 8), 52186#(<= main_~i~0 9), 52187#(<= main_~i~0 10), 52188#(<= main_~i~0 11), 52189#(<= main_~i~0 12), 52190#(<= main_~i~0 13), 52191#(<= main_~i~0 14), 52192#(<= main_~i~0 15), 52193#(<= main_~i~0 16), 52194#(<= main_~i~0 17), 52195#(<= main_~i~0 18), 52196#(<= main_~i~0 19), 52197#(<= main_~i~0 20), 52198#(<= main_~i~0 21), 52199#(<= main_~i~0 22), 52200#(<= main_~i~0 23), 52201#(<= main_~i~0 24), 52202#(<= main_~i~0 25), 52203#(<= main_~i~0 26), 52204#(<= main_~i~0 27), 52205#(<= main_~i~0 28), 52206#(<= main_~i~0 29), 52207#(<= main_~i~0 30), 52208#(<= main_~i~0 31), 52209#(<= main_~i~0 32), 52210#(<= main_~i~0 33), 52211#(<= main_~i~0 34), 52212#(<= main_~i~0 35), 52213#(<= main_~i~0 36), 52214#(<= main_~i~0 37), 52215#(<= main_~i~0 38), 52216#(<= main_~i~0 39), 52217#(<= main_~i~0 40), 52218#(<= main_~i~0 41), 52219#(<= main_~i~0 42), 52220#(<= main_~i~0 43), 52221#(<= main_~i~0 44), 52222#(<= main_~i~0 45), 52223#(<= main_~i~0 46)] [2018-04-10 15:45:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13787 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:47,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-10 15:45:47,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-10 15:45:47,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 15:45:47,482 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 86 states. [2018-04-10 15:45:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:48,594 INFO L93 Difference]: Finished difference Result 773 states and 855 transitions. [2018-04-10 15:45:48,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-10 15:45:48,594 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 352 [2018-04-10 15:45:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:48,595 INFO L225 Difference]: With dead ends: 773 [2018-04-10 15:45:48,595 INFO L226 Difference]: Without dead ends: 773 [2018-04-10 15:45:48,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 15:45:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-10 15:45:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 357. [2018-04-10 15:45:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-04-10 15:45:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-04-10 15:45:48,598 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 352 [2018-04-10 15:45:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:48,598 INFO L459 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-04-10 15:45:48,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-10 15:45:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-04-10 15:45:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-04-10 15:45:48,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:48,599 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:48,599 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash -312088914, now seen corresponding path program 83 times [2018-04-10 15:45:48,600 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:48,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14121 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:50,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:50,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-10 15:45:50,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:50,405 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-10 15:45:50,406 INFO L182 omatonBuilderFactory]: Interpolants [53391#true, 53392#false, 53393#(<= main_~i~0 0), 53394#(<= main_~i~0 1), 53395#(<= main_~i~0 2), 53396#(<= main_~i~0 3), 53397#(<= main_~i~0 4), 53398#(<= main_~i~0 5), 53399#(<= main_~i~0 6), 53400#(<= main_~i~0 7), 53401#(<= main_~i~0 8), 53402#(<= main_~i~0 9), 53403#(<= main_~i~0 10), 53404#(<= main_~i~0 11), 53405#(<= main_~i~0 12), 53406#(<= main_~i~0 13), 53407#(<= main_~i~0 14), 53408#(<= main_~i~0 15), 53409#(<= main_~i~0 16), 53410#(<= main_~i~0 17), 53411#(<= main_~i~0 18), 53412#(<= main_~i~0 19), 53413#(<= main_~i~0 20), 53414#(<= main_~i~0 21), 53415#(<= main_~i~0 22), 53416#(<= main_~i~0 23), 53417#(<= main_~i~0 24), 53418#(<= main_~i~0 25), 53419#(<= main_~i~0 26), 53420#(<= main_~i~0 27), 53421#(<= main_~i~0 28), 53422#(<= main_~i~0 29), 53423#(<= main_~i~0 30), 53424#(<= main_~i~0 31), 53425#(<= main_~i~0 32), 53426#(<= main_~i~0 33), 53427#(<= main_~i~0 34), 53428#(<= main_~i~0 35), 53429#(<= main_~i~0 36), 53430#(<= main_~i~0 37), 53431#(<= main_~i~0 38), 53432#(<= main_~i~0 39), 53433#(<= main_~i~0 40), 53434#(<= main_~i~0 41), 53435#(<= main_~i~0 42), 53436#(<= main_~i~0 43), 53437#(<= main_~i~0 44), 53438#(<= main_~i~0 45), 53439#(<= main_~i~0 46), 53440#(<= main_~i~0 47), 53441#(<= main_~i~0 48), 53442#(<= main_~i~0 49), 53443#(<= main_~i~0 50), 53444#(<= main_~i~0 51), 53445#(<= main_~i~0 52), 53446#(<= main_~i~0 53), 53447#(<= main_~i~0 54), 53448#(<= main_~i~0 55), 53449#(<= main_~i~0 56), 53450#(<= main_~i~0 57), 53451#(<= main_~i~0 58), 53452#(<= main_~i~0 59), 53453#(<= main_~i~0 60), 53454#(<= main_~i~0 61), 53455#(<= main_~i~0 62), 53456#(<= main_~i~0 63), 53457#(<= main_~i~0 64), 53458#(<= main_~i~0 65), 53459#(<= main_~i~0 66), 53460#(<= main_~i~0 67), 53461#(<= main_~i~0 68), 53462#(<= main_~i~0 69), 53463#(<= main_~i~0 70), 53464#(<= main_~i~0 71), 53465#(<= main_~i~0 72), 53466#(<= main_~i~0 73), 53467#(<= main_~i~0 74), 53468#(<= main_~i~0 75), 53469#(<= main_~i~0 76), 53470#(<= main_~i~0 77), 53471#(<= main_~i~0 78), 53472#(<= main_~i~0 79), 53473#(<= main_~i~0 80), 53474#(<= main_~i~0 81), 53475#(<= main_~i~0 82), 53476#(<= main_~i~0 83), 53477#(<= main_~i~0 84)] [2018-04-10 15:45:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14121 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:50,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-10 15:45:50,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-10 15:45:50,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 15:45:50,407 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 87 states. [2018-04-10 15:45:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:51,933 INFO L93 Difference]: Finished difference Result 782 states and 865 transitions. [2018-04-10 15:45:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-10 15:45:51,933 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 356 [2018-04-10 15:45:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:51,934 INFO L225 Difference]: With dead ends: 782 [2018-04-10 15:45:51,934 INFO L226 Difference]: Without dead ends: 782 [2018-04-10 15:45:51,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 15:45:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-10 15:45:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 361. [2018-04-10 15:45:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-10 15:45:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-04-10 15:45:51,936 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 356 [2018-04-10 15:45:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:51,936 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-04-10 15:45:51,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-10 15:45:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-04-10 15:45:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-04-10 15:45:51,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:51,937 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:51,938 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash 995941159, now seen corresponding path program 84 times [2018-04-10 15:45:51,938 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:51,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14459 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:53,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:53,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-10 15:45:53,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:53,762 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-10 15:45:53,762 INFO L182 omatonBuilderFactory]: Interpolants [54656#(<= main_~i~0 33), 54657#(<= main_~i~0 34), 54658#(<= main_~i~0 35), 54659#(<= main_~i~0 36), 54660#(<= main_~i~0 37), 54661#(<= main_~i~0 38), 54662#(<= main_~i~0 39), 54663#(<= main_~i~0 40), 54664#(<= main_~i~0 41), 54665#(<= main_~i~0 42), 54666#(<= main_~i~0 43), 54667#(<= main_~i~0 44), 54668#(<= main_~i~0 45), 54669#(<= main_~i~0 46), 54670#(<= main_~i~0 47), 54671#(<= main_~i~0 48), 54672#(<= main_~i~0 49), 54673#(<= main_~i~0 50), 54674#(<= main_~i~0 51), 54675#(<= main_~i~0 52), 54676#(<= main_~i~0 53), 54677#(<= main_~i~0 54), 54678#(<= main_~i~0 55), 54679#(<= main_~i~0 56), 54680#(<= main_~i~0 57), 54681#(<= main_~i~0 58), 54682#(<= main_~i~0 59), 54683#(<= main_~i~0 60), 54684#(<= main_~i~0 61), 54685#(<= main_~i~0 62), 54686#(<= main_~i~0 63), 54687#(<= main_~i~0 64), 54688#(<= main_~i~0 65), 54689#(<= main_~i~0 66), 54690#(<= main_~i~0 67), 54691#(<= main_~i~0 68), 54692#(<= main_~i~0 69), 54693#(<= main_~i~0 70), 54694#(<= main_~i~0 71), 54695#(<= main_~i~0 72), 54696#(<= main_~i~0 73), 54697#(<= main_~i~0 74), 54698#(<= main_~i~0 75), 54699#(<= main_~i~0 76), 54700#(<= main_~i~0 77), 54701#(<= main_~i~0 78), 54702#(<= main_~i~0 79), 54703#(<= main_~i~0 80), 54704#(<= main_~i~0 81), 54705#(<= main_~i~0 82), 54706#(<= main_~i~0 83), 54707#(<= main_~i~0 84), 54708#(<= main_~i~0 85), 54621#true, 54622#false, 54623#(<= main_~i~0 0), 54624#(<= main_~i~0 1), 54625#(<= main_~i~0 2), 54626#(<= main_~i~0 3), 54627#(<= main_~i~0 4), 54628#(<= main_~i~0 5), 54629#(<= main_~i~0 6), 54630#(<= main_~i~0 7), 54631#(<= main_~i~0 8), 54632#(<= main_~i~0 9), 54633#(<= main_~i~0 10), 54634#(<= main_~i~0 11), 54635#(<= main_~i~0 12), 54636#(<= main_~i~0 13), 54637#(<= main_~i~0 14), 54638#(<= main_~i~0 15), 54639#(<= main_~i~0 16), 54640#(<= main_~i~0 17), 54641#(<= main_~i~0 18), 54642#(<= main_~i~0 19), 54643#(<= main_~i~0 20), 54644#(<= main_~i~0 21), 54645#(<= main_~i~0 22), 54646#(<= main_~i~0 23), 54647#(<= main_~i~0 24), 54648#(<= main_~i~0 25), 54649#(<= main_~i~0 26), 54650#(<= main_~i~0 27), 54651#(<= main_~i~0 28), 54652#(<= main_~i~0 29), 54653#(<= main_~i~0 30), 54654#(<= main_~i~0 31), 54655#(<= main_~i~0 32)] [2018-04-10 15:45:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14459 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:53,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-10 15:45:53,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-10 15:45:53,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-04-10 15:45:53,763 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 88 states. [2018-04-10 15:45:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:54,839 INFO L93 Difference]: Finished difference Result 791 states and 875 transitions. [2018-04-10 15:45:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-10 15:45:54,839 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 360 [2018-04-10 15:45:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:54,840 INFO L225 Difference]: With dead ends: 791 [2018-04-10 15:45:54,840 INFO L226 Difference]: Without dead ends: 791 [2018-04-10 15:45:54,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-04-10 15:45:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-04-10 15:45:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 365. [2018-04-10 15:45:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-10 15:45:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-04-10 15:45:54,842 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 360 [2018-04-10 15:45:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:54,842 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-04-10 15:45:54,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-10 15:45:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-04-10 15:45:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-10 15:45:54,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:54,843 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:54,843 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:54,843 INFO L82 PathProgramCache]: Analyzing trace with hash 325249824, now seen corresponding path program 85 times [2018-04-10 15:45:54,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:54,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:45:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14801 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:56,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:45:56,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-10 15:45:56,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:45:56,726 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-10 15:45:56,727 INFO L182 omatonBuilderFactory]: Interpolants [55936#(<= main_~i~0 69), 55937#(<= main_~i~0 70), 55938#(<= main_~i~0 71), 55939#(<= main_~i~0 72), 55940#(<= main_~i~0 73), 55941#(<= main_~i~0 74), 55942#(<= main_~i~0 75), 55943#(<= main_~i~0 76), 55944#(<= main_~i~0 77), 55945#(<= main_~i~0 78), 55946#(<= main_~i~0 79), 55947#(<= main_~i~0 80), 55948#(<= main_~i~0 81), 55949#(<= main_~i~0 82), 55950#(<= main_~i~0 83), 55951#(<= main_~i~0 84), 55952#(<= main_~i~0 85), 55953#(<= main_~i~0 86), 55865#true, 55866#false, 55867#(<= main_~i~0 0), 55868#(<= main_~i~0 1), 55869#(<= main_~i~0 2), 55870#(<= main_~i~0 3), 55871#(<= main_~i~0 4), 55872#(<= main_~i~0 5), 55873#(<= main_~i~0 6), 55874#(<= main_~i~0 7), 55875#(<= main_~i~0 8), 55876#(<= main_~i~0 9), 55877#(<= main_~i~0 10), 55878#(<= main_~i~0 11), 55879#(<= main_~i~0 12), 55880#(<= main_~i~0 13), 55881#(<= main_~i~0 14), 55882#(<= main_~i~0 15), 55883#(<= main_~i~0 16), 55884#(<= main_~i~0 17), 55885#(<= main_~i~0 18), 55886#(<= main_~i~0 19), 55887#(<= main_~i~0 20), 55888#(<= main_~i~0 21), 55889#(<= main_~i~0 22), 55890#(<= main_~i~0 23), 55891#(<= main_~i~0 24), 55892#(<= main_~i~0 25), 55893#(<= main_~i~0 26), 55894#(<= main_~i~0 27), 55895#(<= main_~i~0 28), 55896#(<= main_~i~0 29), 55897#(<= main_~i~0 30), 55898#(<= main_~i~0 31), 55899#(<= main_~i~0 32), 55900#(<= main_~i~0 33), 55901#(<= main_~i~0 34), 55902#(<= main_~i~0 35), 55903#(<= main_~i~0 36), 55904#(<= main_~i~0 37), 55905#(<= main_~i~0 38), 55906#(<= main_~i~0 39), 55907#(<= main_~i~0 40), 55908#(<= main_~i~0 41), 55909#(<= main_~i~0 42), 55910#(<= main_~i~0 43), 55911#(<= main_~i~0 44), 55912#(<= main_~i~0 45), 55913#(<= main_~i~0 46), 55914#(<= main_~i~0 47), 55915#(<= main_~i~0 48), 55916#(<= main_~i~0 49), 55917#(<= main_~i~0 50), 55918#(<= main_~i~0 51), 55919#(<= main_~i~0 52), 55920#(<= main_~i~0 53), 55921#(<= main_~i~0 54), 55922#(<= main_~i~0 55), 55923#(<= main_~i~0 56), 55924#(<= main_~i~0 57), 55925#(<= main_~i~0 58), 55926#(<= main_~i~0 59), 55927#(<= main_~i~0 60), 55928#(<= main_~i~0 61), 55929#(<= main_~i~0 62), 55930#(<= main_~i~0 63), 55931#(<= main_~i~0 64), 55932#(<= main_~i~0 65), 55933#(<= main_~i~0 66), 55934#(<= main_~i~0 67), 55935#(<= main_~i~0 68)] [2018-04-10 15:45:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 14801 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:45:56,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-10 15:45:56,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-10 15:45:56,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 15:45:56,728 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 89 states. [2018-04-10 15:45:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:45:58,085 INFO L93 Difference]: Finished difference Result 800 states and 885 transitions. [2018-04-10 15:45:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-10 15:45:58,085 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 364 [2018-04-10 15:45:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:45:58,086 INFO L225 Difference]: With dead ends: 800 [2018-04-10 15:45:58,086 INFO L226 Difference]: Without dead ends: 800 [2018-04-10 15:45:58,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 15:45:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-04-10 15:45:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 369. [2018-04-10 15:45:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-04-10 15:45:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-04-10 15:45:58,089 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 364 [2018-04-10 15:45:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:45:58,089 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-04-10 15:45:58,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-10 15:45:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-04-10 15:45:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-04-10 15:45:58,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:45:58,090 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:45:58,090 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:45:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1501451929, now seen corresponding path program 86 times [2018-04-10 15:45:58,091 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:45:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:45:58,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 15147 backedges. 0 proven. 15138 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:00,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:00,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-10 15:46:00,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46: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-10 15:46:00,090 INFO L182 omatonBuilderFactory]: Interpolants [57123#true, 57124#false, 57125#(<= main_~i~0 0), 57126#(<= main_~i~0 1), 57127#(<= main_~i~0 2), 57128#(<= main_~i~0 3), 57129#(<= main_~i~0 4), 57130#(<= main_~i~0 5), 57131#(<= main_~i~0 6), 57132#(<= main_~i~0 7), 57133#(<= main_~i~0 8), 57134#(<= main_~i~0 9), 57135#(<= main_~i~0 10), 57136#(<= main_~i~0 11), 57137#(<= main_~i~0 12), 57138#(<= main_~i~0 13), 57139#(<= main_~i~0 14), 57140#(<= main_~i~0 15), 57141#(<= main_~i~0 16), 57142#(<= main_~i~0 17), 57143#(<= main_~i~0 18), 57144#(<= main_~i~0 19), 57145#(<= main_~i~0 20), 57146#(<= main_~i~0 21), 57147#(<= main_~i~0 22), 57148#(<= main_~i~0 23), 57149#(<= main_~i~0 24), 57150#(<= main_~i~0 25), 57151#(<= main_~i~0 26), 57152#(<= main_~i~0 27), 57153#(<= main_~i~0 28), 57154#(<= main_~i~0 29), 57155#(<= main_~i~0 30), 57156#(<= main_~i~0 31), 57157#(<= main_~i~0 32), 57158#(<= main_~i~0 33), 57159#(<= main_~i~0 34), 57160#(<= main_~i~0 35), 57161#(<= main_~i~0 36), 57162#(<= main_~i~0 37), 57163#(<= main_~i~0 38), 57164#(<= main_~i~0 39), 57165#(<= main_~i~0 40), 57166#(<= main_~i~0 41), 57167#(<= main_~i~0 42), 57168#(<= main_~i~0 43), 57169#(<= main_~i~0 44), 57170#(<= main_~i~0 45), 57171#(<= main_~i~0 46), 57172#(<= main_~i~0 47), 57173#(<= main_~i~0 48), 57174#(<= main_~i~0 49), 57175#(<= main_~i~0 50), 57176#(<= main_~i~0 51), 57177#(<= main_~i~0 52), 57178#(<= main_~i~0 53), 57179#(<= main_~i~0 54), 57180#(<= main_~i~0 55), 57181#(<= main_~i~0 56), 57182#(<= main_~i~0 57), 57183#(<= main_~i~0 58), 57184#(<= main_~i~0 59), 57185#(<= main_~i~0 60), 57186#(<= main_~i~0 61), 57187#(<= main_~i~0 62), 57188#(<= main_~i~0 63), 57189#(<= main_~i~0 64), 57190#(<= main_~i~0 65), 57191#(<= main_~i~0 66), 57192#(<= main_~i~0 67), 57193#(<= main_~i~0 68), 57194#(<= main_~i~0 69), 57195#(<= main_~i~0 70), 57196#(<= main_~i~0 71), 57197#(<= main_~i~0 72), 57198#(<= main_~i~0 73), 57199#(<= main_~i~0 74), 57200#(<= main_~i~0 75), 57201#(<= main_~i~0 76), 57202#(<= main_~i~0 77), 57203#(<= main_~i~0 78), 57204#(<= main_~i~0 79), 57205#(<= main_~i~0 80), 57206#(<= main_~i~0 81), 57207#(<= main_~i~0 82), 57208#(<= main_~i~0 83), 57209#(<= main_~i~0 84), 57210#(<= main_~i~0 85), 57211#(<= main_~i~0 86), 57212#(<= main_~i~0 87)] [2018-04-10 15:46:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15147 backedges. 0 proven. 15138 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:00,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-10 15:46:00,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-10 15:46:00,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 15:46:00,091 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 90 states. [2018-04-10 15:46:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:01,884 INFO L93 Difference]: Finished difference Result 809 states and 895 transitions. [2018-04-10 15:46:01,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-10 15:46:01,884 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 368 [2018-04-10 15:46:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:01,885 INFO L225 Difference]: With dead ends: 809 [2018-04-10 15:46:01,885 INFO L226 Difference]: Without dead ends: 809 [2018-04-10 15:46:01,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 15:46:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-04-10 15:46:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 373. [2018-04-10 15:46:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-10 15:46:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-04-10 15:46:01,888 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 368 [2018-04-10 15:46:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:01,888 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-04-10 15:46:01,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-10 15:46:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-04-10 15:46:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-10 15:46:01,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:01,889 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:01,889 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash 76897682, now seen corresponding path program 87 times [2018-04-10 15:46:01,889 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:01,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15497 backedges. 0 proven. 15488 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:03,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:03,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-10 15:46:03,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:03,871 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-10 15:46:03,871 INFO L182 omatonBuilderFactory]: Interpolants [58395#true, 58396#false, 58397#(<= main_~i~0 0), 58398#(<= main_~i~0 1), 58399#(<= main_~i~0 2), 58400#(<= main_~i~0 3), 58401#(<= main_~i~0 4), 58402#(<= main_~i~0 5), 58403#(<= main_~i~0 6), 58404#(<= main_~i~0 7), 58405#(<= main_~i~0 8), 58406#(<= main_~i~0 9), 58407#(<= main_~i~0 10), 58408#(<= main_~i~0 11), 58409#(<= main_~i~0 12), 58410#(<= main_~i~0 13), 58411#(<= main_~i~0 14), 58412#(<= main_~i~0 15), 58413#(<= main_~i~0 16), 58414#(<= main_~i~0 17), 58415#(<= main_~i~0 18), 58416#(<= main_~i~0 19), 58417#(<= main_~i~0 20), 58418#(<= main_~i~0 21), 58419#(<= main_~i~0 22), 58420#(<= main_~i~0 23), 58421#(<= main_~i~0 24), 58422#(<= main_~i~0 25), 58423#(<= main_~i~0 26), 58424#(<= main_~i~0 27), 58425#(<= main_~i~0 28), 58426#(<= main_~i~0 29), 58427#(<= main_~i~0 30), 58428#(<= main_~i~0 31), 58429#(<= main_~i~0 32), 58430#(<= main_~i~0 33), 58431#(<= main_~i~0 34), 58432#(<= main_~i~0 35), 58433#(<= main_~i~0 36), 58434#(<= main_~i~0 37), 58435#(<= main_~i~0 38), 58436#(<= main_~i~0 39), 58437#(<= main_~i~0 40), 58438#(<= main_~i~0 41), 58439#(<= main_~i~0 42), 58440#(<= main_~i~0 43), 58441#(<= main_~i~0 44), 58442#(<= main_~i~0 45), 58443#(<= main_~i~0 46), 58444#(<= main_~i~0 47), 58445#(<= main_~i~0 48), 58446#(<= main_~i~0 49), 58447#(<= main_~i~0 50), 58448#(<= main_~i~0 51), 58449#(<= main_~i~0 52), 58450#(<= main_~i~0 53), 58451#(<= main_~i~0 54), 58452#(<= main_~i~0 55), 58453#(<= main_~i~0 56), 58454#(<= main_~i~0 57), 58455#(<= main_~i~0 58), 58456#(<= main_~i~0 59), 58457#(<= main_~i~0 60), 58458#(<= main_~i~0 61), 58459#(<= main_~i~0 62), 58460#(<= main_~i~0 63), 58461#(<= main_~i~0 64), 58462#(<= main_~i~0 65), 58463#(<= main_~i~0 66), 58464#(<= main_~i~0 67), 58465#(<= main_~i~0 68), 58466#(<= main_~i~0 69), 58467#(<= main_~i~0 70), 58468#(<= main_~i~0 71), 58469#(<= main_~i~0 72), 58470#(<= main_~i~0 73), 58471#(<= main_~i~0 74), 58472#(<= main_~i~0 75), 58473#(<= main_~i~0 76), 58474#(<= main_~i~0 77), 58475#(<= main_~i~0 78), 58476#(<= main_~i~0 79), 58477#(<= main_~i~0 80), 58478#(<= main_~i~0 81), 58479#(<= main_~i~0 82), 58480#(<= main_~i~0 83), 58481#(<= main_~i~0 84), 58482#(<= main_~i~0 85), 58483#(<= main_~i~0 86), 58484#(<= main_~i~0 87), 58485#(<= main_~i~0 88)] [2018-04-10 15:46:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15497 backedges. 0 proven. 15488 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:03,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-10 15:46:03,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-10 15:46:03,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-04-10 15:46:03,872 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 91 states. [2018-04-10 15:46:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:05,569 INFO L93 Difference]: Finished difference Result 818 states and 905 transitions. [2018-04-10 15:46:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-10 15:46:05,569 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 372 [2018-04-10 15:46:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:05,570 INFO L225 Difference]: With dead ends: 818 [2018-04-10 15:46:05,570 INFO L226 Difference]: Without dead ends: 818 [2018-04-10 15:46:05,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-04-10 15:46:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-04-10 15:46:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 377. [2018-04-10 15:46:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-10 15:46:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-04-10 15:46:05,572 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 372 [2018-04-10 15:46:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:05,573 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-04-10 15:46:05,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-10 15:46:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-04-10 15:46:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-04-10 15:46:05,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:05,574 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:05,574 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1368506357, now seen corresponding path program 88 times [2018-04-10 15:46:05,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:05,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15851 backedges. 0 proven. 15842 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:07,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:07,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-10 15:46:07,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:07,581 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-10 15:46:07,581 INFO L182 omatonBuilderFactory]: Interpolants [59681#true, 59682#false, 59683#(<= main_~i~0 0), 59684#(<= main_~i~0 1), 59685#(<= main_~i~0 2), 59686#(<= main_~i~0 3), 59687#(<= main_~i~0 4), 59688#(<= main_~i~0 5), 59689#(<= main_~i~0 6), 59690#(<= main_~i~0 7), 59691#(<= main_~i~0 8), 59692#(<= main_~i~0 9), 59693#(<= main_~i~0 10), 59694#(<= main_~i~0 11), 59695#(<= main_~i~0 12), 59696#(<= main_~i~0 13), 59697#(<= main_~i~0 14), 59698#(<= main_~i~0 15), 59699#(<= main_~i~0 16), 59700#(<= main_~i~0 17), 59701#(<= main_~i~0 18), 59702#(<= main_~i~0 19), 59703#(<= main_~i~0 20), 59704#(<= main_~i~0 21), 59705#(<= main_~i~0 22), 59706#(<= main_~i~0 23), 59707#(<= main_~i~0 24), 59708#(<= main_~i~0 25), 59709#(<= main_~i~0 26), 59710#(<= main_~i~0 27), 59711#(<= main_~i~0 28), 59712#(<= main_~i~0 29), 59713#(<= main_~i~0 30), 59714#(<= main_~i~0 31), 59715#(<= main_~i~0 32), 59716#(<= main_~i~0 33), 59717#(<= main_~i~0 34), 59718#(<= main_~i~0 35), 59719#(<= main_~i~0 36), 59720#(<= main_~i~0 37), 59721#(<= main_~i~0 38), 59722#(<= main_~i~0 39), 59723#(<= main_~i~0 40), 59724#(<= main_~i~0 41), 59725#(<= main_~i~0 42), 59726#(<= main_~i~0 43), 59727#(<= main_~i~0 44), 59728#(<= main_~i~0 45), 59729#(<= main_~i~0 46), 59730#(<= main_~i~0 47), 59731#(<= main_~i~0 48), 59732#(<= main_~i~0 49), 59733#(<= main_~i~0 50), 59734#(<= main_~i~0 51), 59735#(<= main_~i~0 52), 59736#(<= main_~i~0 53), 59737#(<= main_~i~0 54), 59738#(<= main_~i~0 55), 59739#(<= main_~i~0 56), 59740#(<= main_~i~0 57), 59741#(<= main_~i~0 58), 59742#(<= main_~i~0 59), 59743#(<= main_~i~0 60), 59744#(<= main_~i~0 61), 59745#(<= main_~i~0 62), 59746#(<= main_~i~0 63), 59747#(<= main_~i~0 64), 59748#(<= main_~i~0 65), 59749#(<= main_~i~0 66), 59750#(<= main_~i~0 67), 59751#(<= main_~i~0 68), 59752#(<= main_~i~0 69), 59753#(<= main_~i~0 70), 59754#(<= main_~i~0 71), 59755#(<= main_~i~0 72), 59756#(<= main_~i~0 73), 59757#(<= main_~i~0 74), 59758#(<= main_~i~0 75), 59759#(<= main_~i~0 76), 59760#(<= main_~i~0 77), 59761#(<= main_~i~0 78), 59762#(<= main_~i~0 79), 59763#(<= main_~i~0 80), 59764#(<= main_~i~0 81), 59765#(<= main_~i~0 82), 59766#(<= main_~i~0 83), 59767#(<= main_~i~0 84), 59768#(<= main_~i~0 85), 59769#(<= main_~i~0 86), 59770#(<= main_~i~0 87), 59771#(<= main_~i~0 88), 59772#(<= main_~i~0 89)] [2018-04-10 15:46:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15851 backedges. 0 proven. 15842 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:07,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-10 15:46:07,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-10 15:46:07,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 15:46:07,582 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 92 states. [2018-04-10 15:46:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:09,339 INFO L93 Difference]: Finished difference Result 827 states and 915 transitions. [2018-04-10 15:46:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-10 15:46:09,340 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 376 [2018-04-10 15:46:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:09,341 INFO L225 Difference]: With dead ends: 827 [2018-04-10 15:46:09,341 INFO L226 Difference]: Without dead ends: 827 [2018-04-10 15:46:09,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 15:46:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-04-10 15:46:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 381. [2018-04-10 15:46:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-10 15:46:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2018-04-10 15:46:09,343 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 376 [2018-04-10 15:46:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:09,343 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2018-04-10 15:46:09,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-10 15:46:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2018-04-10 15:46:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-04-10 15:46:09,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:09,344 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:09,344 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 598687236, now seen corresponding path program 89 times [2018-04-10 15:46:09,345 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:09,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16209 backedges. 0 proven. 16200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:11,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:11,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-10 15:46:11,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:11,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-10 15:46:11,409 INFO L182 omatonBuilderFactory]: Interpolants [61056#(<= main_~i~0 73), 61057#(<= main_~i~0 74), 61058#(<= main_~i~0 75), 61059#(<= main_~i~0 76), 61060#(<= main_~i~0 77), 61061#(<= main_~i~0 78), 61062#(<= main_~i~0 79), 61063#(<= main_~i~0 80), 61064#(<= main_~i~0 81), 61065#(<= main_~i~0 82), 61066#(<= main_~i~0 83), 61067#(<= main_~i~0 84), 61068#(<= main_~i~0 85), 61069#(<= main_~i~0 86), 61070#(<= main_~i~0 87), 61071#(<= main_~i~0 88), 61072#(<= main_~i~0 89), 61073#(<= main_~i~0 90), 60981#true, 60982#false, 60983#(<= main_~i~0 0), 60984#(<= main_~i~0 1), 60985#(<= main_~i~0 2), 60986#(<= main_~i~0 3), 60987#(<= main_~i~0 4), 60988#(<= main_~i~0 5), 60989#(<= main_~i~0 6), 60990#(<= main_~i~0 7), 60991#(<= main_~i~0 8), 60992#(<= main_~i~0 9), 60993#(<= main_~i~0 10), 60994#(<= main_~i~0 11), 60995#(<= main_~i~0 12), 60996#(<= main_~i~0 13), 60997#(<= main_~i~0 14), 60998#(<= main_~i~0 15), 60999#(<= main_~i~0 16), 61000#(<= main_~i~0 17), 61001#(<= main_~i~0 18), 61002#(<= main_~i~0 19), 61003#(<= main_~i~0 20), 61004#(<= main_~i~0 21), 61005#(<= main_~i~0 22), 61006#(<= main_~i~0 23), 61007#(<= main_~i~0 24), 61008#(<= main_~i~0 25), 61009#(<= main_~i~0 26), 61010#(<= main_~i~0 27), 61011#(<= main_~i~0 28), 61012#(<= main_~i~0 29), 61013#(<= main_~i~0 30), 61014#(<= main_~i~0 31), 61015#(<= main_~i~0 32), 61016#(<= main_~i~0 33), 61017#(<= main_~i~0 34), 61018#(<= main_~i~0 35), 61019#(<= main_~i~0 36), 61020#(<= main_~i~0 37), 61021#(<= main_~i~0 38), 61022#(<= main_~i~0 39), 61023#(<= main_~i~0 40), 61024#(<= main_~i~0 41), 61025#(<= main_~i~0 42), 61026#(<= main_~i~0 43), 61027#(<= main_~i~0 44), 61028#(<= main_~i~0 45), 61029#(<= main_~i~0 46), 61030#(<= main_~i~0 47), 61031#(<= main_~i~0 48), 61032#(<= main_~i~0 49), 61033#(<= main_~i~0 50), 61034#(<= main_~i~0 51), 61035#(<= main_~i~0 52), 61036#(<= main_~i~0 53), 61037#(<= main_~i~0 54), 61038#(<= main_~i~0 55), 61039#(<= main_~i~0 56), 61040#(<= main_~i~0 57), 61041#(<= main_~i~0 58), 61042#(<= main_~i~0 59), 61043#(<= main_~i~0 60), 61044#(<= main_~i~0 61), 61045#(<= main_~i~0 62), 61046#(<= main_~i~0 63), 61047#(<= main_~i~0 64), 61048#(<= main_~i~0 65), 61049#(<= main_~i~0 66), 61050#(<= main_~i~0 67), 61051#(<= main_~i~0 68), 61052#(<= main_~i~0 69), 61053#(<= main_~i~0 70), 61054#(<= main_~i~0 71), 61055#(<= main_~i~0 72)] [2018-04-10 15:46:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 16209 backedges. 0 proven. 16200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:11,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-10 15:46:11,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-10 15:46:11,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-10 15:46:11,410 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand 93 states. [2018-04-10 15:46:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:12,988 INFO L93 Difference]: Finished difference Result 836 states and 925 transitions. [2018-04-10 15:46:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-10 15:46:12,988 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 380 [2018-04-10 15:46:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:12,990 INFO L225 Difference]: With dead ends: 836 [2018-04-10 15:46:12,990 INFO L226 Difference]: Without dead ends: 836 [2018-04-10 15:46:12,990 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-10 15:46:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-04-10 15:46:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 385. [2018-04-10 15:46:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-10 15:46:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-04-10 15:46:12,993 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 380 [2018-04-10 15:46:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:12,993 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-04-10 15:46:12,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-10 15:46:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-04-10 15:46:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-04-10 15:46:12,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:12,994 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:12,994 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:12,994 INFO L82 PathProgramCache]: Analyzing trace with hash -203516035, now seen corresponding path program 90 times [2018-04-10 15:46:12,995 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:13,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16571 backedges. 0 proven. 16562 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:15,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:15,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-10 15:46:15,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:15,124 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-10 15:46:15,124 INFO L182 omatonBuilderFactory]: Interpolants [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), 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)] [2018-04-10 15:46:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16571 backedges. 0 proven. 16562 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:15,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-10 15:46:15,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-10 15:46:15,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-04-10 15:46:15,125 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 94 states. [2018-04-10 15:46:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:16,491 INFO L93 Difference]: Finished difference Result 845 states and 935 transitions. [2018-04-10 15:46:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-10 15:46:16,523 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 384 [2018-04-10 15:46:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:16,524 INFO L225 Difference]: With dead ends: 845 [2018-04-10 15:46:16,524 INFO L226 Difference]: Without dead ends: 845 [2018-04-10 15:46:16,524 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-04-10 15:46:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-04-10 15:46:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 389. [2018-04-10 15:46:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-04-10 15:46:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-04-10 15:46:16,526 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 384 [2018-04-10 15:46:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:16,526 INFO L459 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-04-10 15:46:16,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-10 15:46:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-04-10 15:46:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-04-10 15:46:16,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:16,528 INFO L355 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:16,528 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash 23235702, now seen corresponding path program 91 times [2018-04-10 15:46:16,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:16,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16937 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:18,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:18,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-04-10 15:46:18,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:18,713 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-10 15:46:18,713 INFO L182 omatonBuilderFactory]: Interpolants [63623#true, 63624#false, 63625#(<= main_~i~0 0), 63626#(<= main_~i~0 1), 63627#(<= main_~i~0 2), 63628#(<= main_~i~0 3), 63629#(<= main_~i~0 4), 63630#(<= main_~i~0 5), 63631#(<= main_~i~0 6), 63632#(<= main_~i~0 7), 63633#(<= main_~i~0 8), 63634#(<= main_~i~0 9), 63635#(<= main_~i~0 10), 63636#(<= main_~i~0 11), 63637#(<= main_~i~0 12), 63638#(<= main_~i~0 13), 63639#(<= main_~i~0 14), 63640#(<= main_~i~0 15), 63641#(<= main_~i~0 16), 63642#(<= main_~i~0 17), 63643#(<= main_~i~0 18), 63644#(<= main_~i~0 19), 63645#(<= main_~i~0 20), 63646#(<= main_~i~0 21), 63647#(<= main_~i~0 22), 63648#(<= main_~i~0 23), 63649#(<= main_~i~0 24), 63650#(<= main_~i~0 25), 63651#(<= main_~i~0 26), 63652#(<= main_~i~0 27), 63653#(<= main_~i~0 28), 63654#(<= main_~i~0 29), 63655#(<= main_~i~0 30), 63656#(<= main_~i~0 31), 63657#(<= main_~i~0 32), 63658#(<= main_~i~0 33), 63659#(<= main_~i~0 34), 63660#(<= main_~i~0 35), 63661#(<= main_~i~0 36), 63662#(<= main_~i~0 37), 63663#(<= main_~i~0 38), 63664#(<= main_~i~0 39), 63665#(<= main_~i~0 40), 63666#(<= main_~i~0 41), 63667#(<= main_~i~0 42), 63668#(<= main_~i~0 43), 63669#(<= main_~i~0 44), 63670#(<= main_~i~0 45), 63671#(<= main_~i~0 46), 63672#(<= main_~i~0 47), 63673#(<= main_~i~0 48), 63674#(<= main_~i~0 49), 63675#(<= main_~i~0 50), 63676#(<= main_~i~0 51), 63677#(<= main_~i~0 52), 63678#(<= main_~i~0 53), 63679#(<= main_~i~0 54), 63680#(<= main_~i~0 55), 63681#(<= main_~i~0 56), 63682#(<= main_~i~0 57), 63683#(<= main_~i~0 58), 63684#(<= main_~i~0 59), 63685#(<= main_~i~0 60), 63686#(<= main_~i~0 61), 63687#(<= main_~i~0 62), 63688#(<= main_~i~0 63), 63689#(<= main_~i~0 64), 63690#(<= main_~i~0 65), 63691#(<= main_~i~0 66), 63692#(<= main_~i~0 67), 63693#(<= main_~i~0 68), 63694#(<= main_~i~0 69), 63695#(<= main_~i~0 70), 63696#(<= main_~i~0 71), 63697#(<= main_~i~0 72), 63698#(<= main_~i~0 73), 63699#(<= main_~i~0 74), 63700#(<= main_~i~0 75), 63701#(<= main_~i~0 76), 63702#(<= main_~i~0 77), 63703#(<= main_~i~0 78), 63704#(<= main_~i~0 79), 63705#(<= main_~i~0 80), 63706#(<= main_~i~0 81), 63707#(<= main_~i~0 82), 63708#(<= main_~i~0 83), 63709#(<= main_~i~0 84), 63710#(<= main_~i~0 85), 63711#(<= main_~i~0 86), 63712#(<= main_~i~0 87), 63713#(<= main_~i~0 88), 63714#(<= main_~i~0 89), 63715#(<= main_~i~0 90), 63716#(<= main_~i~0 91), 63717#(<= main_~i~0 92)] [2018-04-10 15:46:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16937 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:18,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-10 15:46:18,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-10 15:46:18,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 15:46:18,714 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 95 states. [2018-04-10 15:46:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:20,764 INFO L93 Difference]: Finished difference Result 854 states and 945 transitions. [2018-04-10 15:46:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-10 15:46:20,764 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 388 [2018-04-10 15:46:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:20,765 INFO L225 Difference]: With dead ends: 854 [2018-04-10 15:46:20,765 INFO L226 Difference]: Without dead ends: 854 [2018-04-10 15:46:20,765 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 15:46:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-04-10 15:46:20,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 393. [2018-04-10 15:46:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-10 15:46:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-04-10 15:46:20,768 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 388 [2018-04-10 15:46:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:20,768 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-04-10 15:46:20,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-10 15:46:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-04-10 15:46:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-10 15:46:20,769 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:20,769 INFO L355 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:20,769 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:20,769 INFO L82 PathProgramCache]: Analyzing trace with hash 293690607, now seen corresponding path program 92 times [2018-04-10 15:46:20,769 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:20,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17307 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:22,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:22,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-10 15:46:22,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:22,948 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-10 15:46:22,948 INFO L182 omatonBuilderFactory]: Interpolants [65024#(<= main_~i~0 57), 65025#(<= main_~i~0 58), 65026#(<= main_~i~0 59), 65027#(<= main_~i~0 60), 65028#(<= main_~i~0 61), 65029#(<= main_~i~0 62), 65030#(<= main_~i~0 63), 65031#(<= main_~i~0 64), 65032#(<= main_~i~0 65), 65033#(<= main_~i~0 66), 65034#(<= main_~i~0 67), 65035#(<= main_~i~0 68), 65036#(<= main_~i~0 69), 65037#(<= main_~i~0 70), 65038#(<= main_~i~0 71), 65039#(<= main_~i~0 72), 65040#(<= main_~i~0 73), 65041#(<= main_~i~0 74), 65042#(<= main_~i~0 75), 65043#(<= main_~i~0 76), 65044#(<= main_~i~0 77), 65045#(<= main_~i~0 78), 65046#(<= main_~i~0 79), 65047#(<= main_~i~0 80), 65048#(<= main_~i~0 81), 65049#(<= main_~i~0 82), 65050#(<= main_~i~0 83), 65051#(<= main_~i~0 84), 65052#(<= main_~i~0 85), 65053#(<= main_~i~0 86), 65054#(<= main_~i~0 87), 65055#(<= main_~i~0 88), 65056#(<= main_~i~0 89), 65057#(<= main_~i~0 90), 65058#(<= main_~i~0 91), 65059#(<= main_~i~0 92), 65060#(<= main_~i~0 93), 64965#true, 64966#false, 64967#(<= main_~i~0 0), 64968#(<= main_~i~0 1), 64969#(<= main_~i~0 2), 64970#(<= main_~i~0 3), 64971#(<= main_~i~0 4), 64972#(<= main_~i~0 5), 64973#(<= main_~i~0 6), 64974#(<= main_~i~0 7), 64975#(<= main_~i~0 8), 64976#(<= main_~i~0 9), 64977#(<= main_~i~0 10), 64978#(<= main_~i~0 11), 64979#(<= main_~i~0 12), 64980#(<= main_~i~0 13), 64981#(<= main_~i~0 14), 64982#(<= main_~i~0 15), 64983#(<= main_~i~0 16), 64984#(<= main_~i~0 17), 64985#(<= main_~i~0 18), 64986#(<= main_~i~0 19), 64987#(<= main_~i~0 20), 64988#(<= main_~i~0 21), 64989#(<= main_~i~0 22), 64990#(<= main_~i~0 23), 64991#(<= main_~i~0 24), 64992#(<= main_~i~0 25), 64993#(<= main_~i~0 26), 64994#(<= main_~i~0 27), 64995#(<= main_~i~0 28), 64996#(<= main_~i~0 29), 64997#(<= main_~i~0 30), 64998#(<= main_~i~0 31), 64999#(<= main_~i~0 32), 65000#(<= main_~i~0 33), 65001#(<= main_~i~0 34), 65002#(<= main_~i~0 35), 65003#(<= main_~i~0 36), 65004#(<= main_~i~0 37), 65005#(<= main_~i~0 38), 65006#(<= main_~i~0 39), 65007#(<= main_~i~0 40), 65008#(<= main_~i~0 41), 65009#(<= main_~i~0 42), 65010#(<= main_~i~0 43), 65011#(<= main_~i~0 44), 65012#(<= main_~i~0 45), 65013#(<= main_~i~0 46), 65014#(<= main_~i~0 47), 65015#(<= main_~i~0 48), 65016#(<= main_~i~0 49), 65017#(<= main_~i~0 50), 65018#(<= main_~i~0 51), 65019#(<= main_~i~0 52), 65020#(<= main_~i~0 53), 65021#(<= main_~i~0 54), 65022#(<= main_~i~0 55), 65023#(<= main_~i~0 56)] [2018-04-10 15:46:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 17307 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:22,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-10 15:46:22,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-10 15:46:22,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-10 15:46:22,949 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 96 states. [2018-04-10 15:46:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:24,523 INFO L93 Difference]: Finished difference Result 863 states and 955 transitions. [2018-04-10 15:46:24,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-10 15:46:24,524 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 392 [2018-04-10 15:46:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:24,524 INFO L225 Difference]: With dead ends: 863 [2018-04-10 15:46:24,525 INFO L226 Difference]: Without dead ends: 863 [2018-04-10 15:46:24,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-10 15:46:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-04-10 15:46:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 397. [2018-04-10 15:46:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-10 15:46:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-04-10 15:46:24,527 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 392 [2018-04-10 15:46:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:24,527 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-04-10 15:46:24,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-10 15:46:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-04-10 15:46:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-04-10 15:46:24,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:24,529 INFO L355 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:24,529 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1549879528, now seen corresponding path program 93 times [2018-04-10 15:46:24,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:24,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17681 backedges. 0 proven. 17672 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:26,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:26,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-10 15:46:26,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:26,869 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-10 15:46:26,870 INFO L182 omatonBuilderFactory]: Interpolants [66321#true, 66323#(<= main_~i~0 0), 66322#false, 66325#(<= main_~i~0 2), 66324#(<= main_~i~0 1), 66327#(<= main_~i~0 4), 66326#(<= main_~i~0 3), 66329#(<= main_~i~0 6), 66328#(<= main_~i~0 5), 66331#(<= main_~i~0 8), 66330#(<= main_~i~0 7), 66333#(<= main_~i~0 10), 66332#(<= main_~i~0 9), 66335#(<= main_~i~0 12), 66334#(<= main_~i~0 11), 66337#(<= main_~i~0 14), 66336#(<= main_~i~0 13), 66339#(<= main_~i~0 16), 66338#(<= main_~i~0 15), 66341#(<= main_~i~0 18), 66340#(<= main_~i~0 17), 66343#(<= main_~i~0 20), 66342#(<= main_~i~0 19), 66345#(<= main_~i~0 22), 66344#(<= main_~i~0 21), 66347#(<= main_~i~0 24), 66346#(<= main_~i~0 23), 66349#(<= main_~i~0 26), 66348#(<= main_~i~0 25), 66351#(<= main_~i~0 28), 66350#(<= main_~i~0 27), 66353#(<= main_~i~0 30), 66352#(<= main_~i~0 29), 66355#(<= main_~i~0 32), 66354#(<= main_~i~0 31), 66357#(<= main_~i~0 34), 66356#(<= main_~i~0 33), 66359#(<= main_~i~0 36), 66358#(<= main_~i~0 35), 66361#(<= main_~i~0 38), 66360#(<= main_~i~0 37), 66363#(<= main_~i~0 40), 66362#(<= main_~i~0 39), 66365#(<= main_~i~0 42), 66364#(<= main_~i~0 41), 66367#(<= main_~i~0 44), 66366#(<= main_~i~0 43), 66369#(<= main_~i~0 46), 66368#(<= main_~i~0 45), 66371#(<= main_~i~0 48), 66370#(<= main_~i~0 47), 66373#(<= main_~i~0 50), 66372#(<= main_~i~0 49), 66375#(<= main_~i~0 52), 66374#(<= main_~i~0 51), 66377#(<= main_~i~0 54), 66376#(<= main_~i~0 53), 66379#(<= main_~i~0 56), 66378#(<= main_~i~0 55), 66381#(<= main_~i~0 58), 66380#(<= main_~i~0 57), 66383#(<= main_~i~0 60), 66382#(<= main_~i~0 59), 66385#(<= main_~i~0 62), 66384#(<= main_~i~0 61), 66387#(<= main_~i~0 64), 66386#(<= main_~i~0 63), 66389#(<= main_~i~0 66), 66388#(<= main_~i~0 65), 66391#(<= main_~i~0 68), 66390#(<= main_~i~0 67), 66393#(<= main_~i~0 70), 66392#(<= main_~i~0 69), 66395#(<= main_~i~0 72), 66394#(<= main_~i~0 71), 66397#(<= main_~i~0 74), 66396#(<= main_~i~0 73), 66399#(<= main_~i~0 76), 66398#(<= main_~i~0 75), 66401#(<= main_~i~0 78), 66400#(<= main_~i~0 77), 66403#(<= main_~i~0 80), 66402#(<= main_~i~0 79), 66405#(<= main_~i~0 82), 66404#(<= main_~i~0 81), 66407#(<= main_~i~0 84), 66406#(<= main_~i~0 83), 66409#(<= main_~i~0 86), 66408#(<= main_~i~0 85), 66411#(<= main_~i~0 88), 66410#(<= main_~i~0 87), 66413#(<= main_~i~0 90), 66412#(<= main_~i~0 89), 66415#(<= main_~i~0 92), 66414#(<= main_~i~0 91), 66417#(<= main_~i~0 94), 66416#(<= main_~i~0 93)] [2018-04-10 15:46:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 17681 backedges. 0 proven. 17672 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:26,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-10 15:46:26,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-10 15:46:26,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-04-10 15:46:26,871 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 97 states. [2018-04-10 15:46:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:29,012 INFO L93 Difference]: Finished difference Result 872 states and 965 transitions. [2018-04-10 15:46:29,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-10 15:46:29,012 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 396 [2018-04-10 15:46:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:29,014 INFO L225 Difference]: With dead ends: 872 [2018-04-10 15:46:29,014 INFO L226 Difference]: Without dead ends: 872 [2018-04-10 15:46:29,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-04-10 15:46:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-04-10 15:46:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 401. [2018-04-10 15:46:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-10 15:46:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-04-10 15:46:29,017 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 396 [2018-04-10 15:46:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:29,017 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-04-10 15:46:29,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-10 15:46:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-04-10 15:46:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-04-10 15:46:29,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:29,018 INFO L355 BasicCegarLoop]: trace histogram [96, 95, 95, 95, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:29,018 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash 487100513, now seen corresponding path program 94 times [2018-04-10 15:46:29,018 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:29,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18059 backedges. 0 proven. 18050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:31,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:31,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-10 15:46:31,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:31,317 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-10 15:46:31,317 INFO L182 omatonBuilderFactory]: Interpolants [67691#true, 67693#(<= main_~i~0 0), 67692#false, 67695#(<= main_~i~0 2), 67694#(<= main_~i~0 1), 67697#(<= main_~i~0 4), 67696#(<= main_~i~0 3), 67699#(<= main_~i~0 6), 67698#(<= main_~i~0 5), 67701#(<= main_~i~0 8), 67700#(<= main_~i~0 7), 67703#(<= main_~i~0 10), 67702#(<= main_~i~0 9), 67705#(<= main_~i~0 12), 67704#(<= main_~i~0 11), 67707#(<= main_~i~0 14), 67706#(<= main_~i~0 13), 67709#(<= main_~i~0 16), 67708#(<= main_~i~0 15), 67711#(<= main_~i~0 18), 67710#(<= main_~i~0 17), 67713#(<= main_~i~0 20), 67712#(<= main_~i~0 19), 67715#(<= main_~i~0 22), 67714#(<= main_~i~0 21), 67717#(<= main_~i~0 24), 67716#(<= main_~i~0 23), 67719#(<= main_~i~0 26), 67718#(<= main_~i~0 25), 67721#(<= main_~i~0 28), 67720#(<= main_~i~0 27), 67723#(<= main_~i~0 30), 67722#(<= main_~i~0 29), 67725#(<= main_~i~0 32), 67724#(<= main_~i~0 31), 67727#(<= main_~i~0 34), 67726#(<= main_~i~0 33), 67729#(<= main_~i~0 36), 67728#(<= main_~i~0 35), 67731#(<= main_~i~0 38), 67730#(<= main_~i~0 37), 67733#(<= main_~i~0 40), 67732#(<= main_~i~0 39), 67735#(<= main_~i~0 42), 67734#(<= main_~i~0 41), 67737#(<= main_~i~0 44), 67736#(<= main_~i~0 43), 67739#(<= main_~i~0 46), 67738#(<= main_~i~0 45), 67741#(<= main_~i~0 48), 67740#(<= main_~i~0 47), 67743#(<= main_~i~0 50), 67742#(<= main_~i~0 49), 67745#(<= main_~i~0 52), 67744#(<= main_~i~0 51), 67747#(<= main_~i~0 54), 67746#(<= main_~i~0 53), 67749#(<= main_~i~0 56), 67748#(<= main_~i~0 55), 67751#(<= main_~i~0 58), 67750#(<= main_~i~0 57), 67753#(<= main_~i~0 60), 67752#(<= main_~i~0 59), 67755#(<= main_~i~0 62), 67754#(<= main_~i~0 61), 67757#(<= main_~i~0 64), 67756#(<= main_~i~0 63), 67759#(<= main_~i~0 66), 67758#(<= main_~i~0 65), 67761#(<= main_~i~0 68), 67760#(<= main_~i~0 67), 67763#(<= main_~i~0 70), 67762#(<= main_~i~0 69), 67765#(<= main_~i~0 72), 67764#(<= main_~i~0 71), 67767#(<= main_~i~0 74), 67766#(<= main_~i~0 73), 67769#(<= main_~i~0 76), 67768#(<= main_~i~0 75), 67771#(<= main_~i~0 78), 67770#(<= main_~i~0 77), 67773#(<= main_~i~0 80), 67772#(<= main_~i~0 79), 67775#(<= main_~i~0 82), 67774#(<= main_~i~0 81), 67777#(<= main_~i~0 84), 67776#(<= main_~i~0 83), 67779#(<= main_~i~0 86), 67778#(<= main_~i~0 85), 67781#(<= main_~i~0 88), 67780#(<= main_~i~0 87), 67783#(<= main_~i~0 90), 67782#(<= main_~i~0 89), 67785#(<= main_~i~0 92), 67784#(<= main_~i~0 91), 67787#(<= main_~i~0 94), 67786#(<= main_~i~0 93), 67788#(<= main_~i~0 95)] [2018-04-10 15:46:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18059 backedges. 0 proven. 18050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:31,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-10 15:46:31,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-10 15:46:31,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-04-10 15:46:31,318 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 98 states. [2018-04-10 15:46:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:33,205 INFO L93 Difference]: Finished difference Result 881 states and 975 transitions. [2018-04-10 15:46:33,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-10 15:46:33,205 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 400 [2018-04-10 15:46:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:33,206 INFO L225 Difference]: With dead ends: 881 [2018-04-10 15:46:33,206 INFO L226 Difference]: Without dead ends: 881 [2018-04-10 15:46:33,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-04-10 15:46:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-04-10 15:46:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 405. [2018-04-10 15:46:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-10 15:46:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-04-10 15:46:33,210 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 400 [2018-04-10 15:46:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:33,210 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-04-10 15:46:33,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-10 15:46:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-04-10 15:46:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-10 15:46:33,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:33,212 INFO L355 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:33,212 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 559772506, now seen corresponding path program 95 times [2018-04-10 15:46:33,212 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:33,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18441 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:35,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:35,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-10 15:46:35,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:35,561 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-10 15:46:35,561 INFO L182 omatonBuilderFactory]: Interpolants [69121#(<= main_~i~0 44), 69120#(<= main_~i~0 43), 69123#(<= main_~i~0 46), 69122#(<= main_~i~0 45), 69125#(<= main_~i~0 48), 69124#(<= main_~i~0 47), 69127#(<= main_~i~0 50), 69126#(<= main_~i~0 49), 69129#(<= main_~i~0 52), 69128#(<= main_~i~0 51), 69131#(<= main_~i~0 54), 69130#(<= main_~i~0 53), 69133#(<= main_~i~0 56), 69132#(<= main_~i~0 55), 69135#(<= main_~i~0 58), 69134#(<= main_~i~0 57), 69137#(<= main_~i~0 60), 69136#(<= main_~i~0 59), 69139#(<= main_~i~0 62), 69138#(<= main_~i~0 61), 69141#(<= main_~i~0 64), 69140#(<= main_~i~0 63), 69143#(<= main_~i~0 66), 69142#(<= main_~i~0 65), 69145#(<= main_~i~0 68), 69144#(<= main_~i~0 67), 69147#(<= main_~i~0 70), 69146#(<= main_~i~0 69), 69149#(<= main_~i~0 72), 69148#(<= main_~i~0 71), 69151#(<= main_~i~0 74), 69150#(<= main_~i~0 73), 69153#(<= main_~i~0 76), 69152#(<= main_~i~0 75), 69155#(<= main_~i~0 78), 69154#(<= main_~i~0 77), 69157#(<= main_~i~0 80), 69156#(<= main_~i~0 79), 69159#(<= main_~i~0 82), 69158#(<= main_~i~0 81), 69161#(<= main_~i~0 84), 69160#(<= main_~i~0 83), 69163#(<= main_~i~0 86), 69162#(<= main_~i~0 85), 69165#(<= main_~i~0 88), 69164#(<= main_~i~0 87), 69167#(<= main_~i~0 90), 69166#(<= main_~i~0 89), 69169#(<= main_~i~0 92), 69168#(<= main_~i~0 91), 69171#(<= main_~i~0 94), 69170#(<= main_~i~0 93), 69173#(<= main_~i~0 96), 69172#(<= main_~i~0 95), 69075#true, 69077#(<= main_~i~0 0), 69076#false, 69079#(<= main_~i~0 2), 69078#(<= main_~i~0 1), 69081#(<= main_~i~0 4), 69080#(<= main_~i~0 3), 69083#(<= main_~i~0 6), 69082#(<= main_~i~0 5), 69085#(<= main_~i~0 8), 69084#(<= main_~i~0 7), 69087#(<= main_~i~0 10), 69086#(<= main_~i~0 9), 69089#(<= main_~i~0 12), 69088#(<= main_~i~0 11), 69091#(<= main_~i~0 14), 69090#(<= main_~i~0 13), 69093#(<= main_~i~0 16), 69092#(<= main_~i~0 15), 69095#(<= main_~i~0 18), 69094#(<= main_~i~0 17), 69097#(<= main_~i~0 20), 69096#(<= main_~i~0 19), 69099#(<= main_~i~0 22), 69098#(<= main_~i~0 21), 69101#(<= main_~i~0 24), 69100#(<= main_~i~0 23), 69103#(<= main_~i~0 26), 69102#(<= main_~i~0 25), 69105#(<= main_~i~0 28), 69104#(<= main_~i~0 27), 69107#(<= main_~i~0 30), 69106#(<= main_~i~0 29), 69109#(<= main_~i~0 32), 69108#(<= main_~i~0 31), 69111#(<= main_~i~0 34), 69110#(<= main_~i~0 33), 69113#(<= main_~i~0 36), 69112#(<= main_~i~0 35), 69115#(<= main_~i~0 38), 69114#(<= main_~i~0 37), 69117#(<= main_~i~0 40), 69116#(<= main_~i~0 39), 69119#(<= main_~i~0 42), 69118#(<= main_~i~0 41)] [2018-04-10 15:46:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18441 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:35,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-10 15:46:35,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-10 15:46:35,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:46:35,562 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 99 states. [2018-04-10 15:46:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:37,196 INFO L93 Difference]: Finished difference Result 890 states and 985 transitions. [2018-04-10 15:46:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-10 15:46:37,196 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 404 [2018-04-10 15:46:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:37,197 INFO L225 Difference]: With dead ends: 890 [2018-04-10 15:46:37,197 INFO L226 Difference]: Without dead ends: 890 [2018-04-10 15:46:37,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:46:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-04-10 15:46:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 409. [2018-04-10 15:46:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-10 15:46:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-04-10 15:46:37,199 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 404 [2018-04-10 15:46:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:37,199 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-04-10 15:46:37,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-10 15:46:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-04-10 15:46:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-04-10 15:46:37,200 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:37,201 INFO L355 BasicCegarLoop]: trace histogram [98, 97, 97, 97, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:37,201 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:37,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1512452563, now seen corresponding path program 96 times [2018-04-10 15:46:37,201 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:37,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18827 backedges. 0 proven. 18818 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:39,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:39,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-04-10 15:46:39,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:39,597 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-10 15:46:39,597 INFO L182 omatonBuilderFactory]: Interpolants [70473#true, 70475#(<= main_~i~0 0), 70474#false, 70477#(<= main_~i~0 2), 70476#(<= main_~i~0 1), 70479#(<= main_~i~0 4), 70478#(<= main_~i~0 3), 70481#(<= main_~i~0 6), 70480#(<= main_~i~0 5), 70483#(<= main_~i~0 8), 70482#(<= main_~i~0 7), 70485#(<= main_~i~0 10), 70484#(<= main_~i~0 9), 70487#(<= main_~i~0 12), 70486#(<= main_~i~0 11), 70489#(<= main_~i~0 14), 70488#(<= main_~i~0 13), 70491#(<= main_~i~0 16), 70490#(<= main_~i~0 15), 70493#(<= main_~i~0 18), 70492#(<= main_~i~0 17), 70495#(<= main_~i~0 20), 70494#(<= main_~i~0 19), 70497#(<= main_~i~0 22), 70496#(<= main_~i~0 21), 70499#(<= main_~i~0 24), 70498#(<= main_~i~0 23), 70501#(<= main_~i~0 26), 70500#(<= main_~i~0 25), 70503#(<= main_~i~0 28), 70502#(<= main_~i~0 27), 70505#(<= main_~i~0 30), 70504#(<= main_~i~0 29), 70507#(<= main_~i~0 32), 70506#(<= main_~i~0 31), 70509#(<= main_~i~0 34), 70508#(<= main_~i~0 33), 70511#(<= main_~i~0 36), 70510#(<= main_~i~0 35), 70513#(<= main_~i~0 38), 70512#(<= main_~i~0 37), 70515#(<= main_~i~0 40), 70514#(<= main_~i~0 39), 70517#(<= main_~i~0 42), 70516#(<= main_~i~0 41), 70519#(<= main_~i~0 44), 70518#(<= main_~i~0 43), 70521#(<= main_~i~0 46), 70520#(<= main_~i~0 45), 70523#(<= main_~i~0 48), 70522#(<= main_~i~0 47), 70525#(<= main_~i~0 50), 70524#(<= main_~i~0 49), 70527#(<= main_~i~0 52), 70526#(<= main_~i~0 51), 70529#(<= main_~i~0 54), 70528#(<= main_~i~0 53), 70531#(<= main_~i~0 56), 70530#(<= main_~i~0 55), 70533#(<= main_~i~0 58), 70532#(<= main_~i~0 57), 70535#(<= main_~i~0 60), 70534#(<= main_~i~0 59), 70537#(<= main_~i~0 62), 70536#(<= main_~i~0 61), 70539#(<= main_~i~0 64), 70538#(<= main_~i~0 63), 70541#(<= main_~i~0 66), 70540#(<= main_~i~0 65), 70543#(<= main_~i~0 68), 70542#(<= main_~i~0 67), 70545#(<= main_~i~0 70), 70544#(<= main_~i~0 69), 70547#(<= main_~i~0 72), 70546#(<= main_~i~0 71), 70549#(<= main_~i~0 74), 70548#(<= main_~i~0 73), 70551#(<= main_~i~0 76), 70550#(<= main_~i~0 75), 70553#(<= main_~i~0 78), 70552#(<= main_~i~0 77), 70555#(<= main_~i~0 80), 70554#(<= main_~i~0 79), 70557#(<= main_~i~0 82), 70556#(<= main_~i~0 81), 70559#(<= main_~i~0 84), 70558#(<= main_~i~0 83), 70561#(<= main_~i~0 86), 70560#(<= main_~i~0 85), 70563#(<= main_~i~0 88), 70562#(<= main_~i~0 87), 70565#(<= main_~i~0 90), 70564#(<= main_~i~0 89), 70567#(<= main_~i~0 92), 70566#(<= main_~i~0 91), 70569#(<= main_~i~0 94), 70568#(<= main_~i~0 93), 70571#(<= main_~i~0 96), 70570#(<= main_~i~0 95), 70572#(<= main_~i~0 97)] [2018-04-10 15:46:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18827 backedges. 0 proven. 18818 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:39,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-10 15:46:39,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-10 15:46:39,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-04-10 15:46:39,599 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 100 states. [2018-04-10 15:46:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:41,344 INFO L93 Difference]: Finished difference Result 899 states and 995 transitions. [2018-04-10 15:46:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-10 15:46:41,344 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 408 [2018-04-10 15:46:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:41,345 INFO L225 Difference]: With dead ends: 899 [2018-04-10 15:46:41,345 INFO L226 Difference]: Without dead ends: 899 [2018-04-10 15:46:41,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-04-10 15:46:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-10 15:46:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 413. [2018-04-10 15:46:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-10 15:46:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-04-10 15:46:41,348 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 408 [2018-04-10 15:46:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:41,348 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-04-10 15:46:41,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-10 15:46:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-04-10 15:46:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-10 15:46:41,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:41,349 INFO L355 BasicCegarLoop]: trace histogram [99, 98, 98, 98, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:41,349 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1795754956, now seen corresponding path program 97 times [2018-04-10 15:46:41,349 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:41,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19217 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:43,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:43,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-04-10 15:46:43,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:43,837 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-10 15:46:43,837 INFO L182 omatonBuilderFactory]: Interpolants [71937#(<= main_~i~0 50), 71936#(<= main_~i~0 49), 71939#(<= main_~i~0 52), 71938#(<= main_~i~0 51), 71941#(<= main_~i~0 54), 71940#(<= main_~i~0 53), 71943#(<= main_~i~0 56), 71942#(<= main_~i~0 55), 71945#(<= main_~i~0 58), 71944#(<= main_~i~0 57), 71947#(<= main_~i~0 60), 71946#(<= main_~i~0 59), 71949#(<= main_~i~0 62), 71948#(<= main_~i~0 61), 71951#(<= main_~i~0 64), 71950#(<= main_~i~0 63), 71953#(<= main_~i~0 66), 71952#(<= main_~i~0 65), 71955#(<= main_~i~0 68), 71954#(<= main_~i~0 67), 71957#(<= main_~i~0 70), 71956#(<= main_~i~0 69), 71959#(<= main_~i~0 72), 71958#(<= main_~i~0 71), 71961#(<= main_~i~0 74), 71960#(<= main_~i~0 73), 71963#(<= main_~i~0 76), 71962#(<= main_~i~0 75), 71965#(<= main_~i~0 78), 71964#(<= main_~i~0 77), 71967#(<= main_~i~0 80), 71966#(<= main_~i~0 79), 71969#(<= main_~i~0 82), 71968#(<= main_~i~0 81), 71971#(<= main_~i~0 84), 71970#(<= main_~i~0 83), 71973#(<= main_~i~0 86), 71972#(<= main_~i~0 85), 71975#(<= main_~i~0 88), 71974#(<= main_~i~0 87), 71977#(<= main_~i~0 90), 71976#(<= main_~i~0 89), 71979#(<= main_~i~0 92), 71978#(<= main_~i~0 91), 71981#(<= main_~i~0 94), 71980#(<= main_~i~0 93), 71983#(<= main_~i~0 96), 71982#(<= main_~i~0 95), 71985#(<= main_~i~0 98), 71984#(<= main_~i~0 97), 71885#true, 71887#(<= main_~i~0 0), 71886#false, 71889#(<= main_~i~0 2), 71888#(<= main_~i~0 1), 71891#(<= main_~i~0 4), 71890#(<= main_~i~0 3), 71893#(<= main_~i~0 6), 71892#(<= main_~i~0 5), 71895#(<= main_~i~0 8), 71894#(<= main_~i~0 7), 71897#(<= main_~i~0 10), 71896#(<= main_~i~0 9), 71899#(<= main_~i~0 12), 71898#(<= main_~i~0 11), 71901#(<= main_~i~0 14), 71900#(<= main_~i~0 13), 71903#(<= main_~i~0 16), 71902#(<= main_~i~0 15), 71905#(<= main_~i~0 18), 71904#(<= main_~i~0 17), 71907#(<= main_~i~0 20), 71906#(<= main_~i~0 19), 71909#(<= main_~i~0 22), 71908#(<= main_~i~0 21), 71911#(<= main_~i~0 24), 71910#(<= main_~i~0 23), 71913#(<= main_~i~0 26), 71912#(<= main_~i~0 25), 71915#(<= main_~i~0 28), 71914#(<= main_~i~0 27), 71917#(<= main_~i~0 30), 71916#(<= main_~i~0 29), 71919#(<= main_~i~0 32), 71918#(<= main_~i~0 31), 71921#(<= main_~i~0 34), 71920#(<= main_~i~0 33), 71923#(<= main_~i~0 36), 71922#(<= main_~i~0 35), 71925#(<= main_~i~0 38), 71924#(<= main_~i~0 37), 71927#(<= main_~i~0 40), 71926#(<= main_~i~0 39), 71929#(<= main_~i~0 42), 71928#(<= main_~i~0 41), 71931#(<= main_~i~0 44), 71930#(<= main_~i~0 43), 71933#(<= main_~i~0 46), 71932#(<= main_~i~0 45), 71935#(<= main_~i~0 48), 71934#(<= main_~i~0 47)] [2018-04-10 15:46:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19217 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:43,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-10 15:46:43,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-10 15:46:43,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-10 15:46:43,839 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 101 states. [2018-04-10 15:46:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:45,613 INFO L93 Difference]: Finished difference Result 908 states and 1005 transitions. [2018-04-10 15:46:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-10 15:46:45,613 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 412 [2018-04-10 15:46:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:45,614 INFO L225 Difference]: With dead ends: 908 [2018-04-10 15:46:45,614 INFO L226 Difference]: Without dead ends: 908 [2018-04-10 15:46:45,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-10 15:46:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-04-10 15:46:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 417. [2018-04-10 15:46:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-04-10 15:46:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-04-10 15:46:45,616 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 412 [2018-04-10 15:46:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:45,616 INFO L459 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-04-10 15:46:45,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-10 15:46:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-04-10 15:46:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-04-10 15:46:45,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:45,618 INFO L355 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:45,618 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 982270277, now seen corresponding path program 98 times [2018-04-10 15:46:45,618 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:45,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19611 backedges. 0 proven. 19602 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:48,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:48,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-04-10 15:46:48,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:48,130 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-10 15:46:48,130 INFO L182 omatonBuilderFactory]: Interpolants [73311#true, 73313#(<= main_~i~0 0), 73312#false, 73315#(<= main_~i~0 2), 73314#(<= main_~i~0 1), 73317#(<= main_~i~0 4), 73316#(<= main_~i~0 3), 73319#(<= main_~i~0 6), 73318#(<= main_~i~0 5), 73321#(<= main_~i~0 8), 73320#(<= main_~i~0 7), 73323#(<= main_~i~0 10), 73322#(<= main_~i~0 9), 73325#(<= main_~i~0 12), 73324#(<= main_~i~0 11), 73327#(<= main_~i~0 14), 73326#(<= main_~i~0 13), 73329#(<= main_~i~0 16), 73328#(<= main_~i~0 15), 73331#(<= main_~i~0 18), 73330#(<= main_~i~0 17), 73333#(<= main_~i~0 20), 73332#(<= main_~i~0 19), 73335#(<= main_~i~0 22), 73334#(<= main_~i~0 21), 73337#(<= main_~i~0 24), 73336#(<= main_~i~0 23), 73339#(<= main_~i~0 26), 73338#(<= main_~i~0 25), 73341#(<= main_~i~0 28), 73340#(<= main_~i~0 27), 73343#(<= main_~i~0 30), 73342#(<= main_~i~0 29), 73345#(<= main_~i~0 32), 73344#(<= main_~i~0 31), 73347#(<= main_~i~0 34), 73346#(<= main_~i~0 33), 73349#(<= main_~i~0 36), 73348#(<= main_~i~0 35), 73351#(<= main_~i~0 38), 73350#(<= main_~i~0 37), 73353#(<= main_~i~0 40), 73352#(<= main_~i~0 39), 73355#(<= main_~i~0 42), 73354#(<= main_~i~0 41), 73357#(<= main_~i~0 44), 73356#(<= main_~i~0 43), 73359#(<= main_~i~0 46), 73358#(<= main_~i~0 45), 73361#(<= main_~i~0 48), 73360#(<= main_~i~0 47), 73363#(<= main_~i~0 50), 73362#(<= main_~i~0 49), 73365#(<= main_~i~0 52), 73364#(<= main_~i~0 51), 73367#(<= main_~i~0 54), 73366#(<= main_~i~0 53), 73369#(<= main_~i~0 56), 73368#(<= main_~i~0 55), 73371#(<= main_~i~0 58), 73370#(<= main_~i~0 57), 73373#(<= main_~i~0 60), 73372#(<= main_~i~0 59), 73375#(<= main_~i~0 62), 73374#(<= main_~i~0 61), 73377#(<= main_~i~0 64), 73376#(<= main_~i~0 63), 73379#(<= main_~i~0 66), 73378#(<= main_~i~0 65), 73381#(<= main_~i~0 68), 73380#(<= main_~i~0 67), 73383#(<= main_~i~0 70), 73382#(<= main_~i~0 69), 73385#(<= main_~i~0 72), 73384#(<= main_~i~0 71), 73387#(<= main_~i~0 74), 73386#(<= main_~i~0 73), 73389#(<= main_~i~0 76), 73388#(<= main_~i~0 75), 73391#(<= main_~i~0 78), 73390#(<= main_~i~0 77), 73393#(<= main_~i~0 80), 73392#(<= main_~i~0 79), 73395#(<= main_~i~0 82), 73394#(<= main_~i~0 81), 73397#(<= main_~i~0 84), 73396#(<= main_~i~0 83), 73399#(<= main_~i~0 86), 73398#(<= main_~i~0 85), 73401#(<= main_~i~0 88), 73400#(<= main_~i~0 87), 73403#(<= main_~i~0 90), 73402#(<= main_~i~0 89), 73405#(<= main_~i~0 92), 73404#(<= main_~i~0 91), 73407#(<= main_~i~0 94), 73406#(<= main_~i~0 93), 73409#(<= main_~i~0 96), 73408#(<= main_~i~0 95), 73411#(<= main_~i~0 98), 73410#(<= main_~i~0 97), 73412#(<= main_~i~0 99)] [2018-04-10 15:46:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19611 backedges. 0 proven. 19602 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:48,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-10 15:46:48,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-10 15:46:48,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-04-10 15:46:48,132 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 102 states. [2018-04-10 15:46:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:50,209 INFO L93 Difference]: Finished difference Result 917 states and 1015 transitions. [2018-04-10 15:46:50,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-10 15:46:50,209 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 416 [2018-04-10 15:46:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:50,210 INFO L225 Difference]: With dead ends: 917 [2018-04-10 15:46:50,210 INFO L226 Difference]: Without dead ends: 917 [2018-04-10 15:46:50,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-04-10 15:46:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-04-10 15:46:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 421. [2018-04-10 15:46:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-04-10 15:46:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-04-10 15:46:50,213 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 416 [2018-04-10 15:46:50,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:50,213 INFO L459 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-04-10 15:46:50,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-10 15:46:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-04-10 15:46:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-04-10 15:46:50,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:50,214 INFO L355 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:50,214 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2112482754, now seen corresponding path program 99 times [2018-04-10 15:46:50,215 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:50,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 20009 backedges. 0 proven. 20000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:52,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:52,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-04-10 15:46:52,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:46:52,770 INFO L182 omatonBuilderFactory]: Interpolants [74753#(<= main_~i~0 0), 74752#false, 74755#(<= main_~i~0 2), 74754#(<= main_~i~0 1), 74757#(<= main_~i~0 4), 74756#(<= main_~i~0 3), 74759#(<= main_~i~0 6), 74758#(<= main_~i~0 5), 74761#(<= main_~i~0 8), 74760#(<= main_~i~0 7), 74763#(<= main_~i~0 10), 74762#(<= main_~i~0 9), 74765#(<= main_~i~0 12), 74764#(<= main_~i~0 11), 74767#(<= main_~i~0 14), 74766#(<= main_~i~0 13), 74769#(<= main_~i~0 16), 74768#(<= main_~i~0 15), 74771#(<= main_~i~0 18), 74770#(<= main_~i~0 17), 74773#(<= main_~i~0 20), 74772#(<= main_~i~0 19), 74775#(<= main_~i~0 22), 74774#(<= main_~i~0 21), 74777#(<= main_~i~0 24), 74776#(<= main_~i~0 23), 74779#(<= main_~i~0 26), 74778#(<= main_~i~0 25), 74781#(<= main_~i~0 28), 74780#(<= main_~i~0 27), 74783#(<= main_~i~0 30), 74782#(<= main_~i~0 29), 74785#(<= main_~i~0 32), 74784#(<= main_~i~0 31), 74787#(<= main_~i~0 34), 74786#(<= main_~i~0 33), 74789#(<= main_~i~0 36), 74788#(<= main_~i~0 35), 74791#(<= main_~i~0 38), 74790#(<= main_~i~0 37), 74793#(<= main_~i~0 40), 74792#(<= main_~i~0 39), 74795#(<= main_~i~0 42), 74794#(<= main_~i~0 41), 74797#(<= main_~i~0 44), 74796#(<= main_~i~0 43), 74799#(<= main_~i~0 46), 74798#(<= main_~i~0 45), 74801#(<= main_~i~0 48), 74800#(<= main_~i~0 47), 74803#(<= main_~i~0 50), 74802#(<= main_~i~0 49), 74805#(<= main_~i~0 52), 74804#(<= main_~i~0 51), 74807#(<= main_~i~0 54), 74806#(<= main_~i~0 53), 74809#(<= main_~i~0 56), 74808#(<= main_~i~0 55), 74811#(<= main_~i~0 58), 74810#(<= main_~i~0 57), 74813#(<= main_~i~0 60), 74812#(<= main_~i~0 59), 74815#(<= main_~i~0 62), 74814#(<= main_~i~0 61), 74817#(<= main_~i~0 64), 74816#(<= main_~i~0 63), 74819#(<= main_~i~0 66), 74818#(<= main_~i~0 65), 74821#(<= main_~i~0 68), 74820#(<= main_~i~0 67), 74823#(<= main_~i~0 70), 74822#(<= main_~i~0 69), 74825#(<= main_~i~0 72), 74824#(<= main_~i~0 71), 74827#(<= main_~i~0 74), 74826#(<= main_~i~0 73), 74829#(<= main_~i~0 76), 74828#(<= main_~i~0 75), 74831#(<= main_~i~0 78), 74830#(<= main_~i~0 77), 74833#(<= main_~i~0 80), 74832#(<= main_~i~0 79), 74835#(<= main_~i~0 82), 74834#(<= main_~i~0 81), 74837#(<= main_~i~0 84), 74836#(<= main_~i~0 83), 74839#(<= main_~i~0 86), 74838#(<= main_~i~0 85), 74841#(<= main_~i~0 88), 74840#(<= main_~i~0 87), 74843#(<= main_~i~0 90), 74842#(<= main_~i~0 89), 74845#(<= main_~i~0 92), 74844#(<= main_~i~0 91), 74847#(<= main_~i~0 94), 74846#(<= main_~i~0 93), 74849#(<= main_~i~0 96), 74848#(<= main_~i~0 95), 74851#(<= main_~i~0 98), 74850#(<= main_~i~0 97), 74853#(<= main_~i~0 100), 74852#(<= main_~i~0 99), 74751#true] [2018-04-10 15:46:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20009 backedges. 0 proven. 20000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:52,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-10 15:46:52,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-10 15:46:52,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-04-10 15:46:52,772 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 103 states. [2018-04-10 15:46:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:46:55,507 INFO L93 Difference]: Finished difference Result 926 states and 1025 transitions. [2018-04-10 15:46:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-10 15:46:55,507 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 420 [2018-04-10 15:46:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:46:55,508 INFO L225 Difference]: With dead ends: 926 [2018-04-10 15:46:55,508 INFO L226 Difference]: Without dead ends: 926 [2018-04-10 15:46:55,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-04-10 15:46:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-04-10 15:46:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 425. [2018-04-10 15:46:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-10 15:46:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-04-10 15:46:55,511 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 420 [2018-04-10 15:46:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:46:55,512 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-04-10 15:46:55,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-10 15:46:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-04-10 15:46:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-04-10 15:46:55,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:46:55,514 INFO L355 BasicCegarLoop]: trace histogram [102, 101, 101, 101, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:46:55,514 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:46:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1575796407, now seen corresponding path program 100 times [2018-04-10 15:46:55,514 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:46:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:46:55,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:46:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20411 backedges. 0 proven. 20402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:58,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:46:58,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-04-10 15:46:58,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:46:58,168 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-10 15:46:58,168 INFO L182 omatonBuilderFactory]: Interpolants [76289#(<= main_~i~0 82), 76288#(<= main_~i~0 81), 76291#(<= main_~i~0 84), 76290#(<= main_~i~0 83), 76293#(<= main_~i~0 86), 76292#(<= main_~i~0 85), 76295#(<= main_~i~0 88), 76294#(<= main_~i~0 87), 76297#(<= main_~i~0 90), 76296#(<= main_~i~0 89), 76299#(<= main_~i~0 92), 76298#(<= main_~i~0 91), 76301#(<= main_~i~0 94), 76300#(<= main_~i~0 93), 76303#(<= main_~i~0 96), 76302#(<= main_~i~0 95), 76305#(<= main_~i~0 98), 76304#(<= main_~i~0 97), 76307#(<= main_~i~0 100), 76306#(<= main_~i~0 99), 76308#(<= main_~i~0 101), 76205#true, 76207#(<= main_~i~0 0), 76206#false, 76209#(<= main_~i~0 2), 76208#(<= main_~i~0 1), 76211#(<= main_~i~0 4), 76210#(<= main_~i~0 3), 76213#(<= main_~i~0 6), 76212#(<= main_~i~0 5), 76215#(<= main_~i~0 8), 76214#(<= main_~i~0 7), 76217#(<= main_~i~0 10), 76216#(<= main_~i~0 9), 76219#(<= main_~i~0 12), 76218#(<= main_~i~0 11), 76221#(<= main_~i~0 14), 76220#(<= main_~i~0 13), 76223#(<= main_~i~0 16), 76222#(<= main_~i~0 15), 76225#(<= main_~i~0 18), 76224#(<= main_~i~0 17), 76227#(<= main_~i~0 20), 76226#(<= main_~i~0 19), 76229#(<= main_~i~0 22), 76228#(<= main_~i~0 21), 76231#(<= main_~i~0 24), 76230#(<= main_~i~0 23), 76233#(<= main_~i~0 26), 76232#(<= main_~i~0 25), 76235#(<= main_~i~0 28), 76234#(<= main_~i~0 27), 76237#(<= main_~i~0 30), 76236#(<= main_~i~0 29), 76239#(<= main_~i~0 32), 76238#(<= main_~i~0 31), 76241#(<= main_~i~0 34), 76240#(<= main_~i~0 33), 76243#(<= main_~i~0 36), 76242#(<= main_~i~0 35), 76245#(<= main_~i~0 38), 76244#(<= main_~i~0 37), 76247#(<= main_~i~0 40), 76246#(<= main_~i~0 39), 76249#(<= main_~i~0 42), 76248#(<= main_~i~0 41), 76251#(<= main_~i~0 44), 76250#(<= main_~i~0 43), 76253#(<= main_~i~0 46), 76252#(<= main_~i~0 45), 76255#(<= main_~i~0 48), 76254#(<= main_~i~0 47), 76257#(<= main_~i~0 50), 76256#(<= main_~i~0 49), 76259#(<= main_~i~0 52), 76258#(<= main_~i~0 51), 76261#(<= main_~i~0 54), 76260#(<= main_~i~0 53), 76263#(<= main_~i~0 56), 76262#(<= main_~i~0 55), 76265#(<= main_~i~0 58), 76264#(<= main_~i~0 57), 76267#(<= main_~i~0 60), 76266#(<= main_~i~0 59), 76269#(<= main_~i~0 62), 76268#(<= main_~i~0 61), 76271#(<= main_~i~0 64), 76270#(<= main_~i~0 63), 76273#(<= main_~i~0 66), 76272#(<= main_~i~0 65), 76275#(<= main_~i~0 68), 76274#(<= main_~i~0 67), 76277#(<= main_~i~0 70), 76276#(<= main_~i~0 69), 76279#(<= main_~i~0 72), 76278#(<= main_~i~0 71), 76281#(<= main_~i~0 74), 76280#(<= main_~i~0 73), 76283#(<= main_~i~0 76), 76282#(<= main_~i~0 75), 76285#(<= main_~i~0 78), 76284#(<= main_~i~0 77), 76287#(<= main_~i~0 80), 76286#(<= main_~i~0 79)] [2018-04-10 15:46:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20411 backedges. 0 proven. 20402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:46:58,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-10 15:46:58,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-10 15:46:58,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-04-10 15:46:58,170 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 104 states. [2018-04-10 15:47:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:47:00,444 INFO L93 Difference]: Finished difference Result 935 states and 1035 transitions. [2018-04-10 15:47:00,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-10 15:47:00,444 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 424 [2018-04-10 15:47:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:47:00,445 INFO L225 Difference]: With dead ends: 935 [2018-04-10 15:47:00,445 INFO L226 Difference]: Without dead ends: 935 [2018-04-10 15:47:00,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-04-10 15:47:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-04-10 15:47:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 429. [2018-04-10 15:47:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-04-10 15:47:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-04-10 15:47:00,447 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 424 [2018-04-10 15:47:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:47:00,447 INFO L459 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-04-10 15:47:00,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-10 15:47:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-04-10 15:47:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-04-10 15:47:00,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:47:00,449 INFO L355 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:47:00,449 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:47:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash -583629136, now seen corresponding path program 101 times [2018-04-10 15:47:00,449 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:47:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:47:00,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:47:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 20817 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:03,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:47:03,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-04-10 15:47:03,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:47:03,344 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-10 15:47:03,345 INFO L182 omatonBuilderFactory]: Interpolants [77673#true, 77675#(<= main_~i~0 0), 77674#false, 77677#(<= main_~i~0 2), 77676#(<= main_~i~0 1), 77679#(<= main_~i~0 4), 77678#(<= main_~i~0 3), 77681#(<= main_~i~0 6), 77680#(<= main_~i~0 5), 77683#(<= main_~i~0 8), 77682#(<= main_~i~0 7), 77685#(<= main_~i~0 10), 77684#(<= main_~i~0 9), 77687#(<= main_~i~0 12), 77686#(<= main_~i~0 11), 77689#(<= main_~i~0 14), 77688#(<= main_~i~0 13), 77691#(<= main_~i~0 16), 77690#(<= main_~i~0 15), 77693#(<= main_~i~0 18), 77692#(<= main_~i~0 17), 77695#(<= main_~i~0 20), 77694#(<= main_~i~0 19), 77697#(<= main_~i~0 22), 77696#(<= main_~i~0 21), 77699#(<= main_~i~0 24), 77698#(<= main_~i~0 23), 77701#(<= main_~i~0 26), 77700#(<= main_~i~0 25), 77703#(<= main_~i~0 28), 77702#(<= main_~i~0 27), 77705#(<= main_~i~0 30), 77704#(<= main_~i~0 29), 77707#(<= main_~i~0 32), 77706#(<= main_~i~0 31), 77709#(<= main_~i~0 34), 77708#(<= main_~i~0 33), 77711#(<= main_~i~0 36), 77710#(<= main_~i~0 35), 77713#(<= main_~i~0 38), 77712#(<= main_~i~0 37), 77715#(<= main_~i~0 40), 77714#(<= main_~i~0 39), 77717#(<= main_~i~0 42), 77716#(<= main_~i~0 41), 77719#(<= main_~i~0 44), 77718#(<= main_~i~0 43), 77721#(<= main_~i~0 46), 77720#(<= main_~i~0 45), 77723#(<= main_~i~0 48), 77722#(<= main_~i~0 47), 77725#(<= main_~i~0 50), 77724#(<= main_~i~0 49), 77727#(<= main_~i~0 52), 77726#(<= main_~i~0 51), 77729#(<= main_~i~0 54), 77728#(<= main_~i~0 53), 77731#(<= main_~i~0 56), 77730#(<= main_~i~0 55), 77733#(<= main_~i~0 58), 77732#(<= main_~i~0 57), 77735#(<= main_~i~0 60), 77734#(<= main_~i~0 59), 77737#(<= main_~i~0 62), 77736#(<= main_~i~0 61), 77739#(<= main_~i~0 64), 77738#(<= main_~i~0 63), 77741#(<= main_~i~0 66), 77740#(<= main_~i~0 65), 77743#(<= main_~i~0 68), 77742#(<= main_~i~0 67), 77745#(<= main_~i~0 70), 77744#(<= main_~i~0 69), 77747#(<= main_~i~0 72), 77746#(<= main_~i~0 71), 77749#(<= main_~i~0 74), 77748#(<= main_~i~0 73), 77751#(<= main_~i~0 76), 77750#(<= main_~i~0 75), 77753#(<= main_~i~0 78), 77752#(<= main_~i~0 77), 77755#(<= main_~i~0 80), 77754#(<= main_~i~0 79), 77757#(<= main_~i~0 82), 77756#(<= main_~i~0 81), 77759#(<= main_~i~0 84), 77758#(<= main_~i~0 83), 77761#(<= main_~i~0 86), 77760#(<= main_~i~0 85), 77763#(<= main_~i~0 88), 77762#(<= main_~i~0 87), 77765#(<= main_~i~0 90), 77764#(<= main_~i~0 89), 77767#(<= main_~i~0 92), 77766#(<= main_~i~0 91), 77769#(<= main_~i~0 94), 77768#(<= main_~i~0 93), 77771#(<= main_~i~0 96), 77770#(<= main_~i~0 95), 77773#(<= main_~i~0 98), 77772#(<= main_~i~0 97), 77775#(<= main_~i~0 100), 77774#(<= main_~i~0 99), 77777#(<= main_~i~0 102), 77776#(<= main_~i~0 101)] [2018-04-10 15:47:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20817 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:03,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-10 15:47:03,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-10 15:47:03,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-04-10 15:47:03,346 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 105 states. [2018-04-10 15:47:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:47:05,823 INFO L93 Difference]: Finished difference Result 944 states and 1045 transitions. [2018-04-10 15:47:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-10 15:47:05,823 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 428 [2018-04-10 15:47:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:47:05,824 INFO L225 Difference]: With dead ends: 944 [2018-04-10 15:47:05,824 INFO L226 Difference]: Without dead ends: 944 [2018-04-10 15:47:05,825 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-04-10 15:47:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-10 15:47:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 433. [2018-04-10 15:47:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-10 15:47:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-04-10 15:47:05,827 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 428 [2018-04-10 15:47:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:47:05,827 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-04-10 15:47:05,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-10 15:47:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-04-10 15:47:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-04-10 15:47:05,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:47:05,828 INFO L355 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:47:05,828 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:47:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1845908951, now seen corresponding path program 102 times [2018-04-10 15:47:05,829 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:47:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:47:05,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:47:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21227 backedges. 0 proven. 21218 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:08,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:47:08,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-04-10 15:47:08,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:47:08,561 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-10 15:47:08,561 INFO L182 omatonBuilderFactory]: Interpolants [79155#true, 79157#(<= main_~i~0 0), 79156#false, 79159#(<= main_~i~0 2), 79158#(<= main_~i~0 1), 79161#(<= main_~i~0 4), 79160#(<= main_~i~0 3), 79163#(<= main_~i~0 6), 79162#(<= main_~i~0 5), 79165#(<= main_~i~0 8), 79164#(<= main_~i~0 7), 79167#(<= main_~i~0 10), 79166#(<= main_~i~0 9), 79169#(<= main_~i~0 12), 79168#(<= main_~i~0 11), 79171#(<= main_~i~0 14), 79170#(<= main_~i~0 13), 79173#(<= main_~i~0 16), 79172#(<= main_~i~0 15), 79175#(<= main_~i~0 18), 79174#(<= main_~i~0 17), 79177#(<= main_~i~0 20), 79176#(<= main_~i~0 19), 79179#(<= main_~i~0 22), 79178#(<= main_~i~0 21), 79181#(<= main_~i~0 24), 79180#(<= main_~i~0 23), 79183#(<= main_~i~0 26), 79182#(<= main_~i~0 25), 79185#(<= main_~i~0 28), 79184#(<= main_~i~0 27), 79187#(<= main_~i~0 30), 79186#(<= main_~i~0 29), 79189#(<= main_~i~0 32), 79188#(<= main_~i~0 31), 79191#(<= main_~i~0 34), 79190#(<= main_~i~0 33), 79193#(<= main_~i~0 36), 79192#(<= main_~i~0 35), 79195#(<= main_~i~0 38), 79194#(<= main_~i~0 37), 79197#(<= main_~i~0 40), 79196#(<= main_~i~0 39), 79199#(<= main_~i~0 42), 79198#(<= main_~i~0 41), 79201#(<= main_~i~0 44), 79200#(<= main_~i~0 43), 79203#(<= main_~i~0 46), 79202#(<= main_~i~0 45), 79205#(<= main_~i~0 48), 79204#(<= main_~i~0 47), 79207#(<= main_~i~0 50), 79206#(<= main_~i~0 49), 79209#(<= main_~i~0 52), 79208#(<= main_~i~0 51), 79211#(<= main_~i~0 54), 79210#(<= main_~i~0 53), 79213#(<= main_~i~0 56), 79212#(<= main_~i~0 55), 79215#(<= main_~i~0 58), 79214#(<= main_~i~0 57), 79217#(<= main_~i~0 60), 79216#(<= main_~i~0 59), 79219#(<= main_~i~0 62), 79218#(<= main_~i~0 61), 79221#(<= main_~i~0 64), 79220#(<= main_~i~0 63), 79223#(<= main_~i~0 66), 79222#(<= main_~i~0 65), 79225#(<= main_~i~0 68), 79224#(<= main_~i~0 67), 79227#(<= main_~i~0 70), 79226#(<= main_~i~0 69), 79229#(<= main_~i~0 72), 79228#(<= main_~i~0 71), 79231#(<= main_~i~0 74), 79230#(<= main_~i~0 73), 79233#(<= main_~i~0 76), 79232#(<= main_~i~0 75), 79235#(<= main_~i~0 78), 79234#(<= main_~i~0 77), 79237#(<= main_~i~0 80), 79236#(<= main_~i~0 79), 79239#(<= main_~i~0 82), 79238#(<= main_~i~0 81), 79241#(<= main_~i~0 84), 79240#(<= main_~i~0 83), 79243#(<= main_~i~0 86), 79242#(<= main_~i~0 85), 79245#(<= main_~i~0 88), 79244#(<= main_~i~0 87), 79247#(<= main_~i~0 90), 79246#(<= main_~i~0 89), 79249#(<= main_~i~0 92), 79248#(<= main_~i~0 91), 79251#(<= main_~i~0 94), 79250#(<= main_~i~0 93), 79253#(<= main_~i~0 96), 79252#(<= main_~i~0 95), 79255#(<= main_~i~0 98), 79254#(<= main_~i~0 97), 79257#(<= main_~i~0 100), 79256#(<= main_~i~0 99), 79259#(<= main_~i~0 102), 79258#(<= main_~i~0 101), 79260#(<= main_~i~0 103)] [2018-04-10 15:47:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21227 backedges. 0 proven. 21218 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:08,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-10 15:47:08,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-10 15:47:08,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-04-10 15:47:08,563 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 106 states. [2018-04-10 15:47:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:47:11,094 INFO L93 Difference]: Finished difference Result 953 states and 1055 transitions. [2018-04-10 15:47:11,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-10 15:47:11,094 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 432 [2018-04-10 15:47:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:47:11,095 INFO L225 Difference]: With dead ends: 953 [2018-04-10 15:47:11,095 INFO L226 Difference]: Without dead ends: 953 [2018-04-10 15:47:11,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-04-10 15:47:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-04-10 15:47:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 437. [2018-04-10 15:47:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-10 15:47:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-04-10 15:47:11,097 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 432 [2018-04-10 15:47:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:47:11,097 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-04-10 15:47:11,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-10 15:47:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-04-10 15:47:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-10 15:47:11,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:47:11,098 INFO L355 BasicCegarLoop]: trace histogram [105, 104, 104, 104, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:47:11,098 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:47:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash 555510050, now seen corresponding path program 103 times [2018-04-10 15:47:11,099 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:47:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:47:11,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:47:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21641 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:13,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:47:13,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-04-10 15:47:13,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:47:13,914 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-10 15:47:13,914 INFO L182 omatonBuilderFactory]: Interpolants [80651#true, 80653#(<= main_~i~0 0), 80652#false, 80655#(<= main_~i~0 2), 80654#(<= main_~i~0 1), 80657#(<= main_~i~0 4), 80656#(<= main_~i~0 3), 80659#(<= main_~i~0 6), 80658#(<= main_~i~0 5), 80661#(<= main_~i~0 8), 80660#(<= main_~i~0 7), 80663#(<= main_~i~0 10), 80662#(<= main_~i~0 9), 80665#(<= main_~i~0 12), 80664#(<= main_~i~0 11), 80667#(<= main_~i~0 14), 80666#(<= main_~i~0 13), 80669#(<= main_~i~0 16), 80668#(<= main_~i~0 15), 80671#(<= main_~i~0 18), 80670#(<= main_~i~0 17), 80673#(<= main_~i~0 20), 80672#(<= main_~i~0 19), 80675#(<= main_~i~0 22), 80674#(<= main_~i~0 21), 80677#(<= main_~i~0 24), 80676#(<= main_~i~0 23), 80679#(<= main_~i~0 26), 80678#(<= main_~i~0 25), 80681#(<= main_~i~0 28), 80680#(<= main_~i~0 27), 80683#(<= main_~i~0 30), 80682#(<= main_~i~0 29), 80685#(<= main_~i~0 32), 80684#(<= main_~i~0 31), 80687#(<= main_~i~0 34), 80686#(<= main_~i~0 33), 80689#(<= main_~i~0 36), 80688#(<= main_~i~0 35), 80691#(<= main_~i~0 38), 80690#(<= main_~i~0 37), 80693#(<= main_~i~0 40), 80692#(<= main_~i~0 39), 80695#(<= main_~i~0 42), 80694#(<= main_~i~0 41), 80697#(<= main_~i~0 44), 80696#(<= main_~i~0 43), 80699#(<= main_~i~0 46), 80698#(<= main_~i~0 45), 80701#(<= main_~i~0 48), 80700#(<= main_~i~0 47), 80703#(<= main_~i~0 50), 80702#(<= main_~i~0 49), 80705#(<= main_~i~0 52), 80704#(<= main_~i~0 51), 80707#(<= main_~i~0 54), 80706#(<= main_~i~0 53), 80709#(<= main_~i~0 56), 80708#(<= main_~i~0 55), 80711#(<= main_~i~0 58), 80710#(<= main_~i~0 57), 80713#(<= main_~i~0 60), 80712#(<= main_~i~0 59), 80715#(<= main_~i~0 62), 80714#(<= main_~i~0 61), 80717#(<= main_~i~0 64), 80716#(<= main_~i~0 63), 80719#(<= main_~i~0 66), 80718#(<= main_~i~0 65), 80721#(<= main_~i~0 68), 80720#(<= main_~i~0 67), 80723#(<= main_~i~0 70), 80722#(<= main_~i~0 69), 80725#(<= main_~i~0 72), 80724#(<= main_~i~0 71), 80727#(<= main_~i~0 74), 80726#(<= main_~i~0 73), 80729#(<= main_~i~0 76), 80728#(<= main_~i~0 75), 80731#(<= main_~i~0 78), 80730#(<= main_~i~0 77), 80733#(<= main_~i~0 80), 80732#(<= main_~i~0 79), 80735#(<= main_~i~0 82), 80734#(<= main_~i~0 81), 80737#(<= main_~i~0 84), 80736#(<= main_~i~0 83), 80739#(<= main_~i~0 86), 80738#(<= main_~i~0 85), 80741#(<= main_~i~0 88), 80740#(<= main_~i~0 87), 80743#(<= main_~i~0 90), 80742#(<= main_~i~0 89), 80745#(<= main_~i~0 92), 80744#(<= main_~i~0 91), 80747#(<= main_~i~0 94), 80746#(<= main_~i~0 93), 80749#(<= main_~i~0 96), 80748#(<= main_~i~0 95), 80751#(<= main_~i~0 98), 80750#(<= main_~i~0 97), 80753#(<= main_~i~0 100), 80752#(<= main_~i~0 99), 80755#(<= main_~i~0 102), 80754#(<= main_~i~0 101), 80757#(<= main_~i~0 104), 80756#(<= main_~i~0 103)] [2018-04-10 15:47:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21641 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:13,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-10 15:47:13,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-10 15:47:13,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-04-10 15:47:13,916 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 107 states. [2018-04-10 15:47:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:47:17,111 INFO L93 Difference]: Finished difference Result 962 states and 1065 transitions. [2018-04-10 15:47:17,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-10 15:47:17,112 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 436 [2018-04-10 15:47:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:47:17,112 INFO L225 Difference]: With dead ends: 962 [2018-04-10 15:47:17,112 INFO L226 Difference]: Without dead ends: 962 [2018-04-10 15:47:17,113 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-04-10 15:47:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-04-10 15:47:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 441. [2018-04-10 15:47:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-10 15:47:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-04-10 15:47:17,115 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 436 [2018-04-10 15:47:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:47:17,115 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-04-10 15:47:17,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-10 15:47:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-04-10 15:47:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-04-10 15:47:17,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:47:17,116 INFO L355 BasicCegarLoop]: trace histogram [106, 105, 105, 105, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:47:17,116 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:47:17,116 INFO L82 PathProgramCache]: Analyzing trace with hash -765131877, now seen corresponding path program 104 times [2018-04-10 15:47:17,117 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:47:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:47:17,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:47:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22059 backedges. 0 proven. 22050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:19,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:47:19,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-04-10 15:47:19,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:47:19,910 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-10 15:47:19,910 INFO L182 omatonBuilderFactory]: Interpolants [82177#(<= main_~i~0 14), 82176#(<= main_~i~0 13), 82179#(<= main_~i~0 16), 82178#(<= main_~i~0 15), 82181#(<= main_~i~0 18), 82180#(<= main_~i~0 17), 82183#(<= main_~i~0 20), 82182#(<= main_~i~0 19), 82185#(<= main_~i~0 22), 82184#(<= main_~i~0 21), 82187#(<= main_~i~0 24), 82186#(<= main_~i~0 23), 82189#(<= main_~i~0 26), 82188#(<= main_~i~0 25), 82191#(<= main_~i~0 28), 82190#(<= main_~i~0 27), 82193#(<= main_~i~0 30), 82192#(<= main_~i~0 29), 82195#(<= main_~i~0 32), 82194#(<= main_~i~0 31), 82197#(<= main_~i~0 34), 82196#(<= main_~i~0 33), 82199#(<= main_~i~0 36), 82198#(<= main_~i~0 35), 82201#(<= main_~i~0 38), 82200#(<= main_~i~0 37), 82203#(<= main_~i~0 40), 82202#(<= main_~i~0 39), 82205#(<= main_~i~0 42), 82204#(<= main_~i~0 41), 82207#(<= main_~i~0 44), 82206#(<= main_~i~0 43), 82209#(<= main_~i~0 46), 82208#(<= main_~i~0 45), 82211#(<= main_~i~0 48), 82210#(<= main_~i~0 47), 82213#(<= main_~i~0 50), 82212#(<= main_~i~0 49), 82215#(<= main_~i~0 52), 82214#(<= main_~i~0 51), 82217#(<= main_~i~0 54), 82216#(<= main_~i~0 53), 82219#(<= main_~i~0 56), 82218#(<= main_~i~0 55), 82221#(<= main_~i~0 58), 82220#(<= main_~i~0 57), 82223#(<= main_~i~0 60), 82222#(<= main_~i~0 59), 82225#(<= main_~i~0 62), 82224#(<= main_~i~0 61), 82227#(<= main_~i~0 64), 82226#(<= main_~i~0 63), 82229#(<= main_~i~0 66), 82228#(<= main_~i~0 65), 82231#(<= main_~i~0 68), 82230#(<= main_~i~0 67), 82233#(<= main_~i~0 70), 82232#(<= main_~i~0 69), 82235#(<= main_~i~0 72), 82234#(<= main_~i~0 71), 82237#(<= main_~i~0 74), 82236#(<= main_~i~0 73), 82239#(<= main_~i~0 76), 82238#(<= main_~i~0 75), 82241#(<= main_~i~0 78), 82240#(<= main_~i~0 77), 82243#(<= main_~i~0 80), 82242#(<= main_~i~0 79), 82245#(<= main_~i~0 82), 82244#(<= main_~i~0 81), 82247#(<= main_~i~0 84), 82246#(<= main_~i~0 83), 82249#(<= main_~i~0 86), 82248#(<= main_~i~0 85), 82251#(<= main_~i~0 88), 82250#(<= main_~i~0 87), 82253#(<= main_~i~0 90), 82252#(<= main_~i~0 89), 82255#(<= main_~i~0 92), 82254#(<= main_~i~0 91), 82257#(<= main_~i~0 94), 82256#(<= main_~i~0 93), 82259#(<= main_~i~0 96), 82258#(<= main_~i~0 95), 82261#(<= main_~i~0 98), 82260#(<= main_~i~0 97), 82263#(<= main_~i~0 100), 82262#(<= main_~i~0 99), 82265#(<= main_~i~0 102), 82264#(<= main_~i~0 101), 82267#(<= main_~i~0 104), 82266#(<= main_~i~0 103), 82268#(<= main_~i~0 105), 82161#true, 82163#(<= main_~i~0 0), 82162#false, 82165#(<= main_~i~0 2), 82164#(<= main_~i~0 1), 82167#(<= main_~i~0 4), 82166#(<= main_~i~0 3), 82169#(<= main_~i~0 6), 82168#(<= main_~i~0 5), 82171#(<= main_~i~0 8), 82170#(<= main_~i~0 7), 82173#(<= main_~i~0 10), 82172#(<= main_~i~0 9), 82175#(<= main_~i~0 12), 82174#(<= main_~i~0 11)] [2018-04-10 15:47:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22059 backedges. 0 proven. 22050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:47:19,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-10 15:47:19,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-10 15:47:19,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-04-10 15:47:19,912 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 108 states. Received shutdown request... [2018-04-10 15:47:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-10 15:47:22,532 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 15:47:22,535 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 15:47:22,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:47:22 BoogieIcfgContainer [2018-04-10 15:47:22,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 15:47:22,536 INFO L168 Benchmark]: Toolchain (without parser) took 189835.36 ms. Allocated memory was 402.1 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 338.2 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 392.7 MB. Max. memory is 5.3 GB. [2018-04-10 15:47:22,537 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 402.1 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:47:22,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.82 ms. Allocated memory is still 402.1 MB. Free memory was 338.2 MB in the beginning and 328.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-04-10 15:47:22,537 INFO L168 Benchmark]: Boogie Preprocessor took 17.42 ms. Allocated memory is still 402.1 MB. Free memory was 328.9 MB in the beginning and 327.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 15:47:22,537 INFO L168 Benchmark]: RCFGBuilder took 186.94 ms. Allocated memory was 402.1 MB in the beginning and 615.0 MB in the end (delta: 212.9 MB). Free memory was 327.6 MB in the beginning and 582.2 MB in the end (delta: -254.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. [2018-04-10 15:47:22,538 INFO L168 Benchmark]: TraceAbstraction took 189491.52 ms. Allocated memory was 615.0 MB in the beginning and 2.0 GB in the end (delta: 1.4 GB). Free memory was 582.2 MB in the beginning and 1.6 GB in the end (delta: -971.3 MB). Peak memory consumption was 423.9 MB. Max. memory is 5.3 GB. [2018-04-10 15:47:22,539 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.18 ms. Allocated memory is still 402.1 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 136.82 ms. Allocated memory is still 402.1 MB. Free memory was 338.2 MB in the beginning and 328.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.42 ms. Allocated memory is still 402.1 MB. Free memory was 328.9 MB in the beginning and 327.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 186.94 ms. Allocated memory was 402.1 MB in the beginning and 615.0 MB in the end (delta: 212.9 MB). Free memory was 327.6 MB in the beginning and 582.2 MB in the end (delta: -254.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 189491.52 ms. Allocated memory was 615.0 MB in the beginning and 2.0 GB in the end (delta: 1.4 GB). Free memory was 582.2 MB in the beginning and 1.6 GB in the end (delta: -971.3 MB). Peak memory consumption was 423.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (441states) and interpolant automaton (currently 108 states, 108 states before enhancement), while ReachableStatesComputation was computing reachable states (940 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (441states) and interpolant automaton (currently 108 states, 108 states before enhancement), while ReachableStatesComputation was computing reachable states (940 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 189.4s OverallTime, 106 OverallIterations, 106 TraceHistogramMax, 80.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 967 SDtfs, 43824 SDslu, 26897 SDs, 0 SdLazy, 48257 SolverSat, 15032 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5883 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 79.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 946/783754 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 105 MinimizatonAttempts, 27399 StatesRemovedByMinimization, 104 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 104.3s InterpolantComputationTime, 24360 NumberOfCodeBlocks, 24360 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 24254 ConstructedInterpolants, 0 QuantifiedInterpolants, 20613900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 2 PerfectInterpolantSequences, 946/783754 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-47-22-545.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_15-47-22-545.csv Completed graceful shutdown