java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:05:51,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:05:51,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:05:51,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:05:51,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:05:51,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:05:51,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:05:51,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:05:51,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:05:51,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:05:51,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:05:51,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:05:51,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:05:51,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:05:51,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:05:51,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:05:51,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:05:51,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:05:51,097 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:05:51,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:05:51,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:05:51,099 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:05:51,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:05:51,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:05:51,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:05:51,102 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:05:51,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:05:51,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:05:51,103 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:05:51,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:05:51,104 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:05:51,104 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-11 13:05:51,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:05:51,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:05:51,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:05:51,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:05:51,125 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:05:51,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:05:51,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:05:51,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:05:51,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:05:51,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:05:51,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:05:51,126 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:05:51,126 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:05:51,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:05:51,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:05:51,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:05:51,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:05:51,127 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:05:51,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:05:51,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:05:51,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:05:51,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 13:05:51,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:05:51,165 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:05:51,168 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:05:51,170 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:05:51,170 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:05:51,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-04-11 13:05:51,492 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3cf544520 [2018-04-11 13:05:51,577 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:05:51,577 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:05:51,577 INFO L168 CDTParser]: Scanning standard_strcpy_original_false-valid-deref.i [2018-04-11 13:05:51,578 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:05:51,578 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:05:51,578 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:05:51,578 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_original_false-valid-deref.i [2018-04-11 13:05:51,578 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_original_false-valid-deref.i [2018-04-11 13:05:51,578 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:05:51,578 INFO L233 ultiparseSymbolTable]: [2018-04-11 13:05:51,610 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3cf544520 [2018-04-11 13:05:51,613 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:05:51,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:05:51,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:05:51,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:05:51,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:05:51,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5d060a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51, skipping insertion in model container [2018-04-11 13:05:51,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,631 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:05:51,639 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:05:51,725 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:05:51,738 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:05:51,741 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-11 13:05:51,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51 WrapperNode [2018-04-11 13:05:51,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:05:51,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:05:51,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:05:51,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:05:51,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (1/1) ... [2018-04-11 13:05:51,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:05:51,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:05:51,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:05:51,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:05:51,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (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-11 13:05:51,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:05:51,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:05:51,801 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-11 13:05:51,801 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:05:51,801 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 13:05:51,801 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-11 13:05:51,801 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:05:51,801 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:05:51,801 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:05:51,949 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:05:51,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:05:51 BoogieIcfgContainer [2018-04-11 13:05:51,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:05:51,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:05:51,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:05:51,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:05:51,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:05:51" (1/3) ... [2018-04-11 13:05:51,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400cce89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:05:51, skipping insertion in model container [2018-04-11 13:05:51,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:05:51" (2/3) ... [2018-04-11 13:05:51,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400cce89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:05:51, skipping insertion in model container [2018-04-11 13:05:51,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:05:51" (3/3) ... [2018-04-11 13:05:51,953 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-04-11 13:05:51,958 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:05:51,963 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-11 13:05:51,983 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:05:51,984 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:05:51,984 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:05:51,984 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:05:51,984 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:05:51,984 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:05:51,984 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:05:51,984 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:05:51,984 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:05:51,985 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:05:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-04-11 13:05:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-11 13:05:51,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:51,997 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:51,998 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:52,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1734705512, now seen corresponding path program 1 times [2018-04-11 13:05:52,031 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:52,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:05:52,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:05:52,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,082 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-04-11 13:05:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:05:52,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:05:52,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:05:52,092 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-04-11 13:05:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:52,159 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-04-11 13:05:52,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:05:52,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-11 13:05:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:52,166 INFO L225 Difference]: With dead ends: 50 [2018-04-11 13:05:52,166 INFO L226 Difference]: Without dead ends: 41 [2018-04-11 13:05:52,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:05:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-11 13:05:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-04-11 13:05:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-11 13:05:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-04-11 13:05:52,196 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-04-11 13:05:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:52,196 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-04-11 13:05:52,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:05:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-04-11 13:05:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 13:05:52,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:52,197 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:52,197 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1166772373, now seen corresponding path program 1 times [2018-04-11 13:05:52,198 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:52,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:52,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-11 13:05:52,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,240 INFO L182 omatonBuilderFactory]: Interpolants [128#true, 129#false, 130#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 131#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-11 13:05:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:05:52,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:05:52,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:05:52,241 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-04-11 13:05:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:52,342 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-11 13:05:52,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:05:52,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 13:05:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:52,344 INFO L225 Difference]: With dead ends: 54 [2018-04-11 13:05:52,344 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 13:05:52,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:05:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 13:05:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-04-11 13:05:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 13:05:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-11 13:05:52,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-04-11 13:05:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:52,352 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-11 13:05:52,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:05:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-11 13:05:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 13:05:52,354 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:52,354 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:52,354 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1914964600, now seen corresponding path program 2 times [2018-04-11 13:05:52,355 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:52,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:52,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-11 13:05:52,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,436 INFO L182 omatonBuilderFactory]: Interpolants [240#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 236#true, 237#false, 238#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 239#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-11 13:05:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:05:52,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:05:52,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:05:52,437 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-04-11 13:05:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:52,526 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-04-11 13:05:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:05:52,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 13:05:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:52,528 INFO L225 Difference]: With dead ends: 67 [2018-04-11 13:05:52,528 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 13:05:52,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:05:52,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 13:05:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-04-11 13:05:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 13:05:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-11 13:05:52,535 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-04-11 13:05:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:52,535 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-11 13:05:52,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:05:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-11 13:05:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 13:05:52,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:52,536 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:52,536 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash -510089099, now seen corresponding path program 3 times [2018-04-11 13:05:52,536 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:52,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:52,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:05:52,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,596 INFO L182 omatonBuilderFactory]: Interpolants [370#true, 371#false, 372#(<= main_~i~0 0), 373#(<= main_~i~0 1), 374#(<= main_~i~0 2), 375#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 376#(and (<= main_~i~0 3) (<= 1 main_~i~0))] [2018-04-11 13:05:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:05:52,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:05:52,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:05:52,597 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-04-11 13:05:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:52,708 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-04-11 13:05:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:05:52,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-11 13:05:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:52,709 INFO L225 Difference]: With dead ends: 80 [2018-04-11 13:05:52,709 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 13:05:52,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:05:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 13:05:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-04-11 13:05:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 13:05:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-04-11 13:05:52,714 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-04-11 13:05:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:52,714 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-04-11 13:05:52,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:05:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-04-11 13:05:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 13:05:52,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:52,716 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:52,716 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash -697843288, now seen corresponding path program 4 times [2018-04-11 13:05:52,717 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:52,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:52,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:05:52,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,780 INFO L182 omatonBuilderFactory]: Interpolants [537#true, 538#false, 539#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 540#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 541#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 542#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 543#(and (<= 4 main_~i~0) (<= main_~i~0 4))] [2018-04-11 13:05:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:52,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:05:52,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:05:52,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:05:52,780 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-04-11 13:05:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:52,936 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-04-11 13:05:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:05:52,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-11 13:05:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:52,938 INFO L225 Difference]: With dead ends: 93 [2018-04-11 13:05:52,938 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 13:05:52,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:05:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 13:05:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-04-11 13:05:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 13:05:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-04-11 13:05:52,945 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-04-11 13:05:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:52,945 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-04-11 13:05:52,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:05:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-04-11 13:05:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:05:52,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:52,946 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:52,946 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1960349611, now seen corresponding path program 5 times [2018-04-11 13:05:52,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:52,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:53,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:05:53,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,017 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#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 731#(and (<= 1 main_~i~0) (<= main_~i~0 5))] [2018-04-11 13:05:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:05:53,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:05:53,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:05:53,017 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 9 states. [2018-04-11 13:05:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:53,172 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-04-11 13:05:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:05:53,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 13:05:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:53,175 INFO L225 Difference]: With dead ends: 106 [2018-04-11 13:05:53,175 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 13:05:53,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:05:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 13:05:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-04-11 13:05:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 13:05:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-04-11 13:05:53,182 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-04-11 13:05:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:53,182 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-04-11 13:05:53,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:05:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-04-11 13:05:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 13:05:53,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:53,188 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:53,188 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash 138077640, now seen corresponding path program 6 times [2018-04-11 13:05:53,189 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:53,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:53,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:05:53,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:53,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-11 13:05:53,277 INFO L182 omatonBuilderFactory]: Interpolants [946#true, 947#false, 948#(<= main_~i~0 0), 949#(<= main_~i~0 1), 950#(<= main_~i~0 2), 951#(<= main_~i~0 3), 952#(<= main_~i~0 4), 953#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 954#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 955#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-04-11 13:05:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:05:53,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:05:53,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:05:53,278 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 10 states. [2018-04-11 13:05:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:53,429 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-04-11 13:05:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:05:53,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-11 13:05:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:53,430 INFO L225 Difference]: With dead ends: 119 [2018-04-11 13:05:53,430 INFO L226 Difference]: Without dead ends: 119 [2018-04-11 13:05:53,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:05:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-11 13:05:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-04-11 13:05:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 13:05:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-04-11 13:05:53,438 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-04-11 13:05:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:53,439 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-04-11 13:05:53,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:05:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-04-11 13:05:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 13:05:53,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:53,440 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:53,440 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash 709222453, now seen corresponding path program 7 times [2018-04-11 13:05:53,441 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:53,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:53,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:05:53,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:53,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-11 13:05:53,524 INFO L182 omatonBuilderFactory]: Interpolants [1200#(<= main_~i~0 1), 1201#(<= main_~i~0 2), 1202#(<= main_~i~0 3), 1203#(<= main_~i~0 4), 1204#(<= main_~i~0 5), 1205#(<= main_~i~0 6), 1206#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1207#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1197#true, 1198#false, 1199#(<= main_~i~0 0)] [2018-04-11 13:05:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:05:53,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:05:53,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:05:53,525 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-04-11 13:05:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:53,681 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-04-11 13:05:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:05:53,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-11 13:05:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:53,682 INFO L225 Difference]: With dead ends: 132 [2018-04-11 13:05:53,682 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 13:05:53,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:05:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 13:05:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-04-11 13:05:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 13:05:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-04-11 13:05:53,687 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-04-11 13:05:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:53,687 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-04-11 13:05:53,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:05:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-04-11 13:05:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 13:05:53,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:53,688 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:53,688 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash 336028136, now seen corresponding path program 8 times [2018-04-11 13:05:53,689 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:53,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:53,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:05:53,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,778 INFO L182 omatonBuilderFactory]: Interpolants [1476#true, 1477#false, 1478#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1479#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 1480#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1481#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1482#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1483#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1484#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1485#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1486#(and (<= 8 main_~i~0) (<= main_~i~0 8))] [2018-04-11 13:05:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:53,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:05:53,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:05:53,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:05:53,779 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-04-11 13:05:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:54,134 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-04-11 13:05:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:05:54,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-11 13:05:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:54,135 INFO L225 Difference]: With dead ends: 145 [2018-04-11 13:05:54,135 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 13:05:54,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:05:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 13:05:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-04-11 13:05:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 13:05:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-04-11 13:05:54,144 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-04-11 13:05:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:54,145 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-04-11 13:05:54,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:05:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-04-11 13:05:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 13:05:54,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:54,147 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:54,147 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1837234197, now seen corresponding path program 9 times [2018-04-11 13:05:54,148 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:54,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:54,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:05:54,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,232 INFO L182 omatonBuilderFactory]: Interpolants [1766#true, 1767#false, 1768#(<= main_~i~0 0), 1769#(<= main_~i~0 1), 1770#(<= main_~i~0 2), 1771#(<= main_~i~0 3), 1772#(<= main_~i~0 4), 1773#(<= main_~i~0 5), 1774#(<= main_~i~0 6), 1775#(<= main_~i~0 7), 1776#(<= main_~i~0 8), 1777#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1778#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-04-11 13:05:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:05:54,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:05:54,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:05:54,233 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 13 states. [2018-04-11 13:05:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:54,464 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-04-11 13:05:54,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:05:54,464 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-04-11 13:05:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:54,465 INFO L225 Difference]: With dead ends: 158 [2018-04-11 13:05:54,465 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 13:05:54,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:05:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 13:05:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-04-11 13:05:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 13:05:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-04-11 13:05:54,471 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-04-11 13:05:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:54,471 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-04-11 13:05:54,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:05:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-04-11 13:05:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 13:05:54,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:54,473 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:54,473 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash 872363528, now seen corresponding path program 10 times [2018-04-11 13:05:54,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:54,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:54,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:05:54,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,590 INFO L182 omatonBuilderFactory]: Interpolants [2112#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2113#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2114#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2101#true, 2102#false, 2103#(<= main_~i~0 0), 2104#(<= main_~i~0 1), 2105#(<= main_~i~0 2), 2106#(<= main_~i~0 3), 2107#(<= main_~i~0 4), 2108#(<= main_~i~0 5), 2109#(<= main_~i~0 6), 2110#(<= main_~i~0 7), 2111#(<= main_~i~0 8)] [2018-04-11 13:05:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:05:54,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:05:54,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:05:54,591 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-04-11 13:05:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:54,890 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-04-11 13:05:54,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:05:54,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-11 13:05:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:54,893 INFO L225 Difference]: With dead ends: 171 [2018-04-11 13:05:54,893 INFO L226 Difference]: Without dead ends: 171 [2018-04-11 13:05:54,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:05:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-11 13:05:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-04-11 13:05:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 13:05:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-04-11 13:05:54,898 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-04-11 13:05:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:54,899 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-04-11 13:05:54,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:05:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-04-11 13:05:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 13:05:54,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:54,900 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:54,901 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:54,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1444300811, now seen corresponding path program 11 times [2018-04-11 13:05:54,901 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:54,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:54,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:05:54,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,996 INFO L182 omatonBuilderFactory]: Interpolants [2464#true, 2465#false, 2466#(<= main_~i~0 0), 2467#(<= main_~i~0 1), 2468#(<= main_~i~0 2), 2469#(<= main_~i~0 3), 2470#(<= main_~i~0 4), 2471#(<= main_~i~0 5), 2472#(<= main_~i~0 6), 2473#(<= main_~i~0 7), 2474#(<= main_~i~0 8), 2475#(<= main_~i~0 9), 2476#(<= main_~i~0 10), 2477#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 2478#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-04-11 13:05:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:54,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:05:54,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:05:54,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:05:54,997 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 15 states. [2018-04-11 13:05:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:55,228 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-04-11 13:05:55,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 13:05:55,228 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-04-11 13:05:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:55,229 INFO L225 Difference]: With dead ends: 184 [2018-04-11 13:05:55,229 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 13:05:55,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:05:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 13:05:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-04-11 13:05:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 13:05:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-04-11 13:05:55,234 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-04-11 13:05:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:55,234 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-04-11 13:05:55,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:05:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-04-11 13:05:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 13:05:55,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:55,235 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:55,235 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash 198468136, now seen corresponding path program 12 times [2018-04-11 13:05:55,236 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:55,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:55,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:55,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:05:55,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:55,333 INFO L182 omatonBuilderFactory]: Interpolants [2855#true, 2856#false, 2857#(<= main_~i~0 0), 2858#(<= main_~i~0 1), 2859#(<= main_~i~0 2), 2860#(<= main_~i~0 3), 2861#(<= main_~i~0 4), 2862#(<= main_~i~0 5), 2863#(<= main_~i~0 6), 2864#(<= main_~i~0 7), 2865#(<= main_~i~0 8), 2866#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2867#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2868#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2869#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 2870#(and (<= 4 main_~i~0) (<= main_~i~0 12))] [2018-04-11 13:05:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:55,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:05:55,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:05:55,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:05:55,334 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 16 states. [2018-04-11 13:05:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:55,687 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-04-11 13:05:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:05:55,689 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-11 13:05:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:55,690 INFO L225 Difference]: With dead ends: 197 [2018-04-11 13:05:55,690 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 13:05:55,690 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:05:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 13:05:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-04-11 13:05:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 13:05:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-04-11 13:05:55,693 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-04-11 13:05:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:55,693 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-04-11 13:05:55,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:05:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-04-11 13:05:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 13:05:55,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:55,694 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:55,694 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1156898859, now seen corresponding path program 13 times [2018-04-11 13:05:55,695 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:55,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:55,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:55,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:05:55,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:55,814 INFO L182 omatonBuilderFactory]: Interpolants [3274#true, 3275#false, 3276#(<= main_~i~0 0), 3277#(<= main_~i~0 1), 3278#(<= main_~i~0 2), 3279#(<= main_~i~0 3), 3280#(<= main_~i~0 4), 3281#(<= main_~i~0 5), 3282#(<= main_~i~0 6), 3283#(<= main_~i~0 7), 3284#(<= main_~i~0 8), 3285#(<= main_~i~0 9), 3286#(<= main_~i~0 10), 3287#(<= main_~i~0 11), 3288#(<= main_~i~0 12), 3289#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3290#(and (<= 1 main_~i~0) (<= main_~i~0 13))] [2018-04-11 13:05:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:55,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:05:55,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:05:55,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:05:55,815 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-04-11 13:05:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:56,108 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-04-11 13:05:56,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:05:56,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-11 13:05:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:56,109 INFO L225 Difference]: With dead ends: 210 [2018-04-11 13:05:56,109 INFO L226 Difference]: Without dead ends: 210 [2018-04-11 13:05:56,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:05:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-11 13:05:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-04-11 13:05:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 13:05:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-04-11 13:05:56,113 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-04-11 13:05:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:56,114 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-04-11 13:05:56,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:05:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-04-11 13:05:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 13:05:56,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:56,114 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:56,115 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash -927406520, now seen corresponding path program 14 times [2018-04-11 13:05:56,115 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:56,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:56,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:56,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:05:56,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:56,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-11 13:05:56,247 INFO L182 omatonBuilderFactory]: Interpolants [3721#true, 3722#false, 3723#(<= main_~i~0 0), 3724#(<= main_~i~0 1), 3725#(<= main_~i~0 2), 3726#(<= main_~i~0 3), 3727#(<= main_~i~0 4), 3728#(<= main_~i~0 5), 3729#(<= main_~i~0 6), 3730#(<= main_~i~0 7), 3731#(<= main_~i~0 8), 3732#(<= main_~i~0 9), 3733#(<= main_~i~0 10), 3734#(<= main_~i~0 11), 3735#(<= main_~i~0 12), 3736#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3737#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 3738#(and (<= 2 main_~i~0) (<= main_~i~0 14))] [2018-04-11 13:05:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:56,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:05:56,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:05:56,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:05:56,247 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-04-11 13:05:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:56,545 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-04-11 13:05:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:05:56,545 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-11 13:05:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:56,546 INFO L225 Difference]: With dead ends: 223 [2018-04-11 13:05:56,546 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 13:05:56,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:05:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 13:05:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-04-11 13:05:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-11 13:05:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-04-11 13:05:56,551 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-04-11 13:05:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:56,551 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-04-11 13:05:56,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:05:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-04-11 13:05:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 13:05:56,552 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:56,552 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:56,552 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash -487313483, now seen corresponding path program 15 times [2018-04-11 13:05:56,553 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:56,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:56,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:56,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:05:56,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:56,697 INFO L182 omatonBuilderFactory]: Interpolants [4196#true, 4197#false, 4198#(<= main_~i~0 0), 4199#(<= main_~i~0 1), 4200#(<= main_~i~0 2), 4201#(<= main_~i~0 3), 4202#(<= main_~i~0 4), 4203#(<= main_~i~0 5), 4204#(<= main_~i~0 6), 4205#(<= main_~i~0 7), 4206#(<= main_~i~0 8), 4207#(<= main_~i~0 9), 4208#(<= main_~i~0 10), 4209#(<= main_~i~0 11), 4210#(<= main_~i~0 12), 4211#(<= main_~i~0 13), 4212#(<= main_~i~0 14), 4213#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 4214#(and (<= 1 main_~i~0) (<= main_~i~0 15))] [2018-04-11 13:05:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:56,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:05:56,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:05:56,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:05:56,698 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 19 states. [2018-04-11 13:05:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:56,982 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-04-11 13:05:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:05:56,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-04-11 13:05:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:56,983 INFO L225 Difference]: With dead ends: 236 [2018-04-11 13:05:56,983 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 13:05:56,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:05:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 13:05:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-11 13:05:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 13:05:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-04-11 13:05:56,988 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-04-11 13:05:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:56,989 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-04-11 13:05:56,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:05:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-04-11 13:05:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 13:05:56,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:56,990 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:56,990 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1096729192, now seen corresponding path program 16 times [2018-04-11 13:05:56,990 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:56,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:57,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:57,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:05:57,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:57,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-11 13:05:57,189 INFO L182 omatonBuilderFactory]: Interpolants [4704#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 4705#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 4706#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 4707#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 4708#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 4709#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 4710#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 4711#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 4712#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 4713#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 4714#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 4715#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 4716#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 4717#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 4699#true, 4700#false, 4701#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 4702#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 4703#(and (<= 2 main_~i~0) (<= main_~i~0 2))] [2018-04-11 13:05:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:57,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:05:57,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:05:57,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:05:57,190 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-04-11 13:05:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:58,213 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-04-11 13:05:58,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 13:05:58,213 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-11 13:05:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:58,214 INFO L225 Difference]: With dead ends: 249 [2018-04-11 13:05:58,214 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 13:05:58,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:05:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 13:05:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-04-11 13:05:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-11 13:05:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-11 13:05:58,217 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-04-11 13:05:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:58,218 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-11 13:05:58,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:05:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-11 13:05:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-11 13:05:58,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:58,218 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:58,218 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1439504491, now seen corresponding path program 17 times [2018-04-11 13:05:58,219 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:58,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:58,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:58,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:05:58,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:58,359 INFO L182 omatonBuilderFactory]: Interpolants [5216#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5217#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5197#true, 5198#false, 5199#(<= main_~i~0 0), 5200#(<= main_~i~0 1), 5201#(<= main_~i~0 2), 5202#(<= main_~i~0 3), 5203#(<= main_~i~0 4), 5204#(<= main_~i~0 5), 5205#(<= main_~i~0 6), 5206#(<= main_~i~0 7), 5207#(<= main_~i~0 8), 5208#(<= main_~i~0 9), 5209#(<= main_~i~0 10), 5210#(<= main_~i~0 11), 5211#(<= main_~i~0 12), 5212#(<= main_~i~0 13), 5213#(<= main_~i~0 14), 5214#(<= main_~i~0 15), 5215#(<= main_~i~0 16)] [2018-04-11 13:05:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:58,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:05:58,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:05:58,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:05:58,359 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 21 states. [2018-04-11 13:05:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:58,722 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-04-11 13:05:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 13:05:58,722 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-04-11 13:05:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:58,723 INFO L225 Difference]: With dead ends: 262 [2018-04-11 13:05:58,723 INFO L226 Difference]: Without dead ends: 262 [2018-04-11 13:05:58,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:05:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-11 13:05:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-04-11 13:05:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-11 13:05:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-04-11 13:05:58,727 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-04-11 13:05:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:58,727 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-04-11 13:05:58,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:05:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-04-11 13:05:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-11 13:05:58,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:58,728 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:58,728 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash 368572040, now seen corresponding path program 18 times [2018-04-11 13:05:58,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:58,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:58,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:58,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:05:58,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:58,887 INFO L182 omatonBuilderFactory]: Interpolants [5760#(<= main_~i~0 2), 5761#(<= main_~i~0 3), 5762#(<= main_~i~0 4), 5763#(<= main_~i~0 5), 5764#(<= main_~i~0 6), 5765#(<= main_~i~0 7), 5766#(<= main_~i~0 8), 5767#(<= main_~i~0 9), 5768#(<= main_~i~0 10), 5769#(<= main_~i~0 11), 5770#(<= main_~i~0 12), 5771#(<= main_~i~0 13), 5772#(<= main_~i~0 14), 5773#(<= main_~i~0 15), 5774#(<= main_~i~0 16), 5775#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5776#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5777#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 5756#true, 5757#false, 5758#(<= main_~i~0 0), 5759#(<= main_~i~0 1)] [2018-04-11 13:05:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:58,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:05:58,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:05:58,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:05:58,888 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 22 states. [2018-04-11 13:05:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:05:59,410 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-04-11 13:05:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:05:59,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-04-11 13:05:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:05:59,412 INFO L225 Difference]: With dead ends: 275 [2018-04-11 13:05:59,412 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 13:05:59,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:05:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 13:05:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-04-11 13:05:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 13:05:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-04-11 13:05:59,418 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-04-11 13:05:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:05:59,418 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-04-11 13:05:59,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:05:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-04-11 13:05:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-11 13:05:59,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:05:59,419 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-11 13:05:59,419 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:05:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1076541579, now seen corresponding path program 19 times [2018-04-11 13:05:59,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:05:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:05:59,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:05:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:59,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:05:59,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:05:59,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:05:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:59,652 INFO L182 omatonBuilderFactory]: Interpolants [6343#true, 6344#false, 6345#(<= main_~i~0 0), 6346#(<= main_~i~0 1), 6347#(<= main_~i~0 2), 6348#(<= main_~i~0 3), 6349#(<= main_~i~0 4), 6350#(<= main_~i~0 5), 6351#(<= main_~i~0 6), 6352#(<= main_~i~0 7), 6353#(<= main_~i~0 8), 6354#(<= main_~i~0 9), 6355#(<= main_~i~0 10), 6356#(<= main_~i~0 11), 6357#(<= main_~i~0 12), 6358#(<= main_~i~0 13), 6359#(<= main_~i~0 14), 6360#(<= main_~i~0 15), 6361#(<= main_~i~0 16), 6362#(<= main_~i~0 17), 6363#(<= main_~i~0 18), 6364#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 6365#(and (<= 1 main_~i~0) (<= main_~i~0 19))] [2018-04-11 13:05:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:05:59,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:05:59,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:05:59,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:05:59,653 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-04-11 13:06:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:00,116 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-04-11 13:06:00,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:06:00,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-11 13:06:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:00,117 INFO L225 Difference]: With dead ends: 288 [2018-04-11 13:06:00,117 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 13:06:00,117 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 13:06:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 13:06:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-04-11 13:06:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-11 13:06:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-04-11 13:06:00,121 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-04-11 13:06:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:00,121 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-04-11 13:06:00,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:06:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-04-11 13:06:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-11 13:06:00,122 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:00,122 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:00,122 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -801733976, now seen corresponding path program 20 times [2018-04-11 13:06:00,123 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:00,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:00,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:00,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:06:00,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:00,305 INFO L182 omatonBuilderFactory]: Interpolants [6976#(<= main_~i~0 16), 6977#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 6978#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 6979#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 6980#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 6981#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 6958#true, 6959#false, 6960#(<= main_~i~0 0), 6961#(<= main_~i~0 1), 6962#(<= main_~i~0 2), 6963#(<= main_~i~0 3), 6964#(<= main_~i~0 4), 6965#(<= main_~i~0 5), 6966#(<= main_~i~0 6), 6967#(<= main_~i~0 7), 6968#(<= main_~i~0 8), 6969#(<= main_~i~0 9), 6970#(<= main_~i~0 10), 6971#(<= main_~i~0 11), 6972#(<= main_~i~0 12), 6973#(<= main_~i~0 13), 6974#(<= main_~i~0 14), 6975#(<= main_~i~0 15)] [2018-04-11 13:06:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:00,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:06:00,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:06:00,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:06:00,305 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-04-11 13:06:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:00,851 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-04-11 13:06:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:06:00,885 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-11 13:06:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:00,886 INFO L225 Difference]: With dead ends: 301 [2018-04-11 13:06:00,886 INFO L226 Difference]: Without dead ends: 301 [2018-04-11 13:06:00,887 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 13:06:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-11 13:06:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-04-11 13:06:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-11 13:06:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-04-11 13:06:00,891 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-04-11 13:06:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:00,892 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-04-11 13:06:00,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:06:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-04-11 13:06:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-11 13:06:00,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:00,893 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:00,893 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash -647409835, now seen corresponding path program 21 times [2018-04-11 13:06:00,894 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:00,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:01,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:01,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:06:01,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:01,154 INFO L182 omatonBuilderFactory]: Interpolants [7616#(<= main_~i~0 13), 7617#(<= main_~i~0 14), 7618#(<= main_~i~0 15), 7619#(<= main_~i~0 16), 7620#(<= main_~i~0 17), 7621#(<= main_~i~0 18), 7622#(<= main_~i~0 19), 7623#(<= main_~i~0 20), 7624#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 7625#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 7601#true, 7602#false, 7603#(<= main_~i~0 0), 7604#(<= main_~i~0 1), 7605#(<= main_~i~0 2), 7606#(<= main_~i~0 3), 7607#(<= main_~i~0 4), 7608#(<= main_~i~0 5), 7609#(<= main_~i~0 6), 7610#(<= main_~i~0 7), 7611#(<= main_~i~0 8), 7612#(<= main_~i~0 9), 7613#(<= main_~i~0 10), 7614#(<= main_~i~0 11), 7615#(<= main_~i~0 12)] [2018-04-11 13:06:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:01,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:06:01,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:06:01,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:06:01,157 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-04-11 13:06:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:01,917 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-04-11 13:06:01,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:06:01,918 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-11 13:06:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:01,919 INFO L225 Difference]: With dead ends: 314 [2018-04-11 13:06:01,919 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 13:06:01,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 13:06:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 13:06:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-04-11 13:06:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-11 13:06:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-04-11 13:06:01,923 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-04-11 13:06:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:01,923 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-04-11 13:06:01,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:06:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-04-11 13:06:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-11 13:06:01,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:01,924 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:01,924 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash 55338696, now seen corresponding path program 22 times [2018-04-11 13:06:01,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:01,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:02,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:02,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:06:02,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:02,162 INFO L182 omatonBuilderFactory]: Interpolants [8272#true, 8273#false, 8274#(<= main_~i~0 0), 8275#(<= main_~i~0 1), 8276#(<= main_~i~0 2), 8277#(<= main_~i~0 3), 8278#(<= main_~i~0 4), 8279#(<= main_~i~0 5), 8280#(<= main_~i~0 6), 8281#(<= main_~i~0 7), 8282#(<= main_~i~0 8), 8283#(<= main_~i~0 9), 8284#(<= main_~i~0 10), 8285#(<= main_~i~0 11), 8286#(<= main_~i~0 12), 8287#(<= main_~i~0 13), 8288#(<= main_~i~0 14), 8289#(<= main_~i~0 15), 8290#(<= main_~i~0 16), 8291#(<= main_~i~0 17), 8292#(<= main_~i~0 18), 8293#(<= main_~i~0 19), 8294#(<= main_~i~0 20), 8295#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 8296#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 8297#(and (<= 2 main_~i~0) (<= main_~i~0 22))] [2018-04-11 13:06:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:02,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 13:06:02,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 13:06:02,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:06:02,164 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-04-11 13:06:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:02,720 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-04-11 13:06:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:06:02,720 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-11 13:06:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:02,721 INFO L225 Difference]: With dead ends: 327 [2018-04-11 13:06:02,721 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 13:06:02,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 13:06:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 13:06:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-04-11 13:06:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-11 13:06:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-04-11 13:06:02,725 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-04-11 13:06:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:02,726 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-04-11 13:06:02,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 13:06:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-04-11 13:06:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-11 13:06:02,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:02,726 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:02,727 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1828913355, now seen corresponding path program 23 times [2018-04-11 13:06:02,727 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:02,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:02,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:02,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:06:02,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:02,960 INFO L182 omatonBuilderFactory]: Interpolants [8971#true, 8972#false, 8973#(<= main_~i~0 0), 8974#(<= main_~i~0 1), 8975#(<= main_~i~0 2), 8976#(<= main_~i~0 3), 8977#(<= main_~i~0 4), 8978#(<= main_~i~0 5), 8979#(<= main_~i~0 6), 8980#(<= main_~i~0 7), 8981#(<= main_~i~0 8), 8982#(<= main_~i~0 9), 8983#(<= main_~i~0 10), 8984#(<= main_~i~0 11), 8985#(<= main_~i~0 12), 8986#(<= main_~i~0 13), 8987#(<= main_~i~0 14), 8988#(<= main_~i~0 15), 8989#(<= main_~i~0 16), 8990#(<= main_~i~0 17), 8991#(<= main_~i~0 18), 8992#(<= main_~i~0 19), 8993#(<= main_~i~0 20), 8994#(<= main_~i~0 21), 8995#(<= main_~i~0 22), 8996#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 8997#(and (<= 1 main_~i~0) (<= main_~i~0 23))] [2018-04-11 13:06:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:02,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:06:02,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:06:02,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:06:02,961 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 27 states. [2018-04-11 13:06:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:03,508 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-04-11 13:06:03,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:06:03,508 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-04-11 13:06:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:03,509 INFO L225 Difference]: With dead ends: 340 [2018-04-11 13:06:03,509 INFO L226 Difference]: Without dead ends: 340 [2018-04-11 13:06:03,510 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 13:06:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-04-11 13:06:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-04-11 13:06:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-11 13:06:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-04-11 13:06:03,513 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-04-11 13:06:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:03,513 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-04-11 13:06:03,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:06:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-04-11 13:06:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-11 13:06:03,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:03,514 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:03,514 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1810604776, now seen corresponding path program 24 times [2018-04-11 13:06:03,514 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:03,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:03,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:03,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:06:03,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:03,771 INFO L182 omatonBuilderFactory]: Interpolants [9698#true, 9699#false, 9700#(<= main_~i~0 0), 9701#(<= main_~i~0 1), 9702#(<= main_~i~0 2), 9703#(<= main_~i~0 3), 9704#(<= main_~i~0 4), 9705#(<= main_~i~0 5), 9706#(<= main_~i~0 6), 9707#(<= main_~i~0 7), 9708#(<= main_~i~0 8), 9709#(<= main_~i~0 9), 9710#(<= main_~i~0 10), 9711#(<= main_~i~0 11), 9712#(<= main_~i~0 12), 9713#(<= main_~i~0 13), 9714#(<= main_~i~0 14), 9715#(<= main_~i~0 15), 9716#(<= main_~i~0 16), 9717#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 9718#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 9719#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 9720#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 9721#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 9722#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 9723#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 9724#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 9725#(and (<= 8 main_~i~0) (<= main_~i~0 24))] [2018-04-11 13:06:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:03,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:06:03,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:06:03,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:06:03,772 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 28 states. [2018-04-11 13:06:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:04,629 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-04-11 13:06:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 13:06:04,629 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 127 [2018-04-11 13:06:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:04,630 INFO L225 Difference]: With dead ends: 353 [2018-04-11 13:06:04,630 INFO L226 Difference]: Without dead ends: 353 [2018-04-11 13:06:04,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 13:06:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-11 13:06:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-04-11 13:06:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-11 13:06:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-04-11 13:06:04,634 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-04-11 13:06:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:04,635 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-04-11 13:06:04,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:06:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-04-11 13:06:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-11 13:06:04,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:04,635 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:04,635 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:04,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1327388437, now seen corresponding path program 25 times [2018-04-11 13:06:04,636 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:04,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:04,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:04,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:06:04,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:04,997 INFO L182 omatonBuilderFactory]: Interpolants [10453#true, 10454#false, 10455#(<= main_~i~0 0), 10456#(<= main_~i~0 1), 10457#(<= main_~i~0 2), 10458#(<= main_~i~0 3), 10459#(<= main_~i~0 4), 10460#(<= main_~i~0 5), 10461#(<= main_~i~0 6), 10462#(<= main_~i~0 7), 10463#(<= main_~i~0 8), 10464#(<= main_~i~0 9), 10465#(<= main_~i~0 10), 10466#(<= main_~i~0 11), 10467#(<= main_~i~0 12), 10468#(<= main_~i~0 13), 10469#(<= main_~i~0 14), 10470#(<= main_~i~0 15), 10471#(<= main_~i~0 16), 10472#(<= main_~i~0 17), 10473#(<= main_~i~0 18), 10474#(<= main_~i~0 19), 10475#(<= main_~i~0 20), 10476#(<= main_~i~0 21), 10477#(<= main_~i~0 22), 10478#(<= main_~i~0 23), 10479#(<= main_~i~0 24), 10480#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 10481#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-04-11 13:06:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:04,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 13:06:04,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 13:06:04,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:06:04,999 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-04-11 13:06:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:05,599 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-04-11 13:06:05,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:06:05,599 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-11 13:06:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:05,600 INFO L225 Difference]: With dead ends: 366 [2018-04-11 13:06:05,600 INFO L226 Difference]: Without dead ends: 366 [2018-04-11 13:06:05,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 13:06:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-11 13:06:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-04-11 13:06:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-11 13:06:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-04-11 13:06:05,606 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-04-11 13:06:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:05,606 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-04-11 13:06:05,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 13:06:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-04-11 13:06:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-11 13:06:05,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:05,607 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:05,607 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash 273037064, now seen corresponding path program 26 times [2018-04-11 13:06:05,608 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:05,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:05,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:05,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 13:06:05,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:05,852 INFO L182 omatonBuilderFactory]: Interpolants [11264#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 11265#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 11236#true, 11237#false, 11238#(<= main_~i~0 0), 11239#(<= main_~i~0 1), 11240#(<= main_~i~0 2), 11241#(<= main_~i~0 3), 11242#(<= main_~i~0 4), 11243#(<= main_~i~0 5), 11244#(<= main_~i~0 6), 11245#(<= main_~i~0 7), 11246#(<= main_~i~0 8), 11247#(<= main_~i~0 9), 11248#(<= main_~i~0 10), 11249#(<= main_~i~0 11), 11250#(<= main_~i~0 12), 11251#(<= main_~i~0 13), 11252#(<= main_~i~0 14), 11253#(<= main_~i~0 15), 11254#(<= main_~i~0 16), 11255#(<= main_~i~0 17), 11256#(<= main_~i~0 18), 11257#(<= main_~i~0 19), 11258#(<= main_~i~0 20), 11259#(<= main_~i~0 21), 11260#(<= main_~i~0 22), 11261#(<= main_~i~0 23), 11262#(<= main_~i~0 24), 11263#(and (<= 0 main_~i~0) (<= main_~i~0 24))] [2018-04-11 13:06:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:05,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:06:05,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:06:05,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:06:05,853 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-04-11 13:06:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:06,504 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-04-11 13:06:06,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:06:06,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-11 13:06:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:06,505 INFO L225 Difference]: With dead ends: 379 [2018-04-11 13:06:06,505 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 13:06:06,506 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 13:06:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 13:06:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-04-11 13:06:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-11 13:06:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-04-11 13:06:06,511 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-04-11 13:06:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:06,511 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-04-11 13:06:06,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:06:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-04-11 13:06:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-11 13:06:06,512 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:06,512 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:06,512 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash 383473397, now seen corresponding path program 27 times [2018-04-11 13:06:06,513 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:06,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:06,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:06,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 13:06:06,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:06,862 INFO L182 omatonBuilderFactory]: Interpolants [12047#true, 12048#false, 12049#(<= main_~i~0 0), 12050#(<= main_~i~0 1), 12051#(<= main_~i~0 2), 12052#(<= main_~i~0 3), 12053#(<= main_~i~0 4), 12054#(<= main_~i~0 5), 12055#(<= main_~i~0 6), 12056#(<= main_~i~0 7), 12057#(<= main_~i~0 8), 12058#(<= main_~i~0 9), 12059#(<= main_~i~0 10), 12060#(<= main_~i~0 11), 12061#(<= main_~i~0 12), 12062#(<= main_~i~0 13), 12063#(<= main_~i~0 14), 12064#(<= main_~i~0 15), 12065#(<= main_~i~0 16), 12066#(<= main_~i~0 17), 12067#(<= main_~i~0 18), 12068#(<= main_~i~0 19), 12069#(<= main_~i~0 20), 12070#(<= main_~i~0 21), 12071#(<= main_~i~0 22), 12072#(<= main_~i~0 23), 12073#(<= main_~i~0 24), 12074#(<= main_~i~0 25), 12075#(<= main_~i~0 26), 12076#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 12077#(and (<= 1 main_~i~0) (<= main_~i~0 27))] [2018-04-11 13:06:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:06,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 13:06:06,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 13:06:06,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:06:06,863 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-04-11 13:06:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:07,561 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-04-11 13:06:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 13:06:07,561 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-11 13:06:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:07,562 INFO L225 Difference]: With dead ends: 392 [2018-04-11 13:06:07,562 INFO L226 Difference]: Without dead ends: 392 [2018-04-11 13:06:07,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:06:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-11 13:06:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-04-11 13:06:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-11 13:06:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-04-11 13:06:07,566 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-04-11 13:06:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:07,566 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-04-11 13:06:07,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 13:06:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-04-11 13:06:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-11 13:06:07,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:07,567 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:07,567 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:07,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1611539240, now seen corresponding path program 28 times [2018-04-11 13:06:07,568 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:07,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:07,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:07,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 13:06:07,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:07,918 INFO L182 omatonBuilderFactory]: Interpolants [12886#true, 12887#false, 12888#(<= main_~i~0 0), 12889#(<= main_~i~0 1), 12890#(<= main_~i~0 2), 12891#(<= main_~i~0 3), 12892#(<= main_~i~0 4), 12893#(<= main_~i~0 5), 12894#(<= main_~i~0 6), 12895#(<= main_~i~0 7), 12896#(<= main_~i~0 8), 12897#(<= main_~i~0 9), 12898#(<= main_~i~0 10), 12899#(<= main_~i~0 11), 12900#(<= main_~i~0 12), 12901#(<= main_~i~0 13), 12902#(<= main_~i~0 14), 12903#(<= main_~i~0 15), 12904#(<= main_~i~0 16), 12905#(<= main_~i~0 17), 12906#(<= main_~i~0 18), 12907#(<= main_~i~0 19), 12908#(<= main_~i~0 20), 12909#(<= main_~i~0 21), 12910#(<= main_~i~0 22), 12911#(<= main_~i~0 23), 12912#(<= main_~i~0 24), 12913#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 12914#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 12915#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 12916#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 12917#(and (<= 4 main_~i~0) (<= main_~i~0 28))] [2018-04-11 13:06:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:07,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 13:06:07,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 13:06:07,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:06:07,919 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 32 states. [2018-04-11 13:06:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:08,871 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-04-11 13:06:08,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:06:08,872 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2018-04-11 13:06:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:08,873 INFO L225 Difference]: With dead ends: 405 [2018-04-11 13:06:08,873 INFO L226 Difference]: Without dead ends: 405 [2018-04-11 13:06:08,873 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 13:06:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-11 13:06:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-04-11 13:06:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-11 13:06:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-04-11 13:06:08,878 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-04-11 13:06:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:08,878 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-04-11 13:06:08,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 13:06:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-04-11 13:06:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-11 13:06:08,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:08,880 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:08,880 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2042756821, now seen corresponding path program 29 times [2018-04-11 13:06:08,881 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:08,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:09,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:09,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 13:06:09,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:09,242 INFO L182 omatonBuilderFactory]: Interpolants [13760#(<= main_~i~0 5), 13761#(<= main_~i~0 6), 13762#(<= main_~i~0 7), 13763#(<= main_~i~0 8), 13764#(<= main_~i~0 9), 13765#(<= main_~i~0 10), 13766#(<= main_~i~0 11), 13767#(<= main_~i~0 12), 13768#(<= main_~i~0 13), 13769#(<= main_~i~0 14), 13770#(<= main_~i~0 15), 13771#(<= main_~i~0 16), 13772#(<= main_~i~0 17), 13773#(<= main_~i~0 18), 13774#(<= main_~i~0 19), 13775#(<= main_~i~0 20), 13776#(<= main_~i~0 21), 13777#(<= main_~i~0 22), 13778#(<= main_~i~0 23), 13779#(<= main_~i~0 24), 13780#(<= main_~i~0 25), 13781#(<= main_~i~0 26), 13782#(<= main_~i~0 27), 13783#(<= main_~i~0 28), 13784#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 13785#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 13753#true, 13754#false, 13755#(<= main_~i~0 0), 13756#(<= main_~i~0 1), 13757#(<= main_~i~0 2), 13758#(<= main_~i~0 3), 13759#(<= main_~i~0 4)] [2018-04-11 13:06:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:09,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 13:06:09,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 13:06:09,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:06:09,244 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 33 states. [2018-04-11 13:06:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:09,943 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-04-11 13:06:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:06:09,943 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-04-11 13:06:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:09,944 INFO L225 Difference]: With dead ends: 418 [2018-04-11 13:06:09,945 INFO L226 Difference]: Without dead ends: 418 [2018-04-11 13:06:09,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 13:06:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-11 13:06:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-04-11 13:06:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-04-11 13:06:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-04-11 13:06:09,950 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-04-11 13:06:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:09,950 INFO L459 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-04-11 13:06:09,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 13:06:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-04-11 13:06:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-11 13:06:09,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:09,952 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:09,952 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1416980296, now seen corresponding path program 30 times [2018-04-11 13:06:09,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:09,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:10,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:10,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 13:06:10,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:10,312 INFO L182 omatonBuilderFactory]: Interpolants [14656#(<= main_~i~0 6), 14657#(<= main_~i~0 7), 14658#(<= main_~i~0 8), 14659#(<= main_~i~0 9), 14660#(<= main_~i~0 10), 14661#(<= main_~i~0 11), 14662#(<= main_~i~0 12), 14663#(<= main_~i~0 13), 14664#(<= main_~i~0 14), 14665#(<= main_~i~0 15), 14666#(<= main_~i~0 16), 14667#(<= main_~i~0 17), 14668#(<= main_~i~0 18), 14669#(<= main_~i~0 19), 14670#(<= main_~i~0 20), 14671#(<= main_~i~0 21), 14672#(<= main_~i~0 22), 14673#(<= main_~i~0 23), 14674#(<= main_~i~0 24), 14675#(<= main_~i~0 25), 14676#(<= main_~i~0 26), 14677#(<= main_~i~0 27), 14678#(<= main_~i~0 28), 14679#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 14680#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 14681#(and (<= 2 main_~i~0) (<= main_~i~0 30)), 14648#true, 14649#false, 14650#(<= main_~i~0 0), 14651#(<= main_~i~0 1), 14652#(<= main_~i~0 2), 14653#(<= main_~i~0 3), 14654#(<= main_~i~0 4), 14655#(<= main_~i~0 5)] [2018-04-11 13:06:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:10,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 13:06:10,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 13:06:10,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:06:10,313 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 34 states. [2018-04-11 13:06:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:11,107 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-04-11 13:06:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:06:11,107 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 157 [2018-04-11 13:06:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:11,108 INFO L225 Difference]: With dead ends: 431 [2018-04-11 13:06:11,108 INFO L226 Difference]: Without dead ends: 431 [2018-04-11 13:06:11,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 13:06:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-11 13:06:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-04-11 13:06:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 13:06:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-04-11 13:06:11,115 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-04-11 13:06:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:11,116 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-04-11 13:06:11,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 13:06:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-04-11 13:06:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-11 13:06:11,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:11,117 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:11,117 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1843416757, now seen corresponding path program 31 times [2018-04-11 13:06:11,118 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:11,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:11,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:11,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 13:06:11,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:11,522 INFO L182 omatonBuilderFactory]: Interpolants [15571#true, 15572#false, 15573#(<= main_~i~0 0), 15574#(<= main_~i~0 1), 15575#(<= main_~i~0 2), 15576#(<= main_~i~0 3), 15577#(<= main_~i~0 4), 15578#(<= main_~i~0 5), 15579#(<= main_~i~0 6), 15580#(<= main_~i~0 7), 15581#(<= main_~i~0 8), 15582#(<= main_~i~0 9), 15583#(<= main_~i~0 10), 15584#(<= main_~i~0 11), 15585#(<= main_~i~0 12), 15586#(<= main_~i~0 13), 15587#(<= main_~i~0 14), 15588#(<= main_~i~0 15), 15589#(<= main_~i~0 16), 15590#(<= main_~i~0 17), 15591#(<= main_~i~0 18), 15592#(<= main_~i~0 19), 15593#(<= main_~i~0 20), 15594#(<= main_~i~0 21), 15595#(<= main_~i~0 22), 15596#(<= main_~i~0 23), 15597#(<= main_~i~0 24), 15598#(<= main_~i~0 25), 15599#(<= main_~i~0 26), 15600#(<= main_~i~0 27), 15601#(<= main_~i~0 28), 15602#(<= main_~i~0 29), 15603#(<= main_~i~0 30), 15604#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 15605#(and (<= 1 main_~i~0) (<= main_~i~0 31))] [2018-04-11 13:06:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:11,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 13:06:11,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 13:06:11,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:06:11,523 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-04-11 13:06:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:12,359 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-04-11 13:06:12,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:06:12,360 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-11 13:06:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:12,361 INFO L225 Difference]: With dead ends: 444 [2018-04-11 13:06:12,361 INFO L226 Difference]: Without dead ends: 444 [2018-04-11 13:06:12,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 13:06:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-11 13:06:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-04-11 13:06:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-11 13:06:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-04-11 13:06:12,368 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-04-11 13:06:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:12,368 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-04-11 13:06:12,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 13:06:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-04-11 13:06:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-11 13:06:12,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:12,369 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:12,369 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1876032664, now seen corresponding path program 32 times [2018-04-11 13:06:12,370 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:12,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:13,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:13,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 13:06:13,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:13,031 INFO L182 omatonBuilderFactory]: Interpolants [16522#true, 16523#false, 16524#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 16525#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 16526#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 16527#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 16528#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 16529#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 16530#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 16531#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 16532#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 16533#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 16534#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 16535#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 16536#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 16537#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 16538#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 16539#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 16540#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 16541#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 16542#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 16543#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 16544#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 16545#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 16546#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 16547#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 16548#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 16549#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 16550#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 16551#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 16552#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 16553#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 16554#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 16555#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 16556#(and (<= 32 main_~i~0) (<= main_~i~0 32))] [2018-04-11 13:06:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:13,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 13:06:13,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 13:06:13,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:06:13,032 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-04-11 13:06:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:16,596 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-04-11 13:06:16,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:06:16,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-11 13:06:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:16,597 INFO L225 Difference]: With dead ends: 457 [2018-04-11 13:06:16,598 INFO L226 Difference]: Without dead ends: 457 [2018-04-11 13:06:16,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:06:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-11 13:06:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-04-11 13:06:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-11 13:06:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-04-11 13:06:16,603 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-04-11 13:06:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:16,603 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-04-11 13:06:16,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 13:06:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-04-11 13:06:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-11 13:06:16,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:16,605 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:16,605 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:16,605 INFO L82 PathProgramCache]: Analyzing trace with hash 801392277, now seen corresponding path program 33 times [2018-04-11 13:06:16,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:16,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:17,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:17,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 13:06:17,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:17,143 INFO L182 omatonBuilderFactory]: Interpolants [17472#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 17436#true, 17437#false, 17438#(<= main_~i~0 0), 17439#(<= main_~i~0 1), 17440#(<= main_~i~0 2), 17441#(<= main_~i~0 3), 17442#(<= main_~i~0 4), 17443#(<= main_~i~0 5), 17444#(<= main_~i~0 6), 17445#(<= main_~i~0 7), 17446#(<= main_~i~0 8), 17447#(<= main_~i~0 9), 17448#(<= main_~i~0 10), 17449#(<= main_~i~0 11), 17450#(<= main_~i~0 12), 17451#(<= main_~i~0 13), 17452#(<= main_~i~0 14), 17453#(<= main_~i~0 15), 17454#(<= main_~i~0 16), 17455#(<= main_~i~0 17), 17456#(<= main_~i~0 18), 17457#(<= main_~i~0 19), 17458#(<= main_~i~0 20), 17459#(<= main_~i~0 21), 17460#(<= main_~i~0 22), 17461#(<= main_~i~0 23), 17462#(<= main_~i~0 24), 17463#(<= main_~i~0 25), 17464#(<= main_~i~0 26), 17465#(<= main_~i~0 27), 17466#(<= main_~i~0 28), 17467#(<= main_~i~0 29), 17468#(<= main_~i~0 30), 17469#(<= main_~i~0 31), 17470#(<= main_~i~0 32), 17471#(and (<= 0 main_~i~0) (<= main_~i~0 32))] [2018-04-11 13:06:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:17,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 13:06:17,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 13:06:17,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:06:17,144 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-04-11 13:06:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:18,093 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-04-11 13:06:18,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:06:18,093 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-11 13:06:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:18,094 INFO L225 Difference]: With dead ends: 470 [2018-04-11 13:06:18,094 INFO L226 Difference]: Without dead ends: 470 [2018-04-11 13:06:18,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 13:06:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-11 13:06:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-04-11 13:06:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-11 13:06:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-04-11 13:06:18,098 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-04-11 13:06:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:18,098 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-04-11 13:06:18,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 13:06:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-04-11 13:06:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-11 13:06:18,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:18,099 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:18,099 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:18,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2137651080, now seen corresponding path program 34 times [2018-04-11 13:06:18,100 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:18,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:18,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:18,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-11 13:06:18,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:18,486 INFO L182 omatonBuilderFactory]: Interpolants [18443#true, 18444#false, 18445#(<= main_~i~0 0), 18446#(<= main_~i~0 1), 18447#(<= main_~i~0 2), 18448#(<= main_~i~0 3), 18449#(<= main_~i~0 4), 18450#(<= main_~i~0 5), 18451#(<= main_~i~0 6), 18452#(<= main_~i~0 7), 18453#(<= main_~i~0 8), 18454#(<= main_~i~0 9), 18455#(<= main_~i~0 10), 18456#(<= main_~i~0 11), 18457#(<= main_~i~0 12), 18458#(<= main_~i~0 13), 18459#(<= main_~i~0 14), 18460#(<= main_~i~0 15), 18461#(<= main_~i~0 16), 18462#(<= main_~i~0 17), 18463#(<= main_~i~0 18), 18464#(<= main_~i~0 19), 18465#(<= main_~i~0 20), 18466#(<= main_~i~0 21), 18467#(<= main_~i~0 22), 18468#(<= main_~i~0 23), 18469#(<= main_~i~0 24), 18470#(<= main_~i~0 25), 18471#(<= main_~i~0 26), 18472#(<= main_~i~0 27), 18473#(<= main_~i~0 28), 18474#(<= main_~i~0 29), 18475#(<= main_~i~0 30), 18476#(<= main_~i~0 31), 18477#(<= main_~i~0 32), 18478#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 18479#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 18480#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-04-11 13:06:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:18,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 13:06:18,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 13:06:18,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:06:18,487 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-04-11 13:06:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:19,459 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-04-11 13:06:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 13:06:19,459 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-11 13:06:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:19,460 INFO L225 Difference]: With dead ends: 483 [2018-04-11 13:06:19,460 INFO L226 Difference]: Without dead ends: 483 [2018-04-11 13:06:19,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 13:06:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-11 13:06:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-04-11 13:06:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-11 13:06:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-04-11 13:06:19,464 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-04-11 13:06:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:19,464 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-04-11 13:06:19,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 13:06:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-04-11 13:06:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-11 13:06:19,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:19,465 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:19,465 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash 578545269, now seen corresponding path program 35 times [2018-04-11 13:06:19,465 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:19,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:19,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:19,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 13:06:19,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:19,874 INFO L182 omatonBuilderFactory]: Interpolants [19478#true, 19479#false, 19480#(<= main_~i~0 0), 19481#(<= main_~i~0 1), 19482#(<= main_~i~0 2), 19483#(<= main_~i~0 3), 19484#(<= main_~i~0 4), 19485#(<= main_~i~0 5), 19486#(<= main_~i~0 6), 19487#(<= main_~i~0 7), 19488#(<= main_~i~0 8), 19489#(<= main_~i~0 9), 19490#(<= main_~i~0 10), 19491#(<= main_~i~0 11), 19492#(<= main_~i~0 12), 19493#(<= main_~i~0 13), 19494#(<= main_~i~0 14), 19495#(<= main_~i~0 15), 19496#(<= main_~i~0 16), 19497#(<= main_~i~0 17), 19498#(<= main_~i~0 18), 19499#(<= main_~i~0 19), 19500#(<= main_~i~0 20), 19501#(<= main_~i~0 21), 19502#(<= main_~i~0 22), 19503#(<= main_~i~0 23), 19504#(<= main_~i~0 24), 19505#(<= main_~i~0 25), 19506#(<= main_~i~0 26), 19507#(<= main_~i~0 27), 19508#(<= main_~i~0 28), 19509#(<= main_~i~0 29), 19510#(<= main_~i~0 30), 19511#(<= main_~i~0 31), 19512#(<= main_~i~0 32), 19513#(<= main_~i~0 33), 19514#(<= main_~i~0 34), 19515#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 19516#(and (<= 1 main_~i~0) (<= main_~i~0 35))] [2018-04-11 13:06:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:19,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 13:06:19,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 13:06:19,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 13:06:19,875 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 39 states. [2018-04-11 13:06:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:20,853 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-04-11 13:06:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 13:06:20,853 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-04-11 13:06:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:20,854 INFO L225 Difference]: With dead ends: 496 [2018-04-11 13:06:20,854 INFO L226 Difference]: Without dead ends: 496 [2018-04-11 13:06:20,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 13:06:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-04-11 13:06:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-04-11 13:06:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-11 13:06:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-04-11 13:06:20,858 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-04-11 13:06:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:20,859 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-04-11 13:06:20,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 13:06:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-04-11 13:06:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-11 13:06:20,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:20,859 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:20,860 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2010858408, now seen corresponding path program 36 times [2018-04-11 13:06:20,860 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:20,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:21,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:21,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 13:06:21,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:21,301 INFO L182 omatonBuilderFactory]: Interpolants [20544#(<= main_~i~0 1), 20545#(<= main_~i~0 2), 20546#(<= main_~i~0 3), 20547#(<= main_~i~0 4), 20548#(<= main_~i~0 5), 20549#(<= main_~i~0 6), 20550#(<= main_~i~0 7), 20551#(<= main_~i~0 8), 20552#(<= main_~i~0 9), 20553#(<= main_~i~0 10), 20554#(<= main_~i~0 11), 20555#(<= main_~i~0 12), 20556#(<= main_~i~0 13), 20557#(<= main_~i~0 14), 20558#(<= main_~i~0 15), 20559#(<= main_~i~0 16), 20560#(<= main_~i~0 17), 20561#(<= main_~i~0 18), 20562#(<= main_~i~0 19), 20563#(<= main_~i~0 20), 20564#(<= main_~i~0 21), 20565#(<= main_~i~0 22), 20566#(<= main_~i~0 23), 20567#(<= main_~i~0 24), 20568#(<= main_~i~0 25), 20569#(<= main_~i~0 26), 20570#(<= main_~i~0 27), 20571#(<= main_~i~0 28), 20572#(<= main_~i~0 29), 20573#(<= main_~i~0 30), 20574#(<= main_~i~0 31), 20575#(<= main_~i~0 32), 20576#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 20577#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 20578#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 20579#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 20580#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 20541#true, 20542#false, 20543#(<= main_~i~0 0)] [2018-04-11 13:06:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:21,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 13:06:21,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 13:06:21,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:06:21,302 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 40 states. [2018-04-11 13:06:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:22,490 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-04-11 13:06:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 13:06:22,490 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 187 [2018-04-11 13:06:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:22,491 INFO L225 Difference]: With dead ends: 509 [2018-04-11 13:06:22,491 INFO L226 Difference]: Without dead ends: 509 [2018-04-11 13:06:22,492 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 13:06:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-11 13:06:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-04-11 13:06:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-04-11 13:06:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-04-11 13:06:22,495 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-04-11 13:06:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:22,495 INFO L459 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-04-11 13:06:22,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 13:06:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-04-11 13:06:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-11 13:06:22,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:22,497 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:22,497 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1349177771, now seen corresponding path program 37 times [2018-04-11 13:06:22,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:22,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:22,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:22,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-11 13:06:22,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:22,933 INFO L182 omatonBuilderFactory]: Interpolants [21632#true, 21633#false, 21634#(<= main_~i~0 0), 21635#(<= main_~i~0 1), 21636#(<= main_~i~0 2), 21637#(<= main_~i~0 3), 21638#(<= main_~i~0 4), 21639#(<= main_~i~0 5), 21640#(<= main_~i~0 6), 21641#(<= main_~i~0 7), 21642#(<= main_~i~0 8), 21643#(<= main_~i~0 9), 21644#(<= main_~i~0 10), 21645#(<= main_~i~0 11), 21646#(<= main_~i~0 12), 21647#(<= main_~i~0 13), 21648#(<= main_~i~0 14), 21649#(<= main_~i~0 15), 21650#(<= main_~i~0 16), 21651#(<= main_~i~0 17), 21652#(<= main_~i~0 18), 21653#(<= main_~i~0 19), 21654#(<= main_~i~0 20), 21655#(<= main_~i~0 21), 21656#(<= main_~i~0 22), 21657#(<= main_~i~0 23), 21658#(<= main_~i~0 24), 21659#(<= main_~i~0 25), 21660#(<= main_~i~0 26), 21661#(<= main_~i~0 27), 21662#(<= main_~i~0 28), 21663#(<= main_~i~0 29), 21664#(<= main_~i~0 30), 21665#(<= main_~i~0 31), 21666#(<= main_~i~0 32), 21667#(<= main_~i~0 33), 21668#(<= main_~i~0 34), 21669#(<= main_~i~0 35), 21670#(<= main_~i~0 36), 21671#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 21672#(and (<= 1 main_~i~0) (<= main_~i~0 37))] [2018-04-11 13:06:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:22,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 13:06:22,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 13:06:22,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 13:06:22,933 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-04-11 13:06:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:23,956 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-04-11 13:06:23,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 13:06:23,956 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-11 13:06:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:23,957 INFO L225 Difference]: With dead ends: 522 [2018-04-11 13:06:23,957 INFO L226 Difference]: Without dead ends: 522 [2018-04-11 13:06:23,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 13:06:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-04-11 13:06:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-04-11 13:06:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-11 13:06:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-04-11 13:06:23,961 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-04-11 13:06:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:23,961 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-04-11 13:06:23,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 13:06:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-04-11 13:06:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-11 13:06:23,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:23,963 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:23,963 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -659298360, now seen corresponding path program 38 times [2018-04-11 13:06:23,964 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:23,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:24,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:24,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-11 13:06:24,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:24,421 INFO L182 omatonBuilderFactory]: Interpolants [22784#(<= main_~i~0 31), 22785#(<= main_~i~0 32), 22786#(<= main_~i~0 33), 22787#(<= main_~i~0 34), 22788#(<= main_~i~0 35), 22789#(<= main_~i~0 36), 22790#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 22791#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 22792#(and (<= 2 main_~i~0) (<= main_~i~0 38)), 22751#true, 22752#false, 22753#(<= main_~i~0 0), 22754#(<= main_~i~0 1), 22755#(<= main_~i~0 2), 22756#(<= main_~i~0 3), 22757#(<= main_~i~0 4), 22758#(<= main_~i~0 5), 22759#(<= main_~i~0 6), 22760#(<= main_~i~0 7), 22761#(<= main_~i~0 8), 22762#(<= main_~i~0 9), 22763#(<= main_~i~0 10), 22764#(<= main_~i~0 11), 22765#(<= main_~i~0 12), 22766#(<= main_~i~0 13), 22767#(<= main_~i~0 14), 22768#(<= main_~i~0 15), 22769#(<= main_~i~0 16), 22770#(<= main_~i~0 17), 22771#(<= main_~i~0 18), 22772#(<= main_~i~0 19), 22773#(<= main_~i~0 20), 22774#(<= main_~i~0 21), 22775#(<= main_~i~0 22), 22776#(<= main_~i~0 23), 22777#(<= main_~i~0 24), 22778#(<= main_~i~0 25), 22779#(<= main_~i~0 26), 22780#(<= main_~i~0 27), 22781#(<= main_~i~0 28), 22782#(<= main_~i~0 29), 22783#(<= main_~i~0 30)] [2018-04-11 13:06:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:24,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 13:06:24,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 13:06:24,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 13:06:24,422 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-04-11 13:06:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:25,536 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-04-11 13:06:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 13:06:25,536 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-11 13:06:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:25,537 INFO L225 Difference]: With dead ends: 535 [2018-04-11 13:06:25,538 INFO L226 Difference]: Without dead ends: 535 [2018-04-11 13:06:25,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 13:06:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-11 13:06:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-04-11 13:06:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-04-11 13:06:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-04-11 13:06:25,544 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-04-11 13:06:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:25,544 INFO L459 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-04-11 13:06:25,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 13:06:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-04-11 13:06:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-11 13:06:25,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:25,546 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:25,546 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash 656285237, now seen corresponding path program 39 times [2018-04-11 13:06:25,547 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:25,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:26,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:26,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-11 13:06:26,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:26,004 INFO L182 omatonBuilderFactory]: Interpolants [23936#(<= main_~i~0 36), 23937#(<= main_~i~0 37), 23938#(<= main_~i~0 38), 23939#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 23940#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 23898#true, 23899#false, 23900#(<= main_~i~0 0), 23901#(<= main_~i~0 1), 23902#(<= main_~i~0 2), 23903#(<= main_~i~0 3), 23904#(<= main_~i~0 4), 23905#(<= main_~i~0 5), 23906#(<= main_~i~0 6), 23907#(<= main_~i~0 7), 23908#(<= main_~i~0 8), 23909#(<= main_~i~0 9), 23910#(<= main_~i~0 10), 23911#(<= main_~i~0 11), 23912#(<= main_~i~0 12), 23913#(<= main_~i~0 13), 23914#(<= main_~i~0 14), 23915#(<= main_~i~0 15), 23916#(<= main_~i~0 16), 23917#(<= main_~i~0 17), 23918#(<= main_~i~0 18), 23919#(<= main_~i~0 19), 23920#(<= main_~i~0 20), 23921#(<= main_~i~0 21), 23922#(<= main_~i~0 22), 23923#(<= main_~i~0 23), 23924#(<= main_~i~0 24), 23925#(<= main_~i~0 25), 23926#(<= main_~i~0 26), 23927#(<= main_~i~0 27), 23928#(<= main_~i~0 28), 23929#(<= main_~i~0 29), 23930#(<= main_~i~0 30), 23931#(<= main_~i~0 31), 23932#(<= main_~i~0 32), 23933#(<= main_~i~0 33), 23934#(<= main_~i~0 34), 23935#(<= main_~i~0 35)] [2018-04-11 13:06:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:26,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 13:06:26,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 13:06:26,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 13:06:26,005 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-04-11 13:06:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:27,152 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-04-11 13:06:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 13:06:27,152 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-11 13:06:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:27,153 INFO L225 Difference]: With dead ends: 548 [2018-04-11 13:06:27,153 INFO L226 Difference]: Without dead ends: 548 [2018-04-11 13:06:27,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-04-11 13:06:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-11 13:06:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-04-11 13:06:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-11 13:06:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-04-11 13:06:27,157 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-04-11 13:06:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:27,157 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-04-11 13:06:27,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 13:06:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-04-11 13:06:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-11 13:06:27,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:27,158 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:27,158 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash 715514856, now seen corresponding path program 40 times [2018-04-11 13:06:27,159 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:27,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:27,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:27,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-11 13:06:27,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:27,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-11 13:06:27,856 INFO L182 omatonBuilderFactory]: Interpolants [25088#(<= main_~i~0 13), 25089#(<= main_~i~0 14), 25090#(<= main_~i~0 15), 25091#(<= main_~i~0 16), 25092#(<= main_~i~0 17), 25093#(<= main_~i~0 18), 25094#(<= main_~i~0 19), 25095#(<= main_~i~0 20), 25096#(<= main_~i~0 21), 25097#(<= main_~i~0 22), 25098#(<= main_~i~0 23), 25099#(<= main_~i~0 24), 25100#(<= main_~i~0 25), 25101#(<= main_~i~0 26), 25102#(<= main_~i~0 27), 25103#(<= main_~i~0 28), 25104#(<= main_~i~0 29), 25105#(<= main_~i~0 30), 25106#(<= main_~i~0 31), 25107#(<= main_~i~0 32), 25108#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 25109#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 25110#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 25111#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 25112#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 25113#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 25114#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 25115#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 25116#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 25073#true, 25074#false, 25075#(<= main_~i~0 0), 25076#(<= main_~i~0 1), 25077#(<= main_~i~0 2), 25078#(<= main_~i~0 3), 25079#(<= main_~i~0 4), 25080#(<= main_~i~0 5), 25081#(<= main_~i~0 6), 25082#(<= main_~i~0 7), 25083#(<= main_~i~0 8), 25084#(<= main_~i~0 9), 25085#(<= main_~i~0 10), 25086#(<= main_~i~0 11), 25087#(<= main_~i~0 12)] [2018-04-11 13:06:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:27,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 13:06:27,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 13:06:27,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 13:06:27,857 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-04-11 13:06:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:29,519 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-04-11 13:06:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 13:06:29,520 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-11 13:06:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:29,521 INFO L225 Difference]: With dead ends: 561 [2018-04-11 13:06:29,521 INFO L226 Difference]: Without dead ends: 561 [2018-04-11 13:06:29,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-04-11 13:06:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-11 13:06:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-04-11 13:06:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-11 13:06:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-04-11 13:06:29,527 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-04-11 13:06:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:29,527 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-04-11 13:06:29,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 13:06:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-04-11 13:06:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-11 13:06:29,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:29,528 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:29,528 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1616595435, now seen corresponding path program 41 times [2018-04-11 13:06:29,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:29,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:30,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:30,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 13:06:30,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:30,065 INFO L182 omatonBuilderFactory]: Interpolants [26304#(<= main_~i~0 26), 26305#(<= main_~i~0 27), 26306#(<= main_~i~0 28), 26307#(<= main_~i~0 29), 26308#(<= main_~i~0 30), 26309#(<= main_~i~0 31), 26310#(<= main_~i~0 32), 26311#(<= main_~i~0 33), 26312#(<= main_~i~0 34), 26313#(<= main_~i~0 35), 26314#(<= main_~i~0 36), 26315#(<= main_~i~0 37), 26316#(<= main_~i~0 38), 26317#(<= main_~i~0 39), 26318#(<= main_~i~0 40), 26319#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 26320#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 26276#true, 26277#false, 26278#(<= main_~i~0 0), 26279#(<= main_~i~0 1), 26280#(<= main_~i~0 2), 26281#(<= main_~i~0 3), 26282#(<= main_~i~0 4), 26283#(<= main_~i~0 5), 26284#(<= main_~i~0 6), 26285#(<= main_~i~0 7), 26286#(<= main_~i~0 8), 26287#(<= main_~i~0 9), 26288#(<= main_~i~0 10), 26289#(<= main_~i~0 11), 26290#(<= main_~i~0 12), 26291#(<= main_~i~0 13), 26292#(<= main_~i~0 14), 26293#(<= main_~i~0 15), 26294#(<= main_~i~0 16), 26295#(<= main_~i~0 17), 26296#(<= main_~i~0 18), 26297#(<= main_~i~0 19), 26298#(<= main_~i~0 20), 26299#(<= main_~i~0 21), 26300#(<= main_~i~0 22), 26301#(<= main_~i~0 23), 26302#(<= main_~i~0 24), 26303#(<= main_~i~0 25)] [2018-04-11 13:06:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:30,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 13:06:30,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 13:06:30,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 13:06:30,066 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 45 states. [2018-04-11 13:06:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:31,223 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-04-11 13:06:31,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 13:06:31,223 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-04-11 13:06:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:31,224 INFO L225 Difference]: With dead ends: 574 [2018-04-11 13:06:31,225 INFO L226 Difference]: Without dead ends: 574 [2018-04-11 13:06:31,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 13:06:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-11 13:06:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-04-11 13:06:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-04-11 13:06:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-04-11 13:06:31,230 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-04-11 13:06:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:31,231 INFO L459 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-04-11 13:06:31,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 13:06:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-04-11 13:06:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-11 13:06:31,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:31,232 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:31,232 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1071855624, now seen corresponding path program 42 times [2018-04-11 13:06:31,233 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:31,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:31,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:31,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-11 13:06:31,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:31,764 INFO L182 omatonBuilderFactory]: Interpolants [27520#(<= main_~i~0 11), 27521#(<= main_~i~0 12), 27522#(<= main_~i~0 13), 27523#(<= main_~i~0 14), 27524#(<= main_~i~0 15), 27525#(<= main_~i~0 16), 27526#(<= main_~i~0 17), 27527#(<= main_~i~0 18), 27528#(<= main_~i~0 19), 27529#(<= main_~i~0 20), 27530#(<= main_~i~0 21), 27531#(<= main_~i~0 22), 27532#(<= main_~i~0 23), 27533#(<= main_~i~0 24), 27534#(<= main_~i~0 25), 27535#(<= main_~i~0 26), 27536#(<= main_~i~0 27), 27537#(<= main_~i~0 28), 27538#(<= main_~i~0 29), 27539#(<= main_~i~0 30), 27540#(<= main_~i~0 31), 27541#(<= main_~i~0 32), 27542#(<= main_~i~0 33), 27543#(<= main_~i~0 34), 27544#(<= main_~i~0 35), 27545#(<= main_~i~0 36), 27546#(<= main_~i~0 37), 27547#(<= main_~i~0 38), 27548#(<= main_~i~0 39), 27549#(<= main_~i~0 40), 27550#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 27551#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 27552#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 27507#true, 27508#false, 27509#(<= main_~i~0 0), 27510#(<= main_~i~0 1), 27511#(<= main_~i~0 2), 27512#(<= main_~i~0 3), 27513#(<= main_~i~0 4), 27514#(<= main_~i~0 5), 27515#(<= main_~i~0 6), 27516#(<= main_~i~0 7), 27517#(<= main_~i~0 8), 27518#(<= main_~i~0 9), 27519#(<= main_~i~0 10)] [2018-04-11 13:06:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:31,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-11 13:06:31,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-11 13:06:31,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 13:06:31,765 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 46 states. [2018-04-11 13:06:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:33,106 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-04-11 13:06:33,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 13:06:33,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 217 [2018-04-11 13:06:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:33,108 INFO L225 Difference]: With dead ends: 587 [2018-04-11 13:06:33,108 INFO L226 Difference]: Without dead ends: 587 [2018-04-11 13:06:33,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2018-04-11 13:06:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-04-11 13:06:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-04-11 13:06:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-04-11 13:06:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-04-11 13:06:33,114 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-04-11 13:06:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:33,114 INFO L459 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-04-11 13:06:33,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-11 13:06:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-04-11 13:06:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-11 13:06:33,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:33,116 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:33,116 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:33,116 INFO L82 PathProgramCache]: Analyzing trace with hash -701041163, now seen corresponding path program 43 times [2018-04-11 13:06:33,116 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:33,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:33,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:33,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-11 13:06:33,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:33,688 INFO L182 omatonBuilderFactory]: Interpolants [28800#(<= main_~i~0 32), 28801#(<= main_~i~0 33), 28802#(<= main_~i~0 34), 28803#(<= main_~i~0 35), 28804#(<= main_~i~0 36), 28805#(<= main_~i~0 37), 28806#(<= main_~i~0 38), 28807#(<= main_~i~0 39), 28808#(<= main_~i~0 40), 28809#(<= main_~i~0 41), 28810#(<= main_~i~0 42), 28811#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 28812#(and (<= 1 main_~i~0) (<= main_~i~0 43)), 28766#true, 28767#false, 28768#(<= main_~i~0 0), 28769#(<= main_~i~0 1), 28770#(<= main_~i~0 2), 28771#(<= main_~i~0 3), 28772#(<= main_~i~0 4), 28773#(<= main_~i~0 5), 28774#(<= main_~i~0 6), 28775#(<= main_~i~0 7), 28776#(<= main_~i~0 8), 28777#(<= main_~i~0 9), 28778#(<= main_~i~0 10), 28779#(<= main_~i~0 11), 28780#(<= main_~i~0 12), 28781#(<= main_~i~0 13), 28782#(<= main_~i~0 14), 28783#(<= main_~i~0 15), 28784#(<= main_~i~0 16), 28785#(<= main_~i~0 17), 28786#(<= main_~i~0 18), 28787#(<= main_~i~0 19), 28788#(<= main_~i~0 20), 28789#(<= main_~i~0 21), 28790#(<= main_~i~0 22), 28791#(<= main_~i~0 23), 28792#(<= main_~i~0 24), 28793#(<= main_~i~0 25), 28794#(<= main_~i~0 26), 28795#(<= main_~i~0 27), 28796#(<= main_~i~0 28), 28797#(<= main_~i~0 29), 28798#(<= main_~i~0 30), 28799#(<= main_~i~0 31)] [2018-04-11 13:06:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:33,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 13:06:33,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 13:06:33,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 13:06:33,689 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-04-11 13:06:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:34,917 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-04-11 13:06:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 13:06:34,918 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-11 13:06:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:34,920 INFO L225 Difference]: With dead ends: 600 [2018-04-11 13:06:34,920 INFO L226 Difference]: Without dead ends: 600 [2018-04-11 13:06:34,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 13:06:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-04-11 13:06:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-04-11 13:06:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-11 13:06:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-04-11 13:06:34,928 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-04-11 13:06:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:34,930 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-04-11 13:06:34,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 13:06:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-04-11 13:06:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-11 13:06:34,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:34,932 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:34,932 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1411245096, now seen corresponding path program 44 times [2018-04-11 13:06:34,932 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:34,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:35,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:35,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-11 13:06:35,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:35,573 INFO L182 omatonBuilderFactory]: Interpolants [30080#(<= main_~i~0 25), 30081#(<= main_~i~0 26), 30082#(<= main_~i~0 27), 30083#(<= main_~i~0 28), 30084#(<= main_~i~0 29), 30085#(<= main_~i~0 30), 30086#(<= main_~i~0 31), 30087#(<= main_~i~0 32), 30088#(<= main_~i~0 33), 30089#(<= main_~i~0 34), 30090#(<= main_~i~0 35), 30091#(<= main_~i~0 36), 30092#(<= main_~i~0 37), 30093#(<= main_~i~0 38), 30094#(<= main_~i~0 39), 30095#(<= main_~i~0 40), 30096#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 30097#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 30098#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 30099#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 30100#(and (<= main_~i~0 44) (<= 4 main_~i~0)), 30053#true, 30054#false, 30055#(<= main_~i~0 0), 30056#(<= main_~i~0 1), 30057#(<= main_~i~0 2), 30058#(<= main_~i~0 3), 30059#(<= main_~i~0 4), 30060#(<= main_~i~0 5), 30061#(<= main_~i~0 6), 30062#(<= main_~i~0 7), 30063#(<= main_~i~0 8), 30064#(<= main_~i~0 9), 30065#(<= main_~i~0 10), 30066#(<= main_~i~0 11), 30067#(<= main_~i~0 12), 30068#(<= main_~i~0 13), 30069#(<= main_~i~0 14), 30070#(<= main_~i~0 15), 30071#(<= main_~i~0 16), 30072#(<= main_~i~0 17), 30073#(<= main_~i~0 18), 30074#(<= main_~i~0 19), 30075#(<= main_~i~0 20), 30076#(<= main_~i~0 21), 30077#(<= main_~i~0 22), 30078#(<= main_~i~0 23), 30079#(<= main_~i~0 24)] [2018-04-11 13:06:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:35,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 13:06:35,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 13:06:35,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 13:06:35,574 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 48 states. [2018-04-11 13:06:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:37,016 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-04-11 13:06:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 13:06:37,016 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-04-11 13:06:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:37,017 INFO L225 Difference]: With dead ends: 613 [2018-04-11 13:06:37,017 INFO L226 Difference]: Without dead ends: 613 [2018-04-11 13:06:37,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 13:06:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-11 13:06:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-04-11 13:06:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-04-11 13:06:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-04-11 13:06:37,021 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-04-11 13:06:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:37,021 INFO L459 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-04-11 13:06:37,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 13:06:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-04-11 13:06:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-11 13:06:37,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:37,022 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:37,022 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash 241360341, now seen corresponding path program 45 times [2018-04-11 13:06:37,022 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:37,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:37,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:37,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-11 13:06:37,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:37,664 INFO L182 omatonBuilderFactory]: Interpolants [31368#true, 31369#false, 31370#(<= main_~i~0 0), 31371#(<= main_~i~0 1), 31372#(<= main_~i~0 2), 31373#(<= main_~i~0 3), 31374#(<= main_~i~0 4), 31375#(<= main_~i~0 5), 31376#(<= main_~i~0 6), 31377#(<= main_~i~0 7), 31378#(<= main_~i~0 8), 31379#(<= main_~i~0 9), 31380#(<= main_~i~0 10), 31381#(<= main_~i~0 11), 31382#(<= main_~i~0 12), 31383#(<= main_~i~0 13), 31384#(<= main_~i~0 14), 31385#(<= main_~i~0 15), 31386#(<= main_~i~0 16), 31387#(<= main_~i~0 17), 31388#(<= main_~i~0 18), 31389#(<= main_~i~0 19), 31390#(<= main_~i~0 20), 31391#(<= main_~i~0 21), 31392#(<= main_~i~0 22), 31393#(<= main_~i~0 23), 31394#(<= main_~i~0 24), 31395#(<= main_~i~0 25), 31396#(<= main_~i~0 26), 31397#(<= main_~i~0 27), 31398#(<= main_~i~0 28), 31399#(<= main_~i~0 29), 31400#(<= main_~i~0 30), 31401#(<= main_~i~0 31), 31402#(<= main_~i~0 32), 31403#(<= main_~i~0 33), 31404#(<= main_~i~0 34), 31405#(<= main_~i~0 35), 31406#(<= main_~i~0 36), 31407#(<= main_~i~0 37), 31408#(<= main_~i~0 38), 31409#(<= main_~i~0 39), 31410#(<= main_~i~0 40), 31411#(<= main_~i~0 41), 31412#(<= main_~i~0 42), 31413#(<= main_~i~0 43), 31414#(<= main_~i~0 44), 31415#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 31416#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-04-11 13:06:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:37,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 13:06:37,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 13:06:37,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 13:06:37,665 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-04-11 13:06:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:39,126 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-04-11 13:06:39,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 13:06:39,126 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-11 13:06:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:39,127 INFO L225 Difference]: With dead ends: 626 [2018-04-11 13:06:39,128 INFO L226 Difference]: Without dead ends: 626 [2018-04-11 13:06:39,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-11 13:06:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-11 13:06:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-04-11 13:06:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-04-11 13:06:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-04-11 13:06:39,132 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-04-11 13:06:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:39,132 INFO L459 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-04-11 13:06:39,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 13:06:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-04-11 13:06:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-11 13:06:39,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:39,133 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:39,133 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:39,133 INFO L82 PathProgramCache]: Analyzing trace with hash 747104328, now seen corresponding path program 46 times [2018-04-11 13:06:39,133 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:39,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:39,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:39,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-11 13:06:39,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:39,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-11 13:06:39,762 INFO L182 omatonBuilderFactory]: Interpolants [32711#true, 32712#false, 32713#(<= main_~i~0 0), 32714#(<= main_~i~0 1), 32715#(<= main_~i~0 2), 32716#(<= main_~i~0 3), 32717#(<= main_~i~0 4), 32718#(<= main_~i~0 5), 32719#(<= main_~i~0 6), 32720#(<= main_~i~0 7), 32721#(<= main_~i~0 8), 32722#(<= main_~i~0 9), 32723#(<= main_~i~0 10), 32724#(<= main_~i~0 11), 32725#(<= main_~i~0 12), 32726#(<= main_~i~0 13), 32727#(<= main_~i~0 14), 32728#(<= main_~i~0 15), 32729#(<= main_~i~0 16), 32730#(<= main_~i~0 17), 32731#(<= main_~i~0 18), 32732#(<= main_~i~0 19), 32733#(<= main_~i~0 20), 32734#(<= main_~i~0 21), 32735#(<= main_~i~0 22), 32736#(<= main_~i~0 23), 32737#(<= main_~i~0 24), 32738#(<= main_~i~0 25), 32739#(<= main_~i~0 26), 32740#(<= main_~i~0 27), 32741#(<= main_~i~0 28), 32742#(<= main_~i~0 29), 32743#(<= main_~i~0 30), 32744#(<= main_~i~0 31), 32745#(<= main_~i~0 32), 32746#(<= main_~i~0 33), 32747#(<= main_~i~0 34), 32748#(<= main_~i~0 35), 32749#(<= main_~i~0 36), 32750#(<= main_~i~0 37), 32751#(<= main_~i~0 38), 32752#(<= main_~i~0 39), 32753#(<= main_~i~0 40), 32754#(<= main_~i~0 41), 32755#(<= main_~i~0 42), 32756#(<= main_~i~0 43), 32757#(<= main_~i~0 44), 32758#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 32759#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 32760#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-04-11 13:06:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:39,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 13:06:39,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 13:06:39,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 13:06:39,763 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-04-11 13:06:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:41,344 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-04-11 13:06:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 13:06:41,344 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-11 13:06:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:41,345 INFO L225 Difference]: With dead ends: 639 [2018-04-11 13:06:41,345 INFO L226 Difference]: Without dead ends: 639 [2018-04-11 13:06:41,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 13:06:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-04-11 13:06:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-04-11 13:06:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-11 13:06:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-04-11 13:06:41,349 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-04-11 13:06:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:41,349 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-04-11 13:06:41,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 13:06:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-04-11 13:06:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-11 13:06:41,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:41,350 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:41,350 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash -231313995, now seen corresponding path program 47 times [2018-04-11 13:06:41,351 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:41,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:41,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:41,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-11 13:06:41,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:42,000 INFO L182 omatonBuilderFactory]: Interpolants [34082#true, 34083#false, 34084#(<= main_~i~0 0), 34085#(<= main_~i~0 1), 34086#(<= main_~i~0 2), 34087#(<= main_~i~0 3), 34088#(<= main_~i~0 4), 34089#(<= main_~i~0 5), 34090#(<= main_~i~0 6), 34091#(<= main_~i~0 7), 34092#(<= main_~i~0 8), 34093#(<= main_~i~0 9), 34094#(<= main_~i~0 10), 34095#(<= main_~i~0 11), 34096#(<= main_~i~0 12), 34097#(<= main_~i~0 13), 34098#(<= main_~i~0 14), 34099#(<= main_~i~0 15), 34100#(<= main_~i~0 16), 34101#(<= main_~i~0 17), 34102#(<= main_~i~0 18), 34103#(<= main_~i~0 19), 34104#(<= main_~i~0 20), 34105#(<= main_~i~0 21), 34106#(<= main_~i~0 22), 34107#(<= main_~i~0 23), 34108#(<= main_~i~0 24), 34109#(<= main_~i~0 25), 34110#(<= main_~i~0 26), 34111#(<= main_~i~0 27), 34112#(<= main_~i~0 28), 34113#(<= main_~i~0 29), 34114#(<= main_~i~0 30), 34115#(<= main_~i~0 31), 34116#(<= main_~i~0 32), 34117#(<= main_~i~0 33), 34118#(<= main_~i~0 34), 34119#(<= main_~i~0 35), 34120#(<= main_~i~0 36), 34121#(<= main_~i~0 37), 34122#(<= main_~i~0 38), 34123#(<= main_~i~0 39), 34124#(<= main_~i~0 40), 34125#(<= main_~i~0 41), 34126#(<= main_~i~0 42), 34127#(<= main_~i~0 43), 34128#(<= main_~i~0 44), 34129#(<= main_~i~0 45), 34130#(<= main_~i~0 46), 34131#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 34132#(and (<= 1 main_~i~0) (<= main_~i~0 47))] [2018-04-11 13:06:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:42,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 13:06:42,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 13:06:42,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 13:06:42,001 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 51 states. [2018-04-11 13:06:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:43,543 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-04-11 13:06:43,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 13:06:43,543 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-04-11 13:06:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:43,544 INFO L225 Difference]: With dead ends: 652 [2018-04-11 13:06:43,544 INFO L226 Difference]: Without dead ends: 652 [2018-04-11 13:06:43,545 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 13:06:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-04-11 13:06:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 602. [2018-04-11 13:06:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-11 13:06:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 698 transitions. [2018-04-11 13:06:43,549 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 698 transitions. Word has length 242 [2018-04-11 13:06:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:43,549 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 698 transitions. [2018-04-11 13:06:43,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 13:06:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 698 transitions. [2018-04-11 13:06:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-11 13:06:43,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:43,550 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:43,550 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash 936592488, now seen corresponding path program 48 times [2018-04-11 13:06:43,551 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:43,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:44,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:44,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-11 13:06:44,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:44,227 INFO L182 omatonBuilderFactory]: Interpolants [35481#true, 35482#false, 35483#(<= main_~i~0 0), 35484#(<= main_~i~0 1), 35485#(<= main_~i~0 2), 35486#(<= main_~i~0 3), 35487#(<= main_~i~0 4), 35488#(<= main_~i~0 5), 35489#(<= main_~i~0 6), 35490#(<= main_~i~0 7), 35491#(<= main_~i~0 8), 35492#(<= main_~i~0 9), 35493#(<= main_~i~0 10), 35494#(<= main_~i~0 11), 35495#(<= main_~i~0 12), 35496#(<= main_~i~0 13), 35497#(<= main_~i~0 14), 35498#(<= main_~i~0 15), 35499#(<= main_~i~0 16), 35500#(<= main_~i~0 17), 35501#(<= main_~i~0 18), 35502#(<= main_~i~0 19), 35503#(<= main_~i~0 20), 35504#(<= main_~i~0 21), 35505#(<= main_~i~0 22), 35506#(<= main_~i~0 23), 35507#(<= main_~i~0 24), 35508#(<= main_~i~0 25), 35509#(<= main_~i~0 26), 35510#(<= main_~i~0 27), 35511#(<= main_~i~0 28), 35512#(<= main_~i~0 29), 35513#(<= main_~i~0 30), 35514#(<= main_~i~0 31), 35515#(<= main_~i~0 32), 35516#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 35517#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 35518#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 35519#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 35520#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 35521#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 35522#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 35523#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 35524#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 35525#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 35526#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 35527#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 35528#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 35529#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 35530#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 35531#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 35532#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-04-11 13:06:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:44,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 13:06:44,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 13:06:44,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 13:06:44,227 INFO L87 Difference]: Start difference. First operand 602 states and 698 transitions. Second operand 52 states. [2018-04-11 13:06:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:47,419 INFO L93 Difference]: Finished difference Result 665 states and 764 transitions. [2018-04-11 13:06:47,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 13:06:47,419 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 247 [2018-04-11 13:06:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:47,421 INFO L225 Difference]: With dead ends: 665 [2018-04-11 13:06:47,421 INFO L226 Difference]: Without dead ends: 665 [2018-04-11 13:06:47,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-04-11 13:06:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-11 13:06:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 614. [2018-04-11 13:06:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-04-11 13:06:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 712 transitions. [2018-04-11 13:06:47,425 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 712 transitions. Word has length 247 [2018-04-11 13:06:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:47,425 INFO L459 AbstractCegarLoop]: Abstraction has 614 states and 712 transitions. [2018-04-11 13:06:47,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 13:06:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 712 transitions. [2018-04-11 13:06:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-11 13:06:47,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:47,426 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:47,426 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1916773781, now seen corresponding path program 49 times [2018-04-11 13:06:47,427 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:47,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:48,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:48,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-11 13:06:48,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:48,250 INFO L182 omatonBuilderFactory]: Interpolants [36908#true, 36909#false, 36910#(<= main_~i~0 0), 36911#(<= main_~i~0 1), 36912#(<= main_~i~0 2), 36913#(<= main_~i~0 3), 36914#(<= main_~i~0 4), 36915#(<= main_~i~0 5), 36916#(<= main_~i~0 6), 36917#(<= main_~i~0 7), 36918#(<= main_~i~0 8), 36919#(<= main_~i~0 9), 36920#(<= main_~i~0 10), 36921#(<= main_~i~0 11), 36922#(<= main_~i~0 12), 36923#(<= main_~i~0 13), 36924#(<= main_~i~0 14), 36925#(<= main_~i~0 15), 36926#(<= main_~i~0 16), 36927#(<= main_~i~0 17), 36928#(<= main_~i~0 18), 36929#(<= main_~i~0 19), 36930#(<= main_~i~0 20), 36931#(<= main_~i~0 21), 36932#(<= main_~i~0 22), 36933#(<= main_~i~0 23), 36934#(<= main_~i~0 24), 36935#(<= main_~i~0 25), 36936#(<= main_~i~0 26), 36937#(<= main_~i~0 27), 36938#(<= main_~i~0 28), 36939#(<= main_~i~0 29), 36940#(<= main_~i~0 30), 36941#(<= main_~i~0 31), 36942#(<= main_~i~0 32), 36943#(<= main_~i~0 33), 36944#(<= main_~i~0 34), 36945#(<= main_~i~0 35), 36946#(<= main_~i~0 36), 36947#(<= main_~i~0 37), 36948#(<= main_~i~0 38), 36949#(<= main_~i~0 39), 36950#(<= main_~i~0 40), 36951#(<= main_~i~0 41), 36952#(<= main_~i~0 42), 36953#(<= main_~i~0 43), 36954#(<= main_~i~0 44), 36955#(<= main_~i~0 45), 36956#(<= main_~i~0 46), 36957#(<= main_~i~0 47), 36958#(<= main_~i~0 48), 36959#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 36960#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-04-11 13:06:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:48,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 13:06:48,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 13:06:48,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 13:06:48,251 INFO L87 Difference]: Start difference. First operand 614 states and 712 transitions. Second operand 53 states. [2018-04-11 13:06:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:49,928 INFO L93 Difference]: Finished difference Result 678 states and 779 transitions. [2018-04-11 13:06:49,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 13:06:49,928 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-11 13:06:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:49,930 INFO L225 Difference]: With dead ends: 678 [2018-04-11 13:06:49,930 INFO L226 Difference]: Without dead ends: 678 [2018-04-11 13:06:49,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-04-11 13:06:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-04-11 13:06:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2018-04-11 13:06:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-04-11 13:06:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2018-04-11 13:06:49,934 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 252 [2018-04-11 13:06:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:49,934 INFO L459 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2018-04-11 13:06:49,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 13:06:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2018-04-11 13:06:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-11 13:06:49,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:49,935 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:49,936 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:49,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1372456824, now seen corresponding path program 50 times [2018-04-11 13:06:49,936 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:49,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:50,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:50,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-11 13:06:50,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:50,720 INFO L182 omatonBuilderFactory]: Interpolants [38400#(<= main_~i~0 35), 38401#(<= main_~i~0 36), 38402#(<= main_~i~0 37), 38403#(<= main_~i~0 38), 38404#(<= main_~i~0 39), 38405#(<= main_~i~0 40), 38406#(<= main_~i~0 41), 38407#(<= main_~i~0 42), 38408#(<= main_~i~0 43), 38409#(<= main_~i~0 44), 38410#(<= main_~i~0 45), 38411#(<= main_~i~0 46), 38412#(<= main_~i~0 47), 38413#(<= main_~i~0 48), 38414#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 38415#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 38416#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 38363#true, 38364#false, 38365#(<= main_~i~0 0), 38366#(<= main_~i~0 1), 38367#(<= main_~i~0 2), 38368#(<= main_~i~0 3), 38369#(<= main_~i~0 4), 38370#(<= main_~i~0 5), 38371#(<= main_~i~0 6), 38372#(<= main_~i~0 7), 38373#(<= main_~i~0 8), 38374#(<= main_~i~0 9), 38375#(<= main_~i~0 10), 38376#(<= main_~i~0 11), 38377#(<= main_~i~0 12), 38378#(<= main_~i~0 13), 38379#(<= main_~i~0 14), 38380#(<= main_~i~0 15), 38381#(<= main_~i~0 16), 38382#(<= main_~i~0 17), 38383#(<= main_~i~0 18), 38384#(<= main_~i~0 19), 38385#(<= main_~i~0 20), 38386#(<= main_~i~0 21), 38387#(<= main_~i~0 22), 38388#(<= main_~i~0 23), 38389#(<= main_~i~0 24), 38390#(<= main_~i~0 25), 38391#(<= main_~i~0 26), 38392#(<= main_~i~0 27), 38393#(<= main_~i~0 28), 38394#(<= main_~i~0 29), 38395#(<= main_~i~0 30), 38396#(<= main_~i~0 31), 38397#(<= main_~i~0 32), 38398#(<= main_~i~0 33), 38399#(<= main_~i~0 34)] [2018-04-11 13:06:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:50,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 13:06:50,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 13:06:50,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 13:06:50,721 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 54 states. [2018-04-11 13:06:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:52,384 INFO L93 Difference]: Finished difference Result 691 states and 794 transitions. [2018-04-11 13:06:52,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 13:06:52,384 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 257 [2018-04-11 13:06:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:52,385 INFO L225 Difference]: With dead ends: 691 [2018-04-11 13:06:52,385 INFO L226 Difference]: Without dead ends: 691 [2018-04-11 13:06:52,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-04-11 13:06:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-04-11 13:06:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 638. [2018-04-11 13:06:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-11 13:06:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 740 transitions. [2018-04-11 13:06:52,390 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 740 transitions. Word has length 257 [2018-04-11 13:06:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:52,390 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 740 transitions. [2018-04-11 13:06:52,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 13:06:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 740 transitions. [2018-04-11 13:06:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-11 13:06:52,391 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:52,391 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:52,391 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1517517451, now seen corresponding path program 51 times [2018-04-11 13:06:52,391 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:52,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:53,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:53,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-11 13:06:53,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:53,150 INFO L182 omatonBuilderFactory]: Interpolants [39846#true, 39847#false, 39848#(<= main_~i~0 0), 39849#(<= main_~i~0 1), 39850#(<= main_~i~0 2), 39851#(<= main_~i~0 3), 39852#(<= main_~i~0 4), 39853#(<= main_~i~0 5), 39854#(<= main_~i~0 6), 39855#(<= main_~i~0 7), 39856#(<= main_~i~0 8), 39857#(<= main_~i~0 9), 39858#(<= main_~i~0 10), 39859#(<= main_~i~0 11), 39860#(<= main_~i~0 12), 39861#(<= main_~i~0 13), 39862#(<= main_~i~0 14), 39863#(<= main_~i~0 15), 39864#(<= main_~i~0 16), 39865#(<= main_~i~0 17), 39866#(<= main_~i~0 18), 39867#(<= main_~i~0 19), 39868#(<= main_~i~0 20), 39869#(<= main_~i~0 21), 39870#(<= main_~i~0 22), 39871#(<= main_~i~0 23), 39872#(<= main_~i~0 24), 39873#(<= main_~i~0 25), 39874#(<= main_~i~0 26), 39875#(<= main_~i~0 27), 39876#(<= main_~i~0 28), 39877#(<= main_~i~0 29), 39878#(<= main_~i~0 30), 39879#(<= main_~i~0 31), 39880#(<= main_~i~0 32), 39881#(<= main_~i~0 33), 39882#(<= main_~i~0 34), 39883#(<= main_~i~0 35), 39884#(<= main_~i~0 36), 39885#(<= main_~i~0 37), 39886#(<= main_~i~0 38), 39887#(<= main_~i~0 39), 39888#(<= main_~i~0 40), 39889#(<= main_~i~0 41), 39890#(<= main_~i~0 42), 39891#(<= main_~i~0 43), 39892#(<= main_~i~0 44), 39893#(<= main_~i~0 45), 39894#(<= main_~i~0 46), 39895#(<= main_~i~0 47), 39896#(<= main_~i~0 48), 39897#(<= main_~i~0 49), 39898#(<= main_~i~0 50), 39899#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 39900#(and (<= 1 main_~i~0) (<= main_~i~0 51))] [2018-04-11 13:06:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:53,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 13:06:53,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 13:06:53,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 13:06:53,151 INFO L87 Difference]: Start difference. First operand 638 states and 740 transitions. Second operand 55 states. [2018-04-11 13:06:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:54,942 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2018-04-11 13:06:54,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 13:06:54,942 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-11 13:06:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:54,944 INFO L225 Difference]: With dead ends: 704 [2018-04-11 13:06:54,944 INFO L226 Difference]: Without dead ends: 704 [2018-04-11 13:06:54,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 13:06:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-04-11 13:06:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 650. [2018-04-11 13:06:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-04-11 13:06:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 754 transitions. [2018-04-11 13:06:54,948 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 754 transitions. Word has length 262 [2018-04-11 13:06:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:54,948 INFO L459 AbstractCegarLoop]: Abstraction has 650 states and 754 transitions. [2018-04-11 13:06:54,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 13:06:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 754 transitions. [2018-04-11 13:06:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-11 13:06:54,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:54,949 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:54,949 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1319762776, now seen corresponding path program 52 times [2018-04-11 13:06:54,950 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:54,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:55,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:55,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-11 13:06:55,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:55,736 INFO L182 omatonBuilderFactory]: Interpolants [41357#true, 41358#false, 41359#(<= main_~i~0 0), 41360#(<= main_~i~0 1), 41361#(<= main_~i~0 2), 41362#(<= main_~i~0 3), 41363#(<= main_~i~0 4), 41364#(<= main_~i~0 5), 41365#(<= main_~i~0 6), 41366#(<= main_~i~0 7), 41367#(<= main_~i~0 8), 41368#(<= main_~i~0 9), 41369#(<= main_~i~0 10), 41370#(<= main_~i~0 11), 41371#(<= main_~i~0 12), 41372#(<= main_~i~0 13), 41373#(<= main_~i~0 14), 41374#(<= main_~i~0 15), 41375#(<= main_~i~0 16), 41376#(<= main_~i~0 17), 41377#(<= main_~i~0 18), 41378#(<= main_~i~0 19), 41379#(<= main_~i~0 20), 41380#(<= main_~i~0 21), 41381#(<= main_~i~0 22), 41382#(<= main_~i~0 23), 41383#(<= main_~i~0 24), 41384#(<= main_~i~0 25), 41385#(<= main_~i~0 26), 41386#(<= main_~i~0 27), 41387#(<= main_~i~0 28), 41388#(<= main_~i~0 29), 41389#(<= main_~i~0 30), 41390#(<= main_~i~0 31), 41391#(<= main_~i~0 32), 41392#(<= main_~i~0 33), 41393#(<= main_~i~0 34), 41394#(<= main_~i~0 35), 41395#(<= main_~i~0 36), 41396#(<= main_~i~0 37), 41397#(<= main_~i~0 38), 41398#(<= main_~i~0 39), 41399#(<= main_~i~0 40), 41400#(<= main_~i~0 41), 41401#(<= main_~i~0 42), 41402#(<= main_~i~0 43), 41403#(<= main_~i~0 44), 41404#(<= main_~i~0 45), 41405#(<= main_~i~0 46), 41406#(<= main_~i~0 47), 41407#(<= main_~i~0 48), 41408#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 41409#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 41410#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 41411#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 41412#(and (<= 4 main_~i~0) (<= main_~i~0 52))] [2018-04-11 13:06:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:55,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 13:06:55,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 13:06:55,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 13:06:55,736 INFO L87 Difference]: Start difference. First operand 650 states and 754 transitions. Second operand 56 states. [2018-04-11 13:06:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:06:57,827 INFO L93 Difference]: Finished difference Result 717 states and 824 transitions. [2018-04-11 13:06:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 13:06:57,827 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 267 [2018-04-11 13:06:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:06:57,829 INFO L225 Difference]: With dead ends: 717 [2018-04-11 13:06:57,829 INFO L226 Difference]: Without dead ends: 717 [2018-04-11 13:06:57,830 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 13:06:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-04-11 13:06:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 662. [2018-04-11 13:06:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-11 13:06:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 768 transitions. [2018-04-11 13:06:57,834 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 768 transitions. Word has length 267 [2018-04-11 13:06:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:06:57,834 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 768 transitions. [2018-04-11 13:06:57,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 13:06:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 768 transitions. [2018-04-11 13:06:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-11 13:06:57,835 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:06:57,835 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-11 13:06:57,835 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:06:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1448407723, now seen corresponding path program 53 times [2018-04-11 13:06:57,836 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:06:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:06:57,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:06:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:58,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:06:58,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-11 13:06:58,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:06:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:58,700 INFO L182 omatonBuilderFactory]: Interpolants [42896#true, 42897#false, 42898#(<= main_~i~0 0), 42899#(<= main_~i~0 1), 42900#(<= main_~i~0 2), 42901#(<= main_~i~0 3), 42902#(<= main_~i~0 4), 42903#(<= main_~i~0 5), 42904#(<= main_~i~0 6), 42905#(<= main_~i~0 7), 42906#(<= main_~i~0 8), 42907#(<= main_~i~0 9), 42908#(<= main_~i~0 10), 42909#(<= main_~i~0 11), 42910#(<= main_~i~0 12), 42911#(<= main_~i~0 13), 42912#(<= main_~i~0 14), 42913#(<= main_~i~0 15), 42914#(<= main_~i~0 16), 42915#(<= main_~i~0 17), 42916#(<= main_~i~0 18), 42917#(<= main_~i~0 19), 42918#(<= main_~i~0 20), 42919#(<= main_~i~0 21), 42920#(<= main_~i~0 22), 42921#(<= main_~i~0 23), 42922#(<= main_~i~0 24), 42923#(<= main_~i~0 25), 42924#(<= main_~i~0 26), 42925#(<= main_~i~0 27), 42926#(<= main_~i~0 28), 42927#(<= main_~i~0 29), 42928#(<= main_~i~0 30), 42929#(<= main_~i~0 31), 42930#(<= main_~i~0 32), 42931#(<= main_~i~0 33), 42932#(<= main_~i~0 34), 42933#(<= main_~i~0 35), 42934#(<= main_~i~0 36), 42935#(<= main_~i~0 37), 42936#(<= main_~i~0 38), 42937#(<= main_~i~0 39), 42938#(<= main_~i~0 40), 42939#(<= main_~i~0 41), 42940#(<= main_~i~0 42), 42941#(<= main_~i~0 43), 42942#(<= main_~i~0 44), 42943#(<= main_~i~0 45), 42944#(<= main_~i~0 46), 42945#(<= main_~i~0 47), 42946#(<= main_~i~0 48), 42947#(<= main_~i~0 49), 42948#(<= main_~i~0 50), 42949#(<= main_~i~0 51), 42950#(<= main_~i~0 52), 42951#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 42952#(and (<= 1 main_~i~0) (<= main_~i~0 53))] [2018-04-11 13:06:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:06:58,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 13:06:58,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 13:06:58,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 13:06:58,701 INFO L87 Difference]: Start difference. First operand 662 states and 768 transitions. Second operand 57 states. [2018-04-11 13:07:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:00,618 INFO L93 Difference]: Finished difference Result 730 states and 839 transitions. [2018-04-11 13:07:00,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 13:07:00,619 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-04-11 13:07:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:00,620 INFO L225 Difference]: With dead ends: 730 [2018-04-11 13:07:00,620 INFO L226 Difference]: Without dead ends: 730 [2018-04-11 13:07:00,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4458, Invalid=7532, Unknown=0, NotChecked=0, Total=11990 [2018-04-11 13:07:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-04-11 13:07:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 674. [2018-04-11 13:07:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-04-11 13:07:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 782 transitions. [2018-04-11 13:07:00,625 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 782 transitions. Word has length 272 [2018-04-11 13:07:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:00,625 INFO L459 AbstractCegarLoop]: Abstraction has 674 states and 782 transitions. [2018-04-11 13:07:00,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 13:07:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 782 transitions. [2018-04-11 13:07:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-11 13:07:00,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:00,627 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:00,627 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1819371720, now seen corresponding path program 54 times [2018-04-11 13:07:00,627 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:00,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:01,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:01,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-11 13:07:01,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:01,535 INFO L182 omatonBuilderFactory]: Interpolants [44463#true, 44464#false, 44465#(<= main_~i~0 0), 44466#(<= main_~i~0 1), 44467#(<= main_~i~0 2), 44468#(<= main_~i~0 3), 44469#(<= main_~i~0 4), 44470#(<= main_~i~0 5), 44471#(<= main_~i~0 6), 44472#(<= main_~i~0 7), 44473#(<= main_~i~0 8), 44474#(<= main_~i~0 9), 44475#(<= main_~i~0 10), 44476#(<= main_~i~0 11), 44477#(<= main_~i~0 12), 44478#(<= main_~i~0 13), 44479#(<= main_~i~0 14), 44480#(<= main_~i~0 15), 44481#(<= main_~i~0 16), 44482#(<= main_~i~0 17), 44483#(<= main_~i~0 18), 44484#(<= main_~i~0 19), 44485#(<= main_~i~0 20), 44486#(<= main_~i~0 21), 44487#(<= main_~i~0 22), 44488#(<= main_~i~0 23), 44489#(<= main_~i~0 24), 44490#(<= main_~i~0 25), 44491#(<= main_~i~0 26), 44492#(<= main_~i~0 27), 44493#(<= main_~i~0 28), 44494#(<= main_~i~0 29), 44495#(<= main_~i~0 30), 44496#(<= main_~i~0 31), 44497#(<= main_~i~0 32), 44498#(<= main_~i~0 33), 44499#(<= main_~i~0 34), 44500#(<= main_~i~0 35), 44501#(<= main_~i~0 36), 44502#(<= main_~i~0 37), 44503#(<= main_~i~0 38), 44504#(<= main_~i~0 39), 44505#(<= main_~i~0 40), 44506#(<= main_~i~0 41), 44507#(<= main_~i~0 42), 44508#(<= main_~i~0 43), 44509#(<= main_~i~0 44), 44510#(<= main_~i~0 45), 44511#(<= main_~i~0 46), 44512#(<= main_~i~0 47), 44513#(<= main_~i~0 48), 44514#(<= main_~i~0 49), 44515#(<= main_~i~0 50), 44516#(<= main_~i~0 51), 44517#(<= main_~i~0 52), 44518#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 44519#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 44520#(and (<= 2 main_~i~0) (<= main_~i~0 54))] [2018-04-11 13:07:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:01,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 13:07:01,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 13:07:01,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:07:01,536 INFO L87 Difference]: Start difference. First operand 674 states and 782 transitions. Second operand 58 states. [2018-04-11 13:07:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:03,874 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-04-11 13:07:03,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 13:07:03,874 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 277 [2018-04-11 13:07:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:03,876 INFO L225 Difference]: With dead ends: 743 [2018-04-11 13:07:03,876 INFO L226 Difference]: Without dead ends: 743 [2018-04-11 13:07:03,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 13:07:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-04-11 13:07:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 686. [2018-04-11 13:07:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-11 13:07:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 796 transitions. [2018-04-11 13:07:03,880 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 796 transitions. Word has length 277 [2018-04-11 13:07:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:03,880 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 796 transitions. [2018-04-11 13:07:03,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 13:07:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 796 transitions. [2018-04-11 13:07:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-11 13:07:03,881 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:03,881 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:03,881 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2102837963, now seen corresponding path program 55 times [2018-04-11 13:07:03,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:03,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:04,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:04,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-11 13:07:04,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:04,772 INFO L182 omatonBuilderFactory]: Interpolants [46080#(<= main_~i~0 20), 46081#(<= main_~i~0 21), 46082#(<= main_~i~0 22), 46083#(<= main_~i~0 23), 46084#(<= main_~i~0 24), 46085#(<= main_~i~0 25), 46086#(<= main_~i~0 26), 46087#(<= main_~i~0 27), 46088#(<= main_~i~0 28), 46089#(<= main_~i~0 29), 46090#(<= main_~i~0 30), 46091#(<= main_~i~0 31), 46092#(<= main_~i~0 32), 46093#(<= main_~i~0 33), 46094#(<= main_~i~0 34), 46095#(<= main_~i~0 35), 46096#(<= main_~i~0 36), 46097#(<= main_~i~0 37), 46098#(<= main_~i~0 38), 46099#(<= main_~i~0 39), 46100#(<= main_~i~0 40), 46101#(<= main_~i~0 41), 46102#(<= main_~i~0 42), 46103#(<= main_~i~0 43), 46104#(<= main_~i~0 44), 46105#(<= main_~i~0 45), 46106#(<= main_~i~0 46), 46107#(<= main_~i~0 47), 46108#(<= main_~i~0 48), 46109#(<= main_~i~0 49), 46110#(<= main_~i~0 50), 46111#(<= main_~i~0 51), 46112#(<= main_~i~0 52), 46113#(<= main_~i~0 53), 46114#(<= main_~i~0 54), 46115#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 46116#(and (<= main_~i~0 55) (<= 1 main_~i~0)), 46058#true, 46059#false, 46060#(<= main_~i~0 0), 46061#(<= main_~i~0 1), 46062#(<= main_~i~0 2), 46063#(<= main_~i~0 3), 46064#(<= main_~i~0 4), 46065#(<= main_~i~0 5), 46066#(<= main_~i~0 6), 46067#(<= main_~i~0 7), 46068#(<= main_~i~0 8), 46069#(<= main_~i~0 9), 46070#(<= main_~i~0 10), 46071#(<= main_~i~0 11), 46072#(<= main_~i~0 12), 46073#(<= main_~i~0 13), 46074#(<= main_~i~0 14), 46075#(<= main_~i~0 15), 46076#(<= main_~i~0 16), 46077#(<= main_~i~0 17), 46078#(<= main_~i~0 18), 46079#(<= main_~i~0 19)] [2018-04-11 13:07:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:04,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 13:07:04,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 13:07:04,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 13:07:04,773 INFO L87 Difference]: Start difference. First operand 686 states and 796 transitions. Second operand 59 states. [2018-04-11 13:07:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:06,637 INFO L93 Difference]: Finished difference Result 756 states and 869 transitions. [2018-04-11 13:07:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 13:07:06,637 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-11 13:07:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:06,639 INFO L225 Difference]: With dead ends: 756 [2018-04-11 13:07:06,639 INFO L226 Difference]: Without dead ends: 756 [2018-04-11 13:07:06,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-11 13:07:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-11 13:07:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 698. [2018-04-11 13:07:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-11 13:07:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 810 transitions. [2018-04-11 13:07:06,643 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 810 transitions. Word has length 282 [2018-04-11 13:07:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:06,643 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 810 transitions. [2018-04-11 13:07:06,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 13:07:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 810 transitions. [2018-04-11 13:07:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-11 13:07:06,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:06,644 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:06,644 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash 875963624, now seen corresponding path program 56 times [2018-04-11 13:07:06,645 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:06,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:07,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:07,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-11 13:07:07,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:07,558 INFO L182 omatonBuilderFactory]: Interpolants [47681#true, 47682#false, 47683#(<= main_~i~0 0), 47684#(<= main_~i~0 1), 47685#(<= main_~i~0 2), 47686#(<= main_~i~0 3), 47687#(<= main_~i~0 4), 47688#(<= main_~i~0 5), 47689#(<= main_~i~0 6), 47690#(<= main_~i~0 7), 47691#(<= main_~i~0 8), 47692#(<= main_~i~0 9), 47693#(<= main_~i~0 10), 47694#(<= main_~i~0 11), 47695#(<= main_~i~0 12), 47696#(<= main_~i~0 13), 47697#(<= main_~i~0 14), 47698#(<= main_~i~0 15), 47699#(<= main_~i~0 16), 47700#(<= main_~i~0 17), 47701#(<= main_~i~0 18), 47702#(<= main_~i~0 19), 47703#(<= main_~i~0 20), 47704#(<= main_~i~0 21), 47705#(<= main_~i~0 22), 47706#(<= main_~i~0 23), 47707#(<= main_~i~0 24), 47708#(<= main_~i~0 25), 47709#(<= main_~i~0 26), 47710#(<= main_~i~0 27), 47711#(<= main_~i~0 28), 47712#(<= main_~i~0 29), 47713#(<= main_~i~0 30), 47714#(<= main_~i~0 31), 47715#(<= main_~i~0 32), 47716#(<= main_~i~0 33), 47717#(<= main_~i~0 34), 47718#(<= main_~i~0 35), 47719#(<= main_~i~0 36), 47720#(<= main_~i~0 37), 47721#(<= main_~i~0 38), 47722#(<= main_~i~0 39), 47723#(<= main_~i~0 40), 47724#(<= main_~i~0 41), 47725#(<= main_~i~0 42), 47726#(<= main_~i~0 43), 47727#(<= main_~i~0 44), 47728#(<= main_~i~0 45), 47729#(<= main_~i~0 46), 47730#(<= main_~i~0 47), 47731#(<= main_~i~0 48), 47732#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 47733#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 47734#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 47735#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 47736#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 47737#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 47738#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 47739#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 47740#(and (<= main_~i~0 56) (<= 8 main_~i~0))] [2018-04-11 13:07:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:07,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-11 13:07:07,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-11 13:07:07,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 13:07:07,559 INFO L87 Difference]: Start difference. First operand 698 states and 810 transitions. Second operand 60 states. [2018-04-11 13:07:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:10,418 INFO L93 Difference]: Finished difference Result 769 states and 884 transitions. [2018-04-11 13:07:10,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 13:07:10,419 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-11 13:07:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:10,420 INFO L225 Difference]: With dead ends: 769 [2018-04-11 13:07:10,420 INFO L226 Difference]: Without dead ends: 769 [2018-04-11 13:07:10,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-11 13:07:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-04-11 13:07:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 710. [2018-04-11 13:07:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-04-11 13:07:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 824 transitions. [2018-04-11 13:07:10,426 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 824 transitions. Word has length 287 [2018-04-11 13:07:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:10,426 INFO L459 AbstractCegarLoop]: Abstraction has 710 states and 824 transitions. [2018-04-11 13:07:10,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-11 13:07:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 824 transitions. [2018-04-11 13:07:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-11 13:07:10,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:10,428 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:10,428 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash -82504427, now seen corresponding path program 57 times [2018-04-11 13:07:10,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:10,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:11,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:11,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-11 13:07:11,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:11,433 INFO L182 omatonBuilderFactory]: Interpolants [49332#true, 49333#false, 49334#(<= main_~i~0 0), 49335#(<= main_~i~0 1), 49336#(<= main_~i~0 2), 49337#(<= main_~i~0 3), 49338#(<= main_~i~0 4), 49339#(<= main_~i~0 5), 49340#(<= main_~i~0 6), 49341#(<= main_~i~0 7), 49342#(<= main_~i~0 8), 49343#(<= main_~i~0 9), 49344#(<= main_~i~0 10), 49345#(<= main_~i~0 11), 49346#(<= main_~i~0 12), 49347#(<= main_~i~0 13), 49348#(<= main_~i~0 14), 49349#(<= main_~i~0 15), 49350#(<= main_~i~0 16), 49351#(<= main_~i~0 17), 49352#(<= main_~i~0 18), 49353#(<= main_~i~0 19), 49354#(<= main_~i~0 20), 49355#(<= main_~i~0 21), 49356#(<= main_~i~0 22), 49357#(<= main_~i~0 23), 49358#(<= main_~i~0 24), 49359#(<= main_~i~0 25), 49360#(<= main_~i~0 26), 49361#(<= main_~i~0 27), 49362#(<= main_~i~0 28), 49363#(<= main_~i~0 29), 49364#(<= main_~i~0 30), 49365#(<= main_~i~0 31), 49366#(<= main_~i~0 32), 49367#(<= main_~i~0 33), 49368#(<= main_~i~0 34), 49369#(<= main_~i~0 35), 49370#(<= main_~i~0 36), 49371#(<= main_~i~0 37), 49372#(<= main_~i~0 38), 49373#(<= main_~i~0 39), 49374#(<= main_~i~0 40), 49375#(<= main_~i~0 41), 49376#(<= main_~i~0 42), 49377#(<= main_~i~0 43), 49378#(<= main_~i~0 44), 49379#(<= main_~i~0 45), 49380#(<= main_~i~0 46), 49381#(<= main_~i~0 47), 49382#(<= main_~i~0 48), 49383#(<= main_~i~0 49), 49384#(<= main_~i~0 50), 49385#(<= main_~i~0 51), 49386#(<= main_~i~0 52), 49387#(<= main_~i~0 53), 49388#(<= main_~i~0 54), 49389#(<= main_~i~0 55), 49390#(<= main_~i~0 56), 49391#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 49392#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-04-11 13:07:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:11,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 13:07:11,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 13:07:11,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 13:07:11,434 INFO L87 Difference]: Start difference. First operand 710 states and 824 transitions. Second operand 61 states. [2018-04-11 13:07:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:13,586 INFO L93 Difference]: Finished difference Result 782 states and 899 transitions. [2018-04-11 13:07:13,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 13:07:13,586 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-04-11 13:07:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:13,588 INFO L225 Difference]: With dead ends: 782 [2018-04-11 13:07:13,588 INFO L226 Difference]: Without dead ends: 782 [2018-04-11 13:07:13,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5136, Invalid=8670, Unknown=0, NotChecked=0, Total=13806 [2018-04-11 13:07:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-11 13:07:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 722. [2018-04-11 13:07:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-04-11 13:07:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 838 transitions. [2018-04-11 13:07:13,594 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 838 transitions. Word has length 292 [2018-04-11 13:07:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:13,594 INFO L459 AbstractCegarLoop]: Abstraction has 722 states and 838 transitions. [2018-04-11 13:07:13,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-11 13:07:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 838 transitions. [2018-04-11 13:07:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-11 13:07:13,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:13,595 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:13,595 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1495910136, now seen corresponding path program 58 times [2018-04-11 13:07:13,596 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:13,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:14,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:14,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-11 13:07:14,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:14,623 INFO L182 omatonBuilderFactory]: Interpolants [51072#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 51011#true, 51012#false, 51013#(<= main_~i~0 0), 51014#(<= main_~i~0 1), 51015#(<= main_~i~0 2), 51016#(<= main_~i~0 3), 51017#(<= main_~i~0 4), 51018#(<= main_~i~0 5), 51019#(<= main_~i~0 6), 51020#(<= main_~i~0 7), 51021#(<= main_~i~0 8), 51022#(<= main_~i~0 9), 51023#(<= main_~i~0 10), 51024#(<= main_~i~0 11), 51025#(<= main_~i~0 12), 51026#(<= main_~i~0 13), 51027#(<= main_~i~0 14), 51028#(<= main_~i~0 15), 51029#(<= main_~i~0 16), 51030#(<= main_~i~0 17), 51031#(<= main_~i~0 18), 51032#(<= main_~i~0 19), 51033#(<= main_~i~0 20), 51034#(<= main_~i~0 21), 51035#(<= main_~i~0 22), 51036#(<= main_~i~0 23), 51037#(<= main_~i~0 24), 51038#(<= main_~i~0 25), 51039#(<= main_~i~0 26), 51040#(<= main_~i~0 27), 51041#(<= main_~i~0 28), 51042#(<= main_~i~0 29), 51043#(<= main_~i~0 30), 51044#(<= main_~i~0 31), 51045#(<= main_~i~0 32), 51046#(<= main_~i~0 33), 51047#(<= main_~i~0 34), 51048#(<= main_~i~0 35), 51049#(<= main_~i~0 36), 51050#(<= main_~i~0 37), 51051#(<= main_~i~0 38), 51052#(<= main_~i~0 39), 51053#(<= main_~i~0 40), 51054#(<= main_~i~0 41), 51055#(<= main_~i~0 42), 51056#(<= main_~i~0 43), 51057#(<= main_~i~0 44), 51058#(<= main_~i~0 45), 51059#(<= main_~i~0 46), 51060#(<= main_~i~0 47), 51061#(<= main_~i~0 48), 51062#(<= main_~i~0 49), 51063#(<= main_~i~0 50), 51064#(<= main_~i~0 51), 51065#(<= main_~i~0 52), 51066#(<= main_~i~0 53), 51067#(<= main_~i~0 54), 51068#(<= main_~i~0 55), 51069#(<= main_~i~0 56), 51070#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 51071#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-04-11 13:07:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:14,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-11 13:07:14,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-11 13:07:14,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 13:07:14,624 INFO L87 Difference]: Start difference. First operand 722 states and 838 transitions. Second operand 62 states. [2018-04-11 13:07:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:16,947 INFO L93 Difference]: Finished difference Result 795 states and 914 transitions. [2018-04-11 13:07:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 13:07:16,947 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 297 [2018-04-11 13:07:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:16,949 INFO L225 Difference]: With dead ends: 795 [2018-04-11 13:07:16,949 INFO L226 Difference]: Without dead ends: 795 [2018-04-11 13:07:16,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5197, Invalid=9083, Unknown=0, NotChecked=0, Total=14280 [2018-04-11 13:07:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-04-11 13:07:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 734. [2018-04-11 13:07:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-04-11 13:07:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2018-04-11 13:07:16,954 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 297 [2018-04-11 13:07:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:16,954 INFO L459 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2018-04-11 13:07:16,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-11 13:07:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2018-04-11 13:07:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-11 13:07:16,955 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:16,955 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:16,955 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2080598795, now seen corresponding path program 59 times [2018-04-11 13:07:16,956 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:16,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:18,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:18,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-11 13:07:18,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:18,002 INFO L182 omatonBuilderFactory]: Interpolants [52736#(<= main_~i~0 16), 52737#(<= main_~i~0 17), 52738#(<= main_~i~0 18), 52739#(<= main_~i~0 19), 52740#(<= main_~i~0 20), 52741#(<= main_~i~0 21), 52742#(<= main_~i~0 22), 52743#(<= main_~i~0 23), 52744#(<= main_~i~0 24), 52745#(<= main_~i~0 25), 52746#(<= main_~i~0 26), 52747#(<= main_~i~0 27), 52748#(<= main_~i~0 28), 52749#(<= main_~i~0 29), 52750#(<= main_~i~0 30), 52751#(<= main_~i~0 31), 52752#(<= main_~i~0 32), 52753#(<= main_~i~0 33), 52754#(<= main_~i~0 34), 52755#(<= main_~i~0 35), 52756#(<= main_~i~0 36), 52757#(<= main_~i~0 37), 52758#(<= main_~i~0 38), 52759#(<= main_~i~0 39), 52760#(<= main_~i~0 40), 52761#(<= main_~i~0 41), 52762#(<= main_~i~0 42), 52763#(<= main_~i~0 43), 52764#(<= main_~i~0 44), 52765#(<= main_~i~0 45), 52766#(<= main_~i~0 46), 52767#(<= main_~i~0 47), 52768#(<= main_~i~0 48), 52769#(<= main_~i~0 49), 52770#(<= main_~i~0 50), 52771#(<= main_~i~0 51), 52772#(<= main_~i~0 52), 52773#(<= main_~i~0 53), 52774#(<= main_~i~0 54), 52775#(<= main_~i~0 55), 52776#(<= main_~i~0 56), 52777#(<= main_~i~0 57), 52778#(<= main_~i~0 58), 52779#(and (<= 0 main_~i~0) (<= main_~i~0 58)), 52780#(and (<= main_~i~0 59) (<= 1 main_~i~0)), 52718#true, 52719#false, 52720#(<= main_~i~0 0), 52721#(<= main_~i~0 1), 52722#(<= main_~i~0 2), 52723#(<= main_~i~0 3), 52724#(<= main_~i~0 4), 52725#(<= main_~i~0 5), 52726#(<= main_~i~0 6), 52727#(<= main_~i~0 7), 52728#(<= main_~i~0 8), 52729#(<= main_~i~0 9), 52730#(<= main_~i~0 10), 52731#(<= main_~i~0 11), 52732#(<= main_~i~0 12), 52733#(<= main_~i~0 13), 52734#(<= main_~i~0 14), 52735#(<= main_~i~0 15)] [2018-04-11 13:07:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:18,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-11 13:07:18,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-11 13:07:18,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 13:07:18,003 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand 63 states. [2018-04-11 13:07:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:20,231 INFO L93 Difference]: Finished difference Result 808 states and 929 transitions. [2018-04-11 13:07:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 13:07:20,231 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 302 [2018-04-11 13:07:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:20,233 INFO L225 Difference]: With dead ends: 808 [2018-04-11 13:07:20,233 INFO L226 Difference]: Without dead ends: 808 [2018-04-11 13:07:20,233 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5493, Invalid=9269, Unknown=0, NotChecked=0, Total=14762 [2018-04-11 13:07:20,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-04-11 13:07:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 746. [2018-04-11 13:07:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-04-11 13:07:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 866 transitions. [2018-04-11 13:07:20,237 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 866 transitions. Word has length 302 [2018-04-11 13:07:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:20,237 INFO L459 AbstractCegarLoop]: Abstraction has 746 states and 866 transitions. [2018-04-11 13:07:20,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-11 13:07:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 866 transitions. [2018-04-11 13:07:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-11 13:07:20,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:20,238 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:20,238 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash -872176344, now seen corresponding path program 60 times [2018-04-11 13:07:20,239 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:20,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:21,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:21,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-11 13:07:21,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:21,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-11 13:07:21,246 INFO L182 omatonBuilderFactory]: Interpolants [54453#true, 54454#false, 54455#(<= main_~i~0 0), 54456#(<= main_~i~0 1), 54457#(<= main_~i~0 2), 54458#(<= main_~i~0 3), 54459#(<= main_~i~0 4), 54460#(<= main_~i~0 5), 54461#(<= main_~i~0 6), 54462#(<= main_~i~0 7), 54463#(<= main_~i~0 8), 54464#(<= main_~i~0 9), 54465#(<= main_~i~0 10), 54466#(<= main_~i~0 11), 54467#(<= main_~i~0 12), 54468#(<= main_~i~0 13), 54469#(<= main_~i~0 14), 54470#(<= main_~i~0 15), 54471#(<= main_~i~0 16), 54472#(<= main_~i~0 17), 54473#(<= main_~i~0 18), 54474#(<= main_~i~0 19), 54475#(<= main_~i~0 20), 54476#(<= main_~i~0 21), 54477#(<= main_~i~0 22), 54478#(<= main_~i~0 23), 54479#(<= main_~i~0 24), 54480#(<= main_~i~0 25), 54481#(<= main_~i~0 26), 54482#(<= main_~i~0 27), 54483#(<= main_~i~0 28), 54484#(<= main_~i~0 29), 54485#(<= main_~i~0 30), 54486#(<= main_~i~0 31), 54487#(<= main_~i~0 32), 54488#(<= main_~i~0 33), 54489#(<= main_~i~0 34), 54490#(<= main_~i~0 35), 54491#(<= main_~i~0 36), 54492#(<= main_~i~0 37), 54493#(<= main_~i~0 38), 54494#(<= main_~i~0 39), 54495#(<= main_~i~0 40), 54496#(<= main_~i~0 41), 54497#(<= main_~i~0 42), 54498#(<= main_~i~0 43), 54499#(<= main_~i~0 44), 54500#(<= main_~i~0 45), 54501#(<= main_~i~0 46), 54502#(<= main_~i~0 47), 54503#(<= main_~i~0 48), 54504#(<= main_~i~0 49), 54505#(<= main_~i~0 50), 54506#(<= main_~i~0 51), 54507#(<= main_~i~0 52), 54508#(<= main_~i~0 53), 54509#(<= main_~i~0 54), 54510#(<= main_~i~0 55), 54511#(<= main_~i~0 56), 54512#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 54513#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 54514#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 54515#(and (<= main_~i~0 59) (<= 3 main_~i~0)), 54516#(and (<= main_~i~0 60) (<= 4 main_~i~0))] [2018-04-11 13:07:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:21,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-11 13:07:21,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-11 13:07:21,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=2310, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 13:07:21,247 INFO L87 Difference]: Start difference. First operand 746 states and 866 transitions. Second operand 64 states. [2018-04-11 13:07:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:23,954 INFO L93 Difference]: Finished difference Result 821 states and 944 transitions. [2018-04-11 13:07:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-11 13:07:23,955 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 307 [2018-04-11 13:07:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:23,956 INFO L225 Difference]: With dead ends: 821 [2018-04-11 13:07:23,956 INFO L226 Difference]: Without dead ends: 821 [2018-04-11 13:07:23,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5319, Invalid=9933, Unknown=0, NotChecked=0, Total=15252 [2018-04-11 13:07:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-04-11 13:07:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 758. [2018-04-11 13:07:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-04-11 13:07:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 880 transitions. [2018-04-11 13:07:23,961 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 880 transitions. Word has length 307 [2018-04-11 13:07:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:23,961 INFO L459 AbstractCegarLoop]: Abstraction has 758 states and 880 transitions. [2018-04-11 13:07:23,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-11 13:07:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 880 transitions. [2018-04-11 13:07:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-11 13:07:23,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:23,962 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:23,963 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash 351124693, now seen corresponding path program 61 times [2018-04-11 13:07:23,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:23,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:25,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:25,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-11 13:07:25,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:25,154 INFO L182 omatonBuilderFactory]: Interpolants [56216#true, 56217#false, 56218#(<= main_~i~0 0), 56219#(<= main_~i~0 1), 56220#(<= main_~i~0 2), 56221#(<= main_~i~0 3), 56222#(<= main_~i~0 4), 56223#(<= main_~i~0 5), 56224#(<= main_~i~0 6), 56225#(<= main_~i~0 7), 56226#(<= main_~i~0 8), 56227#(<= main_~i~0 9), 56228#(<= main_~i~0 10), 56229#(<= main_~i~0 11), 56230#(<= main_~i~0 12), 56231#(<= main_~i~0 13), 56232#(<= main_~i~0 14), 56233#(<= main_~i~0 15), 56234#(<= main_~i~0 16), 56235#(<= main_~i~0 17), 56236#(<= main_~i~0 18), 56237#(<= main_~i~0 19), 56238#(<= main_~i~0 20), 56239#(<= main_~i~0 21), 56240#(<= main_~i~0 22), 56241#(<= main_~i~0 23), 56242#(<= main_~i~0 24), 56243#(<= main_~i~0 25), 56244#(<= main_~i~0 26), 56245#(<= main_~i~0 27), 56246#(<= main_~i~0 28), 56247#(<= main_~i~0 29), 56248#(<= main_~i~0 30), 56249#(<= main_~i~0 31), 56250#(<= main_~i~0 32), 56251#(<= main_~i~0 33), 56252#(<= main_~i~0 34), 56253#(<= main_~i~0 35), 56254#(<= main_~i~0 36), 56255#(<= main_~i~0 37), 56256#(<= main_~i~0 38), 56257#(<= main_~i~0 39), 56258#(<= main_~i~0 40), 56259#(<= main_~i~0 41), 56260#(<= main_~i~0 42), 56261#(<= main_~i~0 43), 56262#(<= main_~i~0 44), 56263#(<= main_~i~0 45), 56264#(<= main_~i~0 46), 56265#(<= main_~i~0 47), 56266#(<= main_~i~0 48), 56267#(<= main_~i~0 49), 56268#(<= main_~i~0 50), 56269#(<= main_~i~0 51), 56270#(<= main_~i~0 52), 56271#(<= main_~i~0 53), 56272#(<= main_~i~0 54), 56273#(<= main_~i~0 55), 56274#(<= main_~i~0 56), 56275#(<= main_~i~0 57), 56276#(<= main_~i~0 58), 56277#(<= main_~i~0 59), 56278#(<= main_~i~0 60), 56279#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 56280#(and (<= main_~i~0 61) (<= 1 main_~i~0))] [2018-04-11 13:07:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:25,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-11 13:07:25,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-11 13:07:25,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 13:07:25,155 INFO L87 Difference]: Start difference. First operand 758 states and 880 transitions. Second operand 65 states. [2018-04-11 13:07:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:27,673 INFO L93 Difference]: Finished difference Result 834 states and 959 transitions. [2018-04-11 13:07:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 13:07:27,673 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-11 13:07:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:27,675 INFO L225 Difference]: With dead ends: 834 [2018-04-11 13:07:27,675 INFO L226 Difference]: Without dead ends: 834 [2018-04-11 13:07:27,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-11 13:07:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-04-11 13:07:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 770. [2018-04-11 13:07:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-04-11 13:07:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 894 transitions. [2018-04-11 13:07:27,683 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 894 transitions. Word has length 312 [2018-04-11 13:07:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:27,683 INFO L459 AbstractCegarLoop]: Abstraction has 770 states and 894 transitions. [2018-04-11 13:07:27,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-11 13:07:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 894 transitions. [2018-04-11 13:07:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-11 13:07:27,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:27,685 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:27,685 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 888170824, now seen corresponding path program 62 times [2018-04-11 13:07:27,685 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:27,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:28,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:28,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-11 13:07:28,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:28,785 INFO L182 omatonBuilderFactory]: Interpolants [58007#true, 58008#false, 58009#(<= main_~i~0 0), 58010#(<= main_~i~0 1), 58011#(<= main_~i~0 2), 58012#(<= main_~i~0 3), 58013#(<= main_~i~0 4), 58014#(<= main_~i~0 5), 58015#(<= main_~i~0 6), 58016#(<= main_~i~0 7), 58017#(<= main_~i~0 8), 58018#(<= main_~i~0 9), 58019#(<= main_~i~0 10), 58020#(<= main_~i~0 11), 58021#(<= main_~i~0 12), 58022#(<= main_~i~0 13), 58023#(<= main_~i~0 14), 58024#(<= main_~i~0 15), 58025#(<= main_~i~0 16), 58026#(<= main_~i~0 17), 58027#(<= main_~i~0 18), 58028#(<= main_~i~0 19), 58029#(<= main_~i~0 20), 58030#(<= main_~i~0 21), 58031#(<= main_~i~0 22), 58032#(<= main_~i~0 23), 58033#(<= main_~i~0 24), 58034#(<= main_~i~0 25), 58035#(<= main_~i~0 26), 58036#(<= main_~i~0 27), 58037#(<= main_~i~0 28), 58038#(<= main_~i~0 29), 58039#(<= main_~i~0 30), 58040#(<= main_~i~0 31), 58041#(<= main_~i~0 32), 58042#(<= main_~i~0 33), 58043#(<= main_~i~0 34), 58044#(<= main_~i~0 35), 58045#(<= main_~i~0 36), 58046#(<= main_~i~0 37), 58047#(<= main_~i~0 38), 58048#(<= main_~i~0 39), 58049#(<= main_~i~0 40), 58050#(<= main_~i~0 41), 58051#(<= main_~i~0 42), 58052#(<= main_~i~0 43), 58053#(<= main_~i~0 44), 58054#(<= main_~i~0 45), 58055#(<= main_~i~0 46), 58056#(<= main_~i~0 47), 58057#(<= main_~i~0 48), 58058#(<= main_~i~0 49), 58059#(<= main_~i~0 50), 58060#(<= main_~i~0 51), 58061#(<= main_~i~0 52), 58062#(<= main_~i~0 53), 58063#(<= main_~i~0 54), 58064#(<= main_~i~0 55), 58065#(<= main_~i~0 56), 58066#(<= main_~i~0 57), 58067#(<= main_~i~0 58), 58068#(<= main_~i~0 59), 58069#(<= main_~i~0 60), 58070#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 58071#(and (<= main_~i~0 61) (<= 1 main_~i~0)), 58072#(and (<= 2 main_~i~0) (<= main_~i~0 62))] [2018-04-11 13:07:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:28,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 13:07:28,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 13:07:28,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 13:07:28,786 INFO L87 Difference]: Start difference. First operand 770 states and 894 transitions. Second operand 66 states. [2018-04-11 13:07:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:31,464 INFO L93 Difference]: Finished difference Result 847 states and 974 transitions. [2018-04-11 13:07:31,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 13:07:31,465 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-11 13:07:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:31,467 INFO L225 Difference]: With dead ends: 847 [2018-04-11 13:07:31,467 INFO L226 Difference]: Without dead ends: 847 [2018-04-11 13:07:31,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-11 13:07:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-04-11 13:07:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 782. [2018-04-11 13:07:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-11 13:07:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 908 transitions. [2018-04-11 13:07:31,472 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 908 transitions. Word has length 317 [2018-04-11 13:07:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:31,472 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 908 transitions. [2018-04-11 13:07:31,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 13:07:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 908 transitions. [2018-04-11 13:07:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-11 13:07:31,473 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:31,474 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:31,474 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 200707253, now seen corresponding path program 63 times [2018-04-11 13:07:31,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:31,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:32,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:32,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-11 13:07:32,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:32,640 INFO L182 omatonBuilderFactory]: Interpolants [59826#true, 59827#false, 59828#(<= main_~i~0 0), 59829#(<= main_~i~0 1), 59830#(<= main_~i~0 2), 59831#(<= main_~i~0 3), 59832#(<= main_~i~0 4), 59833#(<= main_~i~0 5), 59834#(<= main_~i~0 6), 59835#(<= main_~i~0 7), 59836#(<= main_~i~0 8), 59837#(<= main_~i~0 9), 59838#(<= main_~i~0 10), 59839#(<= main_~i~0 11), 59840#(<= main_~i~0 12), 59841#(<= main_~i~0 13), 59842#(<= main_~i~0 14), 59843#(<= main_~i~0 15), 59844#(<= main_~i~0 16), 59845#(<= main_~i~0 17), 59846#(<= main_~i~0 18), 59847#(<= main_~i~0 19), 59848#(<= main_~i~0 20), 59849#(<= main_~i~0 21), 59850#(<= main_~i~0 22), 59851#(<= main_~i~0 23), 59852#(<= main_~i~0 24), 59853#(<= main_~i~0 25), 59854#(<= main_~i~0 26), 59855#(<= main_~i~0 27), 59856#(<= main_~i~0 28), 59857#(<= main_~i~0 29), 59858#(<= main_~i~0 30), 59859#(<= main_~i~0 31), 59860#(<= main_~i~0 32), 59861#(<= main_~i~0 33), 59862#(<= main_~i~0 34), 59863#(<= main_~i~0 35), 59864#(<= main_~i~0 36), 59865#(<= main_~i~0 37), 59866#(<= main_~i~0 38), 59867#(<= main_~i~0 39), 59868#(<= main_~i~0 40), 59869#(<= main_~i~0 41), 59870#(<= main_~i~0 42), 59871#(<= main_~i~0 43), 59872#(<= main_~i~0 44), 59873#(<= main_~i~0 45), 59874#(<= main_~i~0 46), 59875#(<= main_~i~0 47), 59876#(<= main_~i~0 48), 59877#(<= main_~i~0 49), 59878#(<= main_~i~0 50), 59879#(<= main_~i~0 51), 59880#(<= main_~i~0 52), 59881#(<= main_~i~0 53), 59882#(<= main_~i~0 54), 59883#(<= main_~i~0 55), 59884#(<= main_~i~0 56), 59885#(<= main_~i~0 57), 59886#(<= main_~i~0 58), 59887#(<= main_~i~0 59), 59888#(<= main_~i~0 60), 59889#(<= main_~i~0 61), 59890#(<= main_~i~0 62), 59891#(and (<= 0 main_~i~0) (<= main_~i~0 62)), 59892#(and (<= 1 main_~i~0) (<= main_~i~0 63))] [2018-04-11 13:07:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:32,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-11 13:07:32,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-11 13:07:32,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 13:07:32,641 INFO L87 Difference]: Start difference. First operand 782 states and 908 transitions. Second operand 67 states. [2018-04-11 13:07:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:35,264 INFO L93 Difference]: Finished difference Result 860 states and 989 transitions. [2018-04-11 13:07:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 13:07:35,264 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 322 [2018-04-11 13:07:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:35,266 INFO L225 Difference]: With dead ends: 860 [2018-04-11 13:07:35,266 INFO L226 Difference]: Without dead ends: 860 [2018-04-11 13:07:35,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6243, Invalid=10527, Unknown=0, NotChecked=0, Total=16770 [2018-04-11 13:07:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-04-11 13:07:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 794. [2018-04-11 13:07:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-04-11 13:07:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 922 transitions. [2018-04-11 13:07:35,272 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 922 transitions. Word has length 322 [2018-04-11 13:07:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:35,273 INFO L459 AbstractCegarLoop]: Abstraction has 794 states and 922 transitions. [2018-04-11 13:07:35,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-11 13:07:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 922 transitions. [2018-04-11 13:07:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-11 13:07:35,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:35,274 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:35,274 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:35,274 INFO L82 PathProgramCache]: Analyzing trace with hash 474908008, now seen corresponding path program 64 times [2018-04-11 13:07:35,274 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:35,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:36,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:36,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-11 13:07:36,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:36,951 INFO L182 omatonBuilderFactory]: Interpolants [61696#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 61697#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 61698#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 61699#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 61700#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 61701#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 61702#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 61703#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 61704#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 61705#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 61706#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 61707#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 61708#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 61709#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 61710#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 61711#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 61712#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 61713#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 61714#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 61715#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 61716#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 61717#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 61718#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 61719#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 61720#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 61721#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 61722#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 61723#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 61724#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 61725#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 61726#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 61727#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 61728#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 61729#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 61730#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 61731#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 61732#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 61733#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 61734#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 61735#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 61736#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 61737#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 61738#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 61739#(and (<= main_~i~0 64) (<= 64 main_~i~0)), 61673#true, 61674#false, 61675#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 61676#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 61677#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 61678#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 61679#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 61680#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 61681#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 61682#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 61683#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 61684#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 61685#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 61686#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 61687#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 61688#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 61689#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 61690#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 61691#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 61692#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 61693#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 61694#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 61695#(and (<= 20 main_~i~0) (<= main_~i~0 20))] [2018-04-11 13:07:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:36,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-11 13:07:36,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-11 13:07:36,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 13:07:36,952 INFO L87 Difference]: Start difference. First operand 794 states and 922 transitions. Second operand 67 states. [2018-04-11 13:07:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:49,048 INFO L93 Difference]: Finished difference Result 873 states and 1004 transitions. [2018-04-11 13:07:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 13:07:49,049 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-11 13:07:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:49,050 INFO L225 Difference]: With dead ends: 873 [2018-04-11 13:07:49,050 INFO L226 Difference]: Without dead ends: 873 [2018-04-11 13:07:49,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 13:07:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-04-11 13:07:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 806. [2018-04-11 13:07:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-04-11 13:07:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 936 transitions. [2018-04-11 13:07:49,054 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 936 transitions. Word has length 327 [2018-04-11 13:07:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:49,054 INFO L459 AbstractCegarLoop]: Abstraction has 806 states and 936 transitions. [2018-04-11 13:07:49,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-11 13:07:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 936 transitions. [2018-04-11 13:07:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-11 13:07:49,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:49,056 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:49,056 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:49,056 INFO L82 PathProgramCache]: Analyzing trace with hash 228918421, now seen corresponding path program 65 times [2018-04-11 13:07:49,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:49,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:50,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:50,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-11 13:07:50,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:50,281 INFO L182 omatonBuilderFactory]: Interpolants [63419#true, 63420#false, 63421#(<= main_~i~0 0), 63422#(<= main_~i~0 1), 63423#(<= main_~i~0 2), 63424#(<= main_~i~0 3), 63425#(<= main_~i~0 4), 63426#(<= main_~i~0 5), 63427#(<= main_~i~0 6), 63428#(<= main_~i~0 7), 63429#(<= main_~i~0 8), 63430#(<= main_~i~0 9), 63431#(<= main_~i~0 10), 63432#(<= main_~i~0 11), 63433#(<= main_~i~0 12), 63434#(<= main_~i~0 13), 63435#(<= main_~i~0 14), 63436#(<= main_~i~0 15), 63437#(<= main_~i~0 16), 63438#(<= main_~i~0 17), 63439#(<= main_~i~0 18), 63440#(<= main_~i~0 19), 63441#(<= main_~i~0 20), 63442#(<= main_~i~0 21), 63443#(<= main_~i~0 22), 63444#(<= main_~i~0 23), 63445#(<= main_~i~0 24), 63446#(<= main_~i~0 25), 63447#(<= main_~i~0 26), 63448#(<= main_~i~0 27), 63449#(<= main_~i~0 28), 63450#(<= main_~i~0 29), 63451#(<= main_~i~0 30), 63452#(<= main_~i~0 31), 63453#(<= main_~i~0 32), 63454#(<= main_~i~0 33), 63455#(<= main_~i~0 34), 63456#(<= main_~i~0 35), 63457#(<= main_~i~0 36), 63458#(<= main_~i~0 37), 63459#(<= main_~i~0 38), 63460#(<= main_~i~0 39), 63461#(<= main_~i~0 40), 63462#(<= main_~i~0 41), 63463#(<= main_~i~0 42), 63464#(<= main_~i~0 43), 63465#(<= main_~i~0 44), 63466#(<= main_~i~0 45), 63467#(<= main_~i~0 46), 63468#(<= main_~i~0 47), 63469#(<= main_~i~0 48), 63470#(<= main_~i~0 49), 63471#(<= main_~i~0 50), 63472#(<= main_~i~0 51), 63473#(<= main_~i~0 52), 63474#(<= main_~i~0 53), 63475#(<= main_~i~0 54), 63476#(<= main_~i~0 55), 63477#(<= main_~i~0 56), 63478#(<= main_~i~0 57), 63479#(<= main_~i~0 58), 63480#(<= main_~i~0 59), 63481#(<= main_~i~0 60), 63482#(<= main_~i~0 61), 63483#(<= main_~i~0 62), 63484#(<= main_~i~0 63), 63485#(<= main_~i~0 64), 63486#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 63487#(and (<= 1 main_~i~0) (<= main_~i~0 65))] [2018-04-11 13:07:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:50,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-11 13:07:50,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-11 13:07:50,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 13:07:50,282 INFO L87 Difference]: Start difference. First operand 806 states and 936 transitions. Second operand 69 states. [2018-04-11 13:07:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:53,040 INFO L93 Difference]: Finished difference Result 886 states and 1019 transitions. [2018-04-11 13:07:53,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-11 13:07:53,040 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 332 [2018-04-11 13:07:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:53,041 INFO L225 Difference]: With dead ends: 886 [2018-04-11 13:07:53,042 INFO L226 Difference]: Without dead ends: 886 [2018-04-11 13:07:53,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=6636, Invalid=11186, Unknown=0, NotChecked=0, Total=17822 [2018-04-11 13:07:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-04-11 13:07:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 818. [2018-04-11 13:07:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-04-11 13:07:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 950 transitions. [2018-04-11 13:07:53,046 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 950 transitions. Word has length 332 [2018-04-11 13:07:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:53,047 INFO L459 AbstractCegarLoop]: Abstraction has 818 states and 950 transitions. [2018-04-11 13:07:53,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-11 13:07:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 950 transitions. [2018-04-11 13:07:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-11 13:07:53,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:53,048 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:53,048 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2041579128, now seen corresponding path program 66 times [2018-04-11 13:07:53,048 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:53,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:54,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:54,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-11 13:07:54,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:54,299 INFO L182 omatonBuilderFactory]: Interpolants [65322#true, 65323#false, 65324#(<= main_~i~0 0), 65325#(<= main_~i~0 1), 65326#(<= main_~i~0 2), 65327#(<= main_~i~0 3), 65328#(<= main_~i~0 4), 65329#(<= main_~i~0 5), 65330#(<= main_~i~0 6), 65331#(<= main_~i~0 7), 65332#(<= main_~i~0 8), 65333#(<= main_~i~0 9), 65334#(<= main_~i~0 10), 65335#(<= main_~i~0 11), 65336#(<= main_~i~0 12), 65337#(<= main_~i~0 13), 65338#(<= main_~i~0 14), 65339#(<= main_~i~0 15), 65340#(<= main_~i~0 16), 65341#(<= main_~i~0 17), 65342#(<= main_~i~0 18), 65343#(<= main_~i~0 19), 65344#(<= main_~i~0 20), 65345#(<= main_~i~0 21), 65346#(<= main_~i~0 22), 65347#(<= main_~i~0 23), 65348#(<= main_~i~0 24), 65349#(<= main_~i~0 25), 65350#(<= main_~i~0 26), 65351#(<= main_~i~0 27), 65352#(<= main_~i~0 28), 65353#(<= main_~i~0 29), 65354#(<= main_~i~0 30), 65355#(<= main_~i~0 31), 65356#(<= main_~i~0 32), 65357#(<= main_~i~0 33), 65358#(<= main_~i~0 34), 65359#(<= main_~i~0 35), 65360#(<= main_~i~0 36), 65361#(<= main_~i~0 37), 65362#(<= main_~i~0 38), 65363#(<= main_~i~0 39), 65364#(<= main_~i~0 40), 65365#(<= main_~i~0 41), 65366#(<= main_~i~0 42), 65367#(<= main_~i~0 43), 65368#(<= main_~i~0 44), 65369#(<= main_~i~0 45), 65370#(<= main_~i~0 46), 65371#(<= main_~i~0 47), 65372#(<= main_~i~0 48), 65373#(<= main_~i~0 49), 65374#(<= main_~i~0 50), 65375#(<= main_~i~0 51), 65376#(<= main_~i~0 52), 65377#(<= main_~i~0 53), 65378#(<= main_~i~0 54), 65379#(<= main_~i~0 55), 65380#(<= main_~i~0 56), 65381#(<= main_~i~0 57), 65382#(<= main_~i~0 58), 65383#(<= main_~i~0 59), 65384#(<= main_~i~0 60), 65385#(<= main_~i~0 61), 65386#(<= main_~i~0 62), 65387#(<= main_~i~0 63), 65388#(<= main_~i~0 64), 65389#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 65390#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 65391#(and (<= main_~i~0 66) (<= 2 main_~i~0))] [2018-04-11 13:07:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:54,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-11 13:07:54,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-11 13:07:54,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2218, Invalid=2612, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 13:07:54,300 INFO L87 Difference]: Start difference. First operand 818 states and 950 transitions. Second operand 70 states. [2018-04-11 13:07:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:07:57,299 INFO L93 Difference]: Finished difference Result 899 states and 1034 transitions. [2018-04-11 13:07:57,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-11 13:07:57,300 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 337 [2018-04-11 13:07:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:07:57,301 INFO L225 Difference]: With dead ends: 899 [2018-04-11 13:07:57,301 INFO L226 Difference]: Without dead ends: 899 [2018-04-11 13:07:57,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6705, Invalid=11655, Unknown=0, NotChecked=0, Total=18360 [2018-04-11 13:07:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-11 13:07:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 830. [2018-04-11 13:07:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-11 13:07:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 964 transitions. [2018-04-11 13:07:57,306 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 964 transitions. Word has length 337 [2018-04-11 13:07:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:07:57,307 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 964 transitions. [2018-04-11 13:07:57,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-11 13:07:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 964 transitions. [2018-04-11 13:07:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-11 13:07:57,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:07:57,308 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-11 13:07:57,308 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:07:57,308 INFO L82 PathProgramCache]: Analyzing trace with hash -452516747, now seen corresponding path program 67 times [2018-04-11 13:07:57,308 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:07:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:07:57,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:07:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:58,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:07:58,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-11 13:07:58,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:07:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:58,708 INFO L182 omatonBuilderFactory]: Interpolants [67253#true, 67255#(<= main_~i~0 0), 67254#false, 67257#(<= main_~i~0 2), 67256#(<= main_~i~0 1), 67259#(<= main_~i~0 4), 67258#(<= main_~i~0 3), 67261#(<= main_~i~0 6), 67260#(<= main_~i~0 5), 67263#(<= main_~i~0 8), 67262#(<= main_~i~0 7), 67265#(<= main_~i~0 10), 67264#(<= main_~i~0 9), 67267#(<= main_~i~0 12), 67266#(<= main_~i~0 11), 67269#(<= main_~i~0 14), 67268#(<= main_~i~0 13), 67271#(<= main_~i~0 16), 67270#(<= main_~i~0 15), 67273#(<= main_~i~0 18), 67272#(<= main_~i~0 17), 67275#(<= main_~i~0 20), 67274#(<= main_~i~0 19), 67277#(<= main_~i~0 22), 67276#(<= main_~i~0 21), 67279#(<= main_~i~0 24), 67278#(<= main_~i~0 23), 67281#(<= main_~i~0 26), 67280#(<= main_~i~0 25), 67283#(<= main_~i~0 28), 67282#(<= main_~i~0 27), 67285#(<= main_~i~0 30), 67284#(<= main_~i~0 29), 67287#(<= main_~i~0 32), 67286#(<= main_~i~0 31), 67289#(<= main_~i~0 34), 67288#(<= main_~i~0 33), 67291#(<= main_~i~0 36), 67290#(<= main_~i~0 35), 67293#(<= main_~i~0 38), 67292#(<= main_~i~0 37), 67295#(<= main_~i~0 40), 67294#(<= main_~i~0 39), 67297#(<= main_~i~0 42), 67296#(<= main_~i~0 41), 67299#(<= main_~i~0 44), 67298#(<= main_~i~0 43), 67301#(<= main_~i~0 46), 67300#(<= main_~i~0 45), 67303#(<= main_~i~0 48), 67302#(<= main_~i~0 47), 67305#(<= main_~i~0 50), 67304#(<= main_~i~0 49), 67307#(<= main_~i~0 52), 67306#(<= main_~i~0 51), 67309#(<= main_~i~0 54), 67308#(<= main_~i~0 53), 67311#(<= main_~i~0 56), 67310#(<= main_~i~0 55), 67313#(<= main_~i~0 58), 67312#(<= main_~i~0 57), 67315#(<= main_~i~0 60), 67314#(<= main_~i~0 59), 67317#(<= main_~i~0 62), 67316#(<= main_~i~0 61), 67319#(<= main_~i~0 64), 67318#(<= main_~i~0 63), 67321#(<= main_~i~0 66), 67320#(<= main_~i~0 65), 67323#(and (<= main_~i~0 67) (<= 1 main_~i~0)), 67322#(and (<= main_~i~0 66) (<= 0 main_~i~0))] [2018-04-11 13:07:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:07:58,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-11 13:07:58,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-11 13:07:58,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 13:07:58,710 INFO L87 Difference]: Start difference. First operand 830 states and 964 transitions. Second operand 71 states. [2018-04-11 13:08:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:01,374 INFO L93 Difference]: Finished difference Result 912 states and 1049 transitions. [2018-04-11 13:08:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-11 13:08:01,374 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-04-11 13:08:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:01,375 INFO L225 Difference]: With dead ends: 912 [2018-04-11 13:08:01,375 INFO L226 Difference]: Without dead ends: 912 [2018-04-11 13:08:01,376 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-11 13:08:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-04-11 13:08:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 842. [2018-04-11 13:08:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-04-11 13:08:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 978 transitions. [2018-04-11 13:08:01,380 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 978 transitions. Word has length 342 [2018-04-11 13:08:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:01,380 INFO L459 AbstractCegarLoop]: Abstraction has 842 states and 978 transitions. [2018-04-11 13:08:01,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-11 13:08:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 978 transitions. [2018-04-11 13:08:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-11 13:08:01,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:01,382 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:01,382 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1621542312, now seen corresponding path program 68 times [2018-04-11 13:08:01,382 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:01,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:03,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:03,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-11 13:08:03,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:03,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-11 13:08:03,014 INFO L182 omatonBuilderFactory]: Interpolants [69249#(<= main_~i~0 35), 69248#(<= main_~i~0 34), 69251#(<= main_~i~0 37), 69250#(<= main_~i~0 36), 69253#(<= main_~i~0 39), 69252#(<= main_~i~0 38), 69255#(<= main_~i~0 41), 69254#(<= main_~i~0 40), 69257#(<= main_~i~0 43), 69256#(<= main_~i~0 42), 69259#(<= main_~i~0 45), 69258#(<= main_~i~0 44), 69261#(<= main_~i~0 47), 69260#(<= main_~i~0 46), 69263#(<= main_~i~0 49), 69262#(<= main_~i~0 48), 69265#(<= main_~i~0 51), 69264#(<= main_~i~0 50), 69267#(<= main_~i~0 53), 69266#(<= main_~i~0 52), 69269#(<= main_~i~0 55), 69268#(<= main_~i~0 54), 69271#(<= main_~i~0 57), 69270#(<= main_~i~0 56), 69273#(<= main_~i~0 59), 69272#(<= main_~i~0 58), 69275#(<= main_~i~0 61), 69274#(<= main_~i~0 60), 69277#(<= main_~i~0 63), 69276#(<= main_~i~0 62), 69279#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 69278#(<= main_~i~0 64), 69281#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 69280#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 69283#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 69282#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 69213#false, 69212#true, 69215#(<= main_~i~0 1), 69214#(<= main_~i~0 0), 69217#(<= main_~i~0 3), 69216#(<= main_~i~0 2), 69219#(<= main_~i~0 5), 69218#(<= main_~i~0 4), 69221#(<= main_~i~0 7), 69220#(<= main_~i~0 6), 69223#(<= main_~i~0 9), 69222#(<= main_~i~0 8), 69225#(<= main_~i~0 11), 69224#(<= main_~i~0 10), 69227#(<= main_~i~0 13), 69226#(<= main_~i~0 12), 69229#(<= main_~i~0 15), 69228#(<= main_~i~0 14), 69231#(<= main_~i~0 17), 69230#(<= main_~i~0 16), 69233#(<= main_~i~0 19), 69232#(<= main_~i~0 18), 69235#(<= main_~i~0 21), 69234#(<= main_~i~0 20), 69237#(<= main_~i~0 23), 69236#(<= main_~i~0 22), 69239#(<= main_~i~0 25), 69238#(<= main_~i~0 24), 69241#(<= main_~i~0 27), 69240#(<= main_~i~0 26), 69243#(<= main_~i~0 29), 69242#(<= main_~i~0 28), 69245#(<= main_~i~0 31), 69244#(<= main_~i~0 30), 69247#(<= main_~i~0 33), 69246#(<= main_~i~0 32)] [2018-04-11 13:08:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:03,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 13:08:03,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 13:08:03,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 13:08:03,015 INFO L87 Difference]: Start difference. First operand 842 states and 978 transitions. Second operand 72 states. [2018-04-11 13:08:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:06,024 INFO L93 Difference]: Finished difference Result 925 states and 1064 transitions. [2018-04-11 13:08:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-11 13:08:06,024 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-04-11 13:08:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:06,025 INFO L225 Difference]: With dead ends: 925 [2018-04-11 13:08:06,025 INFO L226 Difference]: Without dead ends: 925 [2018-04-11 13:08:06,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-04-11 13:08:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-11 13:08:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 854. [2018-04-11 13:08:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-04-11 13:08:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 992 transitions. [2018-04-11 13:08:06,032 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 992 transitions. Word has length 347 [2018-04-11 13:08:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:06,033 INFO L459 AbstractCegarLoop]: Abstraction has 854 states and 992 transitions. [2018-04-11 13:08:06,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 13:08:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 992 transitions. [2018-04-11 13:08:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-11 13:08:06,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:06,034 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:06,034 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1672146005, now seen corresponding path program 69 times [2018-04-11 13:08:06,035 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:06,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:07,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:07,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-11 13:08:07,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:07,442 INFO L182 omatonBuilderFactory]: Interpolants [71199#true, 71201#(<= main_~i~0 0), 71200#false, 71203#(<= main_~i~0 2), 71202#(<= main_~i~0 1), 71205#(<= main_~i~0 4), 71204#(<= main_~i~0 3), 71207#(<= main_~i~0 6), 71206#(<= main_~i~0 5), 71209#(<= main_~i~0 8), 71208#(<= main_~i~0 7), 71211#(<= main_~i~0 10), 71210#(<= main_~i~0 9), 71213#(<= main_~i~0 12), 71212#(<= main_~i~0 11), 71215#(<= main_~i~0 14), 71214#(<= main_~i~0 13), 71217#(<= main_~i~0 16), 71216#(<= main_~i~0 15), 71219#(<= main_~i~0 18), 71218#(<= main_~i~0 17), 71221#(<= main_~i~0 20), 71220#(<= main_~i~0 19), 71223#(<= main_~i~0 22), 71222#(<= main_~i~0 21), 71225#(<= main_~i~0 24), 71224#(<= main_~i~0 23), 71227#(<= main_~i~0 26), 71226#(<= main_~i~0 25), 71229#(<= main_~i~0 28), 71228#(<= main_~i~0 27), 71231#(<= main_~i~0 30), 71230#(<= main_~i~0 29), 71233#(<= main_~i~0 32), 71232#(<= main_~i~0 31), 71235#(<= main_~i~0 34), 71234#(<= main_~i~0 33), 71237#(<= main_~i~0 36), 71236#(<= main_~i~0 35), 71239#(<= main_~i~0 38), 71238#(<= main_~i~0 37), 71241#(<= main_~i~0 40), 71240#(<= main_~i~0 39), 71243#(<= main_~i~0 42), 71242#(<= main_~i~0 41), 71245#(<= main_~i~0 44), 71244#(<= main_~i~0 43), 71247#(<= main_~i~0 46), 71246#(<= main_~i~0 45), 71249#(<= main_~i~0 48), 71248#(<= main_~i~0 47), 71251#(<= main_~i~0 50), 71250#(<= main_~i~0 49), 71253#(<= main_~i~0 52), 71252#(<= main_~i~0 51), 71255#(<= main_~i~0 54), 71254#(<= main_~i~0 53), 71257#(<= main_~i~0 56), 71256#(<= main_~i~0 55), 71259#(<= main_~i~0 58), 71258#(<= main_~i~0 57), 71261#(<= main_~i~0 60), 71260#(<= main_~i~0 59), 71263#(<= main_~i~0 62), 71262#(<= main_~i~0 61), 71265#(<= main_~i~0 64), 71264#(<= main_~i~0 63), 71267#(<= main_~i~0 66), 71266#(<= main_~i~0 65), 71269#(<= main_~i~0 68), 71268#(<= main_~i~0 67), 71271#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 71270#(and (<= 0 main_~i~0) (<= main_~i~0 68))] [2018-04-11 13:08:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:07,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-11 13:08:07,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-11 13:08:07,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 13:08:07,443 INFO L87 Difference]: Start difference. First operand 854 states and 992 transitions. Second operand 73 states. [2018-04-11 13:08:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:10,276 INFO L93 Difference]: Finished difference Result 938 states and 1079 transitions. [2018-04-11 13:08:10,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-11 13:08:10,276 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-04-11 13:08:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:10,277 INFO L225 Difference]: With dead ends: 938 [2018-04-11 13:08:10,277 INFO L226 Difference]: Without dead ends: 938 [2018-04-11 13:08:10,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-04-11 13:08:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-04-11 13:08:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 866. [2018-04-11 13:08:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-04-11 13:08:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1006 transitions. [2018-04-11 13:08:10,283 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1006 transitions. Word has length 352 [2018-04-11 13:08:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:10,283 INFO L459 AbstractCegarLoop]: Abstraction has 866 states and 1006 transitions. [2018-04-11 13:08:10,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-11 13:08:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1006 transitions. [2018-04-11 13:08:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-11 13:08:10,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:10,284 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:10,284 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1568347704, now seen corresponding path program 70 times [2018-04-11 13:08:10,285 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:10,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:11,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:11,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-11 13:08:11,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:11,691 INFO L182 omatonBuilderFactory]: Interpolants [73217#(<= main_~i~0 1), 73216#(<= main_~i~0 0), 73219#(<= main_~i~0 3), 73218#(<= main_~i~0 2), 73221#(<= main_~i~0 5), 73220#(<= main_~i~0 4), 73223#(<= main_~i~0 7), 73222#(<= main_~i~0 6), 73225#(<= main_~i~0 9), 73224#(<= main_~i~0 8), 73227#(<= main_~i~0 11), 73226#(<= main_~i~0 10), 73229#(<= main_~i~0 13), 73228#(<= main_~i~0 12), 73231#(<= main_~i~0 15), 73230#(<= main_~i~0 14), 73233#(<= main_~i~0 17), 73232#(<= main_~i~0 16), 73235#(<= main_~i~0 19), 73234#(<= main_~i~0 18), 73237#(<= main_~i~0 21), 73236#(<= main_~i~0 20), 73239#(<= main_~i~0 23), 73238#(<= main_~i~0 22), 73241#(<= main_~i~0 25), 73240#(<= main_~i~0 24), 73243#(<= main_~i~0 27), 73242#(<= main_~i~0 26), 73245#(<= main_~i~0 29), 73244#(<= main_~i~0 28), 73247#(<= main_~i~0 31), 73246#(<= main_~i~0 30), 73249#(<= main_~i~0 33), 73248#(<= main_~i~0 32), 73251#(<= main_~i~0 35), 73250#(<= main_~i~0 34), 73253#(<= main_~i~0 37), 73252#(<= main_~i~0 36), 73255#(<= main_~i~0 39), 73254#(<= main_~i~0 38), 73257#(<= main_~i~0 41), 73256#(<= main_~i~0 40), 73259#(<= main_~i~0 43), 73258#(<= main_~i~0 42), 73261#(<= main_~i~0 45), 73260#(<= main_~i~0 44), 73263#(<= main_~i~0 47), 73262#(<= main_~i~0 46), 73265#(<= main_~i~0 49), 73264#(<= main_~i~0 48), 73267#(<= main_~i~0 51), 73266#(<= main_~i~0 50), 73269#(<= main_~i~0 53), 73268#(<= main_~i~0 52), 73271#(<= main_~i~0 55), 73270#(<= main_~i~0 54), 73273#(<= main_~i~0 57), 73272#(<= main_~i~0 56), 73275#(<= main_~i~0 59), 73274#(<= main_~i~0 58), 73277#(<= main_~i~0 61), 73276#(<= main_~i~0 60), 73279#(<= main_~i~0 63), 73278#(<= main_~i~0 62), 73281#(<= main_~i~0 65), 73280#(<= main_~i~0 64), 73283#(<= main_~i~0 67), 73282#(<= main_~i~0 66), 73285#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 73284#(<= main_~i~0 68), 73287#(and (<= 2 main_~i~0) (<= main_~i~0 70)), 73286#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 73215#false, 73214#true] [2018-04-11 13:08:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:11,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-11 13:08:11,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-11 13:08:11,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 13:08:11,693 INFO L87 Difference]: Start difference. First operand 866 states and 1006 transitions. Second operand 74 states. [2018-04-11 13:08:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:14,722 INFO L93 Difference]: Finished difference Result 951 states and 1094 transitions. [2018-04-11 13:08:14,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-11 13:08:14,722 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-04-11 13:08:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:14,724 INFO L225 Difference]: With dead ends: 951 [2018-04-11 13:08:14,724 INFO L226 Difference]: Without dead ends: 951 [2018-04-11 13:08:14,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-04-11 13:08:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-04-11 13:08:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 878. [2018-04-11 13:08:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-04-11 13:08:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1020 transitions. [2018-04-11 13:08:14,730 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1020 transitions. Word has length 357 [2018-04-11 13:08:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:14,730 INFO L459 AbstractCegarLoop]: Abstraction has 878 states and 1020 transitions. [2018-04-11 13:08:14,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-11 13:08:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1020 transitions. [2018-04-11 13:08:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-11 13:08:14,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:14,732 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:14,732 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1100897333, now seen corresponding path program 71 times [2018-04-11 13:08:14,732 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:14,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:16,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:16,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-11 13:08:16,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:16,215 INFO L182 omatonBuilderFactory]: Interpolants [75265#(<= main_~i~0 6), 75264#(<= main_~i~0 5), 75267#(<= main_~i~0 8), 75266#(<= main_~i~0 7), 75269#(<= main_~i~0 10), 75268#(<= main_~i~0 9), 75271#(<= main_~i~0 12), 75270#(<= main_~i~0 11), 75273#(<= main_~i~0 14), 75272#(<= main_~i~0 13), 75275#(<= main_~i~0 16), 75274#(<= main_~i~0 15), 75277#(<= main_~i~0 18), 75276#(<= main_~i~0 17), 75279#(<= main_~i~0 20), 75278#(<= main_~i~0 19), 75281#(<= main_~i~0 22), 75280#(<= main_~i~0 21), 75283#(<= main_~i~0 24), 75282#(<= main_~i~0 23), 75285#(<= main_~i~0 26), 75284#(<= main_~i~0 25), 75287#(<= main_~i~0 28), 75286#(<= main_~i~0 27), 75289#(<= main_~i~0 30), 75288#(<= main_~i~0 29), 75291#(<= main_~i~0 32), 75290#(<= main_~i~0 31), 75293#(<= main_~i~0 34), 75292#(<= main_~i~0 33), 75295#(<= main_~i~0 36), 75294#(<= main_~i~0 35), 75297#(<= main_~i~0 38), 75296#(<= main_~i~0 37), 75299#(<= main_~i~0 40), 75298#(<= main_~i~0 39), 75301#(<= main_~i~0 42), 75300#(<= main_~i~0 41), 75303#(<= main_~i~0 44), 75302#(<= main_~i~0 43), 75305#(<= main_~i~0 46), 75304#(<= main_~i~0 45), 75307#(<= main_~i~0 48), 75306#(<= main_~i~0 47), 75309#(<= main_~i~0 50), 75308#(<= main_~i~0 49), 75311#(<= main_~i~0 52), 75310#(<= main_~i~0 51), 75313#(<= main_~i~0 54), 75312#(<= main_~i~0 53), 75315#(<= main_~i~0 56), 75314#(<= main_~i~0 55), 75317#(<= main_~i~0 58), 75316#(<= main_~i~0 57), 75319#(<= main_~i~0 60), 75318#(<= main_~i~0 59), 75321#(<= main_~i~0 62), 75320#(<= main_~i~0 61), 75323#(<= main_~i~0 64), 75322#(<= main_~i~0 63), 75325#(<= main_~i~0 66), 75324#(<= main_~i~0 65), 75327#(<= main_~i~0 68), 75326#(<= main_~i~0 67), 75329#(<= main_~i~0 70), 75328#(<= main_~i~0 69), 75331#(and (<= 1 main_~i~0) (<= main_~i~0 71)), 75330#(and (<= 0 main_~i~0) (<= main_~i~0 70)), 75257#true, 75259#(<= main_~i~0 0), 75258#false, 75261#(<= main_~i~0 2), 75260#(<= main_~i~0 1), 75263#(<= main_~i~0 4), 75262#(<= main_~i~0 3)] [2018-04-11 13:08:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:16,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-11 13:08:16,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-11 13:08:16,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2633, Invalid=2917, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 13:08:16,217 INFO L87 Difference]: Start difference. First operand 878 states and 1020 transitions. Second operand 75 states. [2018-04-11 13:08:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:19,189 INFO L93 Difference]: Finished difference Result 964 states and 1109 transitions. [2018-04-11 13:08:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-11 13:08:19,189 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 362 [2018-04-11 13:08:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:19,190 INFO L225 Difference]: With dead ends: 964 [2018-04-11 13:08:19,191 INFO L226 Difference]: Without dead ends: 964 [2018-04-11 13:08:19,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7887, Invalid=13283, Unknown=0, NotChecked=0, Total=21170 [2018-04-11 13:08:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-04-11 13:08:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 890. [2018-04-11 13:08:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-11 13:08:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1034 transitions. [2018-04-11 13:08:19,196 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1034 transitions. Word has length 362 [2018-04-11 13:08:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:19,196 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 1034 transitions. [2018-04-11 13:08:19,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-11 13:08:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1034 transitions. [2018-04-11 13:08:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-11 13:08:19,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:19,198 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:19,198 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1822189032, now seen corresponding path program 72 times [2018-04-11 13:08:19,198 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:19,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:20,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:20,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-11 13:08:20,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:20,803 INFO L182 omatonBuilderFactory]: Interpolants [77329#false, 77328#true, 77331#(<= main_~i~0 1), 77330#(<= main_~i~0 0), 77333#(<= main_~i~0 3), 77332#(<= main_~i~0 2), 77335#(<= main_~i~0 5), 77334#(<= main_~i~0 4), 77337#(<= main_~i~0 7), 77336#(<= main_~i~0 6), 77339#(<= main_~i~0 9), 77338#(<= main_~i~0 8), 77341#(<= main_~i~0 11), 77340#(<= main_~i~0 10), 77343#(<= main_~i~0 13), 77342#(<= main_~i~0 12), 77345#(<= main_~i~0 15), 77344#(<= main_~i~0 14), 77347#(<= main_~i~0 17), 77346#(<= main_~i~0 16), 77349#(<= main_~i~0 19), 77348#(<= main_~i~0 18), 77351#(<= main_~i~0 21), 77350#(<= main_~i~0 20), 77353#(<= main_~i~0 23), 77352#(<= main_~i~0 22), 77355#(<= main_~i~0 25), 77354#(<= main_~i~0 24), 77357#(<= main_~i~0 27), 77356#(<= main_~i~0 26), 77359#(<= main_~i~0 29), 77358#(<= main_~i~0 28), 77361#(<= main_~i~0 31), 77360#(<= main_~i~0 30), 77363#(<= main_~i~0 33), 77362#(<= main_~i~0 32), 77365#(<= main_~i~0 35), 77364#(<= main_~i~0 34), 77367#(<= main_~i~0 37), 77366#(<= main_~i~0 36), 77369#(<= main_~i~0 39), 77368#(<= main_~i~0 38), 77371#(<= main_~i~0 41), 77370#(<= main_~i~0 40), 77373#(<= main_~i~0 43), 77372#(<= main_~i~0 42), 77375#(<= main_~i~0 45), 77374#(<= main_~i~0 44), 77377#(<= main_~i~0 47), 77376#(<= main_~i~0 46), 77379#(<= main_~i~0 49), 77378#(<= main_~i~0 48), 77381#(<= main_~i~0 51), 77380#(<= main_~i~0 50), 77383#(<= main_~i~0 53), 77382#(<= main_~i~0 52), 77385#(<= main_~i~0 55), 77384#(<= main_~i~0 54), 77387#(<= main_~i~0 57), 77386#(<= main_~i~0 56), 77389#(<= main_~i~0 59), 77388#(<= main_~i~0 58), 77391#(<= main_~i~0 61), 77390#(<= main_~i~0 60), 77393#(<= main_~i~0 63), 77392#(<= main_~i~0 62), 77395#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 77394#(<= main_~i~0 64), 77397#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 77396#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 77399#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 77398#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 77401#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 77400#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 77403#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 77402#(and (<= 7 main_~i~0) (<= main_~i~0 71))] [2018-04-11 13:08:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:20,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-11 13:08:20,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-11 13:08:20,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3470, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 13:08:20,804 INFO L87 Difference]: Start difference. First operand 890 states and 1034 transitions. Second operand 76 states. [2018-04-11 13:08:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:24,864 INFO L93 Difference]: Finished difference Result 977 states and 1124 transitions. [2018-04-11 13:08:24,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-11 13:08:24,864 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 367 [2018-04-11 13:08:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:24,865 INFO L225 Difference]: With dead ends: 977 [2018-04-11 13:08:24,865 INFO L226 Difference]: Without dead ends: 977 [2018-04-11 13:08:24,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7119, Invalid=14637, Unknown=0, NotChecked=0, Total=21756 [2018-04-11 13:08:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-04-11 13:08:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 902. [2018-04-11 13:08:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-04-11 13:08:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1048 transitions. [2018-04-11 13:08:24,871 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1048 transitions. Word has length 367 [2018-04-11 13:08:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:24,871 INFO L459 AbstractCegarLoop]: Abstraction has 902 states and 1048 transitions. [2018-04-11 13:08:24,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-11 13:08:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1048 transitions. [2018-04-11 13:08:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-11 13:08:24,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:24,872 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:24,872 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash -43027435, now seen corresponding path program 73 times [2018-04-11 13:08:24,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:24,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:26,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:26,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-11 13:08:26,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:26,457 INFO L182 omatonBuilderFactory]: Interpolants [79489#(<= main_~i~0 60), 79488#(<= main_~i~0 59), 79491#(<= main_~i~0 62), 79490#(<= main_~i~0 61), 79493#(<= main_~i~0 64), 79492#(<= main_~i~0 63), 79495#(<= main_~i~0 66), 79494#(<= main_~i~0 65), 79497#(<= main_~i~0 68), 79496#(<= main_~i~0 67), 79499#(<= main_~i~0 70), 79498#(<= main_~i~0 69), 79501#(<= main_~i~0 72), 79500#(<= main_~i~0 71), 79503#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 79502#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 79427#true, 79429#(<= main_~i~0 0), 79428#false, 79431#(<= main_~i~0 2), 79430#(<= main_~i~0 1), 79433#(<= main_~i~0 4), 79432#(<= main_~i~0 3), 79435#(<= main_~i~0 6), 79434#(<= main_~i~0 5), 79437#(<= main_~i~0 8), 79436#(<= main_~i~0 7), 79439#(<= main_~i~0 10), 79438#(<= main_~i~0 9), 79441#(<= main_~i~0 12), 79440#(<= main_~i~0 11), 79443#(<= main_~i~0 14), 79442#(<= main_~i~0 13), 79445#(<= main_~i~0 16), 79444#(<= main_~i~0 15), 79447#(<= main_~i~0 18), 79446#(<= main_~i~0 17), 79449#(<= main_~i~0 20), 79448#(<= main_~i~0 19), 79451#(<= main_~i~0 22), 79450#(<= main_~i~0 21), 79453#(<= main_~i~0 24), 79452#(<= main_~i~0 23), 79455#(<= main_~i~0 26), 79454#(<= main_~i~0 25), 79457#(<= main_~i~0 28), 79456#(<= main_~i~0 27), 79459#(<= main_~i~0 30), 79458#(<= main_~i~0 29), 79461#(<= main_~i~0 32), 79460#(<= main_~i~0 31), 79463#(<= main_~i~0 34), 79462#(<= main_~i~0 33), 79465#(<= main_~i~0 36), 79464#(<= main_~i~0 35), 79467#(<= main_~i~0 38), 79466#(<= main_~i~0 37), 79469#(<= main_~i~0 40), 79468#(<= main_~i~0 39), 79471#(<= main_~i~0 42), 79470#(<= main_~i~0 41), 79473#(<= main_~i~0 44), 79472#(<= main_~i~0 43), 79475#(<= main_~i~0 46), 79474#(<= main_~i~0 45), 79477#(<= main_~i~0 48), 79476#(<= main_~i~0 47), 79479#(<= main_~i~0 50), 79478#(<= main_~i~0 49), 79481#(<= main_~i~0 52), 79480#(<= main_~i~0 51), 79483#(<= main_~i~0 54), 79482#(<= main_~i~0 53), 79485#(<= main_~i~0 56), 79484#(<= main_~i~0 55), 79487#(<= main_~i~0 58), 79486#(<= main_~i~0 57)] [2018-04-11 13:08:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:26,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-11 13:08:26,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-11 13:08:26,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 13:08:26,459 INFO L87 Difference]: Start difference. First operand 902 states and 1048 transitions. Second operand 77 states. [2018-04-11 13:08:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:29,591 INFO L93 Difference]: Finished difference Result 990 states and 1139 transitions. [2018-04-11 13:08:29,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-11 13:08:29,592 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-04-11 13:08:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:29,593 INFO L225 Difference]: With dead ends: 990 [2018-04-11 13:08:29,593 INFO L226 Difference]: Without dead ends: 990 [2018-04-11 13:08:29,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-04-11 13:08:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-04-11 13:08:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 914. [2018-04-11 13:08:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-11 13:08:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1062 transitions. [2018-04-11 13:08:29,598 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1062 transitions. Word has length 372 [2018-04-11 13:08:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:29,598 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1062 transitions. [2018-04-11 13:08:29,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-11 13:08:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1062 transitions. [2018-04-11 13:08:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-11 13:08:29,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:29,600 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:29,600 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash 689912328, now seen corresponding path program 74 times [2018-04-11 13:08:29,600 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:29,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:31,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:31,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-11 13:08:31,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:31,216 INFO L182 omatonBuilderFactory]: Interpolants [81555#false, 81554#true, 81557#(<= main_~i~0 1), 81556#(<= main_~i~0 0), 81559#(<= main_~i~0 3), 81558#(<= main_~i~0 2), 81561#(<= main_~i~0 5), 81560#(<= main_~i~0 4), 81563#(<= main_~i~0 7), 81562#(<= main_~i~0 6), 81565#(<= main_~i~0 9), 81564#(<= main_~i~0 8), 81567#(<= main_~i~0 11), 81566#(<= main_~i~0 10), 81569#(<= main_~i~0 13), 81568#(<= main_~i~0 12), 81571#(<= main_~i~0 15), 81570#(<= main_~i~0 14), 81573#(<= main_~i~0 17), 81572#(<= main_~i~0 16), 81575#(<= main_~i~0 19), 81574#(<= main_~i~0 18), 81577#(<= main_~i~0 21), 81576#(<= main_~i~0 20), 81579#(<= main_~i~0 23), 81578#(<= main_~i~0 22), 81581#(<= main_~i~0 25), 81580#(<= main_~i~0 24), 81583#(<= main_~i~0 27), 81582#(<= main_~i~0 26), 81585#(<= main_~i~0 29), 81584#(<= main_~i~0 28), 81587#(<= main_~i~0 31), 81586#(<= main_~i~0 30), 81589#(<= main_~i~0 33), 81588#(<= main_~i~0 32), 81591#(<= main_~i~0 35), 81590#(<= main_~i~0 34), 81593#(<= main_~i~0 37), 81592#(<= main_~i~0 36), 81595#(<= main_~i~0 39), 81594#(<= main_~i~0 38), 81597#(<= main_~i~0 41), 81596#(<= main_~i~0 40), 81599#(<= main_~i~0 43), 81598#(<= main_~i~0 42), 81601#(<= main_~i~0 45), 81600#(<= main_~i~0 44), 81603#(<= main_~i~0 47), 81602#(<= main_~i~0 46), 81605#(<= main_~i~0 49), 81604#(<= main_~i~0 48), 81607#(<= main_~i~0 51), 81606#(<= main_~i~0 50), 81609#(<= main_~i~0 53), 81608#(<= main_~i~0 52), 81611#(<= main_~i~0 55), 81610#(<= main_~i~0 54), 81613#(<= main_~i~0 57), 81612#(<= main_~i~0 56), 81615#(<= main_~i~0 59), 81614#(<= main_~i~0 58), 81617#(<= main_~i~0 61), 81616#(<= main_~i~0 60), 81619#(<= main_~i~0 63), 81618#(<= main_~i~0 62), 81621#(<= main_~i~0 65), 81620#(<= main_~i~0 64), 81623#(<= main_~i~0 67), 81622#(<= main_~i~0 66), 81625#(<= main_~i~0 69), 81624#(<= main_~i~0 68), 81627#(<= main_~i~0 71), 81626#(<= main_~i~0 70), 81629#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 81628#(<= main_~i~0 72), 81631#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 81630#(and (<= 1 main_~i~0) (<= main_~i~0 73))] [2018-04-11 13:08:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:31,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 13:08:31,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 13:08:31,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 13:08:31,218 INFO L87 Difference]: Start difference. First operand 914 states and 1062 transitions. Second operand 78 states. [2018-04-11 13:08:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:34,609 INFO L93 Difference]: Finished difference Result 1003 states and 1154 transitions. [2018-04-11 13:08:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-11 13:08:34,609 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-04-11 13:08:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:34,610 INFO L225 Difference]: With dead ends: 1003 [2018-04-11 13:08:34,610 INFO L226 Difference]: Without dead ends: 1003 [2018-04-11 13:08:34,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-11 13:08:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-04-11 13:08:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 926. [2018-04-11 13:08:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-04-11 13:08:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1076 transitions. [2018-04-11 13:08:34,616 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1076 transitions. Word has length 377 [2018-04-11 13:08:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:34,616 INFO L459 AbstractCegarLoop]: Abstraction has 926 states and 1076 transitions. [2018-04-11 13:08:34,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-11 13:08:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1076 transitions. [2018-04-11 13:08:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-11 13:08:34,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:34,617 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:34,617 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1137953803, now seen corresponding path program 75 times [2018-04-11 13:08:34,618 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:34,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:36,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:36,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-11 13:08:36,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:36,307 INFO L182 omatonBuilderFactory]: Interpolants [83713#(<= main_~i~0 2), 83712#(<= main_~i~0 1), 83715#(<= main_~i~0 4), 83714#(<= main_~i~0 3), 83717#(<= main_~i~0 6), 83716#(<= main_~i~0 5), 83719#(<= main_~i~0 8), 83718#(<= main_~i~0 7), 83721#(<= main_~i~0 10), 83720#(<= main_~i~0 9), 83723#(<= main_~i~0 12), 83722#(<= main_~i~0 11), 83725#(<= main_~i~0 14), 83724#(<= main_~i~0 13), 83727#(<= main_~i~0 16), 83726#(<= main_~i~0 15), 83729#(<= main_~i~0 18), 83728#(<= main_~i~0 17), 83731#(<= main_~i~0 20), 83730#(<= main_~i~0 19), 83733#(<= main_~i~0 22), 83732#(<= main_~i~0 21), 83735#(<= main_~i~0 24), 83734#(<= main_~i~0 23), 83737#(<= main_~i~0 26), 83736#(<= main_~i~0 25), 83739#(<= main_~i~0 28), 83738#(<= main_~i~0 27), 83741#(<= main_~i~0 30), 83740#(<= main_~i~0 29), 83743#(<= main_~i~0 32), 83742#(<= main_~i~0 31), 83745#(<= main_~i~0 34), 83744#(<= main_~i~0 33), 83747#(<= main_~i~0 36), 83746#(<= main_~i~0 35), 83749#(<= main_~i~0 38), 83748#(<= main_~i~0 37), 83751#(<= main_~i~0 40), 83750#(<= main_~i~0 39), 83753#(<= main_~i~0 42), 83752#(<= main_~i~0 41), 83755#(<= main_~i~0 44), 83754#(<= main_~i~0 43), 83757#(<= main_~i~0 46), 83756#(<= main_~i~0 45), 83759#(<= main_~i~0 48), 83758#(<= main_~i~0 47), 83761#(<= main_~i~0 50), 83760#(<= main_~i~0 49), 83763#(<= main_~i~0 52), 83762#(<= main_~i~0 51), 83765#(<= main_~i~0 54), 83764#(<= main_~i~0 53), 83767#(<= main_~i~0 56), 83766#(<= main_~i~0 55), 83769#(<= main_~i~0 58), 83768#(<= main_~i~0 57), 83771#(<= main_~i~0 60), 83770#(<= main_~i~0 59), 83773#(<= main_~i~0 62), 83772#(<= main_~i~0 61), 83775#(<= main_~i~0 64), 83774#(<= main_~i~0 63), 83777#(<= main_~i~0 66), 83776#(<= main_~i~0 65), 83779#(<= main_~i~0 68), 83778#(<= main_~i~0 67), 83781#(<= main_~i~0 70), 83780#(<= main_~i~0 69), 83783#(<= main_~i~0 72), 83782#(<= main_~i~0 71), 83785#(<= main_~i~0 74), 83784#(<= main_~i~0 73), 83787#(and (<= 1 main_~i~0) (<= main_~i~0 75)), 83786#(and (<= 0 main_~i~0) (<= main_~i~0 74)), 83709#true, 83711#(<= main_~i~0 0), 83710#false] [2018-04-11 13:08:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:36,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-11 13:08:36,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-11 13:08:36,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-11 13:08:36,308 INFO L87 Difference]: Start difference. First operand 926 states and 1076 transitions. Second operand 79 states. [2018-04-11 13:08:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:39,646 INFO L93 Difference]: Finished difference Result 1016 states and 1169 transitions. [2018-04-11 13:08:39,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-11 13:08:39,647 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-04-11 13:08:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:39,648 INFO L225 Difference]: With dead ends: 1016 [2018-04-11 13:08:39,648 INFO L226 Difference]: Without dead ends: 1016 [2018-04-11 13:08:39,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-04-11 13:08:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-04-11 13:08:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 938. [2018-04-11 13:08:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-11 13:08:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1090 transitions. [2018-04-11 13:08:39,654 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1090 transitions. Word has length 382 [2018-04-11 13:08:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:39,654 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 1090 transitions. [2018-04-11 13:08:39,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-11 13:08:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1090 transitions. [2018-04-11 13:08:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-11 13:08:39,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:39,655 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:39,655 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1413519832, now seen corresponding path program 76 times [2018-04-11 13:08:39,656 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:39,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:41,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:41,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-11 13:08:41,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:41,356 INFO L182 omatonBuilderFactory]: Interpolants [85893#false, 85892#true, 85895#(<= main_~i~0 1), 85894#(<= main_~i~0 0), 85897#(<= main_~i~0 3), 85896#(<= main_~i~0 2), 85899#(<= main_~i~0 5), 85898#(<= main_~i~0 4), 85901#(<= main_~i~0 7), 85900#(<= main_~i~0 6), 85903#(<= main_~i~0 9), 85902#(<= main_~i~0 8), 85905#(<= main_~i~0 11), 85904#(<= main_~i~0 10), 85907#(<= main_~i~0 13), 85906#(<= main_~i~0 12), 85909#(<= main_~i~0 15), 85908#(<= main_~i~0 14), 85911#(<= main_~i~0 17), 85910#(<= main_~i~0 16), 85913#(<= main_~i~0 19), 85912#(<= main_~i~0 18), 85915#(<= main_~i~0 21), 85914#(<= main_~i~0 20), 85917#(<= main_~i~0 23), 85916#(<= main_~i~0 22), 85919#(<= main_~i~0 25), 85918#(<= main_~i~0 24), 85921#(<= main_~i~0 27), 85920#(<= main_~i~0 26), 85923#(<= main_~i~0 29), 85922#(<= main_~i~0 28), 85925#(<= main_~i~0 31), 85924#(<= main_~i~0 30), 85927#(<= main_~i~0 33), 85926#(<= main_~i~0 32), 85929#(<= main_~i~0 35), 85928#(<= main_~i~0 34), 85931#(<= main_~i~0 37), 85930#(<= main_~i~0 36), 85933#(<= main_~i~0 39), 85932#(<= main_~i~0 38), 85935#(<= main_~i~0 41), 85934#(<= main_~i~0 40), 85937#(<= main_~i~0 43), 85936#(<= main_~i~0 42), 85939#(<= main_~i~0 45), 85938#(<= main_~i~0 44), 85941#(<= main_~i~0 47), 85940#(<= main_~i~0 46), 85943#(<= main_~i~0 49), 85942#(<= main_~i~0 48), 85945#(<= main_~i~0 51), 85944#(<= main_~i~0 50), 85947#(<= main_~i~0 53), 85946#(<= main_~i~0 52), 85949#(<= main_~i~0 55), 85948#(<= main_~i~0 54), 85951#(<= main_~i~0 57), 85950#(<= main_~i~0 56), 85953#(<= main_~i~0 59), 85952#(<= main_~i~0 58), 85955#(<= main_~i~0 61), 85954#(<= main_~i~0 60), 85957#(<= main_~i~0 63), 85956#(<= main_~i~0 62), 85959#(<= main_~i~0 65), 85958#(<= main_~i~0 64), 85961#(<= main_~i~0 67), 85960#(<= main_~i~0 66), 85963#(<= main_~i~0 69), 85962#(<= main_~i~0 68), 85965#(<= main_~i~0 71), 85964#(<= main_~i~0 70), 85967#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 85966#(<= main_~i~0 72), 85969#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 85968#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 85971#(and (<= main_~i~0 76) (<= 4 main_~i~0)), 85970#(and (<= main_~i~0 75) (<= 3 main_~i~0))] [2018-04-11 13:08:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:41,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-11 13:08:41,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-11 13:08:41,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 13:08:41,358 INFO L87 Difference]: Start difference. First operand 938 states and 1090 transitions. Second operand 80 states. [2018-04-11 13:08:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:45,225 INFO L93 Difference]: Finished difference Result 1029 states and 1184 transitions. [2018-04-11 13:08:45,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-11 13:08:45,226 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-04-11 13:08:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:45,227 INFO L225 Difference]: With dead ends: 1029 [2018-04-11 13:08:45,227 INFO L226 Difference]: Without dead ends: 1029 [2018-04-11 13:08:45,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-11 13:08:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-04-11 13:08:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 950. [2018-04-11 13:08:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-04-11 13:08:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1104 transitions. [2018-04-11 13:08:45,233 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1104 transitions. Word has length 387 [2018-04-11 13:08:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:45,233 INFO L459 AbstractCegarLoop]: Abstraction has 950 states and 1104 transitions. [2018-04-11 13:08:45,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-11 13:08:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1104 transitions. [2018-04-11 13:08:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-11 13:08:45,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:45,234 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:45,234 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash 694328277, now seen corresponding path program 77 times [2018-04-11 13:08:45,235 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:45,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:08:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:46,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:08:46,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-11 13:08:46,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:08:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:46,947 INFO L182 omatonBuilderFactory]: Interpolants [88103#true, 88105#(<= main_~i~0 0), 88104#false, 88107#(<= main_~i~0 2), 88106#(<= main_~i~0 1), 88109#(<= main_~i~0 4), 88108#(<= main_~i~0 3), 88111#(<= main_~i~0 6), 88110#(<= main_~i~0 5), 88113#(<= main_~i~0 8), 88112#(<= main_~i~0 7), 88115#(<= main_~i~0 10), 88114#(<= main_~i~0 9), 88117#(<= main_~i~0 12), 88116#(<= main_~i~0 11), 88119#(<= main_~i~0 14), 88118#(<= main_~i~0 13), 88121#(<= main_~i~0 16), 88120#(<= main_~i~0 15), 88123#(<= main_~i~0 18), 88122#(<= main_~i~0 17), 88125#(<= main_~i~0 20), 88124#(<= main_~i~0 19), 88127#(<= main_~i~0 22), 88126#(<= main_~i~0 21), 88129#(<= main_~i~0 24), 88128#(<= main_~i~0 23), 88131#(<= main_~i~0 26), 88130#(<= main_~i~0 25), 88133#(<= main_~i~0 28), 88132#(<= main_~i~0 27), 88135#(<= main_~i~0 30), 88134#(<= main_~i~0 29), 88137#(<= main_~i~0 32), 88136#(<= main_~i~0 31), 88139#(<= main_~i~0 34), 88138#(<= main_~i~0 33), 88141#(<= main_~i~0 36), 88140#(<= main_~i~0 35), 88143#(<= main_~i~0 38), 88142#(<= main_~i~0 37), 88145#(<= main_~i~0 40), 88144#(<= main_~i~0 39), 88147#(<= main_~i~0 42), 88146#(<= main_~i~0 41), 88149#(<= main_~i~0 44), 88148#(<= main_~i~0 43), 88151#(<= main_~i~0 46), 88150#(<= main_~i~0 45), 88153#(<= main_~i~0 48), 88152#(<= main_~i~0 47), 88155#(<= main_~i~0 50), 88154#(<= main_~i~0 49), 88157#(<= main_~i~0 52), 88156#(<= main_~i~0 51), 88159#(<= main_~i~0 54), 88158#(<= main_~i~0 53), 88161#(<= main_~i~0 56), 88160#(<= main_~i~0 55), 88163#(<= main_~i~0 58), 88162#(<= main_~i~0 57), 88165#(<= main_~i~0 60), 88164#(<= main_~i~0 59), 88167#(<= main_~i~0 62), 88166#(<= main_~i~0 61), 88169#(<= main_~i~0 64), 88168#(<= main_~i~0 63), 88171#(<= main_~i~0 66), 88170#(<= main_~i~0 65), 88173#(<= main_~i~0 68), 88172#(<= main_~i~0 67), 88175#(<= main_~i~0 70), 88174#(<= main_~i~0 69), 88177#(<= main_~i~0 72), 88176#(<= main_~i~0 71), 88179#(<= main_~i~0 74), 88178#(<= main_~i~0 73), 88181#(<= main_~i~0 76), 88180#(<= main_~i~0 75), 88183#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 88182#(and (<= 0 main_~i~0) (<= main_~i~0 76))] [2018-04-11 13:08:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:08:46,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-11 13:08:46,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-11 13:08:46,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=3394, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 13:08:46,949 INFO L87 Difference]: Start difference. First operand 950 states and 1104 transitions. Second operand 81 states. [2018-04-11 13:08:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:08:50,505 INFO L93 Difference]: Finished difference Result 1042 states and 1199 transitions. [2018-04-11 13:08:50,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-11 13:08:50,505 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 392 [2018-04-11 13:08:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:08:50,507 INFO L225 Difference]: With dead ends: 1042 [2018-04-11 13:08:50,507 INFO L226 Difference]: Without dead ends: 1042 [2018-04-11 13:08:50,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=9246, Invalid=15560, Unknown=0, NotChecked=0, Total=24806 [2018-04-11 13:08:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-04-11 13:08:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 962. [2018-04-11 13:08:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-04-11 13:08:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1118 transitions. [2018-04-11 13:08:50,516 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1118 transitions. Word has length 392 [2018-04-11 13:08:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:08:50,516 INFO L459 AbstractCegarLoop]: Abstraction has 962 states and 1118 transitions. [2018-04-11 13:08:50,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-11 13:08:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1118 transitions. [2018-04-11 13:08:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-11 13:08:50,519 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:08:50,519 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-11 13:08:50,519 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:08:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1370417736, now seen corresponding path program 78 times [2018-04-11 13:08:50,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:08:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:08:50,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-11 13:08:51,796 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 13:08:51,799 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 13:08:51,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 01:08:51 BoogieIcfgContainer [2018-04-11 13:08:51,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 13:08:51,800 INFO L168 Benchmark]: Toolchain (without parser) took 180186.04 ms. Allocated memory was 404.2 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 343.0 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 498.5 MB. Max. memory is 5.3 GB. [2018-04-11 13:08:51,801 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 404.2 MB. Free memory is still 364.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:08:51,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.47 ms. Allocated memory is still 404.2 MB. Free memory was 343.0 MB in the beginning and 333.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-04-11 13:08:51,801 INFO L168 Benchmark]: Boogie Preprocessor took 19.21 ms. Allocated memory is still 404.2 MB. Free memory was 333.7 MB in the beginning and 332.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 13:08:51,801 INFO L168 Benchmark]: RCFGBuilder took 183.06 ms. Allocated memory was 404.2 MB in the beginning and 594.0 MB in the end (delta: 189.8 MB). Free memory was 332.4 MB in the beginning and 562.0 MB in the end (delta: -229.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-11 13:08:51,802 INFO L168 Benchmark]: TraceAbstraction took 179849.82 ms. Allocated memory was 594.0 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 562.0 MB in the beginning and 1.8 GB in the end (delta: -1.2 GB). Peak memory consumption was 527.7 MB. Max. memory is 5.3 GB. [2018-04-11 13:08:51,803 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.21 ms. Allocated memory is still 404.2 MB. Free memory is still 364.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 131.47 ms. Allocated memory is still 404.2 MB. Free memory was 343.0 MB in the beginning and 333.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.21 ms. Allocated memory is still 404.2 MB. Free memory was 333.7 MB in the beginning and 332.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 183.06 ms. Allocated memory was 404.2 MB in the beginning and 594.0 MB in the end (delta: 189.8 MB). Free memory was 332.4 MB in the beginning and 562.0 MB in the end (delta: -229.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 179849.82 ms. Allocated memory was 594.0 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 562.0 MB in the beginning and 1.8 GB in the end (delta: -1.2 GB). Peak memory consumption was 527.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was analyzing trace of length 398 with TraceHistMax 79, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 398 with TraceHistMax 79, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 398 with TraceHistMax 79, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 398 with TraceHistMax 79, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 398 with TraceHistMax 79, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was analyzing trace of length 398 with TraceHistMax 79, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 179.8s OverallTime, 79 OverallIterations, 79 TraceHistogramMax, 127.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5708 SDtfs, 96559 SDslu, 50517 SDs, 0 SdLazy, 178974 SolverSat, 36380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6105 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6027 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82455 ImplicationChecksByTransitivity, 87.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=962occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/386386 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 78 MinimizatonAttempts, 3237 StatesRemovedByMinimization, 78 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 48.1s InterpolantComputationTime, 15561 NumberOfCodeBlocks, 15561 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 15483 ConstructedInterpolants, 0 QuantifiedInterpolants, 13332289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/386386 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/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_13-08-51-808.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_13-08-51-808.csv Completed graceful shutdown