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/sanfoundry_24_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 02:52:36,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 02:52:36,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 02:52:36,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 02:52:36,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 02:52:36,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 02:52:36,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 02:52:36,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 02:52:36,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 02:52:36,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 02:52:36,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 02:52:36,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 02:52:36,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 02:52:36,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 02:52:36,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 02:52:36,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 02:52:36,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 02:52:36,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 02:52:36,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 02:52:36,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 02:52:36,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 02:52:36,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 02:52:36,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 02:52:36,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 02:52:36,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 02:52:36,047 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 02:52:36,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 02:52:36,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 02:52:36,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 02:52:36,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 02:52:36,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 02:52:36,049 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-12 02:52:36,069 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 02:52:36,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 02:52:36,071 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 02:52:36,071 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 02:52:36,071 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 02:52:36,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 02:52:36,071 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 02:52:36,071 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 02:52:36,071 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 02:52:36,071 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 02:52:36,071 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 02:52:36,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 02:52:36,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 02:52:36,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 02:52:36,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 02:52:36,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 02:52:36,106 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 02:52:36,108 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 02:52:36,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 02:52:36,110 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 02:52:36,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_false-valid-deref.i [2018-04-12 02:52:36,444 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGaf47beca1 [2018-04-12 02:52:36,550 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 02:52:36,550 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 02:52:36,550 INFO L168 CDTParser]: Scanning sanfoundry_24_false-valid-deref.i [2018-04-12 02:52:36,551 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 02:52:36,551 INFO L215 ultiparseSymbolTable]: [2018-04-12 02:52:36,551 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 02:52:36,551 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsanfoundry____false_valid_deref_i__printOdd ('printOdd') in sanfoundry_24_false-valid-deref.i [2018-04-12 02:52:36,551 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sanfoundry_24_false-valid-deref.i [2018-04-12 02:52:36,552 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsanfoundry____false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in sanfoundry_24_false-valid-deref.i [2018-04-12 02:52:36,552 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsanfoundry____false_valid_deref_i__printEven ('printEven') in sanfoundry_24_false-valid-deref.i [2018-04-12 02:52:36,552 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 02:52:36,552 INFO L233 ultiparseSymbolTable]: [2018-04-12 02:52:36,563 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGaf47beca1 [2018-04-12 02:52:36,566 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 02:52:36,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 02:52:36,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 02:52:36,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 02:52:36,571 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 02:52:36,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b11e57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36, skipping insertion in model container [2018-04-12 02:52:36,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,583 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 02:52:36,592 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 02:52:36,685 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 02:52:36,698 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 02:52:36,700 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 8 non ball SCCs. Number of states in SCCs 8. [2018-04-12 02:52:36,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36 WrapperNode [2018-04-12 02:52:36,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 02:52:36,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 02:52:36,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 02:52:36,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 02:52:36,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... [2018-04-12 02:52:36,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 02:52:36,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 02:52:36,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 02:52:36,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 02:52:36,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 02:52:36,761 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 02:52:36,761 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 02:52:36,762 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsanfoundry____false_valid_deref_i____VERIFIER_assert [2018-04-12 02:52:36,762 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printEven [2018-04-12 02:52:36,762 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printOdd [2018-04-12 02:52:36,762 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 02:52:36,762 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 02:52:36,762 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsanfoundry____false_valid_deref_i____VERIFIER_assert [2018-04-12 02:52:36,762 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 02:52:36,762 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printEven [2018-04-12 02:52:36,762 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printOdd [2018-04-12 02:52:36,762 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 02:52:36,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 02:52:36,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 02:52:36,974 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 02:52:36,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 02:52:36 BoogieIcfgContainer [2018-04-12 02:52:36,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 02:52:36,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 02:52:36,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 02:52:36,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 02:52:36,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 02:52:36" (1/3) ... [2018-04-12 02:52:36,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3c47ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 02:52:36, skipping insertion in model container [2018-04-12 02:52:36,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:52:36" (2/3) ... [2018-04-12 02:52:36,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3c47ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 02:52:36, skipping insertion in model container [2018-04-12 02:52:36,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 02:52:36" (3/3) ... [2018-04-12 02:52:36,979 INFO L107 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i [2018-04-12 02:52:36,985 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 02:52:36,989 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-04-12 02:52:37,012 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 02:52:37,012 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 02:52:37,012 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 02:52:37,012 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 02:52:37,012 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 02:52:37,012 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 02:52:37,012 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 02:52:37,012 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 02:52:37,013 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 02:52:37,013 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 02:52:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-04-12 02:52:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 02:52:37,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:37,026 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:37,026 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 529392829, now seen corresponding path program 1 times [2018-04-12 02:52:37,062 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:37,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:52:37,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 02:52:37,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,121 INFO L182 omatonBuilderFactory]: Interpolants [45#true, 46#false, 47#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-04-12 02:52:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 02:52:37,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 02:52:37,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 02:52:37,137 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-04-12 02:52:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:37,208 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-04-12 02:52:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 02:52:37,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-04-12 02:52:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:37,215 INFO L225 Difference]: With dead ends: 60 [2018-04-12 02:52:37,215 INFO L226 Difference]: Without dead ends: 51 [2018-04-12 02:52:37,217 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 02:52:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-12 02:52:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-04-12 02:52:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-12 02:52:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-04-12 02:52:37,245 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2018-04-12 02:52:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:37,246 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-04-12 02:52:37,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 02:52:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-04-12 02:52:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 02:52:37,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:37,247 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:37,247 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash -406435754, now seen corresponding path program 1 times [2018-04-12 02:52:37,248 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:37,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:37,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-12 02:52:37,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,288 INFO L182 omatonBuilderFactory]: Interpolants [154#true, 155#false, 156#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 157#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-12 02:52:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 02:52:37,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 02:52:37,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:52:37,291 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-04-12 02:52:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:37,360 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-04-12 02:52:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 02:52:37,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-12 02:52:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:37,362 INFO L225 Difference]: With dead ends: 66 [2018-04-12 02:52:37,362 INFO L226 Difference]: Without dead ends: 66 [2018-04-12 02:52:37,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:52:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-12 02:52:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-04-12 02:52:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-12 02:52:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-04-12 02:52:37,369 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 13 [2018-04-12 02:52:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:37,370 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-04-12 02:52:37,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 02:52:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-04-12 02:52:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 02:52:37,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:37,371 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:37,371 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2003385437, now seen corresponding path program 2 times [2018-04-12 02:52:37,372 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:37,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:37,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-12 02:52:37,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,427 INFO L182 omatonBuilderFactory]: Interpolants [288#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 284#true, 285#false, 286#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 287#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-12 02:52:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:52:37,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:52:37,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:52:37,427 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 5 states. [2018-04-12 02:52:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:37,548 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-04-12 02:52:37,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:52:37,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 02:52:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:37,551 INFO L225 Difference]: With dead ends: 81 [2018-04-12 02:52:37,551 INFO L226 Difference]: Without dead ends: 81 [2018-04-12 02:52:37,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:52:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-12 02:52:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-04-12 02:52:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-12 02:52:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-04-12 02:52:37,559 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2018-04-12 02:52:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:37,559 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-04-12 02:52:37,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:52:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-04-12 02:52:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-12 02:52:37,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:37,560 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:37,561 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -948915018, now seen corresponding path program 3 times [2018-04-12 02:52:37,562 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:37,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:37,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 02:52:37,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,632 INFO L182 omatonBuilderFactory]: Interpolants [448#(<= main_~i~0 2), 449#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 450#(and (<= main_~i~0 3) (<= 1 main_~i~0)), 444#true, 445#false, 446#(<= main_~i~0 0), 447#(<= main_~i~0 1)] [2018-04-12 02:52:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 02:52:37,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 02:52:37,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:52:37,633 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 7 states. [2018-04-12 02:52:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:37,770 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-04-12 02:52:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 02:52:37,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-04-12 02:52:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:37,772 INFO L225 Difference]: With dead ends: 96 [2018-04-12 02:52:37,773 INFO L226 Difference]: Without dead ends: 96 [2018-04-12 02:52:37,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-12 02:52:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-12 02:52:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-04-12 02:52:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-12 02:52:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-04-12 02:52:37,780 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 23 [2018-04-12 02:52:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:37,780 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2018-04-12 02:52:37,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 02:52:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2018-04-12 02:52:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 02:52:37,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:37,782 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:37,782 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1053586435, now seen corresponding path program 4 times [2018-04-12 02:52:37,783 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:37,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:37,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 02:52:37,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,869 INFO L182 omatonBuilderFactory]: Interpolants [641#true, 642#false, 643#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 644#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 645#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 646#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 647#(and (<= 4 main_~i~0) (<= main_~i~0 4))] [2018-04-12 02:52:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:37,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 02:52:37,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 02:52:37,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:52:37,870 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 7 states. [2018-04-12 02:52:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:38,096 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2018-04-12 02:52:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 02:52:38,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-12 02:52:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:38,097 INFO L225 Difference]: With dead ends: 111 [2018-04-12 02:52:38,097 INFO L226 Difference]: Without dead ends: 111 [2018-04-12 02:52:38,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:52:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-12 02:52:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2018-04-12 02:52:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-12 02:52:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2018-04-12 02:52:38,102 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 28 [2018-04-12 02:52:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:38,102 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2018-04-12 02:52:38,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 02:52:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2018-04-12 02:52:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 02:52:38,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:38,103 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:38,103 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash -339269354, now seen corresponding path program 5 times [2018-04-12 02:52:38,103 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:38,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:38,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 02:52:38,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,165 INFO L182 omatonBuilderFactory]: Interpolants [864#(<= main_~i~0 1), 865#(<= main_~i~0 2), 866#(<= main_~i~0 3), 867#(<= main_~i~0 4), 868#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 869#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 861#true, 862#false, 863#(<= main_~i~0 0)] [2018-04-12 02:52:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 02:52:38,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 02:52:38,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-12 02:52:38,165 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 9 states. [2018-04-12 02:52:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:38,355 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-04-12 02:52:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 02:52:38,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-12 02:52:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:38,356 INFO L225 Difference]: With dead ends: 126 [2018-04-12 02:52:38,356 INFO L226 Difference]: Without dead ends: 126 [2018-04-12 02:52:38,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-04-12 02:52:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-12 02:52:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-04-12 02:52:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-12 02:52:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2018-04-12 02:52:38,364 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 33 [2018-04-12 02:52:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:38,365 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2018-04-12 02:52:38,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 02:52:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2018-04-12 02:52:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 02:52:38,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:38,366 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:38,367 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2023150493, now seen corresponding path program 6 times [2018-04-12 02:52:38,367 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:38,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:38,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 02:52:38,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,455 INFO L182 omatonBuilderFactory]: Interpolants [1122#true, 1123#false, 1124#(<= main_~i~0 0), 1125#(<= main_~i~0 1), 1126#(<= main_~i~0 2), 1127#(<= main_~i~0 3), 1128#(<= main_~i~0 4), 1129#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1130#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1131#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-04-12 02:52:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 02:52:38,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 02:52:38,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-12 02:52:38,456 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 10 states. [2018-04-12 02:52:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:38,668 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-04-12 02:52:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 02:52:38,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-12 02:52:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:38,670 INFO L225 Difference]: With dead ends: 141 [2018-04-12 02:52:38,670 INFO L226 Difference]: Without dead ends: 141 [2018-04-12 02:52:38,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-04-12 02:52:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-12 02:52:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-04-12 02:52:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 02:52:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2018-04-12 02:52:38,676 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 38 [2018-04-12 02:52:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:38,676 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2018-04-12 02:52:38,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 02:52:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2018-04-12 02:52:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 02:52:38,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:38,678 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:38,680 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1822448266, now seen corresponding path program 7 times [2018-04-12 02:52:38,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:38,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:38,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 02:52:38,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,768 INFO L182 omatonBuilderFactory]: Interpolants [1424#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1425#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1415#true, 1416#false, 1417#(<= main_~i~0 0), 1418#(<= main_~i~0 1), 1419#(<= main_~i~0 2), 1420#(<= main_~i~0 3), 1421#(<= main_~i~0 4), 1422#(<= main_~i~0 5), 1423#(<= main_~i~0 6)] [2018-04-12 02:52:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:38,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 02:52:38,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 02:52:38,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-12 02:52:38,769 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand 11 states. [2018-04-12 02:52:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:38,988 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2018-04-12 02:52:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 02:52:38,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-04-12 02:52:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:38,990 INFO L225 Difference]: With dead ends: 156 [2018-04-12 02:52:38,990 INFO L226 Difference]: Without dead ends: 156 [2018-04-12 02:52:38,990 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-12 02:52:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-12 02:52:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-04-12 02:52:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 02:52:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2018-04-12 02:52:38,998 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 43 [2018-04-12 02:52:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:38,999 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2018-04-12 02:52:38,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 02:52:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2018-04-12 02:52:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 02:52:39,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:39,001 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:39,001 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash 213717821, now seen corresponding path program 8 times [2018-04-12 02:52:39,002 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:39,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:39,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:39,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 02:52:39,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:39,094 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1745#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1746#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1747#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1748#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1749#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1750#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 1740#true, 1741#false, 1742#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1743#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-12 02:52:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:39,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 02:52:39,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 02:52:39,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 02:52:39,095 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand 11 states. [2018-04-12 02:52:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:39,649 INFO L93 Difference]: Finished difference Result 171 states and 220 transitions. [2018-04-12 02:52:39,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 02:52:39,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-04-12 02:52:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:39,651 INFO L225 Difference]: With dead ends: 171 [2018-04-12 02:52:39,651 INFO L226 Difference]: Without dead ends: 171 [2018-04-12 02:52:39,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 02:52:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-12 02:52:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-04-12 02:52:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-12 02:52:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2018-04-12 02:52:39,657 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 48 [2018-04-12 02:52:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:39,657 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2018-04-12 02:52:39,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 02:52:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2018-04-12 02:52:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-12 02:52:39,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:39,659 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:39,659 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 961554902, now seen corresponding path program 9 times [2018-04-12 02:52:39,660 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:39,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:39,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:39,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 02:52:39,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:39,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-12 02:52:39,779 INFO L182 omatonBuilderFactory]: Interpolants [2080#true, 2081#false, 2082#(<= main_~i~0 0), 2083#(<= main_~i~0 1), 2084#(<= main_~i~0 2), 2085#(<= main_~i~0 3), 2086#(<= main_~i~0 4), 2087#(<= main_~i~0 5), 2088#(<= main_~i~0 6), 2089#(<= main_~i~0 7), 2090#(<= main_~i~0 8), 2091#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2092#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-04-12 02:52:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:39,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 02:52:39,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 02:52:39,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-12 02:52:39,780 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand 13 states. [2018-04-12 02:52:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:40,080 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-04-12 02:52:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 02:52:40,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-04-12 02:52:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:40,081 INFO L225 Difference]: With dead ends: 186 [2018-04-12 02:52:40,081 INFO L226 Difference]: Without dead ends: 186 [2018-04-12 02:52:40,081 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-12 02:52:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-12 02:52:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-04-12 02:52:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-12 02:52:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2018-04-12 02:52:40,085 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 53 [2018-04-12 02:52:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:40,086 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2018-04-12 02:52:40,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 02:52:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2018-04-12 02:52:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 02:52:40,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:40,087 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:40,087 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2142221603, now seen corresponding path program 10 times [2018-04-12 02:52:40,088 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:40,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:40,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-12 02:52:40,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,207 INFO L182 omatonBuilderFactory]: Interpolants [2469#true, 2470#false, 2471#(<= main_~i~0 0), 2472#(<= main_~i~0 1), 2473#(<= main_~i~0 2), 2474#(<= main_~i~0 3), 2475#(<= main_~i~0 4), 2476#(<= main_~i~0 5), 2477#(<= main_~i~0 6), 2478#(<= main_~i~0 7), 2479#(<= main_~i~0 8), 2480#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2481#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2482#(and (<= 2 main_~i~0) (<= main_~i~0 10))] [2018-04-12 02:52:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 02:52:40,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 02:52:40,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-12 02:52:40,208 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand 14 states. [2018-04-12 02:52:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:40,470 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2018-04-12 02:52:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 02:52:40,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-04-12 02:52:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:40,472 INFO L225 Difference]: With dead ends: 201 [2018-04-12 02:52:40,472 INFO L226 Difference]: Without dead ends: 201 [2018-04-12 02:52:40,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-12 02:52:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-12 02:52:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2018-04-12 02:52:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 02:52:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-04-12 02:52:40,476 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 58 [2018-04-12 02:52:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:40,477 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-04-12 02:52:40,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 02:52:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-04-12 02:52:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 02:52:40,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:40,477 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:40,478 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash -181488074, now seen corresponding path program 11 times [2018-04-12 02:52:40,479 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:40,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:40,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 02:52:40,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,571 INFO L182 omatonBuilderFactory]: Interpolants [2890#true, 2891#false, 2892#(<= main_~i~0 0), 2893#(<= main_~i~0 1), 2894#(<= main_~i~0 2), 2895#(<= main_~i~0 3), 2896#(<= main_~i~0 4), 2897#(<= main_~i~0 5), 2898#(<= main_~i~0 6), 2899#(<= main_~i~0 7), 2900#(<= main_~i~0 8), 2901#(<= main_~i~0 9), 2902#(<= main_~i~0 10), 2903#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 2904#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-04-12 02:52:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 02:52:40,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 02:52:40,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-04-12 02:52:40,572 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 15 states. [2018-04-12 02:52:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:40,831 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2018-04-12 02:52:40,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 02:52:40,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-04-12 02:52:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:40,832 INFO L225 Difference]: With dead ends: 216 [2018-04-12 02:52:40,832 INFO L226 Difference]: Without dead ends: 216 [2018-04-12 02:52:40,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-04-12 02:52:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-12 02:52:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2018-04-12 02:52:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-12 02:52:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2018-04-12 02:52:40,836 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 63 [2018-04-12 02:52:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:40,836 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2018-04-12 02:52:40,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 02:52:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-04-12 02:52:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-12 02:52:40,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:40,837 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:40,837 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash 159021693, now seen corresponding path program 12 times [2018-04-12 02:52:40,838 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:40,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:40,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 02:52:40,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,955 INFO L182 omatonBuilderFactory]: Interpolants [3343#true, 3344#false, 3345#(<= main_~i~0 0), 3346#(<= main_~i~0 1), 3347#(<= main_~i~0 2), 3348#(<= main_~i~0 3), 3349#(<= main_~i~0 4), 3350#(<= main_~i~0 5), 3351#(<= main_~i~0 6), 3352#(<= main_~i~0 7), 3353#(<= main_~i~0 8), 3354#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 3355#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 3356#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 3357#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 3358#(and (<= 4 main_~i~0) (<= main_~i~0 12))] [2018-04-12 02:52:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:40,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 02:52:40,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 02:52:40,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-12 02:52:40,956 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand 16 states. [2018-04-12 02:52:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:41,349 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2018-04-12 02:52:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 02:52:41,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-04-12 02:52:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:41,350 INFO L225 Difference]: With dead ends: 231 [2018-04-12 02:52:41,350 INFO L226 Difference]: Without dead ends: 231 [2018-04-12 02:52:41,350 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-04-12 02:52:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-12 02:52:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-04-12 02:52:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-12 02:52:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2018-04-12 02:52:41,356 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 68 [2018-04-12 02:52:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:41,356 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2018-04-12 02:52:41,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 02:52:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2018-04-12 02:52:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-12 02:52:41,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:41,357 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:41,357 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:41,357 INFO L82 PathProgramCache]: Analyzing trace with hash -619623786, now seen corresponding path program 13 times [2018-04-12 02:52:41,358 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:41,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:41,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:41,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 02:52:41,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:41,461 INFO L182 omatonBuilderFactory]: Interpolants [3840#(<= main_~i~0 10), 3841#(<= main_~i~0 11), 3842#(<= main_~i~0 12), 3843#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3844#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 3828#true, 3829#false, 3830#(<= main_~i~0 0), 3831#(<= main_~i~0 1), 3832#(<= main_~i~0 2), 3833#(<= main_~i~0 3), 3834#(<= main_~i~0 4), 3835#(<= main_~i~0 5), 3836#(<= main_~i~0 6), 3837#(<= main_~i~0 7), 3838#(<= main_~i~0 8), 3839#(<= main_~i~0 9)] [2018-04-12 02:52:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:41,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 02:52:41,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 02:52:41,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-12 02:52:41,462 INFO L87 Difference]: Start difference. First operand 214 states and 281 transitions. Second operand 17 states. [2018-04-12 02:52:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:41,846 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2018-04-12 02:52:41,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 02:52:41,846 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-04-12 02:52:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:41,847 INFO L225 Difference]: With dead ends: 246 [2018-04-12 02:52:41,847 INFO L226 Difference]: Without dead ends: 246 [2018-04-12 02:52:41,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-04-12 02:52:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-12 02:52:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2018-04-12 02:52:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-12 02:52:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2018-04-12 02:52:41,851 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 73 [2018-04-12 02:52:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:41,851 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2018-04-12 02:52:41,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 02:52:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-04-12 02:52:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-12 02:52:41,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:41,852 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:41,852 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1310350819, now seen corresponding path program 14 times [2018-04-12 02:52:41,852 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:41,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:41,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:41,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 02:52:41,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:41,956 INFO L182 omatonBuilderFactory]: Interpolants [4352#(<= main_~i~0 5), 4353#(<= main_~i~0 6), 4354#(<= main_~i~0 7), 4355#(<= main_~i~0 8), 4356#(<= main_~i~0 9), 4357#(<= main_~i~0 10), 4358#(<= main_~i~0 11), 4359#(<= main_~i~0 12), 4360#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 4361#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 4362#(and (<= 2 main_~i~0) (<= main_~i~0 14)), 4345#true, 4346#false, 4347#(<= main_~i~0 0), 4348#(<= main_~i~0 1), 4349#(<= main_~i~0 2), 4350#(<= main_~i~0 3), 4351#(<= main_~i~0 4)] [2018-04-12 02:52:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:41,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 02:52:41,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 02:52:41,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-12 02:52:41,957 INFO L87 Difference]: Start difference. First operand 228 states and 300 transitions. Second operand 18 states. [2018-04-12 02:52:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:42,300 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2018-04-12 02:52:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 02:52:42,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-04-12 02:52:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:42,301 INFO L225 Difference]: With dead ends: 261 [2018-04-12 02:52:42,301 INFO L226 Difference]: Without dead ends: 261 [2018-04-12 02:52:42,301 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-12 02:52:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-12 02:52:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-04-12 02:52:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-12 02:52:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-04-12 02:52:42,309 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 78 [2018-04-12 02:52:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:42,309 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-04-12 02:52:42,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 02:52:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-04-12 02:52:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-12 02:52:42,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:42,311 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:42,311 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1536026358, now seen corresponding path program 15 times [2018-04-12 02:52:42,311 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:42,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:42,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:42,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 02:52:42,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:42,488 INFO L182 omatonBuilderFactory]: Interpolants [4896#(<= main_~i~0 0), 4897#(<= main_~i~0 1), 4898#(<= main_~i~0 2), 4899#(<= main_~i~0 3), 4900#(<= main_~i~0 4), 4901#(<= main_~i~0 5), 4902#(<= main_~i~0 6), 4903#(<= main_~i~0 7), 4904#(<= main_~i~0 8), 4905#(<= main_~i~0 9), 4906#(<= main_~i~0 10), 4907#(<= main_~i~0 11), 4908#(<= main_~i~0 12), 4909#(<= main_~i~0 13), 4910#(<= main_~i~0 14), 4911#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 4912#(and (<= 1 main_~i~0) (<= main_~i~0 15)), 4894#true, 4895#false] [2018-04-12 02:52:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:42,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 02:52:42,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 02:52:42,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-04-12 02:52:42,489 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 19 states. [2018-04-12 02:52:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:42,933 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2018-04-12 02:52:42,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 02:52:42,933 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-04-12 02:52:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:42,934 INFO L225 Difference]: With dead ends: 276 [2018-04-12 02:52:42,934 INFO L226 Difference]: Without dead ends: 276 [2018-04-12 02:52:42,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 02:52:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-12 02:52:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2018-04-12 02:52:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-12 02:52:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2018-04-12 02:52:42,942 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 83 [2018-04-12 02:52:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:42,942 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2018-04-12 02:52:42,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 02:52:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2018-04-12 02:52:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-12 02:52:42,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:42,944 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:42,944 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -155467331, now seen corresponding path program 16 times [2018-04-12 02:52:42,945 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:42,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:43,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:43,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 02:52:43,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:43,168 INFO L182 omatonBuilderFactory]: Interpolants [5475#true, 5476#false, 5477#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 5478#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 5479#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 5480#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 5481#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 5482#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 5483#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 5484#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 5485#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 5486#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 5487#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 5488#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 5489#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 5490#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 5491#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 5492#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 5493#(and (<= main_~i~0 16) (<= 16 main_~i~0))] [2018-04-12 02:52:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:43,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 02:52:43,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 02:52:43,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 02:52:43,170 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand 19 states. [2018-04-12 02:52:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:44,488 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2018-04-12 02:52:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 02:52:44,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-04-12 02:52:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:44,489 INFO L225 Difference]: With dead ends: 291 [2018-04-12 02:52:44,489 INFO L226 Difference]: Without dead ends: 291 [2018-04-12 02:52:44,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 02:52:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-12 02:52:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2018-04-12 02:52:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-12 02:52:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-04-12 02:52:44,495 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 88 [2018-04-12 02:52:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:44,495 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-04-12 02:52:44,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 02:52:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-04-12 02:52:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-12 02:52:44,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:44,497 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:44,497 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1548055722, now seen corresponding path program 17 times [2018-04-12 02:52:44,498 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:44,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:44,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:44,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 02:52:44,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:44,680 INFO L182 omatonBuilderFactory]: Interpolants [6055#true, 6056#false, 6057#(<= main_~i~0 0), 6058#(<= main_~i~0 1), 6059#(<= main_~i~0 2), 6060#(<= main_~i~0 3), 6061#(<= main_~i~0 4), 6062#(<= main_~i~0 5), 6063#(<= main_~i~0 6), 6064#(<= main_~i~0 7), 6065#(<= main_~i~0 8), 6066#(<= main_~i~0 9), 6067#(<= main_~i~0 10), 6068#(<= main_~i~0 11), 6069#(<= main_~i~0 12), 6070#(<= main_~i~0 13), 6071#(<= main_~i~0 14), 6072#(<= main_~i~0 15), 6073#(<= main_~i~0 16), 6074#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 6075#(and (<= main_~i~0 17) (<= 1 main_~i~0))] [2018-04-12 02:52:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:44,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 02:52:44,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 02:52:44,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-04-12 02:52:44,681 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 21 states. [2018-04-12 02:52:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:45,196 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2018-04-12 02:52:45,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 02:52:45,197 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-04-12 02:52:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:45,198 INFO L225 Difference]: With dead ends: 306 [2018-04-12 02:52:45,198 INFO L226 Difference]: Without dead ends: 306 [2018-04-12 02:52:45,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 02:52:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-12 02:52:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2018-04-12 02:52:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-12 02:52:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 376 transitions. [2018-04-12 02:52:45,205 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 376 transitions. Word has length 93 [2018-04-12 02:52:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:45,205 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 376 transitions. [2018-04-12 02:52:45,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 02:52:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 376 transitions. [2018-04-12 02:52:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-04-12 02:52:45,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:45,207 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:45,207 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1755765085, now seen corresponding path program 18 times [2018-04-12 02:52:45,208 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:45,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:45,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:45,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 02:52:45,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:45,415 INFO L182 omatonBuilderFactory]: Interpolants [6720#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 6721#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 6700#true, 6701#false, 6702#(<= main_~i~0 0), 6703#(<= main_~i~0 1), 6704#(<= main_~i~0 2), 6705#(<= main_~i~0 3), 6706#(<= main_~i~0 4), 6707#(<= main_~i~0 5), 6708#(<= main_~i~0 6), 6709#(<= main_~i~0 7), 6710#(<= main_~i~0 8), 6711#(<= main_~i~0 9), 6712#(<= main_~i~0 10), 6713#(<= main_~i~0 11), 6714#(<= main_~i~0 12), 6715#(<= main_~i~0 13), 6716#(<= main_~i~0 14), 6717#(<= main_~i~0 15), 6718#(<= main_~i~0 16), 6719#(and (<= 0 main_~i~0) (<= main_~i~0 16))] [2018-04-12 02:52:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:45,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 02:52:45,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 02:52:45,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-04-12 02:52:45,416 INFO L87 Difference]: Start difference. First operand 284 states and 376 transitions. Second operand 22 states. [2018-04-12 02:52:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:46,002 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2018-04-12 02:52:46,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 02:52:46,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2018-04-12 02:52:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:46,003 INFO L225 Difference]: With dead ends: 321 [2018-04-12 02:52:46,004 INFO L226 Difference]: Without dead ends: 321 [2018-04-12 02:52:46,004 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 02:52:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-12 02:52:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-04-12 02:52:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-12 02:52:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2018-04-12 02:52:46,008 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 98 [2018-04-12 02:52:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:46,008 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2018-04-12 02:52:46,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 02:52:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2018-04-12 02:52:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-12 02:52:46,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:46,009 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:46,009 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash -47368266, now seen corresponding path program 19 times [2018-04-12 02:52:46,010 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:46,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:46,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:46,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 02:52:46,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:46,180 INFO L182 omatonBuilderFactory]: Interpolants [7392#(<= main_~i~0 13), 7393#(<= main_~i~0 14), 7394#(<= main_~i~0 15), 7395#(<= main_~i~0 16), 7396#(<= main_~i~0 17), 7397#(<= main_~i~0 18), 7398#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 7399#(and (<= 1 main_~i~0) (<= main_~i~0 19)), 7377#true, 7378#false, 7379#(<= main_~i~0 0), 7380#(<= main_~i~0 1), 7381#(<= main_~i~0 2), 7382#(<= main_~i~0 3), 7383#(<= main_~i~0 4), 7384#(<= main_~i~0 5), 7385#(<= main_~i~0 6), 7386#(<= main_~i~0 7), 7387#(<= main_~i~0 8), 7388#(<= main_~i~0 9), 7389#(<= main_~i~0 10), 7390#(<= main_~i~0 11), 7391#(<= main_~i~0 12)] [2018-04-12 02:52:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:46,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 02:52:46,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 02:52:46,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-12 02:52:46,181 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 23 states. [2018-04-12 02:52:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:46,617 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2018-04-12 02:52:46,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 02:52:46,617 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-04-12 02:52:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:46,618 INFO L225 Difference]: With dead ends: 336 [2018-04-12 02:52:46,619 INFO L226 Difference]: Without dead ends: 336 [2018-04-12 02:52:46,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 02:52:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-12 02:52:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 312. [2018-04-12 02:52:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-04-12 02:52:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2018-04-12 02:52:46,625 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 103 [2018-04-12 02:52:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:46,626 INFO L459 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2018-04-12 02:52:46,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 02:52:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2018-04-12 02:52:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-12 02:52:46,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:46,627 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:46,627 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1271982333, now seen corresponding path program 20 times [2018-04-12 02:52:46,628 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:46,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:46,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:46,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 02:52:46,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:46,859 INFO L182 omatonBuilderFactory]: Interpolants [8096#(<= main_~i~0 8), 8097#(<= main_~i~0 9), 8098#(<= main_~i~0 10), 8099#(<= main_~i~0 11), 8100#(<= main_~i~0 12), 8101#(<= main_~i~0 13), 8102#(<= main_~i~0 14), 8103#(<= main_~i~0 15), 8104#(<= main_~i~0 16), 8105#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 8106#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 8107#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 8108#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 8109#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 8086#true, 8087#false, 8088#(<= main_~i~0 0), 8089#(<= main_~i~0 1), 8090#(<= main_~i~0 2), 8091#(<= main_~i~0 3), 8092#(<= main_~i~0 4), 8093#(<= main_~i~0 5), 8094#(<= main_~i~0 6), 8095#(<= main_~i~0 7)] [2018-04-12 02:52:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:46,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 02:52:46,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 02:52:46,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-12 02:52:46,859 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand 24 states. [2018-04-12 02:52:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:47,676 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2018-04-12 02:52:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 02:52:47,676 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 108 [2018-04-12 02:52:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:47,678 INFO L225 Difference]: With dead ends: 351 [2018-04-12 02:52:47,678 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 02:52:47,679 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 02:52:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 02:52:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 326. [2018-04-12 02:52:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-12 02:52:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-04-12 02:52:47,684 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 108 [2018-04-12 02:52:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:47,685 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-04-12 02:52:47,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 02:52:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-04-12 02:52:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-04-12 02:52:47,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:47,686 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:47,686 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash 771484694, now seen corresponding path program 21 times [2018-04-12 02:52:47,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:47,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:47,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:47,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 02:52:47,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:47,941 INFO L182 omatonBuilderFactory]: Interpolants [8832#(<= main_~i~0 3), 8833#(<= main_~i~0 4), 8834#(<= main_~i~0 5), 8835#(<= main_~i~0 6), 8836#(<= main_~i~0 7), 8837#(<= main_~i~0 8), 8838#(<= main_~i~0 9), 8839#(<= main_~i~0 10), 8840#(<= main_~i~0 11), 8841#(<= main_~i~0 12), 8842#(<= main_~i~0 13), 8843#(<= main_~i~0 14), 8844#(<= main_~i~0 15), 8845#(<= main_~i~0 16), 8846#(<= main_~i~0 17), 8847#(<= main_~i~0 18), 8848#(<= main_~i~0 19), 8849#(<= main_~i~0 20), 8850#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 8851#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 8827#true, 8828#false, 8829#(<= main_~i~0 0), 8830#(<= main_~i~0 1), 8831#(<= main_~i~0 2)] [2018-04-12 02:52:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:47,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 02:52:47,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 02:52:47,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-12 02:52:47,943 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 25 states. [2018-04-12 02:52:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:48,759 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2018-04-12 02:52:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 02:52:48,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2018-04-12 02:52:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:48,760 INFO L225 Difference]: With dead ends: 366 [2018-04-12 02:52:48,760 INFO L226 Difference]: Without dead ends: 366 [2018-04-12 02:52:48,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 02:52:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-12 02:52:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-04-12 02:52:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-12 02:52:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 452 transitions. [2018-04-12 02:52:48,767 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 452 transitions. Word has length 113 [2018-04-12 02:52:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:48,768 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 452 transitions. [2018-04-12 02:52:48,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 02:52:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 452 transitions. [2018-04-12 02:52:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-04-12 02:52:48,769 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:48,769 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:48,769 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:48,769 INFO L82 PathProgramCache]: Analyzing trace with hash 937685149, now seen corresponding path program 22 times [2018-04-12 02:52:48,770 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:48,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:49,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:49,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-12 02:52:49,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:49,062 INFO L182 omatonBuilderFactory]: Interpolants [9600#true, 9601#false, 9602#(<= main_~i~0 0), 9603#(<= main_~i~0 1), 9604#(<= main_~i~0 2), 9605#(<= main_~i~0 3), 9606#(<= main_~i~0 4), 9607#(<= main_~i~0 5), 9608#(<= main_~i~0 6), 9609#(<= main_~i~0 7), 9610#(<= main_~i~0 8), 9611#(<= main_~i~0 9), 9612#(<= main_~i~0 10), 9613#(<= main_~i~0 11), 9614#(<= main_~i~0 12), 9615#(<= main_~i~0 13), 9616#(<= main_~i~0 14), 9617#(<= main_~i~0 15), 9618#(<= main_~i~0 16), 9619#(<= main_~i~0 17), 9620#(<= main_~i~0 18), 9621#(<= main_~i~0 19), 9622#(<= main_~i~0 20), 9623#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 9624#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 9625#(and (<= 2 main_~i~0) (<= main_~i~0 22))] [2018-04-12 02:52:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:49,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 02:52:49,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 02:52:49,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-12 02:52:49,064 INFO L87 Difference]: Start difference. First operand 340 states and 452 transitions. Second operand 26 states. [2018-04-12 02:52:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:49,860 INFO L93 Difference]: Finished difference Result 381 states and 500 transitions. [2018-04-12 02:52:49,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 02:52:49,861 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-04-12 02:52:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:49,862 INFO L225 Difference]: With dead ends: 381 [2018-04-12 02:52:49,862 INFO L226 Difference]: Without dead ends: 381 [2018-04-12 02:52:49,863 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-12 02:52:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-12 02:52:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2018-04-12 02:52:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-12 02:52:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-04-12 02:52:49,869 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 118 [2018-04-12 02:52:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:49,869 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-04-12 02:52:49,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 02:52:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-04-12 02:52:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-04-12 02:52:49,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:49,871 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:49,871 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash -658724746, now seen corresponding path program 23 times [2018-04-12 02:52:49,872 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:49,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:50,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:50,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 02:52:50,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:50,094 INFO L182 omatonBuilderFactory]: Interpolants [10405#true, 10406#false, 10407#(<= main_~i~0 0), 10408#(<= main_~i~0 1), 10409#(<= main_~i~0 2), 10410#(<= main_~i~0 3), 10411#(<= main_~i~0 4), 10412#(<= main_~i~0 5), 10413#(<= main_~i~0 6), 10414#(<= main_~i~0 7), 10415#(<= main_~i~0 8), 10416#(<= main_~i~0 9), 10417#(<= main_~i~0 10), 10418#(<= main_~i~0 11), 10419#(<= main_~i~0 12), 10420#(<= main_~i~0 13), 10421#(<= main_~i~0 14), 10422#(<= main_~i~0 15), 10423#(<= main_~i~0 16), 10424#(<= main_~i~0 17), 10425#(<= main_~i~0 18), 10426#(<= main_~i~0 19), 10427#(<= main_~i~0 20), 10428#(<= main_~i~0 21), 10429#(<= main_~i~0 22), 10430#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 10431#(and (<= 1 main_~i~0) (<= main_~i~0 23))] [2018-04-12 02:52:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:50,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 02:52:50,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 02:52:50,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-04-12 02:52:50,095 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 27 states. [2018-04-12 02:52:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:50,720 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2018-04-12 02:52:50,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 02:52:50,720 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-04-12 02:52:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:50,721 INFO L225 Difference]: With dead ends: 396 [2018-04-12 02:52:50,721 INFO L226 Difference]: Without dead ends: 396 [2018-04-12 02:52:50,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 02:52:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-12 02:52:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2018-04-12 02:52:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-12 02:52:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2018-04-12 02:52:50,725 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 123 [2018-04-12 02:52:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:50,725 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2018-04-12 02:52:50,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 02:52:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2018-04-12 02:52:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-04-12 02:52:50,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:50,726 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:50,726 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1207308227, now seen corresponding path program 24 times [2018-04-12 02:52:50,727 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:50,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:50,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:50,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-12 02:52:50,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:50,938 INFO L182 omatonBuilderFactory]: Interpolants [11264#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 11265#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 11266#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 11267#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 11268#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 11269#(and (<= 8 main_~i~0) (<= main_~i~0 24)), 11242#true, 11243#false, 11244#(<= main_~i~0 0), 11245#(<= main_~i~0 1), 11246#(<= main_~i~0 2), 11247#(<= main_~i~0 3), 11248#(<= main_~i~0 4), 11249#(<= main_~i~0 5), 11250#(<= main_~i~0 6), 11251#(<= main_~i~0 7), 11252#(<= main_~i~0 8), 11253#(<= main_~i~0 9), 11254#(<= main_~i~0 10), 11255#(<= main_~i~0 11), 11256#(<= main_~i~0 12), 11257#(<= main_~i~0 13), 11258#(<= main_~i~0 14), 11259#(<= main_~i~0 15), 11260#(<= main_~i~0 16), 11261#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 11262#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 11263#(and (<= 2 main_~i~0) (<= main_~i~0 18))] [2018-04-12 02:52:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:50,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 02:52:50,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 02:52:50,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-04-12 02:52:50,939 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand 28 states. [2018-04-12 02:52:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:51,973 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2018-04-12 02:52:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 02:52:51,974 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 128 [2018-04-12 02:52:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:51,975 INFO L225 Difference]: With dead ends: 411 [2018-04-12 02:52:51,975 INFO L226 Difference]: Without dead ends: 411 [2018-04-12 02:52:51,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 02:52:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-12 02:52:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 382. [2018-04-12 02:52:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-04-12 02:52:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2018-04-12 02:52:51,979 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 128 [2018-04-12 02:52:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:51,980 INFO L459 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2018-04-12 02:52:51,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 02:52:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2018-04-12 02:52:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-04-12 02:52:51,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:51,980 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:51,980 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -595235626, now seen corresponding path program 25 times [2018-04-12 02:52:51,981 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:51,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:52,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:52,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 02:52:52,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:52,263 INFO L182 omatonBuilderFactory]: Interpolants [12111#true, 12112#false, 12113#(<= main_~i~0 0), 12114#(<= main_~i~0 1), 12115#(<= main_~i~0 2), 12116#(<= main_~i~0 3), 12117#(<= main_~i~0 4), 12118#(<= main_~i~0 5), 12119#(<= main_~i~0 6), 12120#(<= main_~i~0 7), 12121#(<= main_~i~0 8), 12122#(<= main_~i~0 9), 12123#(<= main_~i~0 10), 12124#(<= main_~i~0 11), 12125#(<= main_~i~0 12), 12126#(<= main_~i~0 13), 12127#(<= main_~i~0 14), 12128#(<= main_~i~0 15), 12129#(<= main_~i~0 16), 12130#(<= main_~i~0 17), 12131#(<= main_~i~0 18), 12132#(<= main_~i~0 19), 12133#(<= main_~i~0 20), 12134#(<= main_~i~0 21), 12135#(<= main_~i~0 22), 12136#(<= main_~i~0 23), 12137#(<= main_~i~0 24), 12138#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 12139#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-04-12 02:52:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:52,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 02:52:52,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 02:52:52,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-12 02:52:52,264 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand 29 states. [2018-04-12 02:52:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:52,957 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2018-04-12 02:52:52,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 02:52:52,958 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-04-12 02:52:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:52,959 INFO L225 Difference]: With dead ends: 426 [2018-04-12 02:52:52,959 INFO L226 Difference]: Without dead ends: 426 [2018-04-12 02:52:52,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 02:52:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-04-12 02:52:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2018-04-12 02:52:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-04-12 02:52:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 528 transitions. [2018-04-12 02:52:52,965 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 528 transitions. Word has length 133 [2018-04-12 02:52:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:52,966 INFO L459 AbstractCegarLoop]: Abstraction has 396 states and 528 transitions. [2018-04-12 02:52:52,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 02:52:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 528 transitions. [2018-04-12 02:52:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-04-12 02:52:52,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:52,967 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:52,967 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash -353572899, now seen corresponding path program 26 times [2018-04-12 02:52:52,968 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:52,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:53,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:53,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-12 02:52:53,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:53,268 INFO L182 omatonBuilderFactory]: Interpolants [13012#true, 13013#false, 13014#(<= main_~i~0 0), 13015#(<= main_~i~0 1), 13016#(<= main_~i~0 2), 13017#(<= main_~i~0 3), 13018#(<= main_~i~0 4), 13019#(<= main_~i~0 5), 13020#(<= main_~i~0 6), 13021#(<= main_~i~0 7), 13022#(<= main_~i~0 8), 13023#(<= main_~i~0 9), 13024#(<= main_~i~0 10), 13025#(<= main_~i~0 11), 13026#(<= main_~i~0 12), 13027#(<= main_~i~0 13), 13028#(<= main_~i~0 14), 13029#(<= main_~i~0 15), 13030#(<= main_~i~0 16), 13031#(<= main_~i~0 17), 13032#(<= main_~i~0 18), 13033#(<= main_~i~0 19), 13034#(<= main_~i~0 20), 13035#(<= main_~i~0 21), 13036#(<= main_~i~0 22), 13037#(<= main_~i~0 23), 13038#(<= main_~i~0 24), 13039#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 13040#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 13041#(and (<= 2 main_~i~0) (<= main_~i~0 26))] [2018-04-12 02:52:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:53,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 02:52:53,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 02:52:53,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-12 02:52:53,269 INFO L87 Difference]: Start difference. First operand 396 states and 528 transitions. Second operand 30 states. [2018-04-12 02:52:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:54,067 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2018-04-12 02:52:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 02:52:54,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 138 [2018-04-12 02:52:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:54,068 INFO L225 Difference]: With dead ends: 441 [2018-04-12 02:52:54,068 INFO L226 Difference]: Without dead ends: 441 [2018-04-12 02:52:54,069 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-12 02:52:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-04-12 02:52:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2018-04-12 02:52:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-12 02:52:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2018-04-12 02:52:54,073 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 138 [2018-04-12 02:52:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:54,073 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2018-04-12 02:52:54,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 02:52:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2018-04-12 02:52:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-04-12 02:52:54,074 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:54,074 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:54,074 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1259587274, now seen corresponding path program 27 times [2018-04-12 02:52:54,074 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:54,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:54,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:54,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 02:52:54,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:54,329 INFO L182 omatonBuilderFactory]: Interpolants [13952#(<= main_~i~0 5), 13953#(<= main_~i~0 6), 13954#(<= main_~i~0 7), 13955#(<= main_~i~0 8), 13956#(<= main_~i~0 9), 13957#(<= main_~i~0 10), 13958#(<= main_~i~0 11), 13959#(<= main_~i~0 12), 13960#(<= main_~i~0 13), 13961#(<= main_~i~0 14), 13962#(<= main_~i~0 15), 13963#(<= main_~i~0 16), 13964#(<= main_~i~0 17), 13965#(<= main_~i~0 18), 13966#(<= main_~i~0 19), 13967#(<= main_~i~0 20), 13968#(<= main_~i~0 21), 13969#(<= main_~i~0 22), 13970#(<= main_~i~0 23), 13971#(<= main_~i~0 24), 13972#(<= main_~i~0 25), 13973#(<= main_~i~0 26), 13974#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 13975#(and (<= 1 main_~i~0) (<= main_~i~0 27)), 13945#true, 13946#false, 13947#(<= main_~i~0 0), 13948#(<= main_~i~0 1), 13949#(<= main_~i~0 2), 13950#(<= main_~i~0 3), 13951#(<= main_~i~0 4)] [2018-04-12 02:52:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:54,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 02:52:54,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 02:52:54,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-12 02:52:54,330 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand 31 states. [2018-04-12 02:52:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:55,065 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2018-04-12 02:52:55,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 02:52:55,065 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2018-04-12 02:52:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:55,067 INFO L225 Difference]: With dead ends: 456 [2018-04-12 02:52:55,067 INFO L226 Difference]: Without dead ends: 456 [2018-04-12 02:52:55,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 02:52:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-12 02:52:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 424. [2018-04-12 02:52:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-12 02:52:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2018-04-12 02:52:55,073 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 143 [2018-04-12 02:52:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:55,074 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2018-04-12 02:52:55,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 02:52:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2018-04-12 02:52:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-04-12 02:52:55,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:55,075 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:55,076 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash 582408061, now seen corresponding path program 28 times [2018-04-12 02:52:55,076 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:55,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:55,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:55,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-12 02:52:55,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:55,428 INFO L182 omatonBuilderFactory]: Interpolants [14912#(<= main_~i~0 0), 14913#(<= main_~i~0 1), 14914#(<= main_~i~0 2), 14915#(<= main_~i~0 3), 14916#(<= main_~i~0 4), 14917#(<= main_~i~0 5), 14918#(<= main_~i~0 6), 14919#(<= main_~i~0 7), 14920#(<= main_~i~0 8), 14921#(<= main_~i~0 9), 14922#(<= main_~i~0 10), 14923#(<= main_~i~0 11), 14924#(<= main_~i~0 12), 14925#(<= main_~i~0 13), 14926#(<= main_~i~0 14), 14927#(<= main_~i~0 15), 14928#(<= main_~i~0 16), 14929#(<= main_~i~0 17), 14930#(<= main_~i~0 18), 14931#(<= main_~i~0 19), 14932#(<= main_~i~0 20), 14933#(<= main_~i~0 21), 14934#(<= main_~i~0 22), 14935#(<= main_~i~0 23), 14936#(<= main_~i~0 24), 14937#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 14938#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 14939#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 14940#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 14941#(and (<= 4 main_~i~0) (<= main_~i~0 28)), 14910#true, 14911#false] [2018-04-12 02:52:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:55,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 02:52:55,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 02:52:55,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-04-12 02:52:55,429 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 32 states. [2018-04-12 02:52:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:56,414 INFO L93 Difference]: Finished difference Result 471 states and 620 transitions. [2018-04-12 02:52:56,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 02:52:56,414 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 148 [2018-04-12 02:52:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:56,415 INFO L225 Difference]: With dead ends: 471 [2018-04-12 02:52:56,416 INFO L226 Difference]: Without dead ends: 471 [2018-04-12 02:52:56,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 02:52:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-12 02:52:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 438. [2018-04-12 02:52:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-12 02:52:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-04-12 02:52:56,420 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 148 [2018-04-12 02:52:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:56,420 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-04-12 02:52:56,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 02:52:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-04-12 02:52:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-04-12 02:52:56,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:56,421 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:56,422 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash -637071978, now seen corresponding path program 29 times [2018-04-12 02:52:56,422 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:56,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:56,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:56,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 02:52:56,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:56,758 INFO L182 omatonBuilderFactory]: Interpolants [15936#(<= main_~i~0 27), 15937#(<= main_~i~0 28), 15938#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 15939#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 15907#true, 15908#false, 15909#(<= main_~i~0 0), 15910#(<= main_~i~0 1), 15911#(<= main_~i~0 2), 15912#(<= main_~i~0 3), 15913#(<= main_~i~0 4), 15914#(<= main_~i~0 5), 15915#(<= main_~i~0 6), 15916#(<= main_~i~0 7), 15917#(<= main_~i~0 8), 15918#(<= main_~i~0 9), 15919#(<= main_~i~0 10), 15920#(<= main_~i~0 11), 15921#(<= main_~i~0 12), 15922#(<= main_~i~0 13), 15923#(<= main_~i~0 14), 15924#(<= main_~i~0 15), 15925#(<= main_~i~0 16), 15926#(<= main_~i~0 17), 15927#(<= main_~i~0 18), 15928#(<= main_~i~0 19), 15929#(<= main_~i~0 20), 15930#(<= main_~i~0 21), 15931#(<= main_~i~0 22), 15932#(<= main_~i~0 23), 15933#(<= main_~i~0 24), 15934#(<= main_~i~0 25), 15935#(<= main_~i~0 26)] [2018-04-12 02:52:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:56,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 02:52:56,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 02:52:56,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 02:52:56,759 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 33 states. [2018-04-12 02:52:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:57,631 INFO L93 Difference]: Finished difference Result 486 states and 640 transitions. [2018-04-12 02:52:57,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 02:52:57,631 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 153 [2018-04-12 02:52:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:57,632 INFO L225 Difference]: With dead ends: 486 [2018-04-12 02:52:57,632 INFO L226 Difference]: Without dead ends: 486 [2018-04-12 02:52:57,633 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 02:52:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-04-12 02:52:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2018-04-12 02:52:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-12 02:52:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 604 transitions. [2018-04-12 02:52:57,637 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 604 transitions. Word has length 153 [2018-04-12 02:52:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:57,637 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 604 transitions. [2018-04-12 02:52:57,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 02:52:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 604 transitions. [2018-04-12 02:52:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-12 02:52:57,638 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:57,638 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:57,638 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2062434531, now seen corresponding path program 30 times [2018-04-12 02:52:57,638 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:57,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:57,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:57,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-12 02:52:57,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:57,983 INFO L182 omatonBuilderFactory]: Interpolants [16960#(<= main_~i~0 22), 16961#(<= main_~i~0 23), 16962#(<= main_~i~0 24), 16963#(<= main_~i~0 25), 16964#(<= main_~i~0 26), 16965#(<= main_~i~0 27), 16966#(<= main_~i~0 28), 16967#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 16968#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 16969#(and (<= 2 main_~i~0) (<= main_~i~0 30)), 16936#true, 16937#false, 16938#(<= main_~i~0 0), 16939#(<= main_~i~0 1), 16940#(<= main_~i~0 2), 16941#(<= main_~i~0 3), 16942#(<= main_~i~0 4), 16943#(<= main_~i~0 5), 16944#(<= main_~i~0 6), 16945#(<= main_~i~0 7), 16946#(<= main_~i~0 8), 16947#(<= main_~i~0 9), 16948#(<= main_~i~0 10), 16949#(<= main_~i~0 11), 16950#(<= main_~i~0 12), 16951#(<= main_~i~0 13), 16952#(<= main_~i~0 14), 16953#(<= main_~i~0 15), 16954#(<= main_~i~0 16), 16955#(<= main_~i~0 17), 16956#(<= main_~i~0 18), 16957#(<= main_~i~0 19), 16958#(<= main_~i~0 20), 16959#(<= main_~i~0 21)] [2018-04-12 02:52:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:57,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 02:52:57,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 02:52:57,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 02:52:57,984 INFO L87 Difference]: Start difference. First operand 452 states and 604 transitions. Second operand 34 states. [2018-04-12 02:52:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:52:58,862 INFO L93 Difference]: Finished difference Result 501 states and 660 transitions. [2018-04-12 02:52:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 02:52:58,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 158 [2018-04-12 02:52:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:52:58,864 INFO L225 Difference]: With dead ends: 501 [2018-04-12 02:52:58,864 INFO L226 Difference]: Without dead ends: 501 [2018-04-12 02:52:58,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 02:52:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-04-12 02:52:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 466. [2018-04-12 02:52:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-04-12 02:52:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2018-04-12 02:52:58,869 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 158 [2018-04-12 02:52:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:52:58,870 INFO L459 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2018-04-12 02:52:58,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 02:52:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2018-04-12 02:52:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-04-12 02:52:58,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:52:58,871 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-12 02:52:58,871 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:52:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash 543943158, now seen corresponding path program 31 times [2018-04-12 02:52:58,872 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:52:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:52:58,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:52:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:59,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:52:59,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 02:52:59,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:52:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:59,261 INFO L182 omatonBuilderFactory]: Interpolants [17997#true, 17998#false, 17999#(<= main_~i~0 0), 18000#(<= main_~i~0 1), 18001#(<= main_~i~0 2), 18002#(<= main_~i~0 3), 18003#(<= main_~i~0 4), 18004#(<= main_~i~0 5), 18005#(<= main_~i~0 6), 18006#(<= main_~i~0 7), 18007#(<= main_~i~0 8), 18008#(<= main_~i~0 9), 18009#(<= main_~i~0 10), 18010#(<= main_~i~0 11), 18011#(<= main_~i~0 12), 18012#(<= main_~i~0 13), 18013#(<= main_~i~0 14), 18014#(<= main_~i~0 15), 18015#(<= main_~i~0 16), 18016#(<= main_~i~0 17), 18017#(<= main_~i~0 18), 18018#(<= main_~i~0 19), 18019#(<= main_~i~0 20), 18020#(<= main_~i~0 21), 18021#(<= main_~i~0 22), 18022#(<= main_~i~0 23), 18023#(<= main_~i~0 24), 18024#(<= main_~i~0 25), 18025#(<= main_~i~0 26), 18026#(<= main_~i~0 27), 18027#(<= main_~i~0 28), 18028#(<= main_~i~0 29), 18029#(<= main_~i~0 30), 18030#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 18031#(and (<= 1 main_~i~0) (<= main_~i~0 31))] [2018-04-12 02:52:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:52:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 02:52:59,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 02:52:59,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 02:52:59,263 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand 35 states. [2018-04-12 02:53:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:00,203 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2018-04-12 02:53:00,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 02:53:00,207 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-04-12 02:53:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:00,208 INFO L225 Difference]: With dead ends: 516 [2018-04-12 02:53:00,208 INFO L226 Difference]: Without dead ends: 516 [2018-04-12 02:53:00,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 02:53:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-04-12 02:53:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 480. [2018-04-12 02:53:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-04-12 02:53:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 642 transitions. [2018-04-12 02:53:00,213 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 642 transitions. Word has length 163 [2018-04-12 02:53:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:00,213 INFO L459 AbstractCegarLoop]: Abstraction has 480 states and 642 transitions. [2018-04-12 02:53:00,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 02:53:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 642 transitions. [2018-04-12 02:53:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-04-12 02:53:00,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:00,215 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:00,215 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1423466819, now seen corresponding path program 32 times [2018-04-12 02:53:00,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:00,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:00,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:00,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 02:53:00,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:00,699 INFO L182 omatonBuilderFactory]: Interpolants [19090#true, 19091#false, 19092#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 19093#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 19094#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 19095#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 19096#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 19097#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 19098#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 19099#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 19100#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 19101#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 19102#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 19103#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 19104#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 19105#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 19106#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 19107#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 19108#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 19109#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 19110#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 19111#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 19112#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 19113#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 19114#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 19115#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 19116#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 19117#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 19118#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 19119#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 19120#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 19121#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 19122#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 19123#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 19124#(and (<= 32 main_~i~0) (<= main_~i~0 32))] [2018-04-12 02:53:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:00,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 02:53:00,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 02:53:00,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 02:53:00,700 INFO L87 Difference]: Start difference. First operand 480 states and 642 transitions. Second operand 35 states. [2018-04-12 02:53:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:05,392 INFO L93 Difference]: Finished difference Result 531 states and 700 transitions. [2018-04-12 02:53:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 02:53:05,392 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-04-12 02:53:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:05,393 INFO L225 Difference]: With dead ends: 531 [2018-04-12 02:53:05,393 INFO L226 Difference]: Without dead ends: 531 [2018-04-12 02:53:05,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 02:53:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-04-12 02:53:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 494. [2018-04-12 02:53:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-04-12 02:53:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 661 transitions. [2018-04-12 02:53:05,401 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 661 transitions. Word has length 168 [2018-04-12 02:53:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:05,402 INFO L459 AbstractCegarLoop]: Abstraction has 494 states and 661 transitions. [2018-04-12 02:53:05,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 02:53:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 661 transitions. [2018-04-12 02:53:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-04-12 02:53:05,404 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:05,404 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:05,404 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash 422628950, now seen corresponding path program 33 times [2018-04-12 02:53:05,405 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:05,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:05,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:05,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-12 02:53:05,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:05,860 INFO L182 omatonBuilderFactory]: Interpolants [20160#(<= main_~i~0 8), 20161#(<= main_~i~0 9), 20162#(<= main_~i~0 10), 20163#(<= main_~i~0 11), 20164#(<= main_~i~0 12), 20165#(<= main_~i~0 13), 20166#(<= main_~i~0 14), 20167#(<= main_~i~0 15), 20168#(<= main_~i~0 16), 20169#(<= main_~i~0 17), 20170#(<= main_~i~0 18), 20171#(<= main_~i~0 19), 20172#(<= main_~i~0 20), 20173#(<= main_~i~0 21), 20174#(<= main_~i~0 22), 20175#(<= main_~i~0 23), 20176#(<= main_~i~0 24), 20177#(<= main_~i~0 25), 20178#(<= main_~i~0 26), 20179#(<= main_~i~0 27), 20180#(<= main_~i~0 28), 20181#(<= main_~i~0 29), 20182#(<= main_~i~0 30), 20183#(<= main_~i~0 31), 20184#(<= main_~i~0 32), 20185#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 20186#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 20150#true, 20151#false, 20152#(<= main_~i~0 0), 20153#(<= main_~i~0 1), 20154#(<= main_~i~0 2), 20155#(<= main_~i~0 3), 20156#(<= main_~i~0 4), 20157#(<= main_~i~0 5), 20158#(<= main_~i~0 6), 20159#(<= main_~i~0 7)] [2018-04-12 02:53:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:05,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 02:53:05,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 02:53:05,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 02:53:05,861 INFO L87 Difference]: Start difference. First operand 494 states and 661 transitions. Second operand 37 states. [2018-04-12 02:53:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:06,816 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2018-04-12 02:53:06,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 02:53:06,816 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 173 [2018-04-12 02:53:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:06,817 INFO L225 Difference]: With dead ends: 546 [2018-04-12 02:53:06,818 INFO L226 Difference]: Without dead ends: 546 [2018-04-12 02:53:06,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 02:53:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-04-12 02:53:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 508. [2018-04-12 02:53:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-04-12 02:53:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2018-04-12 02:53:06,822 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 173 [2018-04-12 02:53:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:06,822 INFO L459 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2018-04-12 02:53:06,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 02:53:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2018-04-12 02:53:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-12 02:53:06,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:06,823 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:06,823 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1101166173, now seen corresponding path program 34 times [2018-04-12 02:53:06,824 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:06,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:07,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:07,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-12 02:53:07,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:07,235 INFO L182 omatonBuilderFactory]: Interpolants [21312#(<= main_~i~0 3), 21313#(<= main_~i~0 4), 21314#(<= main_~i~0 5), 21315#(<= main_~i~0 6), 21316#(<= main_~i~0 7), 21317#(<= main_~i~0 8), 21318#(<= main_~i~0 9), 21319#(<= main_~i~0 10), 21320#(<= main_~i~0 11), 21321#(<= main_~i~0 12), 21322#(<= main_~i~0 13), 21323#(<= main_~i~0 14), 21324#(<= main_~i~0 15), 21325#(<= main_~i~0 16), 21326#(<= main_~i~0 17), 21327#(<= main_~i~0 18), 21328#(<= main_~i~0 19), 21329#(<= main_~i~0 20), 21330#(<= main_~i~0 21), 21331#(<= main_~i~0 22), 21332#(<= main_~i~0 23), 21333#(<= main_~i~0 24), 21334#(<= main_~i~0 25), 21335#(<= main_~i~0 26), 21336#(<= main_~i~0 27), 21337#(<= main_~i~0 28), 21338#(<= main_~i~0 29), 21339#(<= main_~i~0 30), 21340#(<= main_~i~0 31), 21341#(<= main_~i~0 32), 21342#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 21343#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 21344#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 21307#true, 21308#false, 21309#(<= main_~i~0 0), 21310#(<= main_~i~0 1), 21311#(<= main_~i~0 2)] [2018-04-12 02:53:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:07,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 02:53:07,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 02:53:07,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 02:53:07,235 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand 38 states. [2018-04-12 02:53:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:08,345 INFO L93 Difference]: Finished difference Result 561 states and 740 transitions. [2018-04-12 02:53:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 02:53:08,345 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 178 [2018-04-12 02:53:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:08,347 INFO L225 Difference]: With dead ends: 561 [2018-04-12 02:53:08,347 INFO L226 Difference]: Without dead ends: 561 [2018-04-12 02:53:08,347 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-12 02:53:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-12 02:53:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 522. [2018-04-12 02:53:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-04-12 02:53:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2018-04-12 02:53:08,351 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 178 [2018-04-12 02:53:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:08,351 INFO L459 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2018-04-12 02:53:08,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 02:53:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2018-04-12 02:53:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-04-12 02:53:08,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:08,352 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:08,352 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:08,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1911274166, now seen corresponding path program 35 times [2018-04-12 02:53:08,353 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:08,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:08,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:08,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-12 02:53:08,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:08,785 INFO L182 omatonBuilderFactory]: Interpolants [22528#(<= main_~i~0 30), 22529#(<= main_~i~0 31), 22530#(<= main_~i~0 32), 22531#(<= main_~i~0 33), 22532#(<= main_~i~0 34), 22533#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 22534#(and (<= 1 main_~i~0) (<= main_~i~0 35)), 22496#true, 22497#false, 22498#(<= main_~i~0 0), 22499#(<= main_~i~0 1), 22500#(<= main_~i~0 2), 22501#(<= main_~i~0 3), 22502#(<= main_~i~0 4), 22503#(<= main_~i~0 5), 22504#(<= main_~i~0 6), 22505#(<= main_~i~0 7), 22506#(<= main_~i~0 8), 22507#(<= main_~i~0 9), 22508#(<= main_~i~0 10), 22509#(<= main_~i~0 11), 22510#(<= main_~i~0 12), 22511#(<= main_~i~0 13), 22512#(<= main_~i~0 14), 22513#(<= main_~i~0 15), 22514#(<= main_~i~0 16), 22515#(<= main_~i~0 17), 22516#(<= main_~i~0 18), 22517#(<= main_~i~0 19), 22518#(<= main_~i~0 20), 22519#(<= main_~i~0 21), 22520#(<= main_~i~0 22), 22521#(<= main_~i~0 23), 22522#(<= main_~i~0 24), 22523#(<= main_~i~0 25), 22524#(<= main_~i~0 26), 22525#(<= main_~i~0 27), 22526#(<= main_~i~0 28), 22527#(<= main_~i~0 29)] [2018-04-12 02:53:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:08,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 02:53:08,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 02:53:08,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 02:53:08,786 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand 39 states. [2018-04-12 02:53:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:09,865 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2018-04-12 02:53:09,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 02:53:09,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 183 [2018-04-12 02:53:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:09,866 INFO L225 Difference]: With dead ends: 576 [2018-04-12 02:53:09,866 INFO L226 Difference]: Without dead ends: 576 [2018-04-12 02:53:09,867 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 02:53:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-04-12 02:53:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 536. [2018-04-12 02:53:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-04-12 02:53:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2018-04-12 02:53:09,870 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 183 [2018-04-12 02:53:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:09,870 INFO L459 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2018-04-12 02:53:09,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 02:53:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2018-04-12 02:53:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-12 02:53:09,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:09,871 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:09,871 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1465104899, now seen corresponding path program 36 times [2018-04-12 02:53:09,872 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:09,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:10,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:10,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-12 02:53:10,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:10,276 INFO L182 omatonBuilderFactory]: Interpolants [23744#(<= main_~i~0 25), 23745#(<= main_~i~0 26), 23746#(<= main_~i~0 27), 23747#(<= main_~i~0 28), 23748#(<= main_~i~0 29), 23749#(<= main_~i~0 30), 23750#(<= main_~i~0 31), 23751#(<= main_~i~0 32), 23752#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 23753#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 23754#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 23755#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 23756#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 23717#true, 23718#false, 23719#(<= main_~i~0 0), 23720#(<= main_~i~0 1), 23721#(<= main_~i~0 2), 23722#(<= main_~i~0 3), 23723#(<= main_~i~0 4), 23724#(<= main_~i~0 5), 23725#(<= main_~i~0 6), 23726#(<= main_~i~0 7), 23727#(<= main_~i~0 8), 23728#(<= main_~i~0 9), 23729#(<= main_~i~0 10), 23730#(<= main_~i~0 11), 23731#(<= main_~i~0 12), 23732#(<= main_~i~0 13), 23733#(<= main_~i~0 14), 23734#(<= main_~i~0 15), 23735#(<= main_~i~0 16), 23736#(<= main_~i~0 17), 23737#(<= main_~i~0 18), 23738#(<= main_~i~0 19), 23739#(<= main_~i~0 20), 23740#(<= main_~i~0 21), 23741#(<= main_~i~0 22), 23742#(<= main_~i~0 23), 23743#(<= main_~i~0 24)] [2018-04-12 02:53:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:10,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 02:53:10,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 02:53:10,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 02:53:10,277 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand 40 states. [2018-04-12 02:53:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:11,541 INFO L93 Difference]: Finished difference Result 591 states and 780 transitions. [2018-04-12 02:53:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 02:53:11,542 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 188 [2018-04-12 02:53:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:11,543 INFO L225 Difference]: With dead ends: 591 [2018-04-12 02:53:11,543 INFO L226 Difference]: Without dead ends: 591 [2018-04-12 02:53:11,543 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-12 02:53:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-04-12 02:53:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 550. [2018-04-12 02:53:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-04-12 02:53:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 737 transitions. [2018-04-12 02:53:11,547 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 737 transitions. Word has length 188 [2018-04-12 02:53:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:11,547 INFO L459 AbstractCegarLoop]: Abstraction has 550 states and 737 transitions. [2018-04-12 02:53:11,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 02:53:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 737 transitions. [2018-04-12 02:53:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-04-12 02:53:11,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:11,548 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:11,548 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1420996374, now seen corresponding path program 37 times [2018-04-12 02:53:11,549 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:11,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:12,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:12,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-12 02:53:12,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:12,077 INFO L182 omatonBuilderFactory]: Interpolants [24970#true, 24971#false, 24972#(<= main_~i~0 0), 24973#(<= main_~i~0 1), 24974#(<= main_~i~0 2), 24975#(<= main_~i~0 3), 24976#(<= main_~i~0 4), 24977#(<= main_~i~0 5), 24978#(<= main_~i~0 6), 24979#(<= main_~i~0 7), 24980#(<= main_~i~0 8), 24981#(<= main_~i~0 9), 24982#(<= main_~i~0 10), 24983#(<= main_~i~0 11), 24984#(<= main_~i~0 12), 24985#(<= main_~i~0 13), 24986#(<= main_~i~0 14), 24987#(<= main_~i~0 15), 24988#(<= main_~i~0 16), 24989#(<= main_~i~0 17), 24990#(<= main_~i~0 18), 24991#(<= main_~i~0 19), 24992#(<= main_~i~0 20), 24993#(<= main_~i~0 21), 24994#(<= main_~i~0 22), 24995#(<= main_~i~0 23), 24996#(<= main_~i~0 24), 24997#(<= main_~i~0 25), 24998#(<= main_~i~0 26), 24999#(<= main_~i~0 27), 25000#(<= main_~i~0 28), 25001#(<= main_~i~0 29), 25002#(<= main_~i~0 30), 25003#(<= main_~i~0 31), 25004#(<= main_~i~0 32), 25005#(<= main_~i~0 33), 25006#(<= main_~i~0 34), 25007#(<= main_~i~0 35), 25008#(<= main_~i~0 36), 25009#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 25010#(and (<= 1 main_~i~0) (<= main_~i~0 37))] [2018-04-12 02:53:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:12,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 02:53:12,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 02:53:12,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 02:53:12,078 INFO L87 Difference]: Start difference. First operand 550 states and 737 transitions. Second operand 41 states. [2018-04-12 02:53:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:13,386 INFO L93 Difference]: Finished difference Result 606 states and 800 transitions. [2018-04-12 02:53:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 02:53:13,386 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-04-12 02:53:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:13,387 INFO L225 Difference]: With dead ends: 606 [2018-04-12 02:53:13,388 INFO L226 Difference]: Without dead ends: 606 [2018-04-12 02:53:13,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 02:53:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-04-12 02:53:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 564. [2018-04-12 02:53:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-04-12 02:53:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2018-04-12 02:53:13,392 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 193 [2018-04-12 02:53:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:13,392 INFO L459 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2018-04-12 02:53:13,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 02:53:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2018-04-12 02:53:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-04-12 02:53:13,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:13,393 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:13,393 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1813049955, now seen corresponding path program 38 times [2018-04-12 02:53:13,394 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:13,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:13,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:13,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-12 02:53:13,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:13,832 INFO L182 omatonBuilderFactory]: Interpolants [26255#true, 26256#false, 26257#(<= main_~i~0 0), 26258#(<= main_~i~0 1), 26259#(<= main_~i~0 2), 26260#(<= main_~i~0 3), 26261#(<= main_~i~0 4), 26262#(<= main_~i~0 5), 26263#(<= main_~i~0 6), 26264#(<= main_~i~0 7), 26265#(<= main_~i~0 8), 26266#(<= main_~i~0 9), 26267#(<= main_~i~0 10), 26268#(<= main_~i~0 11), 26269#(<= main_~i~0 12), 26270#(<= main_~i~0 13), 26271#(<= main_~i~0 14), 26272#(<= main_~i~0 15), 26273#(<= main_~i~0 16), 26274#(<= main_~i~0 17), 26275#(<= main_~i~0 18), 26276#(<= main_~i~0 19), 26277#(<= main_~i~0 20), 26278#(<= main_~i~0 21), 26279#(<= main_~i~0 22), 26280#(<= main_~i~0 23), 26281#(<= main_~i~0 24), 26282#(<= main_~i~0 25), 26283#(<= main_~i~0 26), 26284#(<= main_~i~0 27), 26285#(<= main_~i~0 28), 26286#(<= main_~i~0 29), 26287#(<= main_~i~0 30), 26288#(<= main_~i~0 31), 26289#(<= main_~i~0 32), 26290#(<= main_~i~0 33), 26291#(<= main_~i~0 34), 26292#(<= main_~i~0 35), 26293#(<= main_~i~0 36), 26294#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 26295#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 26296#(and (<= 2 main_~i~0) (<= main_~i~0 38))] [2018-04-12 02:53:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:13,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 02:53:13,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 02:53:13,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 02:53:13,833 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand 42 states. [2018-04-12 02:53:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:15,242 INFO L93 Difference]: Finished difference Result 621 states and 820 transitions. [2018-04-12 02:53:15,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 02:53:15,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 198 [2018-04-12 02:53:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:15,261 INFO L225 Difference]: With dead ends: 621 [2018-04-12 02:53:15,261 INFO L226 Difference]: Without dead ends: 621 [2018-04-12 02:53:15,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 02:53:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-04-12 02:53:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 578. [2018-04-12 02:53:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-04-12 02:53:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 775 transitions. [2018-04-12 02:53:15,266 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 775 transitions. Word has length 198 [2018-04-12 02:53:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:15,266 INFO L459 AbstractCegarLoop]: Abstraction has 578 states and 775 transitions. [2018-04-12 02:53:15,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 02:53:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 775 transitions. [2018-04-12 02:53:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-04-12 02:53:15,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:15,267 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:15,267 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash -937710730, now seen corresponding path program 39 times [2018-04-12 02:53:15,268 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:15,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:15,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:15,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-12 02:53:15,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:15,737 INFO L182 omatonBuilderFactory]: Interpolants [27584#(<= main_~i~0 10), 27585#(<= main_~i~0 11), 27586#(<= main_~i~0 12), 27587#(<= main_~i~0 13), 27588#(<= main_~i~0 14), 27589#(<= main_~i~0 15), 27590#(<= main_~i~0 16), 27591#(<= main_~i~0 17), 27592#(<= main_~i~0 18), 27593#(<= main_~i~0 19), 27594#(<= main_~i~0 20), 27595#(<= main_~i~0 21), 27596#(<= main_~i~0 22), 27597#(<= main_~i~0 23), 27598#(<= main_~i~0 24), 27599#(<= main_~i~0 25), 27600#(<= main_~i~0 26), 27601#(<= main_~i~0 27), 27602#(<= main_~i~0 28), 27603#(<= main_~i~0 29), 27604#(<= main_~i~0 30), 27605#(<= main_~i~0 31), 27606#(<= main_~i~0 32), 27607#(<= main_~i~0 33), 27608#(<= main_~i~0 34), 27609#(<= main_~i~0 35), 27610#(<= main_~i~0 36), 27611#(<= main_~i~0 37), 27612#(<= main_~i~0 38), 27613#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 27614#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 27572#true, 27573#false, 27574#(<= main_~i~0 0), 27575#(<= main_~i~0 1), 27576#(<= main_~i~0 2), 27577#(<= main_~i~0 3), 27578#(<= main_~i~0 4), 27579#(<= main_~i~0 5), 27580#(<= main_~i~0 6), 27581#(<= main_~i~0 7), 27582#(<= main_~i~0 8), 27583#(<= main_~i~0 9)] [2018-04-12 02:53:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:15,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 02:53:15,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 02:53:15,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 02:53:15,738 INFO L87 Difference]: Start difference. First operand 578 states and 775 transitions. Second operand 43 states. [2018-04-12 02:53:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:16,990 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2018-04-12 02:53:16,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 02:53:16,990 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 203 [2018-04-12 02:53:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:16,992 INFO L225 Difference]: With dead ends: 636 [2018-04-12 02:53:16,992 INFO L226 Difference]: Without dead ends: 636 [2018-04-12 02:53:16,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-04-12 02:53:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-04-12 02:53:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 592. [2018-04-12 02:53:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-04-12 02:53:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 794 transitions. [2018-04-12 02:53:16,999 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 794 transitions. Word has length 203 [2018-04-12 02:53:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:17,000 INFO L459 AbstractCegarLoop]: Abstraction has 592 states and 794 transitions. [2018-04-12 02:53:17,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 02:53:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 794 transitions. [2018-04-12 02:53:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-04-12 02:53:17,001 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:17,001 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:17,001 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1433088707, now seen corresponding path program 40 times [2018-04-12 02:53:17,002 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:17,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:17,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:17,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-12 02:53:17,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:17,565 INFO L182 omatonBuilderFactory]: Interpolants [28928#(<= main_~i~0 5), 28929#(<= main_~i~0 6), 28930#(<= main_~i~0 7), 28931#(<= main_~i~0 8), 28932#(<= main_~i~0 9), 28933#(<= main_~i~0 10), 28934#(<= main_~i~0 11), 28935#(<= main_~i~0 12), 28936#(<= main_~i~0 13), 28937#(<= main_~i~0 14), 28938#(<= main_~i~0 15), 28939#(<= main_~i~0 16), 28940#(<= main_~i~0 17), 28941#(<= main_~i~0 18), 28942#(<= main_~i~0 19), 28943#(<= main_~i~0 20), 28944#(<= main_~i~0 21), 28945#(<= main_~i~0 22), 28946#(<= main_~i~0 23), 28947#(<= main_~i~0 24), 28948#(<= main_~i~0 25), 28949#(<= main_~i~0 26), 28950#(<= main_~i~0 27), 28951#(<= main_~i~0 28), 28952#(<= main_~i~0 29), 28953#(<= main_~i~0 30), 28954#(<= main_~i~0 31), 28955#(<= main_~i~0 32), 28956#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 28957#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 28958#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 28959#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 28960#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 28961#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 28962#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 28963#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 28964#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 28921#true, 28922#false, 28923#(<= main_~i~0 0), 28924#(<= main_~i~0 1), 28925#(<= main_~i~0 2), 28926#(<= main_~i~0 3), 28927#(<= main_~i~0 4)] [2018-04-12 02:53:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:17,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 02:53:17,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 02:53:17,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 02:53:17,566 INFO L87 Difference]: Start difference. First operand 592 states and 794 transitions. Second operand 44 states. [2018-04-12 02:53:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:19,519 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2018-04-12 02:53:19,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 02:53:19,519 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 208 [2018-04-12 02:53:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:19,521 INFO L225 Difference]: With dead ends: 651 [2018-04-12 02:53:19,521 INFO L226 Difference]: Without dead ends: 651 [2018-04-12 02:53:19,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-04-12 02:53:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-04-12 02:53:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 606. [2018-04-12 02:53:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-04-12 02:53:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 813 transitions. [2018-04-12 02:53:19,526 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 813 transitions. Word has length 208 [2018-04-12 02:53:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:19,526 INFO L459 AbstractCegarLoop]: Abstraction has 606 states and 813 transitions. [2018-04-12 02:53:19,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 02:53:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 813 transitions. [2018-04-12 02:53:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-04-12 02:53:19,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:19,527 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:19,527 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash 255635414, now seen corresponding path program 41 times [2018-04-12 02:53:19,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:19,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:20,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:20,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-12 02:53:20,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:20,064 INFO L182 omatonBuilderFactory]: Interpolants [30336#(<= main_~i~0 32), 30337#(<= main_~i~0 33), 30338#(<= main_~i~0 34), 30339#(<= main_~i~0 35), 30340#(<= main_~i~0 36), 30341#(<= main_~i~0 37), 30342#(<= main_~i~0 38), 30343#(<= main_~i~0 39), 30344#(<= main_~i~0 40), 30345#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 30346#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 30302#true, 30303#false, 30304#(<= main_~i~0 0), 30305#(<= main_~i~0 1), 30306#(<= main_~i~0 2), 30307#(<= main_~i~0 3), 30308#(<= main_~i~0 4), 30309#(<= main_~i~0 5), 30310#(<= main_~i~0 6), 30311#(<= main_~i~0 7), 30312#(<= main_~i~0 8), 30313#(<= main_~i~0 9), 30314#(<= main_~i~0 10), 30315#(<= main_~i~0 11), 30316#(<= main_~i~0 12), 30317#(<= main_~i~0 13), 30318#(<= main_~i~0 14), 30319#(<= main_~i~0 15), 30320#(<= main_~i~0 16), 30321#(<= main_~i~0 17), 30322#(<= main_~i~0 18), 30323#(<= main_~i~0 19), 30324#(<= main_~i~0 20), 30325#(<= main_~i~0 21), 30326#(<= main_~i~0 22), 30327#(<= main_~i~0 23), 30328#(<= main_~i~0 24), 30329#(<= main_~i~0 25), 30330#(<= main_~i~0 26), 30331#(<= main_~i~0 27), 30332#(<= main_~i~0 28), 30333#(<= main_~i~0 29), 30334#(<= main_~i~0 30), 30335#(<= main_~i~0 31)] [2018-04-12 02:53:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:20,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-12 02:53:20,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-12 02:53:20,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 02:53:20,065 INFO L87 Difference]: Start difference. First operand 606 states and 813 transitions. Second operand 45 states. [2018-04-12 02:53:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:21,397 INFO L93 Difference]: Finished difference Result 666 states and 880 transitions. [2018-04-12 02:53:21,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 02:53:21,397 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 213 [2018-04-12 02:53:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:21,399 INFO L225 Difference]: With dead ends: 666 [2018-04-12 02:53:21,399 INFO L226 Difference]: Without dead ends: 666 [2018-04-12 02:53:21,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-04-12 02:53:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-04-12 02:53:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 620. [2018-04-12 02:53:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-04-12 02:53:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 832 transitions. [2018-04-12 02:53:21,405 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 832 transitions. Word has length 213 [2018-04-12 02:53:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:21,405 INFO L459 AbstractCegarLoop]: Abstraction has 620 states and 832 transitions. [2018-04-12 02:53:21,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-12 02:53:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 832 transitions. [2018-04-12 02:53:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-04-12 02:53:21,406 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:21,406 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:21,406 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash 658998493, now seen corresponding path program 42 times [2018-04-12 02:53:21,407 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:21,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:21,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:21,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-12 02:53:21,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:21,981 INFO L182 omatonBuilderFactory]: Interpolants [31744#(<= main_~i~0 27), 31745#(<= main_~i~0 28), 31746#(<= main_~i~0 29), 31747#(<= main_~i~0 30), 31748#(<= main_~i~0 31), 31749#(<= main_~i~0 32), 31750#(<= main_~i~0 33), 31751#(<= main_~i~0 34), 31752#(<= main_~i~0 35), 31753#(<= main_~i~0 36), 31754#(<= main_~i~0 37), 31755#(<= main_~i~0 38), 31756#(<= main_~i~0 39), 31757#(<= main_~i~0 40), 31758#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 31759#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 31760#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 31715#true, 31716#false, 31717#(<= main_~i~0 0), 31718#(<= main_~i~0 1), 31719#(<= main_~i~0 2), 31720#(<= main_~i~0 3), 31721#(<= main_~i~0 4), 31722#(<= main_~i~0 5), 31723#(<= main_~i~0 6), 31724#(<= main_~i~0 7), 31725#(<= main_~i~0 8), 31726#(<= main_~i~0 9), 31727#(<= main_~i~0 10), 31728#(<= main_~i~0 11), 31729#(<= main_~i~0 12), 31730#(<= main_~i~0 13), 31731#(<= main_~i~0 14), 31732#(<= main_~i~0 15), 31733#(<= main_~i~0 16), 31734#(<= main_~i~0 17), 31735#(<= main_~i~0 18), 31736#(<= main_~i~0 19), 31737#(<= main_~i~0 20), 31738#(<= main_~i~0 21), 31739#(<= main_~i~0 22), 31740#(<= main_~i~0 23), 31741#(<= main_~i~0 24), 31742#(<= main_~i~0 25), 31743#(<= main_~i~0 26)] [2018-04-12 02:53:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:21,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 02:53:21,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 02:53:21,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 02:53:21,982 INFO L87 Difference]: Start difference. First operand 620 states and 832 transitions. Second operand 46 states. [2018-04-12 02:53:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:23,393 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2018-04-12 02:53:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-12 02:53:23,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 218 [2018-04-12 02:53:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:23,394 INFO L225 Difference]: With dead ends: 681 [2018-04-12 02:53:23,395 INFO L226 Difference]: Without dead ends: 681 [2018-04-12 02:53:23,395 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-12 02:53:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-04-12 02:53:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 634. [2018-04-12 02:53:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-04-12 02:53:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 851 transitions. [2018-04-12 02:53:23,399 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 851 transitions. Word has length 218 [2018-04-12 02:53:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:23,399 INFO L459 AbstractCegarLoop]: Abstraction has 634 states and 851 transitions. [2018-04-12 02:53:23,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 02:53:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 851 transitions. [2018-04-12 02:53:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-04-12 02:53:23,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:23,401 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:23,401 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash 162249782, now seen corresponding path program 43 times [2018-04-12 02:53:23,401 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:23,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:23,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:23,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-12 02:53:23,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:23,995 INFO L182 omatonBuilderFactory]: Interpolants [33160#true, 33161#false, 33162#(<= main_~i~0 0), 33163#(<= main_~i~0 1), 33164#(<= main_~i~0 2), 33165#(<= main_~i~0 3), 33166#(<= main_~i~0 4), 33167#(<= main_~i~0 5), 33168#(<= main_~i~0 6), 33169#(<= main_~i~0 7), 33170#(<= main_~i~0 8), 33171#(<= main_~i~0 9), 33172#(<= main_~i~0 10), 33173#(<= main_~i~0 11), 33174#(<= main_~i~0 12), 33175#(<= main_~i~0 13), 33176#(<= main_~i~0 14), 33177#(<= main_~i~0 15), 33178#(<= main_~i~0 16), 33179#(<= main_~i~0 17), 33180#(<= main_~i~0 18), 33181#(<= main_~i~0 19), 33182#(<= main_~i~0 20), 33183#(<= main_~i~0 21), 33184#(<= main_~i~0 22), 33185#(<= main_~i~0 23), 33186#(<= main_~i~0 24), 33187#(<= main_~i~0 25), 33188#(<= main_~i~0 26), 33189#(<= main_~i~0 27), 33190#(<= main_~i~0 28), 33191#(<= main_~i~0 29), 33192#(<= main_~i~0 30), 33193#(<= main_~i~0 31), 33194#(<= main_~i~0 32), 33195#(<= main_~i~0 33), 33196#(<= main_~i~0 34), 33197#(<= main_~i~0 35), 33198#(<= main_~i~0 36), 33199#(<= main_~i~0 37), 33200#(<= main_~i~0 38), 33201#(<= main_~i~0 39), 33202#(<= main_~i~0 40), 33203#(<= main_~i~0 41), 33204#(<= main_~i~0 42), 33205#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 33206#(and (<= 1 main_~i~0) (<= main_~i~0 43))] [2018-04-12 02:53:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:23,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-12 02:53:23,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-12 02:53:23,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 02:53:23,995 INFO L87 Difference]: Start difference. First operand 634 states and 851 transitions. Second operand 47 states. [2018-04-12 02:53:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:25,596 INFO L93 Difference]: Finished difference Result 696 states and 920 transitions. [2018-04-12 02:53:25,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 02:53:25,596 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-04-12 02:53:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:25,597 INFO L225 Difference]: With dead ends: 696 [2018-04-12 02:53:25,598 INFO L226 Difference]: Without dead ends: 696 [2018-04-12 02:53:25,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-12 02:53:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-04-12 02:53:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 648. [2018-04-12 02:53:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-04-12 02:53:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 870 transitions. [2018-04-12 02:53:25,603 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 870 transitions. Word has length 223 [2018-04-12 02:53:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:25,603 INFO L459 AbstractCegarLoop]: Abstraction has 648 states and 870 transitions. [2018-04-12 02:53:25,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-12 02:53:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 870 transitions. [2018-04-12 02:53:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-04-12 02:53:25,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:25,604 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:25,604 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:25,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2016490621, now seen corresponding path program 44 times [2018-04-12 02:53:25,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:25,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:26,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:26,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-12 02:53:26,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:26,229 INFO L182 omatonBuilderFactory]: Interpolants [34637#true, 34638#false, 34639#(<= main_~i~0 0), 34640#(<= main_~i~0 1), 34641#(<= main_~i~0 2), 34642#(<= main_~i~0 3), 34643#(<= main_~i~0 4), 34644#(<= main_~i~0 5), 34645#(<= main_~i~0 6), 34646#(<= main_~i~0 7), 34647#(<= main_~i~0 8), 34648#(<= main_~i~0 9), 34649#(<= main_~i~0 10), 34650#(<= main_~i~0 11), 34651#(<= main_~i~0 12), 34652#(<= main_~i~0 13), 34653#(<= main_~i~0 14), 34654#(<= main_~i~0 15), 34655#(<= main_~i~0 16), 34656#(<= main_~i~0 17), 34657#(<= main_~i~0 18), 34658#(<= main_~i~0 19), 34659#(<= main_~i~0 20), 34660#(<= main_~i~0 21), 34661#(<= main_~i~0 22), 34662#(<= main_~i~0 23), 34663#(<= main_~i~0 24), 34664#(<= main_~i~0 25), 34665#(<= main_~i~0 26), 34666#(<= main_~i~0 27), 34667#(<= main_~i~0 28), 34668#(<= main_~i~0 29), 34669#(<= main_~i~0 30), 34670#(<= main_~i~0 31), 34671#(<= main_~i~0 32), 34672#(<= main_~i~0 33), 34673#(<= main_~i~0 34), 34674#(<= main_~i~0 35), 34675#(<= main_~i~0 36), 34676#(<= main_~i~0 37), 34677#(<= main_~i~0 38), 34678#(<= main_~i~0 39), 34679#(<= main_~i~0 40), 34680#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 34681#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 34682#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 34683#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 34684#(and (<= main_~i~0 44) (<= 4 main_~i~0))] [2018-04-12 02:53:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:26,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 02:53:26,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 02:53:26,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 02:53:26,230 INFO L87 Difference]: Start difference. First operand 648 states and 870 transitions. Second operand 48 states. [2018-04-12 02:53:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:28,199 INFO L93 Difference]: Finished difference Result 711 states and 940 transitions. [2018-04-12 02:53:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 02:53:28,200 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2018-04-12 02:53:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:28,201 INFO L225 Difference]: With dead ends: 711 [2018-04-12 02:53:28,201 INFO L226 Difference]: Without dead ends: 711 [2018-04-12 02:53:28,201 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-12 02:53:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-04-12 02:53:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 662. [2018-04-12 02:53:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-12 02:53:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 889 transitions. [2018-04-12 02:53:28,206 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 889 transitions. Word has length 228 [2018-04-12 02:53:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:28,206 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 889 transitions. [2018-04-12 02:53:28,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 02:53:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 889 transitions. [2018-04-12 02:53:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-04-12 02:53:28,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:28,207 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:28,207 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:28,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1820405610, now seen corresponding path program 45 times [2018-04-12 02:53:28,208 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:28,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:28,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:28,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-12 02:53:28,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:28,943 INFO L182 omatonBuilderFactory]: Interpolants [36146#true, 36147#false, 36148#(<= main_~i~0 0), 36149#(<= main_~i~0 1), 36150#(<= main_~i~0 2), 36151#(<= main_~i~0 3), 36152#(<= main_~i~0 4), 36153#(<= main_~i~0 5), 36154#(<= main_~i~0 6), 36155#(<= main_~i~0 7), 36156#(<= main_~i~0 8), 36157#(<= main_~i~0 9), 36158#(<= main_~i~0 10), 36159#(<= main_~i~0 11), 36160#(<= main_~i~0 12), 36161#(<= main_~i~0 13), 36162#(<= main_~i~0 14), 36163#(<= main_~i~0 15), 36164#(<= main_~i~0 16), 36165#(<= main_~i~0 17), 36166#(<= main_~i~0 18), 36167#(<= main_~i~0 19), 36168#(<= main_~i~0 20), 36169#(<= main_~i~0 21), 36170#(<= main_~i~0 22), 36171#(<= main_~i~0 23), 36172#(<= main_~i~0 24), 36173#(<= main_~i~0 25), 36174#(<= main_~i~0 26), 36175#(<= main_~i~0 27), 36176#(<= main_~i~0 28), 36177#(<= main_~i~0 29), 36178#(<= main_~i~0 30), 36179#(<= main_~i~0 31), 36180#(<= main_~i~0 32), 36181#(<= main_~i~0 33), 36182#(<= main_~i~0 34), 36183#(<= main_~i~0 35), 36184#(<= main_~i~0 36), 36185#(<= main_~i~0 37), 36186#(<= main_~i~0 38), 36187#(<= main_~i~0 39), 36188#(<= main_~i~0 40), 36189#(<= main_~i~0 41), 36190#(<= main_~i~0 42), 36191#(<= main_~i~0 43), 36192#(<= main_~i~0 44), 36193#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 36194#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-04-12 02:53:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:28,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-12 02:53:28,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-12 02:53:28,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 02:53:28,944 INFO L87 Difference]: Start difference. First operand 662 states and 889 transitions. Second operand 49 states. [2018-04-12 02:53:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:30,507 INFO L93 Difference]: Finished difference Result 726 states and 960 transitions. [2018-04-12 02:53:30,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 02:53:30,507 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 233 [2018-04-12 02:53:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:30,509 INFO L225 Difference]: With dead ends: 726 [2018-04-12 02:53:30,509 INFO L226 Difference]: Without dead ends: 726 [2018-04-12 02:53:30,509 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-12 02:53:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-04-12 02:53:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 676. [2018-04-12 02:53:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-04-12 02:53:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 908 transitions. [2018-04-12 02:53:30,514 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 908 transitions. Word has length 233 [2018-04-12 02:53:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:30,514 INFO L459 AbstractCegarLoop]: Abstraction has 676 states and 908 transitions. [2018-04-12 02:53:30,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-12 02:53:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 908 transitions. [2018-04-12 02:53:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-12 02:53:30,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:30,515 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:30,516 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash -553919459, now seen corresponding path program 46 times [2018-04-12 02:53:30,516 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:30,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:31,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:31,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-12 02:53:31,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:31,184 INFO L182 omatonBuilderFactory]: Interpolants [37687#true, 37688#false, 37689#(<= main_~i~0 0), 37690#(<= main_~i~0 1), 37691#(<= main_~i~0 2), 37692#(<= main_~i~0 3), 37693#(<= main_~i~0 4), 37694#(<= main_~i~0 5), 37695#(<= main_~i~0 6), 37696#(<= main_~i~0 7), 37697#(<= main_~i~0 8), 37698#(<= main_~i~0 9), 37699#(<= main_~i~0 10), 37700#(<= main_~i~0 11), 37701#(<= main_~i~0 12), 37702#(<= main_~i~0 13), 37703#(<= main_~i~0 14), 37704#(<= main_~i~0 15), 37705#(<= main_~i~0 16), 37706#(<= main_~i~0 17), 37707#(<= main_~i~0 18), 37708#(<= main_~i~0 19), 37709#(<= main_~i~0 20), 37710#(<= main_~i~0 21), 37711#(<= main_~i~0 22), 37712#(<= main_~i~0 23), 37713#(<= main_~i~0 24), 37714#(<= main_~i~0 25), 37715#(<= main_~i~0 26), 37716#(<= main_~i~0 27), 37717#(<= main_~i~0 28), 37718#(<= main_~i~0 29), 37719#(<= main_~i~0 30), 37720#(<= main_~i~0 31), 37721#(<= main_~i~0 32), 37722#(<= main_~i~0 33), 37723#(<= main_~i~0 34), 37724#(<= main_~i~0 35), 37725#(<= main_~i~0 36), 37726#(<= main_~i~0 37), 37727#(<= main_~i~0 38), 37728#(<= main_~i~0 39), 37729#(<= main_~i~0 40), 37730#(<= main_~i~0 41), 37731#(<= main_~i~0 42), 37732#(<= main_~i~0 43), 37733#(<= main_~i~0 44), 37734#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 37735#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 37736#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-04-12 02:53:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:31,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 02:53:31,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 02:53:31,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 02:53:31,185 INFO L87 Difference]: Start difference. First operand 676 states and 908 transitions. Second operand 50 states. [2018-04-12 02:53:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:33,002 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2018-04-12 02:53:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-12 02:53:33,003 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 238 [2018-04-12 02:53:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:33,004 INFO L225 Difference]: With dead ends: 741 [2018-04-12 02:53:33,004 INFO L226 Difference]: Without dead ends: 741 [2018-04-12 02:53:33,005 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-12 02:53:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-04-12 02:53:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 690. [2018-04-12 02:53:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-04-12 02:53:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 927 transitions. [2018-04-12 02:53:33,010 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 927 transitions. Word has length 238 [2018-04-12 02:53:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:33,010 INFO L459 AbstractCegarLoop]: Abstraction has 690 states and 927 transitions. [2018-04-12 02:53:33,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 02:53:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 927 transitions. [2018-04-12 02:53:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-04-12 02:53:33,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:33,011 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:33,011 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:33,011 INFO L82 PathProgramCache]: Analyzing trace with hash -448008970, now seen corresponding path program 47 times [2018-04-12 02:53:33,011 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:33,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:33,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:33,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 02:53:33,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:33,694 INFO L182 omatonBuilderFactory]: Interpolants [39296#(<= main_~i~0 34), 39297#(<= main_~i~0 35), 39298#(<= main_~i~0 36), 39299#(<= main_~i~0 37), 39300#(<= main_~i~0 38), 39301#(<= main_~i~0 39), 39302#(<= main_~i~0 40), 39303#(<= main_~i~0 41), 39304#(<= main_~i~0 42), 39305#(<= main_~i~0 43), 39306#(<= main_~i~0 44), 39307#(<= main_~i~0 45), 39308#(<= main_~i~0 46), 39309#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 39310#(and (<= 1 main_~i~0) (<= main_~i~0 47)), 39260#true, 39261#false, 39262#(<= main_~i~0 0), 39263#(<= main_~i~0 1), 39264#(<= main_~i~0 2), 39265#(<= main_~i~0 3), 39266#(<= main_~i~0 4), 39267#(<= main_~i~0 5), 39268#(<= main_~i~0 6), 39269#(<= main_~i~0 7), 39270#(<= main_~i~0 8), 39271#(<= main_~i~0 9), 39272#(<= main_~i~0 10), 39273#(<= main_~i~0 11), 39274#(<= main_~i~0 12), 39275#(<= main_~i~0 13), 39276#(<= main_~i~0 14), 39277#(<= main_~i~0 15), 39278#(<= main_~i~0 16), 39279#(<= main_~i~0 17), 39280#(<= main_~i~0 18), 39281#(<= main_~i~0 19), 39282#(<= main_~i~0 20), 39283#(<= main_~i~0 21), 39284#(<= main_~i~0 22), 39285#(<= main_~i~0 23), 39286#(<= main_~i~0 24), 39287#(<= main_~i~0 25), 39288#(<= main_~i~0 26), 39289#(<= main_~i~0 27), 39290#(<= main_~i~0 28), 39291#(<= main_~i~0 29), 39292#(<= main_~i~0 30), 39293#(<= main_~i~0 31), 39294#(<= main_~i~0 32), 39295#(<= main_~i~0 33)] [2018-04-12 02:53:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:33,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-12 02:53:33,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-12 02:53:33,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 02:53:33,695 INFO L87 Difference]: Start difference. First operand 690 states and 927 transitions. Second operand 51 states. [2018-04-12 02:53:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:35,332 INFO L93 Difference]: Finished difference Result 756 states and 1000 transitions. [2018-04-12 02:53:35,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 02:53:35,332 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 243 [2018-04-12 02:53:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:35,334 INFO L225 Difference]: With dead ends: 756 [2018-04-12 02:53:35,334 INFO L226 Difference]: Without dead ends: 756 [2018-04-12 02:53:35,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-04-12 02:53:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-12 02:53:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 704. [2018-04-12 02:53:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-04-12 02:53:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 946 transitions. [2018-04-12 02:53:35,339 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 946 transitions. Word has length 243 [2018-04-12 02:53:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:35,339 INFO L459 AbstractCegarLoop]: Abstraction has 704 states and 946 transitions. [2018-04-12 02:53:35,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-12 02:53:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 946 transitions. [2018-04-12 02:53:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-04-12 02:53:35,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:35,341 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:35,341 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash 282164157, now seen corresponding path program 48 times [2018-04-12 02:53:35,341 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:35,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:36,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:36,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-12 02:53:36,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:36,071 INFO L182 omatonBuilderFactory]: Interpolants [40865#true, 40866#false, 40867#(<= main_~i~0 0), 40868#(<= main_~i~0 1), 40869#(<= main_~i~0 2), 40870#(<= main_~i~0 3), 40871#(<= main_~i~0 4), 40872#(<= main_~i~0 5), 40873#(<= main_~i~0 6), 40874#(<= main_~i~0 7), 40875#(<= main_~i~0 8), 40876#(<= main_~i~0 9), 40877#(<= main_~i~0 10), 40878#(<= main_~i~0 11), 40879#(<= main_~i~0 12), 40880#(<= main_~i~0 13), 40881#(<= main_~i~0 14), 40882#(<= main_~i~0 15), 40883#(<= main_~i~0 16), 40884#(<= main_~i~0 17), 40885#(<= main_~i~0 18), 40886#(<= main_~i~0 19), 40887#(<= main_~i~0 20), 40888#(<= main_~i~0 21), 40889#(<= main_~i~0 22), 40890#(<= main_~i~0 23), 40891#(<= main_~i~0 24), 40892#(<= main_~i~0 25), 40893#(<= main_~i~0 26), 40894#(<= main_~i~0 27), 40895#(<= main_~i~0 28), 40896#(<= main_~i~0 29), 40897#(<= main_~i~0 30), 40898#(<= main_~i~0 31), 40899#(<= main_~i~0 32), 40900#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 40901#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 40902#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 40903#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 40904#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 40905#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 40906#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 40907#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 40908#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 40909#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 40910#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 40911#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 40912#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 40913#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 40914#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 40915#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 40916#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-04-12 02:53:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:36,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 02:53:36,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 02:53:36,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 02:53:36,072 INFO L87 Difference]: Start difference. First operand 704 states and 946 transitions. Second operand 52 states. [2018-04-12 02:53:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:39,809 INFO L93 Difference]: Finished difference Result 771 states and 1020 transitions. [2018-04-12 02:53:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-12 02:53:39,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 248 [2018-04-12 02:53:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:39,811 INFO L225 Difference]: With dead ends: 771 [2018-04-12 02:53:39,811 INFO L226 Difference]: Without dead ends: 771 [2018-04-12 02:53:39,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-04-12 02:53:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-04-12 02:53:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 718. [2018-04-12 02:53:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-04-12 02:53:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 965 transitions. [2018-04-12 02:53:39,817 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 965 transitions. Word has length 248 [2018-04-12 02:53:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:39,817 INFO L459 AbstractCegarLoop]: Abstraction has 718 states and 965 transitions. [2018-04-12 02:53:39,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 02:53:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 965 transitions. [2018-04-12 02:53:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-04-12 02:53:39,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:39,818 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:39,818 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash -198635178, now seen corresponding path program 49 times [2018-04-12 02:53:39,819 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:39,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:40,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:40,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-12 02:53:40,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:40,601 INFO L182 omatonBuilderFactory]: Interpolants [42502#true, 42503#false, 42504#(<= main_~i~0 0), 42505#(<= main_~i~0 1), 42506#(<= main_~i~0 2), 42507#(<= main_~i~0 3), 42508#(<= main_~i~0 4), 42509#(<= main_~i~0 5), 42510#(<= main_~i~0 6), 42511#(<= main_~i~0 7), 42512#(<= main_~i~0 8), 42513#(<= main_~i~0 9), 42514#(<= main_~i~0 10), 42515#(<= main_~i~0 11), 42516#(<= main_~i~0 12), 42517#(<= main_~i~0 13), 42518#(<= main_~i~0 14), 42519#(<= main_~i~0 15), 42520#(<= main_~i~0 16), 42521#(<= main_~i~0 17), 42522#(<= main_~i~0 18), 42523#(<= main_~i~0 19), 42524#(<= main_~i~0 20), 42525#(<= main_~i~0 21), 42526#(<= main_~i~0 22), 42527#(<= main_~i~0 23), 42528#(<= main_~i~0 24), 42529#(<= main_~i~0 25), 42530#(<= main_~i~0 26), 42531#(<= main_~i~0 27), 42532#(<= main_~i~0 28), 42533#(<= main_~i~0 29), 42534#(<= main_~i~0 30), 42535#(<= main_~i~0 31), 42536#(<= main_~i~0 32), 42537#(<= main_~i~0 33), 42538#(<= main_~i~0 34), 42539#(<= main_~i~0 35), 42540#(<= main_~i~0 36), 42541#(<= main_~i~0 37), 42542#(<= main_~i~0 38), 42543#(<= main_~i~0 39), 42544#(<= main_~i~0 40), 42545#(<= main_~i~0 41), 42546#(<= main_~i~0 42), 42547#(<= main_~i~0 43), 42548#(<= main_~i~0 44), 42549#(<= main_~i~0 45), 42550#(<= main_~i~0 46), 42551#(<= main_~i~0 47), 42552#(<= main_~i~0 48), 42553#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 42554#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-04-12 02:53:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:40,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-12 02:53:40,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-12 02:53:40,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 02:53:40,601 INFO L87 Difference]: Start difference. First operand 718 states and 965 transitions. Second operand 53 states. [2018-04-12 02:53:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:42,546 INFO L93 Difference]: Finished difference Result 786 states and 1040 transitions. [2018-04-12 02:53:42,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 02:53:42,546 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-04-12 02:53:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:42,548 INFO L225 Difference]: With dead ends: 786 [2018-04-12 02:53:42,548 INFO L226 Difference]: Without dead ends: 786 [2018-04-12 02:53:42,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-04-12 02:53:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-04-12 02:53:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 732. [2018-04-12 02:53:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-04-12 02:53:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 984 transitions. [2018-04-12 02:53:42,554 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 984 transitions. Word has length 253 [2018-04-12 02:53:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:42,554 INFO L459 AbstractCegarLoop]: Abstraction has 732 states and 984 transitions. [2018-04-12 02:53:42,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-12 02:53:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 984 transitions. [2018-04-12 02:53:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-04-12 02:53:42,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:42,556 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:42,556 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash -698608803, now seen corresponding path program 50 times [2018-04-12 02:53:42,556 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:42,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:43,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:43,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-12 02:53:43,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:43,305 INFO L182 omatonBuilderFactory]: Interpolants [44171#true, 44172#false, 44173#(<= main_~i~0 0), 44174#(<= main_~i~0 1), 44175#(<= main_~i~0 2), 44176#(<= main_~i~0 3), 44177#(<= main_~i~0 4), 44178#(<= main_~i~0 5), 44179#(<= main_~i~0 6), 44180#(<= main_~i~0 7), 44181#(<= main_~i~0 8), 44182#(<= main_~i~0 9), 44183#(<= main_~i~0 10), 44184#(<= main_~i~0 11), 44185#(<= main_~i~0 12), 44186#(<= main_~i~0 13), 44187#(<= main_~i~0 14), 44188#(<= main_~i~0 15), 44189#(<= main_~i~0 16), 44190#(<= main_~i~0 17), 44191#(<= main_~i~0 18), 44192#(<= main_~i~0 19), 44193#(<= main_~i~0 20), 44194#(<= main_~i~0 21), 44195#(<= main_~i~0 22), 44196#(<= main_~i~0 23), 44197#(<= main_~i~0 24), 44198#(<= main_~i~0 25), 44199#(<= main_~i~0 26), 44200#(<= main_~i~0 27), 44201#(<= main_~i~0 28), 44202#(<= main_~i~0 29), 44203#(<= main_~i~0 30), 44204#(<= main_~i~0 31), 44205#(<= main_~i~0 32), 44206#(<= main_~i~0 33), 44207#(<= main_~i~0 34), 44208#(<= main_~i~0 35), 44209#(<= main_~i~0 36), 44210#(<= main_~i~0 37), 44211#(<= main_~i~0 38), 44212#(<= main_~i~0 39), 44213#(<= main_~i~0 40), 44214#(<= main_~i~0 41), 44215#(<= main_~i~0 42), 44216#(<= main_~i~0 43), 44217#(<= main_~i~0 44), 44218#(<= main_~i~0 45), 44219#(<= main_~i~0 46), 44220#(<= main_~i~0 47), 44221#(<= main_~i~0 48), 44222#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 44223#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 44224#(and (<= 2 main_~i~0) (<= main_~i~0 50))] [2018-04-12 02:53:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:43,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 02:53:43,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 02:53:43,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 02:53:43,307 INFO L87 Difference]: Start difference. First operand 732 states and 984 transitions. Second operand 54 states. [2018-04-12 02:53:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:45,436 INFO L93 Difference]: Finished difference Result 801 states and 1060 transitions. [2018-04-12 02:53:45,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-12 02:53:45,436 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 258 [2018-04-12 02:53:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:45,438 INFO L225 Difference]: With dead ends: 801 [2018-04-12 02:53:45,439 INFO L226 Difference]: Without dead ends: 801 [2018-04-12 02:53:45,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-04-12 02:53:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-04-12 02:53:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 746. [2018-04-12 02:53:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-04-12 02:53:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1003 transitions. [2018-04-12 02:53:45,449 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1003 transitions. Word has length 258 [2018-04-12 02:53:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:45,449 INFO L459 AbstractCegarLoop]: Abstraction has 746 states and 1003 transitions. [2018-04-12 02:53:45,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 02:53:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1003 transitions. [2018-04-12 02:53:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-04-12 02:53:45,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:45,452 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:45,452 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:45,452 INFO L82 PathProgramCache]: Analyzing trace with hash -777241162, now seen corresponding path program 51 times [2018-04-12 02:53:45,453 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:45,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:46,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:46,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-12 02:53:46,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:46,270 INFO L182 omatonBuilderFactory]: Interpolants [45872#true, 45873#false, 45874#(<= main_~i~0 0), 45875#(<= main_~i~0 1), 45876#(<= main_~i~0 2), 45877#(<= main_~i~0 3), 45878#(<= main_~i~0 4), 45879#(<= main_~i~0 5), 45880#(<= main_~i~0 6), 45881#(<= main_~i~0 7), 45882#(<= main_~i~0 8), 45883#(<= main_~i~0 9), 45884#(<= main_~i~0 10), 45885#(<= main_~i~0 11), 45886#(<= main_~i~0 12), 45887#(<= main_~i~0 13), 45888#(<= main_~i~0 14), 45889#(<= main_~i~0 15), 45890#(<= main_~i~0 16), 45891#(<= main_~i~0 17), 45892#(<= main_~i~0 18), 45893#(<= main_~i~0 19), 45894#(<= main_~i~0 20), 45895#(<= main_~i~0 21), 45896#(<= main_~i~0 22), 45897#(<= main_~i~0 23), 45898#(<= main_~i~0 24), 45899#(<= main_~i~0 25), 45900#(<= main_~i~0 26), 45901#(<= main_~i~0 27), 45902#(<= main_~i~0 28), 45903#(<= main_~i~0 29), 45904#(<= main_~i~0 30), 45905#(<= main_~i~0 31), 45906#(<= main_~i~0 32), 45907#(<= main_~i~0 33), 45908#(<= main_~i~0 34), 45909#(<= main_~i~0 35), 45910#(<= main_~i~0 36), 45911#(<= main_~i~0 37), 45912#(<= main_~i~0 38), 45913#(<= main_~i~0 39), 45914#(<= main_~i~0 40), 45915#(<= main_~i~0 41), 45916#(<= main_~i~0 42), 45917#(<= main_~i~0 43), 45918#(<= main_~i~0 44), 45919#(<= main_~i~0 45), 45920#(<= main_~i~0 46), 45921#(<= main_~i~0 47), 45922#(<= main_~i~0 48), 45923#(<= main_~i~0 49), 45924#(<= main_~i~0 50), 45925#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 45926#(and (<= 1 main_~i~0) (<= main_~i~0 51))] [2018-04-12 02:53:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:46,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 02:53:46,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 02:53:46,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 02:53:46,271 INFO L87 Difference]: Start difference. First operand 746 states and 1003 transitions. Second operand 55 states. [2018-04-12 02:53:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:48,442 INFO L93 Difference]: Finished difference Result 816 states and 1080 transitions. [2018-04-12 02:53:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-12 02:53:48,442 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 263 [2018-04-12 02:53:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:48,444 INFO L225 Difference]: With dead ends: 816 [2018-04-12 02:53:48,444 INFO L226 Difference]: Without dead ends: 816 [2018-04-12 02:53:48,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 02:53:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2018-04-12 02:53:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 760. [2018-04-12 02:53:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-04-12 02:53:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1022 transitions. [2018-04-12 02:53:48,450 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1022 transitions. Word has length 263 [2018-04-12 02:53:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:48,450 INFO L459 AbstractCegarLoop]: Abstraction has 760 states and 1022 transitions. [2018-04-12 02:53:48,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 02:53:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1022 transitions. [2018-04-12 02:53:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-04-12 02:53:48,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:48,452 INFO L355 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:48,452 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1413111043, now seen corresponding path program 52 times [2018-04-12 02:53:48,452 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:48,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:49,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:49,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-12 02:53:49,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:49,243 INFO L182 omatonBuilderFactory]: Interpolants [47616#(<= main_~i~0 9), 47617#(<= main_~i~0 10), 47618#(<= main_~i~0 11), 47619#(<= main_~i~0 12), 47620#(<= main_~i~0 13), 47621#(<= main_~i~0 14), 47622#(<= main_~i~0 15), 47623#(<= main_~i~0 16), 47624#(<= main_~i~0 17), 47625#(<= main_~i~0 18), 47626#(<= main_~i~0 19), 47627#(<= main_~i~0 20), 47628#(<= main_~i~0 21), 47629#(<= main_~i~0 22), 47630#(<= main_~i~0 23), 47631#(<= main_~i~0 24), 47632#(<= main_~i~0 25), 47633#(<= main_~i~0 26), 47634#(<= main_~i~0 27), 47635#(<= main_~i~0 28), 47636#(<= main_~i~0 29), 47637#(<= main_~i~0 30), 47638#(<= main_~i~0 31), 47639#(<= main_~i~0 32), 47640#(<= main_~i~0 33), 47641#(<= main_~i~0 34), 47642#(<= main_~i~0 35), 47643#(<= main_~i~0 36), 47644#(<= main_~i~0 37), 47645#(<= main_~i~0 38), 47646#(<= main_~i~0 39), 47647#(<= main_~i~0 40), 47648#(<= main_~i~0 41), 47649#(<= main_~i~0 42), 47650#(<= main_~i~0 43), 47651#(<= main_~i~0 44), 47652#(<= main_~i~0 45), 47653#(<= main_~i~0 46), 47654#(<= main_~i~0 47), 47655#(<= main_~i~0 48), 47656#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 47657#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 47658#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 47659#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 47660#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 47605#true, 47606#false, 47607#(<= main_~i~0 0), 47608#(<= main_~i~0 1), 47609#(<= main_~i~0 2), 47610#(<= main_~i~0 3), 47611#(<= main_~i~0 4), 47612#(<= main_~i~0 5), 47613#(<= main_~i~0 6), 47614#(<= main_~i~0 7), 47615#(<= main_~i~0 8)] [2018-04-12 02:53:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:49,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-12 02:53:49,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-12 02:53:49,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 02:53:49,244 INFO L87 Difference]: Start difference. First operand 760 states and 1022 transitions. Second operand 56 states. [2018-04-12 02:53:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:51,604 INFO L93 Difference]: Finished difference Result 831 states and 1100 transitions. [2018-04-12 02:53:51,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-12 02:53:51,605 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 268 [2018-04-12 02:53:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:51,606 INFO L225 Difference]: With dead ends: 831 [2018-04-12 02:53:51,606 INFO L226 Difference]: Without dead ends: 831 [2018-04-12 02:53:51,607 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-12 02:53:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-04-12 02:53:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 774. [2018-04-12 02:53:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2018-04-12 02:53:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1041 transitions. [2018-04-12 02:53:51,612 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1041 transitions. Word has length 268 [2018-04-12 02:53:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:51,612 INFO L459 AbstractCegarLoop]: Abstraction has 774 states and 1041 transitions. [2018-04-12 02:53:51,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-12 02:53:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1041 transitions. [2018-04-12 02:53:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-04-12 02:53:51,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:51,613 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:51,614 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash 199979542, now seen corresponding path program 53 times [2018-04-12 02:53:51,614 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:51,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:52,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:52,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-12 02:53:52,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:52,458 INFO L182 omatonBuilderFactory]: Interpolants [49408#(<= main_~i~0 36), 49409#(<= main_~i~0 37), 49410#(<= main_~i~0 38), 49411#(<= main_~i~0 39), 49412#(<= main_~i~0 40), 49413#(<= main_~i~0 41), 49414#(<= main_~i~0 42), 49415#(<= main_~i~0 43), 49416#(<= main_~i~0 44), 49417#(<= main_~i~0 45), 49418#(<= main_~i~0 46), 49419#(<= main_~i~0 47), 49420#(<= main_~i~0 48), 49421#(<= main_~i~0 49), 49422#(<= main_~i~0 50), 49423#(<= main_~i~0 51), 49424#(<= main_~i~0 52), 49425#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 49426#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 49370#true, 49371#false, 49372#(<= main_~i~0 0), 49373#(<= main_~i~0 1), 49374#(<= main_~i~0 2), 49375#(<= main_~i~0 3), 49376#(<= main_~i~0 4), 49377#(<= main_~i~0 5), 49378#(<= main_~i~0 6), 49379#(<= main_~i~0 7), 49380#(<= main_~i~0 8), 49381#(<= main_~i~0 9), 49382#(<= main_~i~0 10), 49383#(<= main_~i~0 11), 49384#(<= main_~i~0 12), 49385#(<= main_~i~0 13), 49386#(<= main_~i~0 14), 49387#(<= main_~i~0 15), 49388#(<= main_~i~0 16), 49389#(<= main_~i~0 17), 49390#(<= main_~i~0 18), 49391#(<= main_~i~0 19), 49392#(<= main_~i~0 20), 49393#(<= main_~i~0 21), 49394#(<= main_~i~0 22), 49395#(<= main_~i~0 23), 49396#(<= main_~i~0 24), 49397#(<= main_~i~0 25), 49398#(<= main_~i~0 26), 49399#(<= main_~i~0 27), 49400#(<= main_~i~0 28), 49401#(<= main_~i~0 29), 49402#(<= main_~i~0 30), 49403#(<= main_~i~0 31), 49404#(<= main_~i~0 32), 49405#(<= main_~i~0 33), 49406#(<= main_~i~0 34), 49407#(<= main_~i~0 35)] [2018-04-12 02:53:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:52,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-12 02:53:52,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-12 02:53:52,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 02:53:52,459 INFO L87 Difference]: Start difference. First operand 774 states and 1041 transitions. Second operand 57 states. [2018-04-12 02:53:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:54,532 INFO L93 Difference]: Finished difference Result 846 states and 1120 transitions. [2018-04-12 02:53:54,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 02:53:54,533 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 273 [2018-04-12 02:53:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:54,534 INFO L225 Difference]: With dead ends: 846 [2018-04-12 02:53:54,534 INFO L226 Difference]: Without dead ends: 846 [2018-04-12 02:53:54,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4458, Invalid=7532, Unknown=0, NotChecked=0, Total=11990 [2018-04-12 02:53:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-04-12 02:53:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 788. [2018-04-12 02:53:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-04-12 02:53:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1060 transitions. [2018-04-12 02:53:54,540 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1060 transitions. Word has length 273 [2018-04-12 02:53:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:54,540 INFO L459 AbstractCegarLoop]: Abstraction has 788 states and 1060 transitions. [2018-04-12 02:53:54,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-12 02:53:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1060 transitions. [2018-04-12 02:53:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-04-12 02:53:54,541 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:54,541 INFO L355 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:54,541 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1622682269, now seen corresponding path program 54 times [2018-04-12 02:53:54,542 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:54,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 7317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:55,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:55,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-12 02:53:55,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:55,463 INFO L182 omatonBuilderFactory]: Interpolants [51200#(<= main_~i~0 31), 51201#(<= main_~i~0 32), 51202#(<= main_~i~0 33), 51203#(<= main_~i~0 34), 51204#(<= main_~i~0 35), 51205#(<= main_~i~0 36), 51206#(<= main_~i~0 37), 51207#(<= main_~i~0 38), 51208#(<= main_~i~0 39), 51209#(<= main_~i~0 40), 51210#(<= main_~i~0 41), 51211#(<= main_~i~0 42), 51212#(<= main_~i~0 43), 51213#(<= main_~i~0 44), 51214#(<= main_~i~0 45), 51215#(<= main_~i~0 46), 51216#(<= main_~i~0 47), 51217#(<= main_~i~0 48), 51218#(<= main_~i~0 49), 51219#(<= main_~i~0 50), 51220#(<= main_~i~0 51), 51221#(<= main_~i~0 52), 51222#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 51223#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 51224#(and (<= 2 main_~i~0) (<= main_~i~0 54)), 51167#true, 51168#false, 51169#(<= main_~i~0 0), 51170#(<= main_~i~0 1), 51171#(<= main_~i~0 2), 51172#(<= main_~i~0 3), 51173#(<= main_~i~0 4), 51174#(<= main_~i~0 5), 51175#(<= main_~i~0 6), 51176#(<= main_~i~0 7), 51177#(<= main_~i~0 8), 51178#(<= main_~i~0 9), 51179#(<= main_~i~0 10), 51180#(<= main_~i~0 11), 51181#(<= main_~i~0 12), 51182#(<= main_~i~0 13), 51183#(<= main_~i~0 14), 51184#(<= main_~i~0 15), 51185#(<= main_~i~0 16), 51186#(<= main_~i~0 17), 51187#(<= main_~i~0 18), 51188#(<= main_~i~0 19), 51189#(<= main_~i~0 20), 51190#(<= main_~i~0 21), 51191#(<= main_~i~0 22), 51192#(<= main_~i~0 23), 51193#(<= main_~i~0 24), 51194#(<= main_~i~0 25), 51195#(<= main_~i~0 26), 51196#(<= main_~i~0 27), 51197#(<= main_~i~0 28), 51198#(<= main_~i~0 29), 51199#(<= main_~i~0 30)] [2018-04-12 02:53:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 7317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:55,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-12 02:53:55,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-12 02:53:55,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 02:53:55,463 INFO L87 Difference]: Start difference. First operand 788 states and 1060 transitions. Second operand 58 states. [2018-04-12 02:53:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:53:57,613 INFO L93 Difference]: Finished difference Result 861 states and 1140 transitions. [2018-04-12 02:53:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-12 02:53:57,613 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 278 [2018-04-12 02:53:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:53:57,615 INFO L225 Difference]: With dead ends: 861 [2018-04-12 02:53:57,615 INFO L226 Difference]: Without dead ends: 861 [2018-04-12 02:53:57,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-04-12 02:53:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-04-12 02:53:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 802. [2018-04-12 02:53:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2018-04-12 02:53:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1079 transitions. [2018-04-12 02:53:57,622 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1079 transitions. Word has length 278 [2018-04-12 02:53:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:53:57,622 INFO L459 AbstractCegarLoop]: Abstraction has 802 states and 1079 transitions. [2018-04-12 02:53:57,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-12 02:53:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1079 transitions. [2018-04-12 02:53:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-04-12 02:53:57,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:53:57,623 INFO L355 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-12 02:53:57,623 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:53:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 226274934, now seen corresponding path program 55 times [2018-04-12 02:53:57,624 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:53:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:53:57,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:53:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:58,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:53:58,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-12 02:53:58,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:53:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:58,542 INFO L182 omatonBuilderFactory]: Interpolants [52996#true, 52997#false, 52998#(<= main_~i~0 0), 52999#(<= main_~i~0 1), 53000#(<= main_~i~0 2), 53001#(<= main_~i~0 3), 53002#(<= main_~i~0 4), 53003#(<= main_~i~0 5), 53004#(<= main_~i~0 6), 53005#(<= main_~i~0 7), 53006#(<= main_~i~0 8), 53007#(<= main_~i~0 9), 53008#(<= main_~i~0 10), 53009#(<= main_~i~0 11), 53010#(<= main_~i~0 12), 53011#(<= main_~i~0 13), 53012#(<= main_~i~0 14), 53013#(<= main_~i~0 15), 53014#(<= main_~i~0 16), 53015#(<= main_~i~0 17), 53016#(<= main_~i~0 18), 53017#(<= main_~i~0 19), 53018#(<= main_~i~0 20), 53019#(<= main_~i~0 21), 53020#(<= main_~i~0 22), 53021#(<= main_~i~0 23), 53022#(<= main_~i~0 24), 53023#(<= main_~i~0 25), 53024#(<= main_~i~0 26), 53025#(<= main_~i~0 27), 53026#(<= main_~i~0 28), 53027#(<= main_~i~0 29), 53028#(<= main_~i~0 30), 53029#(<= main_~i~0 31), 53030#(<= main_~i~0 32), 53031#(<= main_~i~0 33), 53032#(<= main_~i~0 34), 53033#(<= main_~i~0 35), 53034#(<= main_~i~0 36), 53035#(<= main_~i~0 37), 53036#(<= main_~i~0 38), 53037#(<= main_~i~0 39), 53038#(<= main_~i~0 40), 53039#(<= main_~i~0 41), 53040#(<= main_~i~0 42), 53041#(<= main_~i~0 43), 53042#(<= main_~i~0 44), 53043#(<= main_~i~0 45), 53044#(<= main_~i~0 46), 53045#(<= main_~i~0 47), 53046#(<= main_~i~0 48), 53047#(<= main_~i~0 49), 53048#(<= main_~i~0 50), 53049#(<= main_~i~0 51), 53050#(<= main_~i~0 52), 53051#(<= main_~i~0 53), 53052#(<= main_~i~0 54), 53053#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 53054#(and (<= main_~i~0 55) (<= 1 main_~i~0))] [2018-04-12 02:53:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:53:58,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-12 02:53:58,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-12 02:53:58,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 02:53:58,543 INFO L87 Difference]: Start difference. First operand 802 states and 1079 transitions. Second operand 59 states. [2018-04-12 02:54:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:01,034 INFO L93 Difference]: Finished difference Result 876 states and 1160 transitions. [2018-04-12 02:54:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-12 02:54:01,034 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 283 [2018-04-12 02:54:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:01,036 INFO L225 Difference]: With dead ends: 876 [2018-04-12 02:54:01,036 INFO L226 Difference]: Without dead ends: 876 [2018-04-12 02:54:01,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-12 02:54:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-04-12 02:54:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 816. [2018-04-12 02:54:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-04-12 02:54:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1098 transitions. [2018-04-12 02:54:01,041 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1098 transitions. Word has length 283 [2018-04-12 02:54:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:01,041 INFO L459 AbstractCegarLoop]: Abstraction has 816 states and 1098 transitions. [2018-04-12 02:54:01,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-12 02:54:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1098 transitions. [2018-04-12 02:54:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-04-12 02:54:01,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:01,043 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:01,043 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1201821123, now seen corresponding path program 56 times [2018-04-12 02:54:01,044 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:01,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 7868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:02,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:02,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-12 02:54:02,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:02,117 INFO L182 omatonBuilderFactory]: Interpolants [54912#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 54913#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 54914#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 54915#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 54916#(and (<= main_~i~0 56) (<= 8 main_~i~0)), 54857#true, 54858#false, 54859#(<= main_~i~0 0), 54860#(<= main_~i~0 1), 54861#(<= main_~i~0 2), 54862#(<= main_~i~0 3), 54863#(<= main_~i~0 4), 54864#(<= main_~i~0 5), 54865#(<= main_~i~0 6), 54866#(<= main_~i~0 7), 54867#(<= main_~i~0 8), 54868#(<= main_~i~0 9), 54869#(<= main_~i~0 10), 54870#(<= main_~i~0 11), 54871#(<= main_~i~0 12), 54872#(<= main_~i~0 13), 54873#(<= main_~i~0 14), 54874#(<= main_~i~0 15), 54875#(<= main_~i~0 16), 54876#(<= main_~i~0 17), 54877#(<= main_~i~0 18), 54878#(<= main_~i~0 19), 54879#(<= main_~i~0 20), 54880#(<= main_~i~0 21), 54881#(<= main_~i~0 22), 54882#(<= main_~i~0 23), 54883#(<= main_~i~0 24), 54884#(<= main_~i~0 25), 54885#(<= main_~i~0 26), 54886#(<= main_~i~0 27), 54887#(<= main_~i~0 28), 54888#(<= main_~i~0 29), 54889#(<= main_~i~0 30), 54890#(<= main_~i~0 31), 54891#(<= main_~i~0 32), 54892#(<= main_~i~0 33), 54893#(<= main_~i~0 34), 54894#(<= main_~i~0 35), 54895#(<= main_~i~0 36), 54896#(<= main_~i~0 37), 54897#(<= main_~i~0 38), 54898#(<= main_~i~0 39), 54899#(<= main_~i~0 40), 54900#(<= main_~i~0 41), 54901#(<= main_~i~0 42), 54902#(<= main_~i~0 43), 54903#(<= main_~i~0 44), 54904#(<= main_~i~0 45), 54905#(<= main_~i~0 46), 54906#(<= main_~i~0 47), 54907#(<= main_~i~0 48), 54908#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 54909#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 54910#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 54911#(and (<= main_~i~0 51) (<= 3 main_~i~0))] [2018-04-12 02:54:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 7868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:02,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-12 02:54:02,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-12 02:54:02,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 02:54:02,118 INFO L87 Difference]: Start difference. First operand 816 states and 1098 transitions. Second operand 60 states. [2018-04-12 02:54:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:05,494 INFO L93 Difference]: Finished difference Result 891 states and 1180 transitions. [2018-04-12 02:54:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-12 02:54:05,494 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 288 [2018-04-12 02:54:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:05,496 INFO L225 Difference]: With dead ends: 891 [2018-04-12 02:54:05,496 INFO L226 Difference]: Without dead ends: 891 [2018-04-12 02:54:05,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-12 02:54:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-04-12 02:54:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 830. [2018-04-12 02:54:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-12 02:54:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1117 transitions. [2018-04-12 02:54:05,502 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1117 transitions. Word has length 288 [2018-04-12 02:54:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:05,502 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1117 transitions. [2018-04-12 02:54:05,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-12 02:54:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1117 transitions. [2018-04-12 02:54:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-04-12 02:54:05,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:05,504 INFO L355 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:05,504 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2104881878, now seen corresponding path program 57 times [2018-04-12 02:54:05,504 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:05,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8151 backedges. 0 proven. 8151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:06,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:06,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-12 02:54:06,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:06,546 INFO L182 omatonBuilderFactory]: Interpolants [56750#true, 56751#false, 56752#(<= main_~i~0 0), 56753#(<= main_~i~0 1), 56754#(<= main_~i~0 2), 56755#(<= main_~i~0 3), 56756#(<= main_~i~0 4), 56757#(<= main_~i~0 5), 56758#(<= main_~i~0 6), 56759#(<= main_~i~0 7), 56760#(<= main_~i~0 8), 56761#(<= main_~i~0 9), 56762#(<= main_~i~0 10), 56763#(<= main_~i~0 11), 56764#(<= main_~i~0 12), 56765#(<= main_~i~0 13), 56766#(<= main_~i~0 14), 56767#(<= main_~i~0 15), 56768#(<= main_~i~0 16), 56769#(<= main_~i~0 17), 56770#(<= main_~i~0 18), 56771#(<= main_~i~0 19), 56772#(<= main_~i~0 20), 56773#(<= main_~i~0 21), 56774#(<= main_~i~0 22), 56775#(<= main_~i~0 23), 56776#(<= main_~i~0 24), 56777#(<= main_~i~0 25), 56778#(<= main_~i~0 26), 56779#(<= main_~i~0 27), 56780#(<= main_~i~0 28), 56781#(<= main_~i~0 29), 56782#(<= main_~i~0 30), 56783#(<= main_~i~0 31), 56784#(<= main_~i~0 32), 56785#(<= main_~i~0 33), 56786#(<= main_~i~0 34), 56787#(<= main_~i~0 35), 56788#(<= main_~i~0 36), 56789#(<= main_~i~0 37), 56790#(<= main_~i~0 38), 56791#(<= main_~i~0 39), 56792#(<= main_~i~0 40), 56793#(<= main_~i~0 41), 56794#(<= main_~i~0 42), 56795#(<= main_~i~0 43), 56796#(<= main_~i~0 44), 56797#(<= main_~i~0 45), 56798#(<= main_~i~0 46), 56799#(<= main_~i~0 47), 56800#(<= main_~i~0 48), 56801#(<= main_~i~0 49), 56802#(<= main_~i~0 50), 56803#(<= main_~i~0 51), 56804#(<= main_~i~0 52), 56805#(<= main_~i~0 53), 56806#(<= main_~i~0 54), 56807#(<= main_~i~0 55), 56808#(<= main_~i~0 56), 56809#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 56810#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-04-12 02:54:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8151 backedges. 0 proven. 8151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:06,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-12 02:54:06,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-12 02:54:06,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-04-12 02:54:06,547 INFO L87 Difference]: Start difference. First operand 830 states and 1117 transitions. Second operand 61 states. [2018-04-12 02:54:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:09,176 INFO L93 Difference]: Finished difference Result 906 states and 1200 transitions. [2018-04-12 02:54:09,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-12 02:54:09,176 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 293 [2018-04-12 02:54:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:09,178 INFO L225 Difference]: With dead ends: 906 [2018-04-12 02:54:09,178 INFO L226 Difference]: Without dead ends: 906 [2018-04-12 02:54:09,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5136, Invalid=8670, Unknown=0, NotChecked=0, Total=13806 [2018-04-12 02:54:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-04-12 02:54:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 844. [2018-04-12 02:54:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-04-12 02:54:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1136 transitions. [2018-04-12 02:54:09,183 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1136 transitions. Word has length 293 [2018-04-12 02:54:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:09,183 INFO L459 AbstractCegarLoop]: Abstraction has 844 states and 1136 transitions. [2018-04-12 02:54:09,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-12 02:54:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1136 transitions. [2018-04-12 02:54:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-04-12 02:54:09,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:09,185 INFO L355 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:09,185 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 157295069, now seen corresponding path program 58 times [2018-04-12 02:54:09,185 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:09,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8439 backedges. 0 proven. 8439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:10,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:10,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-12 02:54:10,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:10,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-12 02:54:10,149 INFO L182 omatonBuilderFactory]: Interpolants [58675#true, 58676#false, 58677#(<= main_~i~0 0), 58678#(<= main_~i~0 1), 58679#(<= main_~i~0 2), 58680#(<= main_~i~0 3), 58681#(<= main_~i~0 4), 58682#(<= main_~i~0 5), 58683#(<= main_~i~0 6), 58684#(<= main_~i~0 7), 58685#(<= main_~i~0 8), 58686#(<= main_~i~0 9), 58687#(<= main_~i~0 10), 58688#(<= main_~i~0 11), 58689#(<= main_~i~0 12), 58690#(<= main_~i~0 13), 58691#(<= main_~i~0 14), 58692#(<= main_~i~0 15), 58693#(<= main_~i~0 16), 58694#(<= main_~i~0 17), 58695#(<= main_~i~0 18), 58696#(<= main_~i~0 19), 58697#(<= main_~i~0 20), 58698#(<= main_~i~0 21), 58699#(<= main_~i~0 22), 58700#(<= main_~i~0 23), 58701#(<= main_~i~0 24), 58702#(<= main_~i~0 25), 58703#(<= main_~i~0 26), 58704#(<= main_~i~0 27), 58705#(<= main_~i~0 28), 58706#(<= main_~i~0 29), 58707#(<= main_~i~0 30), 58708#(<= main_~i~0 31), 58709#(<= main_~i~0 32), 58710#(<= main_~i~0 33), 58711#(<= main_~i~0 34), 58712#(<= main_~i~0 35), 58713#(<= main_~i~0 36), 58714#(<= main_~i~0 37), 58715#(<= main_~i~0 38), 58716#(<= main_~i~0 39), 58717#(<= main_~i~0 40), 58718#(<= main_~i~0 41), 58719#(<= main_~i~0 42), 58720#(<= main_~i~0 43), 58721#(<= main_~i~0 44), 58722#(<= main_~i~0 45), 58723#(<= main_~i~0 46), 58724#(<= main_~i~0 47), 58725#(<= main_~i~0 48), 58726#(<= main_~i~0 49), 58727#(<= main_~i~0 50), 58728#(<= main_~i~0 51), 58729#(<= main_~i~0 52), 58730#(<= main_~i~0 53), 58731#(<= main_~i~0 54), 58732#(<= main_~i~0 55), 58733#(<= main_~i~0 56), 58734#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 58735#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 58736#(and (<= 2 main_~i~0) (<= main_~i~0 58))] [2018-04-12 02:54:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8439 backedges. 0 proven. 8439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:10,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-12 02:54:10,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-12 02:54:10,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 02:54:10,150 INFO L87 Difference]: Start difference. First operand 844 states and 1136 transitions. Second operand 62 states. [2018-04-12 02:54:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:12,942 INFO L93 Difference]: Finished difference Result 921 states and 1220 transitions. [2018-04-12 02:54:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-12 02:54:12,942 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 298 [2018-04-12 02:54:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:12,943 INFO L225 Difference]: With dead ends: 921 [2018-04-12 02:54:12,943 INFO L226 Difference]: Without dead ends: 921 [2018-04-12 02:54:12,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5197, Invalid=9083, Unknown=0, NotChecked=0, Total=14280 [2018-04-12 02:54:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-04-12 02:54:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 858. [2018-04-12 02:54:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-04-12 02:54:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1155 transitions. [2018-04-12 02:54:12,948 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1155 transitions. Word has length 298 [2018-04-12 02:54:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:12,949 INFO L459 AbstractCegarLoop]: Abstraction has 858 states and 1155 transitions. [2018-04-12 02:54:12,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-12 02:54:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1155 transitions. [2018-04-12 02:54:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-04-12 02:54:12,950 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:12,950 INFO L355 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:12,950 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:12,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1620230346, now seen corresponding path program 59 times [2018-04-12 02:54:12,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:12,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8732 backedges. 0 proven. 8732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:14,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:14,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-12 02:54:14,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:14,006 INFO L182 omatonBuilderFactory]: Interpolants [60672#(<= main_~i~0 38), 60673#(<= main_~i~0 39), 60674#(<= main_~i~0 40), 60675#(<= main_~i~0 41), 60676#(<= main_~i~0 42), 60677#(<= main_~i~0 43), 60678#(<= main_~i~0 44), 60679#(<= main_~i~0 45), 60680#(<= main_~i~0 46), 60681#(<= main_~i~0 47), 60682#(<= main_~i~0 48), 60683#(<= main_~i~0 49), 60684#(<= main_~i~0 50), 60685#(<= main_~i~0 51), 60686#(<= main_~i~0 52), 60687#(<= main_~i~0 53), 60688#(<= main_~i~0 54), 60689#(<= main_~i~0 55), 60690#(<= main_~i~0 56), 60691#(<= main_~i~0 57), 60692#(<= main_~i~0 58), 60693#(and (<= 0 main_~i~0) (<= main_~i~0 58)), 60694#(and (<= main_~i~0 59) (<= 1 main_~i~0)), 60632#true, 60633#false, 60634#(<= main_~i~0 0), 60635#(<= main_~i~0 1), 60636#(<= main_~i~0 2), 60637#(<= main_~i~0 3), 60638#(<= main_~i~0 4), 60639#(<= main_~i~0 5), 60640#(<= main_~i~0 6), 60641#(<= main_~i~0 7), 60642#(<= main_~i~0 8), 60643#(<= main_~i~0 9), 60644#(<= main_~i~0 10), 60645#(<= main_~i~0 11), 60646#(<= main_~i~0 12), 60647#(<= main_~i~0 13), 60648#(<= main_~i~0 14), 60649#(<= main_~i~0 15), 60650#(<= main_~i~0 16), 60651#(<= main_~i~0 17), 60652#(<= main_~i~0 18), 60653#(<= main_~i~0 19), 60654#(<= main_~i~0 20), 60655#(<= main_~i~0 21), 60656#(<= main_~i~0 22), 60657#(<= main_~i~0 23), 60658#(<= main_~i~0 24), 60659#(<= main_~i~0 25), 60660#(<= main_~i~0 26), 60661#(<= main_~i~0 27), 60662#(<= main_~i~0 28), 60663#(<= main_~i~0 29), 60664#(<= main_~i~0 30), 60665#(<= main_~i~0 31), 60666#(<= main_~i~0 32), 60667#(<= main_~i~0 33), 60668#(<= main_~i~0 34), 60669#(<= main_~i~0 35), 60670#(<= main_~i~0 36), 60671#(<= main_~i~0 37)] [2018-04-12 02:54:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8732 backedges. 0 proven. 8732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:14,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-12 02:54:14,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-12 02:54:14,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-04-12 02:54:14,007 INFO L87 Difference]: Start difference. First operand 858 states and 1155 transitions. Second operand 63 states. [2018-04-12 02:54:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:16,472 INFO L93 Difference]: Finished difference Result 936 states and 1240 transitions. [2018-04-12 02:54:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-12 02:54:16,472 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 303 [2018-04-12 02:54:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:16,473 INFO L225 Difference]: With dead ends: 936 [2018-04-12 02:54:16,474 INFO L226 Difference]: Without dead ends: 936 [2018-04-12 02:54:16,474 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5493, Invalid=9269, Unknown=0, NotChecked=0, Total=14762 [2018-04-12 02:54:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-04-12 02:54:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 872. [2018-04-12 02:54:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-04-12 02:54:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1174 transitions. [2018-04-12 02:54:16,481 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1174 transitions. Word has length 303 [2018-04-12 02:54:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:16,481 INFO L459 AbstractCegarLoop]: Abstraction has 872 states and 1174 transitions. [2018-04-12 02:54:16,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-12 02:54:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1174 transitions. [2018-04-12 02:54:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-04-12 02:54:16,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:16,484 INFO L355 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:16,484 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash -571895427, now seen corresponding path program 60 times [2018-04-12 02:54:16,485 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:16,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 0 proven. 9030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:17,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:17,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-12 02:54:17,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:17,584 INFO L182 omatonBuilderFactory]: Interpolants [62621#true, 62622#false, 62623#(<= main_~i~0 0), 62624#(<= main_~i~0 1), 62625#(<= main_~i~0 2), 62626#(<= main_~i~0 3), 62627#(<= main_~i~0 4), 62628#(<= main_~i~0 5), 62629#(<= main_~i~0 6), 62630#(<= main_~i~0 7), 62631#(<= main_~i~0 8), 62632#(<= main_~i~0 9), 62633#(<= main_~i~0 10), 62634#(<= main_~i~0 11), 62635#(<= main_~i~0 12), 62636#(<= main_~i~0 13), 62637#(<= main_~i~0 14), 62638#(<= main_~i~0 15), 62639#(<= main_~i~0 16), 62640#(<= main_~i~0 17), 62641#(<= main_~i~0 18), 62642#(<= main_~i~0 19), 62643#(<= main_~i~0 20), 62644#(<= main_~i~0 21), 62645#(<= main_~i~0 22), 62646#(<= main_~i~0 23), 62647#(<= main_~i~0 24), 62648#(<= main_~i~0 25), 62649#(<= main_~i~0 26), 62650#(<= main_~i~0 27), 62651#(<= main_~i~0 28), 62652#(<= main_~i~0 29), 62653#(<= main_~i~0 30), 62654#(<= main_~i~0 31), 62655#(<= main_~i~0 32), 62656#(<= main_~i~0 33), 62657#(<= main_~i~0 34), 62658#(<= main_~i~0 35), 62659#(<= main_~i~0 36), 62660#(<= main_~i~0 37), 62661#(<= main_~i~0 38), 62662#(<= main_~i~0 39), 62663#(<= main_~i~0 40), 62664#(<= main_~i~0 41), 62665#(<= main_~i~0 42), 62666#(<= main_~i~0 43), 62667#(<= main_~i~0 44), 62668#(<= main_~i~0 45), 62669#(<= main_~i~0 46), 62670#(<= main_~i~0 47), 62671#(<= main_~i~0 48), 62672#(<= main_~i~0 49), 62673#(<= main_~i~0 50), 62674#(<= main_~i~0 51), 62675#(<= main_~i~0 52), 62676#(<= main_~i~0 53), 62677#(<= main_~i~0 54), 62678#(<= main_~i~0 55), 62679#(<= main_~i~0 56), 62680#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 62681#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 62682#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 62683#(and (<= main_~i~0 59) (<= 3 main_~i~0)), 62684#(and (<= main_~i~0 60) (<= 4 main_~i~0))] [2018-04-12 02:54:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 0 proven. 9030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:17,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-12 02:54:17,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-12 02:54:17,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=2310, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 02:54:17,585 INFO L87 Difference]: Start difference. First operand 872 states and 1174 transitions. Second operand 64 states. [2018-04-12 02:54:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:20,857 INFO L93 Difference]: Finished difference Result 951 states and 1260 transitions. [2018-04-12 02:54:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-12 02:54:20,881 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 308 [2018-04-12 02:54:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:20,882 INFO L225 Difference]: With dead ends: 951 [2018-04-12 02:54:20,882 INFO L226 Difference]: Without dead ends: 951 [2018-04-12 02:54:20,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5319, Invalid=9933, Unknown=0, NotChecked=0, Total=15252 [2018-04-12 02:54:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-04-12 02:54:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 886. [2018-04-12 02:54:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-04-12 02:54:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1193 transitions. [2018-04-12 02:54:20,887 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1193 transitions. Word has length 308 [2018-04-12 02:54:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:20,887 INFO L459 AbstractCegarLoop]: Abstraction has 886 states and 1193 transitions. [2018-04-12 02:54:20,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-12 02:54:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1193 transitions. [2018-04-12 02:54:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-04-12 02:54:20,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:20,889 INFO L355 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:20,889 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:20,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1283943530, now seen corresponding path program 61 times [2018-04-12 02:54:20,889 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:20,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9333 backedges. 0 proven. 9333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:21,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:21,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-12 02:54:21,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:21,985 INFO L182 omatonBuilderFactory]: Interpolants [64642#true, 64643#false, 64644#(<= main_~i~0 0), 64645#(<= main_~i~0 1), 64646#(<= main_~i~0 2), 64647#(<= main_~i~0 3), 64648#(<= main_~i~0 4), 64649#(<= main_~i~0 5), 64650#(<= main_~i~0 6), 64651#(<= main_~i~0 7), 64652#(<= main_~i~0 8), 64653#(<= main_~i~0 9), 64654#(<= main_~i~0 10), 64655#(<= main_~i~0 11), 64656#(<= main_~i~0 12), 64657#(<= main_~i~0 13), 64658#(<= main_~i~0 14), 64659#(<= main_~i~0 15), 64660#(<= main_~i~0 16), 64661#(<= main_~i~0 17), 64662#(<= main_~i~0 18), 64663#(<= main_~i~0 19), 64664#(<= main_~i~0 20), 64665#(<= main_~i~0 21), 64666#(<= main_~i~0 22), 64667#(<= main_~i~0 23), 64668#(<= main_~i~0 24), 64669#(<= main_~i~0 25), 64670#(<= main_~i~0 26), 64671#(<= main_~i~0 27), 64672#(<= main_~i~0 28), 64673#(<= main_~i~0 29), 64674#(<= main_~i~0 30), 64675#(<= main_~i~0 31), 64676#(<= main_~i~0 32), 64677#(<= main_~i~0 33), 64678#(<= main_~i~0 34), 64679#(<= main_~i~0 35), 64680#(<= main_~i~0 36), 64681#(<= main_~i~0 37), 64682#(<= main_~i~0 38), 64683#(<= main_~i~0 39), 64684#(<= main_~i~0 40), 64685#(<= main_~i~0 41), 64686#(<= main_~i~0 42), 64687#(<= main_~i~0 43), 64688#(<= main_~i~0 44), 64689#(<= main_~i~0 45), 64690#(<= main_~i~0 46), 64691#(<= main_~i~0 47), 64692#(<= main_~i~0 48), 64693#(<= main_~i~0 49), 64694#(<= main_~i~0 50), 64695#(<= main_~i~0 51), 64696#(<= main_~i~0 52), 64697#(<= main_~i~0 53), 64698#(<= main_~i~0 54), 64699#(<= main_~i~0 55), 64700#(<= main_~i~0 56), 64701#(<= main_~i~0 57), 64702#(<= main_~i~0 58), 64703#(<= main_~i~0 59), 64704#(<= main_~i~0 60), 64705#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 64706#(and (<= main_~i~0 61) (<= 1 main_~i~0))] [2018-04-12 02:54:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9333 backedges. 0 proven. 9333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:21,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-12 02:54:21,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-12 02:54:21,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 02:54:21,986 INFO L87 Difference]: Start difference. First operand 886 states and 1193 transitions. Second operand 65 states. [2018-04-12 02:54:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:24,959 INFO L93 Difference]: Finished difference Result 966 states and 1280 transitions. [2018-04-12 02:54:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-12 02:54:24,960 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 313 [2018-04-12 02:54:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:24,961 INFO L225 Difference]: With dead ends: 966 [2018-04-12 02:54:24,961 INFO L226 Difference]: Without dead ends: 966 [2018-04-12 02:54:24,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-12 02:54:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-04-12 02:54:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 900. [2018-04-12 02:54:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-04-12 02:54:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1212 transitions. [2018-04-12 02:54:24,967 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1212 transitions. Word has length 313 [2018-04-12 02:54:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:24,967 INFO L459 AbstractCegarLoop]: Abstraction has 900 states and 1212 transitions. [2018-04-12 02:54:24,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-12 02:54:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1212 transitions. [2018-04-12 02:54:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-04-12 02:54:24,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:24,969 INFO L355 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:24,969 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1817970403, now seen corresponding path program 62 times [2018-04-12 02:54:24,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:24,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9641 backedges. 0 proven. 9641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:26,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:26,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-12 02:54:26,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:26,161 INFO L182 omatonBuilderFactory]: Interpolants [66695#true, 66697#(<= main_~i~0 0), 66696#false, 66699#(<= main_~i~0 2), 66698#(<= main_~i~0 1), 66701#(<= main_~i~0 4), 66700#(<= main_~i~0 3), 66703#(<= main_~i~0 6), 66702#(<= main_~i~0 5), 66705#(<= main_~i~0 8), 66704#(<= main_~i~0 7), 66707#(<= main_~i~0 10), 66706#(<= main_~i~0 9), 66709#(<= main_~i~0 12), 66708#(<= main_~i~0 11), 66711#(<= main_~i~0 14), 66710#(<= main_~i~0 13), 66713#(<= main_~i~0 16), 66712#(<= main_~i~0 15), 66715#(<= main_~i~0 18), 66714#(<= main_~i~0 17), 66717#(<= main_~i~0 20), 66716#(<= main_~i~0 19), 66719#(<= main_~i~0 22), 66718#(<= main_~i~0 21), 66721#(<= main_~i~0 24), 66720#(<= main_~i~0 23), 66723#(<= main_~i~0 26), 66722#(<= main_~i~0 25), 66725#(<= main_~i~0 28), 66724#(<= main_~i~0 27), 66727#(<= main_~i~0 30), 66726#(<= main_~i~0 29), 66729#(<= main_~i~0 32), 66728#(<= main_~i~0 31), 66731#(<= main_~i~0 34), 66730#(<= main_~i~0 33), 66733#(<= main_~i~0 36), 66732#(<= main_~i~0 35), 66735#(<= main_~i~0 38), 66734#(<= main_~i~0 37), 66737#(<= main_~i~0 40), 66736#(<= main_~i~0 39), 66739#(<= main_~i~0 42), 66738#(<= main_~i~0 41), 66741#(<= main_~i~0 44), 66740#(<= main_~i~0 43), 66743#(<= main_~i~0 46), 66742#(<= main_~i~0 45), 66745#(<= main_~i~0 48), 66744#(<= main_~i~0 47), 66747#(<= main_~i~0 50), 66746#(<= main_~i~0 49), 66749#(<= main_~i~0 52), 66748#(<= main_~i~0 51), 66751#(<= main_~i~0 54), 66750#(<= main_~i~0 53), 66753#(<= main_~i~0 56), 66752#(<= main_~i~0 55), 66755#(<= main_~i~0 58), 66754#(<= main_~i~0 57), 66757#(<= main_~i~0 60), 66756#(<= main_~i~0 59), 66759#(and (<= main_~i~0 61) (<= 1 main_~i~0)), 66758#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 66760#(and (<= 2 main_~i~0) (<= main_~i~0 62))] [2018-04-12 02:54:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9641 backedges. 0 proven. 9641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:26,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-12 02:54:26,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-12 02:54:26,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 02:54:26,163 INFO L87 Difference]: Start difference. First operand 900 states and 1212 transitions. Second operand 66 states. [2018-04-12 02:54:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:28,909 INFO L93 Difference]: Finished difference Result 981 states and 1300 transitions. [2018-04-12 02:54:28,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-12 02:54:28,909 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 318 [2018-04-12 02:54:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:28,911 INFO L225 Difference]: With dead ends: 981 [2018-04-12 02:54:28,911 INFO L226 Difference]: Without dead ends: 981 [2018-04-12 02:54:28,912 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-12 02:54:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-04-12 02:54:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 914. [2018-04-12 02:54:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-12 02:54:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1231 transitions. [2018-04-12 02:54:28,917 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1231 transitions. Word has length 318 [2018-04-12 02:54:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:28,918 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1231 transitions. [2018-04-12 02:54:28,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-12 02:54:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1231 transitions. [2018-04-12 02:54:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-04-12 02:54:28,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:28,919 INFO L355 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:28,919 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1445851126, now seen corresponding path program 63 times [2018-04-12 02:54:28,920 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:28,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9954 backedges. 0 proven. 9954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:30,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:30,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 02:54:30,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:30,177 INFO L182 omatonBuilderFactory]: Interpolants [68781#false, 68780#true, 68783#(<= main_~i~0 1), 68782#(<= main_~i~0 0), 68785#(<= main_~i~0 3), 68784#(<= main_~i~0 2), 68787#(<= main_~i~0 5), 68786#(<= main_~i~0 4), 68789#(<= main_~i~0 7), 68788#(<= main_~i~0 6), 68791#(<= main_~i~0 9), 68790#(<= main_~i~0 8), 68793#(<= main_~i~0 11), 68792#(<= main_~i~0 10), 68795#(<= main_~i~0 13), 68794#(<= main_~i~0 12), 68797#(<= main_~i~0 15), 68796#(<= main_~i~0 14), 68799#(<= main_~i~0 17), 68798#(<= main_~i~0 16), 68801#(<= main_~i~0 19), 68800#(<= main_~i~0 18), 68803#(<= main_~i~0 21), 68802#(<= main_~i~0 20), 68805#(<= main_~i~0 23), 68804#(<= main_~i~0 22), 68807#(<= main_~i~0 25), 68806#(<= main_~i~0 24), 68809#(<= main_~i~0 27), 68808#(<= main_~i~0 26), 68811#(<= main_~i~0 29), 68810#(<= main_~i~0 28), 68813#(<= main_~i~0 31), 68812#(<= main_~i~0 30), 68815#(<= main_~i~0 33), 68814#(<= main_~i~0 32), 68817#(<= main_~i~0 35), 68816#(<= main_~i~0 34), 68819#(<= main_~i~0 37), 68818#(<= main_~i~0 36), 68821#(<= main_~i~0 39), 68820#(<= main_~i~0 38), 68823#(<= main_~i~0 41), 68822#(<= main_~i~0 40), 68825#(<= main_~i~0 43), 68824#(<= main_~i~0 42), 68827#(<= main_~i~0 45), 68826#(<= main_~i~0 44), 68829#(<= main_~i~0 47), 68828#(<= main_~i~0 46), 68831#(<= main_~i~0 49), 68830#(<= main_~i~0 48), 68833#(<= main_~i~0 51), 68832#(<= main_~i~0 50), 68835#(<= main_~i~0 53), 68834#(<= main_~i~0 52), 68837#(<= main_~i~0 55), 68836#(<= main_~i~0 54), 68839#(<= main_~i~0 57), 68838#(<= main_~i~0 56), 68841#(<= main_~i~0 59), 68840#(<= main_~i~0 58), 68843#(<= main_~i~0 61), 68842#(<= main_~i~0 60), 68845#(and (<= 0 main_~i~0) (<= main_~i~0 62)), 68844#(<= main_~i~0 62), 68846#(and (<= 1 main_~i~0) (<= main_~i~0 63))] [2018-04-12 02:54:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9954 backedges. 0 proven. 9954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:30,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-12 02:54:30,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-12 02:54:30,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 02:54:30,178 INFO L87 Difference]: Start difference. First operand 914 states and 1231 transitions. Second operand 67 states. [2018-04-12 02:54:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:33,006 INFO L93 Difference]: Finished difference Result 996 states and 1320 transitions. [2018-04-12 02:54:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-12 02:54:33,007 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 323 [2018-04-12 02:54:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:33,008 INFO L225 Difference]: With dead ends: 996 [2018-04-12 02:54:33,008 INFO L226 Difference]: Without dead ends: 996 [2018-04-12 02:54:33,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6243, Invalid=10527, Unknown=0, NotChecked=0, Total=16770 [2018-04-12 02:54:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2018-04-12 02:54:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 928. [2018-04-12 02:54:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-04-12 02:54:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1250 transitions. [2018-04-12 02:54:33,013 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1250 transitions. Word has length 323 [2018-04-12 02:54:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:33,014 INFO L459 AbstractCegarLoop]: Abstraction has 928 states and 1250 transitions. [2018-04-12 02:54:33,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-12 02:54:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1250 transitions. [2018-04-12 02:54:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-04-12 02:54:33,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:33,015 INFO L355 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:33,015 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash -71739203, now seen corresponding path program 64 times [2018-04-12 02:54:33,016 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:33,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10272 backedges. 0 proven. 10272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:34,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:34,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 02:54:34,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:34,577 INFO L182 omatonBuilderFactory]: Interpolants [70913#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 70912#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 70915#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 70914#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 70917#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 70916#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 70919#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 70918#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 70921#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 70920#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 70923#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 70922#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 70925#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 70924#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 70927#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 70926#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 70929#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 70928#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 70931#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 70930#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 70933#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 70932#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 70935#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 70934#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 70937#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 70936#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 70939#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 70938#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 70941#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 70940#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 70943#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 70942#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 70945#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 70944#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 70947#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 70946#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 70949#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 70948#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 70951#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 70950#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 70953#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 70952#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 70955#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 70954#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 70957#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 70956#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 70959#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 70958#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 70961#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 70960#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 70963#(and (<= main_~i~0 64) (<= 64 main_~i~0)), 70962#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 70897#true, 70899#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 70898#false, 70901#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 70900#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 70903#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 70902#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 70905#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 70904#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 70907#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 70906#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 70909#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 70908#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 70911#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 70910#(and (<= main_~i~0 11) (<= 11 main_~i~0))] [2018-04-12 02:54:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10272 backedges. 0 proven. 10272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:34,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-12 02:54:34,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-12 02:54:34,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 02:54:34,578 INFO L87 Difference]: Start difference. First operand 928 states and 1250 transitions. Second operand 67 states. [2018-04-12 02:54:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:51,515 INFO L93 Difference]: Finished difference Result 1011 states and 1340 transitions. [2018-04-12 02:54:51,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-12 02:54:51,515 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 328 [2018-04-12 02:54:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:51,517 INFO L225 Difference]: With dead ends: 1011 [2018-04-12 02:54:51,517 INFO L226 Difference]: Without dead ends: 1011 [2018-04-12 02:54:51,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 02:54:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-04-12 02:54:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 942. [2018-04-12 02:54:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-04-12 02:54:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1269 transitions. [2018-04-12 02:54:51,527 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1269 transitions. Word has length 328 [2018-04-12 02:54:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:51,528 INFO L459 AbstractCegarLoop]: Abstraction has 942 states and 1269 transitions. [2018-04-12 02:54:51,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-12 02:54:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1269 transitions. [2018-04-12 02:54:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-04-12 02:54:51,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:51,531 INFO L355 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:51,531 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash -526166954, now seen corresponding path program 65 times [2018-04-12 02:54:51,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:51,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10595 backedges. 0 proven. 10595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:52,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:52,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-12 02:54:52,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:52,888 INFO L182 omatonBuilderFactory]: Interpolants [72961#(<= main_~i~0 42), 72960#(<= main_~i~0 41), 72963#(<= main_~i~0 44), 72962#(<= main_~i~0 43), 72965#(<= main_~i~0 46), 72964#(<= main_~i~0 45), 72967#(<= main_~i~0 48), 72966#(<= main_~i~0 47), 72969#(<= main_~i~0 50), 72968#(<= main_~i~0 49), 72971#(<= main_~i~0 52), 72970#(<= main_~i~0 51), 72973#(<= main_~i~0 54), 72972#(<= main_~i~0 53), 72975#(<= main_~i~0 56), 72974#(<= main_~i~0 55), 72977#(<= main_~i~0 58), 72976#(<= main_~i~0 57), 72979#(<= main_~i~0 60), 72978#(<= main_~i~0 59), 72981#(<= main_~i~0 62), 72980#(<= main_~i~0 61), 72983#(<= main_~i~0 64), 72982#(<= main_~i~0 63), 72985#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 72984#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 72917#true, 72919#(<= main_~i~0 0), 72918#false, 72921#(<= main_~i~0 2), 72920#(<= main_~i~0 1), 72923#(<= main_~i~0 4), 72922#(<= main_~i~0 3), 72925#(<= main_~i~0 6), 72924#(<= main_~i~0 5), 72927#(<= main_~i~0 8), 72926#(<= main_~i~0 7), 72929#(<= main_~i~0 10), 72928#(<= main_~i~0 9), 72931#(<= main_~i~0 12), 72930#(<= main_~i~0 11), 72933#(<= main_~i~0 14), 72932#(<= main_~i~0 13), 72935#(<= main_~i~0 16), 72934#(<= main_~i~0 15), 72937#(<= main_~i~0 18), 72936#(<= main_~i~0 17), 72939#(<= main_~i~0 20), 72938#(<= main_~i~0 19), 72941#(<= main_~i~0 22), 72940#(<= main_~i~0 21), 72943#(<= main_~i~0 24), 72942#(<= main_~i~0 23), 72945#(<= main_~i~0 26), 72944#(<= main_~i~0 25), 72947#(<= main_~i~0 28), 72946#(<= main_~i~0 27), 72949#(<= main_~i~0 30), 72948#(<= main_~i~0 29), 72951#(<= main_~i~0 32), 72950#(<= main_~i~0 31), 72953#(<= main_~i~0 34), 72952#(<= main_~i~0 33), 72955#(<= main_~i~0 36), 72954#(<= main_~i~0 35), 72957#(<= main_~i~0 38), 72956#(<= main_~i~0 37), 72959#(<= main_~i~0 40), 72958#(<= main_~i~0 39)] [2018-04-12 02:54:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10595 backedges. 0 proven. 10595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:52,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-12 02:54:52,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-12 02:54:52,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 02:54:52,889 INFO L87 Difference]: Start difference. First operand 942 states and 1269 transitions. Second operand 69 states. [2018-04-12 02:54:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:55,697 INFO L93 Difference]: Finished difference Result 1026 states and 1360 transitions. [2018-04-12 02:54:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 02:54:55,697 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 333 [2018-04-12 02:54:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:55,699 INFO L225 Difference]: With dead ends: 1026 [2018-04-12 02:54:55,699 INFO L226 Difference]: Without dead ends: 1026 [2018-04-12 02:54:55,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6636, Invalid=11186, Unknown=0, NotChecked=0, Total=17822 [2018-04-12 02:54:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-04-12 02:54:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 956. [2018-04-12 02:54:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2018-04-12 02:54:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1288 transitions. [2018-04-12 02:54:55,706 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1288 transitions. Word has length 333 [2018-04-12 02:54:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:55,706 INFO L459 AbstractCegarLoop]: Abstraction has 956 states and 1288 transitions. [2018-04-12 02:54:55,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-12 02:54:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1288 transitions. [2018-04-12 02:54:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-04-12 02:54:55,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:55,708 INFO L355 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:55,708 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -86790051, now seen corresponding path program 66 times [2018-04-12 02:54:55,709 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:55,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:54:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10923 backedges. 0 proven. 10923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:57,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:54:57,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-12 02:54:57,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:54:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:57,028 INFO L182 omatonBuilderFactory]: Interpolants [75137#(<= main_~i~0 37), 75136#(<= main_~i~0 36), 75139#(<= main_~i~0 39), 75138#(<= main_~i~0 38), 75141#(<= main_~i~0 41), 75140#(<= main_~i~0 40), 75143#(<= main_~i~0 43), 75142#(<= main_~i~0 42), 75145#(<= main_~i~0 45), 75144#(<= main_~i~0 44), 75147#(<= main_~i~0 47), 75146#(<= main_~i~0 46), 75149#(<= main_~i~0 49), 75148#(<= main_~i~0 48), 75151#(<= main_~i~0 51), 75150#(<= main_~i~0 50), 75153#(<= main_~i~0 53), 75152#(<= main_~i~0 52), 75155#(<= main_~i~0 55), 75154#(<= main_~i~0 54), 75157#(<= main_~i~0 57), 75156#(<= main_~i~0 56), 75159#(<= main_~i~0 59), 75158#(<= main_~i~0 58), 75161#(<= main_~i~0 61), 75160#(<= main_~i~0 60), 75163#(<= main_~i~0 63), 75162#(<= main_~i~0 62), 75165#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 75164#(<= main_~i~0 64), 75167#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 75166#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 75099#false, 75098#true, 75101#(<= main_~i~0 1), 75100#(<= main_~i~0 0), 75103#(<= main_~i~0 3), 75102#(<= main_~i~0 2), 75105#(<= main_~i~0 5), 75104#(<= main_~i~0 4), 75107#(<= main_~i~0 7), 75106#(<= main_~i~0 6), 75109#(<= main_~i~0 9), 75108#(<= main_~i~0 8), 75111#(<= main_~i~0 11), 75110#(<= main_~i~0 10), 75113#(<= main_~i~0 13), 75112#(<= main_~i~0 12), 75115#(<= main_~i~0 15), 75114#(<= main_~i~0 14), 75117#(<= main_~i~0 17), 75116#(<= main_~i~0 16), 75119#(<= main_~i~0 19), 75118#(<= main_~i~0 18), 75121#(<= main_~i~0 21), 75120#(<= main_~i~0 20), 75123#(<= main_~i~0 23), 75122#(<= main_~i~0 22), 75125#(<= main_~i~0 25), 75124#(<= main_~i~0 24), 75127#(<= main_~i~0 27), 75126#(<= main_~i~0 26), 75129#(<= main_~i~0 29), 75128#(<= main_~i~0 28), 75131#(<= main_~i~0 31), 75130#(<= main_~i~0 30), 75133#(<= main_~i~0 33), 75132#(<= main_~i~0 32), 75135#(<= main_~i~0 35), 75134#(<= main_~i~0 34)] [2018-04-12 02:54:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10923 backedges. 0 proven. 10923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:54:57,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-12 02:54:57,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-12 02:54:57,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2218, Invalid=2612, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 02:54:57,029 INFO L87 Difference]: Start difference. First operand 956 states and 1288 transitions. Second operand 70 states. [2018-04-12 02:54:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:54:59,942 INFO L93 Difference]: Finished difference Result 1041 states and 1380 transitions. [2018-04-12 02:54:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-12 02:54:59,942 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 338 [2018-04-12 02:54:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:54:59,944 INFO L225 Difference]: With dead ends: 1041 [2018-04-12 02:54:59,944 INFO L226 Difference]: Without dead ends: 1041 [2018-04-12 02:54:59,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6705, Invalid=11655, Unknown=0, NotChecked=0, Total=18360 [2018-04-12 02:54:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-04-12 02:54:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 970. [2018-04-12 02:54:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-04-12 02:54:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1307 transitions. [2018-04-12 02:54:59,951 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1307 transitions. Word has length 338 [2018-04-12 02:54:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:54:59,951 INFO L459 AbstractCegarLoop]: Abstraction has 970 states and 1307 transitions. [2018-04-12 02:54:59,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-12 02:54:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1307 transitions. [2018-04-12 02:54:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-04-12 02:54:59,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:54:59,953 INFO L355 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-12 02:54:59,953 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:54:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash -932265802, now seen corresponding path program 67 times [2018-04-12 02:54:59,954 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:54:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:54:59,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11256 backedges. 0 proven. 11256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:01,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:01,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-12 02:55:01,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:01,334 INFO L182 omatonBuilderFactory]: Interpolants [77313#(<= main_~i~0 0), 77312#false, 77315#(<= main_~i~0 2), 77314#(<= main_~i~0 1), 77317#(<= main_~i~0 4), 77316#(<= main_~i~0 3), 77319#(<= main_~i~0 6), 77318#(<= main_~i~0 5), 77321#(<= main_~i~0 8), 77320#(<= main_~i~0 7), 77323#(<= main_~i~0 10), 77322#(<= main_~i~0 9), 77325#(<= main_~i~0 12), 77324#(<= main_~i~0 11), 77327#(<= main_~i~0 14), 77326#(<= main_~i~0 13), 77329#(<= main_~i~0 16), 77328#(<= main_~i~0 15), 77331#(<= main_~i~0 18), 77330#(<= main_~i~0 17), 77333#(<= main_~i~0 20), 77332#(<= main_~i~0 19), 77335#(<= main_~i~0 22), 77334#(<= main_~i~0 21), 77337#(<= main_~i~0 24), 77336#(<= main_~i~0 23), 77339#(<= main_~i~0 26), 77338#(<= main_~i~0 25), 77341#(<= main_~i~0 28), 77340#(<= main_~i~0 27), 77343#(<= main_~i~0 30), 77342#(<= main_~i~0 29), 77345#(<= main_~i~0 32), 77344#(<= main_~i~0 31), 77347#(<= main_~i~0 34), 77346#(<= main_~i~0 33), 77349#(<= main_~i~0 36), 77348#(<= main_~i~0 35), 77351#(<= main_~i~0 38), 77350#(<= main_~i~0 37), 77353#(<= main_~i~0 40), 77352#(<= main_~i~0 39), 77355#(<= main_~i~0 42), 77354#(<= main_~i~0 41), 77357#(<= main_~i~0 44), 77356#(<= main_~i~0 43), 77359#(<= main_~i~0 46), 77358#(<= main_~i~0 45), 77361#(<= main_~i~0 48), 77360#(<= main_~i~0 47), 77363#(<= main_~i~0 50), 77362#(<= main_~i~0 49), 77365#(<= main_~i~0 52), 77364#(<= main_~i~0 51), 77367#(<= main_~i~0 54), 77366#(<= main_~i~0 53), 77369#(<= main_~i~0 56), 77368#(<= main_~i~0 55), 77371#(<= main_~i~0 58), 77370#(<= main_~i~0 57), 77373#(<= main_~i~0 60), 77372#(<= main_~i~0 59), 77375#(<= main_~i~0 62), 77374#(<= main_~i~0 61), 77377#(<= main_~i~0 64), 77376#(<= main_~i~0 63), 77379#(<= main_~i~0 66), 77378#(<= main_~i~0 65), 77381#(and (<= main_~i~0 67) (<= 1 main_~i~0)), 77380#(and (<= main_~i~0 66) (<= 0 main_~i~0)), 77311#true] [2018-04-12 02:55:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11256 backedges. 0 proven. 11256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:01,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-12 02:55:01,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-12 02:55:01,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-12 02:55:01,335 INFO L87 Difference]: Start difference. First operand 970 states and 1307 transitions. Second operand 71 states. [2018-04-12 02:55:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:04,613 INFO L93 Difference]: Finished difference Result 1056 states and 1400 transitions. [2018-04-12 02:55:04,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-12 02:55:04,613 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 343 [2018-04-12 02:55:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:04,614 INFO L225 Difference]: With dead ends: 1056 [2018-04-12 02:55:04,614 INFO L226 Difference]: Without dead ends: 1056 [2018-04-12 02:55:04,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-12 02:55:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-04-12 02:55:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 984. [2018-04-12 02:55:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-04-12 02:55:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1326 transitions. [2018-04-12 02:55:04,621 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1326 transitions. Word has length 343 [2018-04-12 02:55:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:04,621 INFO L459 AbstractCegarLoop]: Abstraction has 984 states and 1326 transitions. [2018-04-12 02:55:04,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-12 02:55:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1326 transitions. [2018-04-12 02:55:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-04-12 02:55:04,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:04,623 INFO L355 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:04,623 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash 689766397, now seen corresponding path program 68 times [2018-04-12 02:55:04,624 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:04,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:05,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:05,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-12 02:55:05,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:05,989 INFO L182 omatonBuilderFactory]: Interpolants [79617#(<= main_~i~0 59), 79616#(<= main_~i~0 58), 79619#(<= main_~i~0 61), 79618#(<= main_~i~0 60), 79621#(<= main_~i~0 63), 79620#(<= main_~i~0 62), 79623#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 79622#(<= main_~i~0 64), 79625#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 79624#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 79627#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 79626#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 79557#false, 79556#true, 79559#(<= main_~i~0 1), 79558#(<= main_~i~0 0), 79561#(<= main_~i~0 3), 79560#(<= main_~i~0 2), 79563#(<= main_~i~0 5), 79562#(<= main_~i~0 4), 79565#(<= main_~i~0 7), 79564#(<= main_~i~0 6), 79567#(<= main_~i~0 9), 79566#(<= main_~i~0 8), 79569#(<= main_~i~0 11), 79568#(<= main_~i~0 10), 79571#(<= main_~i~0 13), 79570#(<= main_~i~0 12), 79573#(<= main_~i~0 15), 79572#(<= main_~i~0 14), 79575#(<= main_~i~0 17), 79574#(<= main_~i~0 16), 79577#(<= main_~i~0 19), 79576#(<= main_~i~0 18), 79579#(<= main_~i~0 21), 79578#(<= main_~i~0 20), 79581#(<= main_~i~0 23), 79580#(<= main_~i~0 22), 79583#(<= main_~i~0 25), 79582#(<= main_~i~0 24), 79585#(<= main_~i~0 27), 79584#(<= main_~i~0 26), 79587#(<= main_~i~0 29), 79586#(<= main_~i~0 28), 79589#(<= main_~i~0 31), 79588#(<= main_~i~0 30), 79591#(<= main_~i~0 33), 79590#(<= main_~i~0 32), 79593#(<= main_~i~0 35), 79592#(<= main_~i~0 34), 79595#(<= main_~i~0 37), 79594#(<= main_~i~0 36), 79597#(<= main_~i~0 39), 79596#(<= main_~i~0 38), 79599#(<= main_~i~0 41), 79598#(<= main_~i~0 40), 79601#(<= main_~i~0 43), 79600#(<= main_~i~0 42), 79603#(<= main_~i~0 45), 79602#(<= main_~i~0 44), 79605#(<= main_~i~0 47), 79604#(<= main_~i~0 46), 79607#(<= main_~i~0 49), 79606#(<= main_~i~0 48), 79609#(<= main_~i~0 51), 79608#(<= main_~i~0 50), 79611#(<= main_~i~0 53), 79610#(<= main_~i~0 52), 79613#(<= main_~i~0 55), 79612#(<= main_~i~0 54), 79615#(<= main_~i~0 57), 79614#(<= main_~i~0 56)] [2018-04-12 02:55:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:05,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-12 02:55:05,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-12 02:55:05,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 02:55:05,990 INFO L87 Difference]: Start difference. First operand 984 states and 1326 transitions. Second operand 72 states. [2018-04-12 02:55:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:09,561 INFO L93 Difference]: Finished difference Result 1071 states and 1420 transitions. [2018-04-12 02:55:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-12 02:55:09,562 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 348 [2018-04-12 02:55:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:09,563 INFO L225 Difference]: With dead ends: 1071 [2018-04-12 02:55:09,563 INFO L226 Difference]: Without dead ends: 1071 [2018-04-12 02:55:09,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-04-12 02:55:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-04-12 02:55:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 998. [2018-04-12 02:55:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-04-12 02:55:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1345 transitions. [2018-04-12 02:55:09,569 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1345 transitions. Word has length 348 [2018-04-12 02:55:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:09,570 INFO L459 AbstractCegarLoop]: Abstraction has 998 states and 1345 transitions. [2018-04-12 02:55:09,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-12 02:55:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1345 transitions. [2018-04-12 02:55:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-04-12 02:55:09,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:09,572 INFO L355 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:09,572 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:09,572 INFO L82 PathProgramCache]: Analyzing trace with hash -5884650, now seen corresponding path program 69 times [2018-04-12 02:55:09,572 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:09,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11937 backedges. 0 proven. 11937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:11,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:11,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-12 02:55:11,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:11,054 INFO L182 omatonBuilderFactory]: Interpolants [81833#true, 81835#(<= main_~i~0 0), 81834#false, 81837#(<= main_~i~0 2), 81836#(<= main_~i~0 1), 81839#(<= main_~i~0 4), 81838#(<= main_~i~0 3), 81841#(<= main_~i~0 6), 81840#(<= main_~i~0 5), 81843#(<= main_~i~0 8), 81842#(<= main_~i~0 7), 81845#(<= main_~i~0 10), 81844#(<= main_~i~0 9), 81847#(<= main_~i~0 12), 81846#(<= main_~i~0 11), 81849#(<= main_~i~0 14), 81848#(<= main_~i~0 13), 81851#(<= main_~i~0 16), 81850#(<= main_~i~0 15), 81853#(<= main_~i~0 18), 81852#(<= main_~i~0 17), 81855#(<= main_~i~0 20), 81854#(<= main_~i~0 19), 81857#(<= main_~i~0 22), 81856#(<= main_~i~0 21), 81859#(<= main_~i~0 24), 81858#(<= main_~i~0 23), 81861#(<= main_~i~0 26), 81860#(<= main_~i~0 25), 81863#(<= main_~i~0 28), 81862#(<= main_~i~0 27), 81865#(<= main_~i~0 30), 81864#(<= main_~i~0 29), 81867#(<= main_~i~0 32), 81866#(<= main_~i~0 31), 81869#(<= main_~i~0 34), 81868#(<= main_~i~0 33), 81871#(<= main_~i~0 36), 81870#(<= main_~i~0 35), 81873#(<= main_~i~0 38), 81872#(<= main_~i~0 37), 81875#(<= main_~i~0 40), 81874#(<= main_~i~0 39), 81877#(<= main_~i~0 42), 81876#(<= main_~i~0 41), 81879#(<= main_~i~0 44), 81878#(<= main_~i~0 43), 81881#(<= main_~i~0 46), 81880#(<= main_~i~0 45), 81883#(<= main_~i~0 48), 81882#(<= main_~i~0 47), 81885#(<= main_~i~0 50), 81884#(<= main_~i~0 49), 81887#(<= main_~i~0 52), 81886#(<= main_~i~0 51), 81889#(<= main_~i~0 54), 81888#(<= main_~i~0 53), 81891#(<= main_~i~0 56), 81890#(<= main_~i~0 55), 81893#(<= main_~i~0 58), 81892#(<= main_~i~0 57), 81895#(<= main_~i~0 60), 81894#(<= main_~i~0 59), 81897#(<= main_~i~0 62), 81896#(<= main_~i~0 61), 81899#(<= main_~i~0 64), 81898#(<= main_~i~0 63), 81901#(<= main_~i~0 66), 81900#(<= main_~i~0 65), 81903#(<= main_~i~0 68), 81902#(<= main_~i~0 67), 81905#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 81904#(and (<= 0 main_~i~0) (<= main_~i~0 68))] [2018-04-12 02:55:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11937 backedges. 0 proven. 11937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:11,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-12 02:55:11,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-12 02:55:11,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-12 02:55:11,055 INFO L87 Difference]: Start difference. First operand 998 states and 1345 transitions. Second operand 73 states. [2018-04-12 02:55:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:14,340 INFO L93 Difference]: Finished difference Result 1086 states and 1440 transitions. [2018-04-12 02:55:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-12 02:55:14,340 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 353 [2018-04-12 02:55:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:14,341 INFO L225 Difference]: With dead ends: 1086 [2018-04-12 02:55:14,341 INFO L226 Difference]: Without dead ends: 1086 [2018-04-12 02:55:14,342 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-12 02:55:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2018-04-12 02:55:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1012. [2018-04-12 02:55:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-04-12 02:55:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1364 transitions. [2018-04-12 02:55:14,349 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1364 transitions. Word has length 353 [2018-04-12 02:55:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:14,349 INFO L459 AbstractCegarLoop]: Abstraction has 1012 states and 1364 transitions. [2018-04-12 02:55:14,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-12 02:55:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1364 transitions. [2018-04-12 02:55:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-12 02:55:14,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:14,351 INFO L355 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:14,351 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1916749725, now seen corresponding path program 70 times [2018-04-12 02:55:14,351 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:14,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:15,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:15,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-12 02:55:15,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:15,797 INFO L182 omatonBuilderFactory]: Interpolants [84143#false, 84142#true, 84145#(<= main_~i~0 1), 84144#(<= main_~i~0 0), 84147#(<= main_~i~0 3), 84146#(<= main_~i~0 2), 84149#(<= main_~i~0 5), 84148#(<= main_~i~0 4), 84151#(<= main_~i~0 7), 84150#(<= main_~i~0 6), 84153#(<= main_~i~0 9), 84152#(<= main_~i~0 8), 84155#(<= main_~i~0 11), 84154#(<= main_~i~0 10), 84157#(<= main_~i~0 13), 84156#(<= main_~i~0 12), 84159#(<= main_~i~0 15), 84158#(<= main_~i~0 14), 84161#(<= main_~i~0 17), 84160#(<= main_~i~0 16), 84163#(<= main_~i~0 19), 84162#(<= main_~i~0 18), 84165#(<= main_~i~0 21), 84164#(<= main_~i~0 20), 84167#(<= main_~i~0 23), 84166#(<= main_~i~0 22), 84169#(<= main_~i~0 25), 84168#(<= main_~i~0 24), 84171#(<= main_~i~0 27), 84170#(<= main_~i~0 26), 84173#(<= main_~i~0 29), 84172#(<= main_~i~0 28), 84175#(<= main_~i~0 31), 84174#(<= main_~i~0 30), 84177#(<= main_~i~0 33), 84176#(<= main_~i~0 32), 84179#(<= main_~i~0 35), 84178#(<= main_~i~0 34), 84181#(<= main_~i~0 37), 84180#(<= main_~i~0 36), 84183#(<= main_~i~0 39), 84182#(<= main_~i~0 38), 84185#(<= main_~i~0 41), 84184#(<= main_~i~0 40), 84187#(<= main_~i~0 43), 84186#(<= main_~i~0 42), 84189#(<= main_~i~0 45), 84188#(<= main_~i~0 44), 84191#(<= main_~i~0 47), 84190#(<= main_~i~0 46), 84193#(<= main_~i~0 49), 84192#(<= main_~i~0 48), 84195#(<= main_~i~0 51), 84194#(<= main_~i~0 50), 84197#(<= main_~i~0 53), 84196#(<= main_~i~0 52), 84199#(<= main_~i~0 55), 84198#(<= main_~i~0 54), 84201#(<= main_~i~0 57), 84200#(<= main_~i~0 56), 84203#(<= main_~i~0 59), 84202#(<= main_~i~0 58), 84205#(<= main_~i~0 61), 84204#(<= main_~i~0 60), 84207#(<= main_~i~0 63), 84206#(<= main_~i~0 62), 84209#(<= main_~i~0 65), 84208#(<= main_~i~0 64), 84211#(<= main_~i~0 67), 84210#(<= main_~i~0 66), 84213#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 84212#(<= main_~i~0 68), 84215#(and (<= 2 main_~i~0) (<= main_~i~0 70)), 84214#(and (<= main_~i~0 69) (<= 1 main_~i~0))] [2018-04-12 02:55:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:15,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-12 02:55:15,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-12 02:55:15,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 02:55:15,798 INFO L87 Difference]: Start difference. First operand 1012 states and 1364 transitions. Second operand 74 states. [2018-04-12 02:55:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:19,288 INFO L93 Difference]: Finished difference Result 1101 states and 1460 transitions. [2018-04-12 02:55:19,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-12 02:55:19,288 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 358 [2018-04-12 02:55:19,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:19,289 INFO L225 Difference]: With dead ends: 1101 [2018-04-12 02:55:19,289 INFO L226 Difference]: Without dead ends: 1101 [2018-04-12 02:55:19,289 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-12 02:55:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-04-12 02:55:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1026. [2018-04-12 02:55:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-04-12 02:55:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1383 transitions. [2018-04-12 02:55:19,295 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1383 transitions. Word has length 358 [2018-04-12 02:55:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:19,296 INFO L459 AbstractCegarLoop]: Abstraction has 1026 states and 1383 transitions. [2018-04-12 02:55:19,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-12 02:55:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1383 transitions. [2018-04-12 02:55:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-04-12 02:55:19,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:19,297 INFO L355 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:19,297 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1423946102, now seen corresponding path program 71 times [2018-04-12 02:55:19,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:19,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12638 backedges. 0 proven. 12638 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:20,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:20,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-12 02:55:20,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:20,825 INFO L182 omatonBuilderFactory]: Interpolants [86529#(<= main_~i~0 44), 86528#(<= main_~i~0 43), 86531#(<= main_~i~0 46), 86530#(<= main_~i~0 45), 86533#(<= main_~i~0 48), 86532#(<= main_~i~0 47), 86535#(<= main_~i~0 50), 86534#(<= main_~i~0 49), 86537#(<= main_~i~0 52), 86536#(<= main_~i~0 51), 86539#(<= main_~i~0 54), 86538#(<= main_~i~0 53), 86541#(<= main_~i~0 56), 86540#(<= main_~i~0 55), 86543#(<= main_~i~0 58), 86542#(<= main_~i~0 57), 86545#(<= main_~i~0 60), 86544#(<= main_~i~0 59), 86547#(<= main_~i~0 62), 86546#(<= main_~i~0 61), 86549#(<= main_~i~0 64), 86548#(<= main_~i~0 63), 86551#(<= main_~i~0 66), 86550#(<= main_~i~0 65), 86553#(<= main_~i~0 68), 86552#(<= main_~i~0 67), 86555#(<= main_~i~0 70), 86554#(<= main_~i~0 69), 86557#(and (<= 1 main_~i~0) (<= main_~i~0 71)), 86556#(and (<= 0 main_~i~0) (<= main_~i~0 70)), 86483#true, 86485#(<= main_~i~0 0), 86484#false, 86487#(<= main_~i~0 2), 86486#(<= main_~i~0 1), 86489#(<= main_~i~0 4), 86488#(<= main_~i~0 3), 86491#(<= main_~i~0 6), 86490#(<= main_~i~0 5), 86493#(<= main_~i~0 8), 86492#(<= main_~i~0 7), 86495#(<= main_~i~0 10), 86494#(<= main_~i~0 9), 86497#(<= main_~i~0 12), 86496#(<= main_~i~0 11), 86499#(<= main_~i~0 14), 86498#(<= main_~i~0 13), 86501#(<= main_~i~0 16), 86500#(<= main_~i~0 15), 86503#(<= main_~i~0 18), 86502#(<= main_~i~0 17), 86505#(<= main_~i~0 20), 86504#(<= main_~i~0 19), 86507#(<= main_~i~0 22), 86506#(<= main_~i~0 21), 86509#(<= main_~i~0 24), 86508#(<= main_~i~0 23), 86511#(<= main_~i~0 26), 86510#(<= main_~i~0 25), 86513#(<= main_~i~0 28), 86512#(<= main_~i~0 27), 86515#(<= main_~i~0 30), 86514#(<= main_~i~0 29), 86517#(<= main_~i~0 32), 86516#(<= main_~i~0 31), 86519#(<= main_~i~0 34), 86518#(<= main_~i~0 33), 86521#(<= main_~i~0 36), 86520#(<= main_~i~0 35), 86523#(<= main_~i~0 38), 86522#(<= main_~i~0 37), 86525#(<= main_~i~0 40), 86524#(<= main_~i~0 39), 86527#(<= main_~i~0 42), 86526#(<= main_~i~0 41)] [2018-04-12 02:55:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12638 backedges. 0 proven. 12638 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:20,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-12 02:55:20,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-12 02:55:20,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2633, Invalid=2917, Unknown=0, NotChecked=0, Total=5550 [2018-04-12 02:55:20,826 INFO L87 Difference]: Start difference. First operand 1026 states and 1383 transitions. Second operand 75 states. [2018-04-12 02:55:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:24,147 INFO L93 Difference]: Finished difference Result 1116 states and 1480 transitions. [2018-04-12 02:55:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-12 02:55:24,148 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 363 [2018-04-12 02:55:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:24,148 INFO L225 Difference]: With dead ends: 1116 [2018-04-12 02:55:24,148 INFO L226 Difference]: Without dead ends: 1116 [2018-04-12 02:55:24,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7887, Invalid=13283, Unknown=0, NotChecked=0, Total=21170 [2018-04-12 02:55:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2018-04-12 02:55:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1040. [2018-04-12 02:55:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-04-12 02:55:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1402 transitions. [2018-04-12 02:55:24,155 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1402 transitions. Word has length 363 [2018-04-12 02:55:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:24,155 INFO L459 AbstractCegarLoop]: Abstraction has 1040 states and 1402 transitions. [2018-04-12 02:55:24,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-12 02:55:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1402 transitions. [2018-04-12 02:55:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-04-12 02:55:24,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:24,157 INFO L355 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:24,158 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1251702979, now seen corresponding path program 72 times [2018-04-12 02:55:24,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:24,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:25,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:25,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-12 02:55:25,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:25,643 INFO L182 omatonBuilderFactory]: Interpolants [88857#false, 88856#true, 88859#(<= main_~i~0 1), 88858#(<= main_~i~0 0), 88861#(<= main_~i~0 3), 88860#(<= main_~i~0 2), 88863#(<= main_~i~0 5), 88862#(<= main_~i~0 4), 88865#(<= main_~i~0 7), 88864#(<= main_~i~0 6), 88867#(<= main_~i~0 9), 88866#(<= main_~i~0 8), 88869#(<= main_~i~0 11), 88868#(<= main_~i~0 10), 88871#(<= main_~i~0 13), 88870#(<= main_~i~0 12), 88873#(<= main_~i~0 15), 88872#(<= main_~i~0 14), 88875#(<= main_~i~0 17), 88874#(<= main_~i~0 16), 88877#(<= main_~i~0 19), 88876#(<= main_~i~0 18), 88879#(<= main_~i~0 21), 88878#(<= main_~i~0 20), 88881#(<= main_~i~0 23), 88880#(<= main_~i~0 22), 88883#(<= main_~i~0 25), 88882#(<= main_~i~0 24), 88885#(<= main_~i~0 27), 88884#(<= main_~i~0 26), 88887#(<= main_~i~0 29), 88886#(<= main_~i~0 28), 88889#(<= main_~i~0 31), 88888#(<= main_~i~0 30), 88891#(<= main_~i~0 33), 88890#(<= main_~i~0 32), 88893#(<= main_~i~0 35), 88892#(<= main_~i~0 34), 88895#(<= main_~i~0 37), 88894#(<= main_~i~0 36), 88897#(<= main_~i~0 39), 88896#(<= main_~i~0 38), 88899#(<= main_~i~0 41), 88898#(<= main_~i~0 40), 88901#(<= main_~i~0 43), 88900#(<= main_~i~0 42), 88903#(<= main_~i~0 45), 88902#(<= main_~i~0 44), 88905#(<= main_~i~0 47), 88904#(<= main_~i~0 46), 88907#(<= main_~i~0 49), 88906#(<= main_~i~0 48), 88909#(<= main_~i~0 51), 88908#(<= main_~i~0 50), 88911#(<= main_~i~0 53), 88910#(<= main_~i~0 52), 88913#(<= main_~i~0 55), 88912#(<= main_~i~0 54), 88915#(<= main_~i~0 57), 88914#(<= main_~i~0 56), 88917#(<= main_~i~0 59), 88916#(<= main_~i~0 58), 88919#(<= main_~i~0 61), 88918#(<= main_~i~0 60), 88921#(<= main_~i~0 63), 88920#(<= main_~i~0 62), 88923#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 88922#(<= main_~i~0 64), 88925#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 88924#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 88927#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 88926#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 88929#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 88928#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 88931#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 88930#(and (<= 7 main_~i~0) (<= main_~i~0 71))] [2018-04-12 02:55:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:25,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-12 02:55:25,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-12 02:55:25,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3470, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 02:55:25,644 INFO L87 Difference]: Start difference. First operand 1040 states and 1402 transitions. Second operand 76 states. [2018-04-12 02:55:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:30,197 INFO L93 Difference]: Finished difference Result 1131 states and 1500 transitions. [2018-04-12 02:55:30,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-12 02:55:30,197 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 368 [2018-04-12 02:55:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:30,198 INFO L225 Difference]: With dead ends: 1131 [2018-04-12 02:55:30,198 INFO L226 Difference]: Without dead ends: 1131 [2018-04-12 02:55:30,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7119, Invalid=14637, Unknown=0, NotChecked=0, Total=21756 [2018-04-12 02:55:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-04-12 02:55:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1054. [2018-04-12 02:55:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-04-12 02:55:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1421 transitions. [2018-04-12 02:55:30,206 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1421 transitions. Word has length 368 [2018-04-12 02:55:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:30,207 INFO L459 AbstractCegarLoop]: Abstraction has 1054 states and 1421 transitions. [2018-04-12 02:55:30,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-12 02:55:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1421 transitions. [2018-04-12 02:55:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-04-12 02:55:30,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:30,209 INFO L355 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:30,209 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:30,209 INFO L82 PathProgramCache]: Analyzing trace with hash -751749674, now seen corresponding path program 73 times [2018-04-12 02:55:30,209 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:30,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13359 backedges. 0 proven. 13359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:31,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:31,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-12 02:55:31,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:31,839 INFO L182 omatonBuilderFactory]: Interpolants [91265#(<= main_~i~0 2), 91264#(<= main_~i~0 1), 91267#(<= main_~i~0 4), 91266#(<= main_~i~0 3), 91269#(<= main_~i~0 6), 91268#(<= main_~i~0 5), 91271#(<= main_~i~0 8), 91270#(<= main_~i~0 7), 91273#(<= main_~i~0 10), 91272#(<= main_~i~0 9), 91275#(<= main_~i~0 12), 91274#(<= main_~i~0 11), 91277#(<= main_~i~0 14), 91276#(<= main_~i~0 13), 91279#(<= main_~i~0 16), 91278#(<= main_~i~0 15), 91281#(<= main_~i~0 18), 91280#(<= main_~i~0 17), 91283#(<= main_~i~0 20), 91282#(<= main_~i~0 19), 91285#(<= main_~i~0 22), 91284#(<= main_~i~0 21), 91287#(<= main_~i~0 24), 91286#(<= main_~i~0 23), 91289#(<= main_~i~0 26), 91288#(<= main_~i~0 25), 91291#(<= main_~i~0 28), 91290#(<= main_~i~0 27), 91293#(<= main_~i~0 30), 91292#(<= main_~i~0 29), 91295#(<= main_~i~0 32), 91294#(<= main_~i~0 31), 91297#(<= main_~i~0 34), 91296#(<= main_~i~0 33), 91299#(<= main_~i~0 36), 91298#(<= main_~i~0 35), 91301#(<= main_~i~0 38), 91300#(<= main_~i~0 37), 91303#(<= main_~i~0 40), 91302#(<= main_~i~0 39), 91305#(<= main_~i~0 42), 91304#(<= main_~i~0 41), 91307#(<= main_~i~0 44), 91306#(<= main_~i~0 43), 91309#(<= main_~i~0 46), 91308#(<= main_~i~0 45), 91311#(<= main_~i~0 48), 91310#(<= main_~i~0 47), 91313#(<= main_~i~0 50), 91312#(<= main_~i~0 49), 91315#(<= main_~i~0 52), 91314#(<= main_~i~0 51), 91317#(<= main_~i~0 54), 91316#(<= main_~i~0 53), 91319#(<= main_~i~0 56), 91318#(<= main_~i~0 55), 91321#(<= main_~i~0 58), 91320#(<= main_~i~0 57), 91323#(<= main_~i~0 60), 91322#(<= main_~i~0 59), 91325#(<= main_~i~0 62), 91324#(<= main_~i~0 61), 91327#(<= main_~i~0 64), 91326#(<= main_~i~0 63), 91329#(<= main_~i~0 66), 91328#(<= main_~i~0 65), 91331#(<= main_~i~0 68), 91330#(<= main_~i~0 67), 91333#(<= main_~i~0 70), 91332#(<= main_~i~0 69), 91335#(<= main_~i~0 72), 91334#(<= main_~i~0 71), 91337#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 91336#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 91261#true, 91263#(<= main_~i~0 0), 91262#false] [2018-04-12 02:55:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13359 backedges. 0 proven. 13359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:31,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-12 02:55:31,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-12 02:55:31,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-12 02:55:31,841 INFO L87 Difference]: Start difference. First operand 1054 states and 1421 transitions. Second operand 77 states. [2018-04-12 02:55:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:35,452 INFO L93 Difference]: Finished difference Result 1146 states and 1520 transitions. [2018-04-12 02:55:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-12 02:55:35,453 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 373 [2018-04-12 02:55:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:35,454 INFO L225 Difference]: With dead ends: 1146 [2018-04-12 02:55:35,454 INFO L226 Difference]: Without dead ends: 1146 [2018-04-12 02:55:35,455 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-12 02:55:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-04-12 02:55:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1068. [2018-04-12 02:55:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-04-12 02:55:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1440 transitions. [2018-04-12 02:55:35,461 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1440 transitions. Word has length 373 [2018-04-12 02:55:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:35,461 INFO L459 AbstractCegarLoop]: Abstraction has 1068 states and 1440 transitions. [2018-04-12 02:55:35,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-12 02:55:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1440 transitions. [2018-04-12 02:55:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-04-12 02:55:35,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:35,463 INFO L355 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:35,463 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1698086621, now seen corresponding path program 74 times [2018-04-12 02:55:35,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:35,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13727 backedges. 0 proven. 13727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:37,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:37,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-12 02:55:37,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:37,087 INFO L182 omatonBuilderFactory]: Interpolants [93699#false, 93698#true, 93701#(<= main_~i~0 1), 93700#(<= main_~i~0 0), 93703#(<= main_~i~0 3), 93702#(<= main_~i~0 2), 93705#(<= main_~i~0 5), 93704#(<= main_~i~0 4), 93707#(<= main_~i~0 7), 93706#(<= main_~i~0 6), 93709#(<= main_~i~0 9), 93708#(<= main_~i~0 8), 93711#(<= main_~i~0 11), 93710#(<= main_~i~0 10), 93713#(<= main_~i~0 13), 93712#(<= main_~i~0 12), 93715#(<= main_~i~0 15), 93714#(<= main_~i~0 14), 93717#(<= main_~i~0 17), 93716#(<= main_~i~0 16), 93719#(<= main_~i~0 19), 93718#(<= main_~i~0 18), 93721#(<= main_~i~0 21), 93720#(<= main_~i~0 20), 93723#(<= main_~i~0 23), 93722#(<= main_~i~0 22), 93725#(<= main_~i~0 25), 93724#(<= main_~i~0 24), 93727#(<= main_~i~0 27), 93726#(<= main_~i~0 26), 93729#(<= main_~i~0 29), 93728#(<= main_~i~0 28), 93731#(<= main_~i~0 31), 93730#(<= main_~i~0 30), 93733#(<= main_~i~0 33), 93732#(<= main_~i~0 32), 93735#(<= main_~i~0 35), 93734#(<= main_~i~0 34), 93737#(<= main_~i~0 37), 93736#(<= main_~i~0 36), 93739#(<= main_~i~0 39), 93738#(<= main_~i~0 38), 93741#(<= main_~i~0 41), 93740#(<= main_~i~0 40), 93743#(<= main_~i~0 43), 93742#(<= main_~i~0 42), 93745#(<= main_~i~0 45), 93744#(<= main_~i~0 44), 93747#(<= main_~i~0 47), 93746#(<= main_~i~0 46), 93749#(<= main_~i~0 49), 93748#(<= main_~i~0 48), 93751#(<= main_~i~0 51), 93750#(<= main_~i~0 50), 93753#(<= main_~i~0 53), 93752#(<= main_~i~0 52), 93755#(<= main_~i~0 55), 93754#(<= main_~i~0 54), 93757#(<= main_~i~0 57), 93756#(<= main_~i~0 56), 93759#(<= main_~i~0 59), 93758#(<= main_~i~0 58), 93761#(<= main_~i~0 61), 93760#(<= main_~i~0 60), 93763#(<= main_~i~0 63), 93762#(<= main_~i~0 62), 93765#(<= main_~i~0 65), 93764#(<= main_~i~0 64), 93767#(<= main_~i~0 67), 93766#(<= main_~i~0 66), 93769#(<= main_~i~0 69), 93768#(<= main_~i~0 68), 93771#(<= main_~i~0 71), 93770#(<= main_~i~0 70), 93773#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 93772#(<= main_~i~0 72), 93775#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 93774#(and (<= 1 main_~i~0) (<= main_~i~0 73))] [2018-04-12 02:55:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13727 backedges. 0 proven. 13727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:37,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-12 02:55:37,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-12 02:55:37,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 02:55:37,088 INFO L87 Difference]: Start difference. First operand 1068 states and 1440 transitions. Second operand 78 states. [2018-04-12 02:55:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:40,972 INFO L93 Difference]: Finished difference Result 1161 states and 1540 transitions. [2018-04-12 02:55:40,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-12 02:55:40,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 378 [2018-04-12 02:55:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:40,974 INFO L225 Difference]: With dead ends: 1161 [2018-04-12 02:55:40,974 INFO L226 Difference]: Without dead ends: 1161 [2018-04-12 02:55:40,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-12 02:55:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2018-04-12 02:55:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1082. [2018-04-12 02:55:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2018-04-12 02:55:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1459 transitions. [2018-04-12 02:55:40,980 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1459 transitions. Word has length 378 [2018-04-12 02:55:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:40,980 INFO L459 AbstractCegarLoop]: Abstraction has 1082 states and 1459 transitions. [2018-04-12 02:55:40,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-12 02:55:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1459 transitions. [2018-04-12 02:55:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-04-12 02:55:40,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:40,982 INFO L355 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:40,982 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:40,982 INFO L82 PathProgramCache]: Analyzing trace with hash 573620790, now seen corresponding path program 75 times [2018-04-12 02:55:40,982 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:41,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14100 backedges. 0 proven. 14100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:42,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:42,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-12 02:55:42,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:42,669 INFO L182 omatonBuilderFactory]: Interpolants [96167#true, 96169#(<= main_~i~0 0), 96168#false, 96171#(<= main_~i~0 2), 96170#(<= main_~i~0 1), 96173#(<= main_~i~0 4), 96172#(<= main_~i~0 3), 96175#(<= main_~i~0 6), 96174#(<= main_~i~0 5), 96177#(<= main_~i~0 8), 96176#(<= main_~i~0 7), 96179#(<= main_~i~0 10), 96178#(<= main_~i~0 9), 96181#(<= main_~i~0 12), 96180#(<= main_~i~0 11), 96183#(<= main_~i~0 14), 96182#(<= main_~i~0 13), 96185#(<= main_~i~0 16), 96184#(<= main_~i~0 15), 96187#(<= main_~i~0 18), 96186#(<= main_~i~0 17), 96189#(<= main_~i~0 20), 96188#(<= main_~i~0 19), 96191#(<= main_~i~0 22), 96190#(<= main_~i~0 21), 96193#(<= main_~i~0 24), 96192#(<= main_~i~0 23), 96195#(<= main_~i~0 26), 96194#(<= main_~i~0 25), 96197#(<= main_~i~0 28), 96196#(<= main_~i~0 27), 96199#(<= main_~i~0 30), 96198#(<= main_~i~0 29), 96201#(<= main_~i~0 32), 96200#(<= main_~i~0 31), 96203#(<= main_~i~0 34), 96202#(<= main_~i~0 33), 96205#(<= main_~i~0 36), 96204#(<= main_~i~0 35), 96207#(<= main_~i~0 38), 96206#(<= main_~i~0 37), 96209#(<= main_~i~0 40), 96208#(<= main_~i~0 39), 96211#(<= main_~i~0 42), 96210#(<= main_~i~0 41), 96213#(<= main_~i~0 44), 96212#(<= main_~i~0 43), 96215#(<= main_~i~0 46), 96214#(<= main_~i~0 45), 96217#(<= main_~i~0 48), 96216#(<= main_~i~0 47), 96219#(<= main_~i~0 50), 96218#(<= main_~i~0 49), 96221#(<= main_~i~0 52), 96220#(<= main_~i~0 51), 96223#(<= main_~i~0 54), 96222#(<= main_~i~0 53), 96225#(<= main_~i~0 56), 96224#(<= main_~i~0 55), 96227#(<= main_~i~0 58), 96226#(<= main_~i~0 57), 96229#(<= main_~i~0 60), 96228#(<= main_~i~0 59), 96231#(<= main_~i~0 62), 96230#(<= main_~i~0 61), 96233#(<= main_~i~0 64), 96232#(<= main_~i~0 63), 96235#(<= main_~i~0 66), 96234#(<= main_~i~0 65), 96237#(<= main_~i~0 68), 96236#(<= main_~i~0 67), 96239#(<= main_~i~0 70), 96238#(<= main_~i~0 69), 96241#(<= main_~i~0 72), 96240#(<= main_~i~0 71), 96243#(<= main_~i~0 74), 96242#(<= main_~i~0 73), 96245#(and (<= 1 main_~i~0) (<= main_~i~0 75)), 96244#(and (<= 0 main_~i~0) (<= main_~i~0 74))] [2018-04-12 02:55:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14100 backedges. 0 proven. 14100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:42,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-12 02:55:42,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-12 02:55:42,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-12 02:55:42,670 INFO L87 Difference]: Start difference. First operand 1082 states and 1459 transitions. Second operand 79 states. [2018-04-12 02:55:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:46,656 INFO L93 Difference]: Finished difference Result 1176 states and 1560 transitions. [2018-04-12 02:55:46,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-12 02:55:46,657 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 383 [2018-04-12 02:55:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:46,658 INFO L225 Difference]: With dead ends: 1176 [2018-04-12 02:55:46,658 INFO L226 Difference]: Without dead ends: 1176 [2018-04-12 02:55:46,658 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-12 02:55:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2018-04-12 02:55:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1096. [2018-04-12 02:55:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-04-12 02:55:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1478 transitions. [2018-04-12 02:55:46,664 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1478 transitions. Word has length 383 [2018-04-12 02:55:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:46,665 INFO L459 AbstractCegarLoop]: Abstraction has 1096 states and 1478 transitions. [2018-04-12 02:55:46,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-12 02:55:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1478 transitions. [2018-04-12 02:55:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-04-12 02:55:46,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:46,666 INFO L355 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:46,666 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:46,666 INFO L82 PathProgramCache]: Analyzing trace with hash 668987005, now seen corresponding path program 76 times [2018-04-12 02:55:46,667 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:46,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 14478 backedges. 0 proven. 14478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:48,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:48,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-12 02:55:48,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:48,361 INFO L182 omatonBuilderFactory]: Interpolants [98689#(<= main_~i~0 19), 98688#(<= main_~i~0 18), 98691#(<= main_~i~0 21), 98690#(<= main_~i~0 20), 98693#(<= main_~i~0 23), 98692#(<= main_~i~0 22), 98695#(<= main_~i~0 25), 98694#(<= main_~i~0 24), 98697#(<= main_~i~0 27), 98696#(<= main_~i~0 26), 98699#(<= main_~i~0 29), 98698#(<= main_~i~0 28), 98701#(<= main_~i~0 31), 98700#(<= main_~i~0 30), 98703#(<= main_~i~0 33), 98702#(<= main_~i~0 32), 98705#(<= main_~i~0 35), 98704#(<= main_~i~0 34), 98707#(<= main_~i~0 37), 98706#(<= main_~i~0 36), 98709#(<= main_~i~0 39), 98708#(<= main_~i~0 38), 98711#(<= main_~i~0 41), 98710#(<= main_~i~0 40), 98713#(<= main_~i~0 43), 98712#(<= main_~i~0 42), 98715#(<= main_~i~0 45), 98714#(<= main_~i~0 44), 98717#(<= main_~i~0 47), 98716#(<= main_~i~0 46), 98719#(<= main_~i~0 49), 98718#(<= main_~i~0 48), 98721#(<= main_~i~0 51), 98720#(<= main_~i~0 50), 98723#(<= main_~i~0 53), 98722#(<= main_~i~0 52), 98725#(<= main_~i~0 55), 98724#(<= main_~i~0 54), 98727#(<= main_~i~0 57), 98726#(<= main_~i~0 56), 98729#(<= main_~i~0 59), 98728#(<= main_~i~0 58), 98731#(<= main_~i~0 61), 98730#(<= main_~i~0 60), 98733#(<= main_~i~0 63), 98732#(<= main_~i~0 62), 98735#(<= main_~i~0 65), 98734#(<= main_~i~0 64), 98737#(<= main_~i~0 67), 98736#(<= main_~i~0 66), 98739#(<= main_~i~0 69), 98738#(<= main_~i~0 68), 98741#(<= main_~i~0 71), 98740#(<= main_~i~0 70), 98743#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 98742#(<= main_~i~0 72), 98745#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 98744#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 98747#(and (<= main_~i~0 76) (<= 4 main_~i~0)), 98746#(and (<= main_~i~0 75) (<= 3 main_~i~0)), 98669#false, 98668#true, 98671#(<= main_~i~0 1), 98670#(<= main_~i~0 0), 98673#(<= main_~i~0 3), 98672#(<= main_~i~0 2), 98675#(<= main_~i~0 5), 98674#(<= main_~i~0 4), 98677#(<= main_~i~0 7), 98676#(<= main_~i~0 6), 98679#(<= main_~i~0 9), 98678#(<= main_~i~0 8), 98681#(<= main_~i~0 11), 98680#(<= main_~i~0 10), 98683#(<= main_~i~0 13), 98682#(<= main_~i~0 12), 98685#(<= main_~i~0 15), 98684#(<= main_~i~0 14), 98687#(<= main_~i~0 17), 98686#(<= main_~i~0 16)] [2018-04-12 02:55:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14478 backedges. 0 proven. 14478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:48,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-12 02:55:48,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-12 02:55:48,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 02:55:48,362 INFO L87 Difference]: Start difference. First operand 1096 states and 1478 transitions. Second operand 80 states. [2018-04-12 02:55:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:52,615 INFO L93 Difference]: Finished difference Result 1191 states and 1580 transitions. [2018-04-12 02:55:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-12 02:55:52,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 388 [2018-04-12 02:55:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:52,616 INFO L225 Difference]: With dead ends: 1191 [2018-04-12 02:55:52,616 INFO L226 Difference]: Without dead ends: 1191 [2018-04-12 02:55:52,617 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-12 02:55:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-04-12 02:55:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1110. [2018-04-12 02:55:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2018-04-12 02:55:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1497 transitions. [2018-04-12 02:55:52,623 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1497 transitions. Word has length 388 [2018-04-12 02:55:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:52,623 INFO L459 AbstractCegarLoop]: Abstraction has 1110 states and 1497 transitions. [2018-04-12 02:55:52,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-12 02:55:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1497 transitions. [2018-04-12 02:55:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-04-12 02:55:52,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:52,625 INFO L355 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:52,625 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash -436971882, now seen corresponding path program 77 times [2018-04-12 02:55:52,626 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:52,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:55:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14861 backedges. 0 proven. 14861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:54,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:55:54,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-12 02:55:54,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:55:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:54,386 INFO L182 omatonBuilderFactory]: Interpolants [101249#(<= main_~i~0 46), 101248#(<= main_~i~0 45), 101251#(<= main_~i~0 48), 101250#(<= main_~i~0 47), 101253#(<= main_~i~0 50), 101252#(<= main_~i~0 49), 101255#(<= main_~i~0 52), 101254#(<= main_~i~0 51), 101257#(<= main_~i~0 54), 101256#(<= main_~i~0 53), 101259#(<= main_~i~0 56), 101258#(<= main_~i~0 55), 101261#(<= main_~i~0 58), 101260#(<= main_~i~0 57), 101263#(<= main_~i~0 60), 101262#(<= main_~i~0 59), 101265#(<= main_~i~0 62), 101264#(<= main_~i~0 61), 101267#(<= main_~i~0 64), 101266#(<= main_~i~0 63), 101269#(<= main_~i~0 66), 101268#(<= main_~i~0 65), 101271#(<= main_~i~0 68), 101270#(<= main_~i~0 67), 101273#(<= main_~i~0 70), 101272#(<= main_~i~0 69), 101275#(<= main_~i~0 72), 101274#(<= main_~i~0 71), 101277#(<= main_~i~0 74), 101276#(<= main_~i~0 73), 101279#(<= main_~i~0 76), 101278#(<= main_~i~0 75), 101281#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 101280#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 101201#true, 101203#(<= main_~i~0 0), 101202#false, 101205#(<= main_~i~0 2), 101204#(<= main_~i~0 1), 101207#(<= main_~i~0 4), 101206#(<= main_~i~0 3), 101209#(<= main_~i~0 6), 101208#(<= main_~i~0 5), 101211#(<= main_~i~0 8), 101210#(<= main_~i~0 7), 101213#(<= main_~i~0 10), 101212#(<= main_~i~0 9), 101215#(<= main_~i~0 12), 101214#(<= main_~i~0 11), 101217#(<= main_~i~0 14), 101216#(<= main_~i~0 13), 101219#(<= main_~i~0 16), 101218#(<= main_~i~0 15), 101221#(<= main_~i~0 18), 101220#(<= main_~i~0 17), 101223#(<= main_~i~0 20), 101222#(<= main_~i~0 19), 101225#(<= main_~i~0 22), 101224#(<= main_~i~0 21), 101227#(<= main_~i~0 24), 101226#(<= main_~i~0 23), 101229#(<= main_~i~0 26), 101228#(<= main_~i~0 25), 101231#(<= main_~i~0 28), 101230#(<= main_~i~0 27), 101233#(<= main_~i~0 30), 101232#(<= main_~i~0 29), 101235#(<= main_~i~0 32), 101234#(<= main_~i~0 31), 101237#(<= main_~i~0 34), 101236#(<= main_~i~0 33), 101239#(<= main_~i~0 36), 101238#(<= main_~i~0 35), 101241#(<= main_~i~0 38), 101240#(<= main_~i~0 37), 101243#(<= main_~i~0 40), 101242#(<= main_~i~0 39), 101245#(<= main_~i~0 42), 101244#(<= main_~i~0 41), 101247#(<= main_~i~0 44), 101246#(<= main_~i~0 43)] [2018-04-12 02:55:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14861 backedges. 0 proven. 14861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:55:54,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-12 02:55:54,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-12 02:55:54,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=3394, Unknown=0, NotChecked=0, Total=6480 [2018-04-12 02:55:54,387 INFO L87 Difference]: Start difference. First operand 1110 states and 1497 transitions. Second operand 81 states. [2018-04-12 02:55:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:55:58,311 INFO L93 Difference]: Finished difference Result 1206 states and 1600 transitions. [2018-04-12 02:55:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-12 02:55:58,311 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 393 [2018-04-12 02:55:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:55:58,312 INFO L225 Difference]: With dead ends: 1206 [2018-04-12 02:55:58,312 INFO L226 Difference]: Without dead ends: 1206 [2018-04-12 02:55:58,313 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-12 02:55:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-04-12 02:55:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1124. [2018-04-12 02:55:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2018-04-12 02:55:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1516 transitions. [2018-04-12 02:55:58,319 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1516 transitions. Word has length 393 [2018-04-12 02:55:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:55:58,319 INFO L459 AbstractCegarLoop]: Abstraction has 1124 states and 1516 transitions. [2018-04-12 02:55:58,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-12 02:55:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1516 transitions. [2018-04-12 02:55:58,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-04-12 02:55:58,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:55:58,320 INFO L355 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-12 02:55:58,321 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:55:58,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1997149725, now seen corresponding path program 78 times [2018-04-12 02:55:58,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:55:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:55:58,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15249 backedges. 0 proven. 15249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:00,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:00,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-12 02:56:00,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:00,146 INFO L182 omatonBuilderFactory]: Interpolants [103809#(<= main_~i~0 41), 103808#(<= main_~i~0 40), 103811#(<= main_~i~0 43), 103810#(<= main_~i~0 42), 103813#(<= main_~i~0 45), 103812#(<= main_~i~0 44), 103815#(<= main_~i~0 47), 103814#(<= main_~i~0 46), 103817#(<= main_~i~0 49), 103816#(<= main_~i~0 48), 103819#(<= main_~i~0 51), 103818#(<= main_~i~0 50), 103821#(<= main_~i~0 53), 103820#(<= main_~i~0 52), 103823#(<= main_~i~0 55), 103822#(<= main_~i~0 54), 103825#(<= main_~i~0 57), 103824#(<= main_~i~0 56), 103827#(<= main_~i~0 59), 103826#(<= main_~i~0 58), 103829#(<= main_~i~0 61), 103828#(<= main_~i~0 60), 103831#(<= main_~i~0 63), 103830#(<= main_~i~0 62), 103833#(<= main_~i~0 65), 103832#(<= main_~i~0 64), 103835#(<= main_~i~0 67), 103834#(<= main_~i~0 66), 103837#(<= main_~i~0 69), 103836#(<= main_~i~0 68), 103839#(<= main_~i~0 71), 103838#(<= main_~i~0 70), 103841#(<= main_~i~0 73), 103840#(<= main_~i~0 72), 103843#(<= main_~i~0 75), 103842#(<= main_~i~0 74), 103845#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 103844#(<= main_~i~0 76), 103847#(and (<= 2 main_~i~0) (<= main_~i~0 78)), 103846#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 103767#false, 103766#true, 103769#(<= main_~i~0 1), 103768#(<= main_~i~0 0), 103771#(<= main_~i~0 3), 103770#(<= main_~i~0 2), 103773#(<= main_~i~0 5), 103772#(<= main_~i~0 4), 103775#(<= main_~i~0 7), 103774#(<= main_~i~0 6), 103777#(<= main_~i~0 9), 103776#(<= main_~i~0 8), 103779#(<= main_~i~0 11), 103778#(<= main_~i~0 10), 103781#(<= main_~i~0 13), 103780#(<= main_~i~0 12), 103783#(<= main_~i~0 15), 103782#(<= main_~i~0 14), 103785#(<= main_~i~0 17), 103784#(<= main_~i~0 16), 103787#(<= main_~i~0 19), 103786#(<= main_~i~0 18), 103789#(<= main_~i~0 21), 103788#(<= main_~i~0 20), 103791#(<= main_~i~0 23), 103790#(<= main_~i~0 22), 103793#(<= main_~i~0 25), 103792#(<= main_~i~0 24), 103795#(<= main_~i~0 27), 103794#(<= main_~i~0 26), 103797#(<= main_~i~0 29), 103796#(<= main_~i~0 28), 103799#(<= main_~i~0 31), 103798#(<= main_~i~0 30), 103801#(<= main_~i~0 33), 103800#(<= main_~i~0 32), 103803#(<= main_~i~0 35), 103802#(<= main_~i~0 34), 103805#(<= main_~i~0 37), 103804#(<= main_~i~0 36), 103807#(<= main_~i~0 39), 103806#(<= main_~i~0 38)] [2018-04-12 02:56:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15249 backedges. 0 proven. 15249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:00,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-12 02:56:00,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-12 02:56:00,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3088, Invalid=3554, Unknown=0, NotChecked=0, Total=6642 [2018-04-12 02:56:00,148 INFO L87 Difference]: Start difference. First operand 1124 states and 1516 transitions. Second operand 82 states. [2018-04-12 02:56:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:04,550 INFO L93 Difference]: Finished difference Result 1221 states and 1620 transitions. [2018-04-12 02:56:04,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-12 02:56:04,550 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 398 [2018-04-12 02:56:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:04,551 INFO L225 Difference]: With dead ends: 1221 [2018-04-12 02:56:04,551 INFO L226 Difference]: Without dead ends: 1221 [2018-04-12 02:56:04,552 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=9327, Invalid=16113, Unknown=0, NotChecked=0, Total=25440 [2018-04-12 02:56:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2018-04-12 02:56:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1138. [2018-04-12 02:56:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-04-12 02:56:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1535 transitions. [2018-04-12 02:56:04,557 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1535 transitions. Word has length 398 [2018-04-12 02:56:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:04,558 INFO L459 AbstractCegarLoop]: Abstraction has 1138 states and 1535 transitions. [2018-04-12 02:56:04,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-12 02:56:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1535 transitions. [2018-04-12 02:56:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-04-12 02:56:04,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:04,559 INFO L355 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:04,559 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:04,560 INFO L82 PathProgramCache]: Analyzing trace with hash 521270006, now seen corresponding path program 79 times [2018-04-12 02:56:04,560 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:04,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15642 backedges. 0 proven. 15642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:06,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:06,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-12 02:56:06,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:06,388 INFO L182 omatonBuilderFactory]: Interpolants [106369#(<= main_~i~0 4), 106368#(<= main_~i~0 3), 106371#(<= main_~i~0 6), 106370#(<= main_~i~0 5), 106373#(<= main_~i~0 8), 106372#(<= main_~i~0 7), 106375#(<= main_~i~0 10), 106374#(<= main_~i~0 9), 106377#(<= main_~i~0 12), 106376#(<= main_~i~0 11), 106379#(<= main_~i~0 14), 106378#(<= main_~i~0 13), 106381#(<= main_~i~0 16), 106380#(<= main_~i~0 15), 106383#(<= main_~i~0 18), 106382#(<= main_~i~0 17), 106385#(<= main_~i~0 20), 106384#(<= main_~i~0 19), 106387#(<= main_~i~0 22), 106386#(<= main_~i~0 21), 106389#(<= main_~i~0 24), 106388#(<= main_~i~0 23), 106391#(<= main_~i~0 26), 106390#(<= main_~i~0 25), 106393#(<= main_~i~0 28), 106392#(<= main_~i~0 27), 106395#(<= main_~i~0 30), 106394#(<= main_~i~0 29), 106397#(<= main_~i~0 32), 106396#(<= main_~i~0 31), 106399#(<= main_~i~0 34), 106398#(<= main_~i~0 33), 106401#(<= main_~i~0 36), 106400#(<= main_~i~0 35), 106403#(<= main_~i~0 38), 106402#(<= main_~i~0 37), 106405#(<= main_~i~0 40), 106404#(<= main_~i~0 39), 106407#(<= main_~i~0 42), 106406#(<= main_~i~0 41), 106409#(<= main_~i~0 44), 106408#(<= main_~i~0 43), 106411#(<= main_~i~0 46), 106410#(<= main_~i~0 45), 106413#(<= main_~i~0 48), 106412#(<= main_~i~0 47), 106415#(<= main_~i~0 50), 106414#(<= main_~i~0 49), 106417#(<= main_~i~0 52), 106416#(<= main_~i~0 51), 106419#(<= main_~i~0 54), 106418#(<= main_~i~0 53), 106421#(<= main_~i~0 56), 106420#(<= main_~i~0 55), 106423#(<= main_~i~0 58), 106422#(<= main_~i~0 57), 106425#(<= main_~i~0 60), 106424#(<= main_~i~0 59), 106427#(<= main_~i~0 62), 106426#(<= main_~i~0 61), 106429#(<= main_~i~0 64), 106428#(<= main_~i~0 63), 106431#(<= main_~i~0 66), 106430#(<= main_~i~0 65), 106433#(<= main_~i~0 68), 106432#(<= main_~i~0 67), 106435#(<= main_~i~0 70), 106434#(<= main_~i~0 69), 106437#(<= main_~i~0 72), 106436#(<= main_~i~0 71), 106439#(<= main_~i~0 74), 106438#(<= main_~i~0 73), 106441#(<= main_~i~0 76), 106440#(<= main_~i~0 75), 106443#(<= main_~i~0 78), 106442#(<= main_~i~0 77), 106445#(and (<= 1 main_~i~0) (<= main_~i~0 79)), 106444#(and (<= 0 main_~i~0) (<= main_~i~0 78)), 106363#true, 106365#(<= main_~i~0 0), 106364#false, 106367#(<= main_~i~0 2), 106366#(<= main_~i~0 1)] [2018-04-12 02:56:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15642 backedges. 0 proven. 15642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:06,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-12 02:56:06,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-12 02:56:06,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=3561, Unknown=0, NotChecked=0, Total=6806 [2018-04-12 02:56:06,389 INFO L87 Difference]: Start difference. First operand 1138 states and 1535 transitions. Second operand 83 states. [2018-04-12 02:56:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:10,670 INFO L93 Difference]: Finished difference Result 1236 states and 1640 transitions. [2018-04-12 02:56:10,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-12 02:56:10,670 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 403 [2018-04-12 02:56:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:10,671 INFO L225 Difference]: With dead ends: 1236 [2018-04-12 02:56:10,671 INFO L226 Difference]: Without dead ends: 1236 [2018-04-12 02:56:10,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=9723, Invalid=16359, Unknown=0, NotChecked=0, Total=26082 [2018-04-12 02:56:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-04-12 02:56:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1152. [2018-04-12 02:56:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-04-12 02:56:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1554 transitions. [2018-04-12 02:56:10,677 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1554 transitions. Word has length 403 [2018-04-12 02:56:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:10,677 INFO L459 AbstractCegarLoop]: Abstraction has 1152 states and 1554 transitions. [2018-04-12 02:56:10,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-12 02:56:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1554 transitions. [2018-04-12 02:56:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-04-12 02:56:10,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:10,679 INFO L355 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:10,679 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:10,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1071592893, now seen corresponding path program 80 times [2018-04-12 02:56:10,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:10,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16040 backedges. 0 proven. 16040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:12,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:12,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-12 02:56:12,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:12,484 INFO L182 omatonBuilderFactory]: Interpolants [109057#(<= main_~i~0 63), 109056#(<= main_~i~0 62), 109059#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 109058#(<= main_~i~0 64), 109061#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 109060#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 109063#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 109062#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 109065#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 109064#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 109067#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 109066#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 109069#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 109068#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 109071#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 109070#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 109073#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 109072#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 109075#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 109074#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 108993#false, 108992#true, 108995#(<= main_~i~0 1), 108994#(<= main_~i~0 0), 108997#(<= main_~i~0 3), 108996#(<= main_~i~0 2), 108999#(<= main_~i~0 5), 108998#(<= main_~i~0 4), 109001#(<= main_~i~0 7), 109000#(<= main_~i~0 6), 109003#(<= main_~i~0 9), 109002#(<= main_~i~0 8), 109005#(<= main_~i~0 11), 109004#(<= main_~i~0 10), 109007#(<= main_~i~0 13), 109006#(<= main_~i~0 12), 109009#(<= main_~i~0 15), 109008#(<= main_~i~0 14), 109011#(<= main_~i~0 17), 109010#(<= main_~i~0 16), 109013#(<= main_~i~0 19), 109012#(<= main_~i~0 18), 109015#(<= main_~i~0 21), 109014#(<= main_~i~0 20), 109017#(<= main_~i~0 23), 109016#(<= main_~i~0 22), 109019#(<= main_~i~0 25), 109018#(<= main_~i~0 24), 109021#(<= main_~i~0 27), 109020#(<= main_~i~0 26), 109023#(<= main_~i~0 29), 109022#(<= main_~i~0 28), 109025#(<= main_~i~0 31), 109024#(<= main_~i~0 30), 109027#(<= main_~i~0 33), 109026#(<= main_~i~0 32), 109029#(<= main_~i~0 35), 109028#(<= main_~i~0 34), 109031#(<= main_~i~0 37), 109030#(<= main_~i~0 36), 109033#(<= main_~i~0 39), 109032#(<= main_~i~0 38), 109035#(<= main_~i~0 41), 109034#(<= main_~i~0 40), 109037#(<= main_~i~0 43), 109036#(<= main_~i~0 42), 109039#(<= main_~i~0 45), 109038#(<= main_~i~0 44), 109041#(<= main_~i~0 47), 109040#(<= main_~i~0 46), 109043#(<= main_~i~0 49), 109042#(<= main_~i~0 48), 109045#(<= main_~i~0 51), 109044#(<= main_~i~0 50), 109047#(<= main_~i~0 53), 109046#(<= main_~i~0 52), 109049#(<= main_~i~0 55), 109048#(<= main_~i~0 54), 109051#(<= main_~i~0 57), 109050#(<= main_~i~0 56), 109053#(<= main_~i~0 59), 109052#(<= main_~i~0 58), 109055#(<= main_~i~0 61), 109054#(<= main_~i~0 60)] [2018-04-12 02:56:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16040 backedges. 0 proven. 16040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:12,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-12 02:56:12,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-12 02:56:12,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2246, Invalid=4726, Unknown=0, NotChecked=0, Total=6972 [2018-04-12 02:56:12,486 INFO L87 Difference]: Start difference. First operand 1152 states and 1554 transitions. Second operand 84 states. [2018-04-12 02:56:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:19,494 INFO L93 Difference]: Finished difference Result 1251 states and 1660 transitions. [2018-04-12 02:56:19,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-12 02:56:19,494 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 408 [2018-04-12 02:56:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:19,495 INFO L225 Difference]: With dead ends: 1251 [2018-04-12 02:56:19,495 INFO L226 Difference]: Without dead ends: 1251 [2018-04-12 02:56:19,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4279 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7671, Invalid=19061, Unknown=0, NotChecked=0, Total=26732 [2018-04-12 02:56:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-04-12 02:56:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1166. [2018-04-12 02:56:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-04-12 02:56:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1573 transitions. [2018-04-12 02:56:19,502 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1573 transitions. Word has length 408 [2018-04-12 02:56:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:19,502 INFO L459 AbstractCegarLoop]: Abstraction has 1166 states and 1573 transitions. [2018-04-12 02:56:19,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-12 02:56:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1573 transitions. [2018-04-12 02:56:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-04-12 02:56:19,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:19,504 INFO L355 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:19,504 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1969252522, now seen corresponding path program 81 times [2018-04-12 02:56:19,505 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:19,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16443 backedges. 0 proven. 16443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:21,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:21,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-12 02:56:21,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:21,481 INFO L182 omatonBuilderFactory]: Interpolants [111653#true, 111655#(<= main_~i~0 0), 111654#false, 111657#(<= main_~i~0 2), 111656#(<= main_~i~0 1), 111659#(<= main_~i~0 4), 111658#(<= main_~i~0 3), 111661#(<= main_~i~0 6), 111660#(<= main_~i~0 5), 111663#(<= main_~i~0 8), 111662#(<= main_~i~0 7), 111665#(<= main_~i~0 10), 111664#(<= main_~i~0 9), 111667#(<= main_~i~0 12), 111666#(<= main_~i~0 11), 111669#(<= main_~i~0 14), 111668#(<= main_~i~0 13), 111671#(<= main_~i~0 16), 111670#(<= main_~i~0 15), 111673#(<= main_~i~0 18), 111672#(<= main_~i~0 17), 111675#(<= main_~i~0 20), 111674#(<= main_~i~0 19), 111677#(<= main_~i~0 22), 111676#(<= main_~i~0 21), 111679#(<= main_~i~0 24), 111678#(<= main_~i~0 23), 111681#(<= main_~i~0 26), 111680#(<= main_~i~0 25), 111683#(<= main_~i~0 28), 111682#(<= main_~i~0 27), 111685#(<= main_~i~0 30), 111684#(<= main_~i~0 29), 111687#(<= main_~i~0 32), 111686#(<= main_~i~0 31), 111689#(<= main_~i~0 34), 111688#(<= main_~i~0 33), 111691#(<= main_~i~0 36), 111690#(<= main_~i~0 35), 111693#(<= main_~i~0 38), 111692#(<= main_~i~0 37), 111695#(<= main_~i~0 40), 111694#(<= main_~i~0 39), 111697#(<= main_~i~0 42), 111696#(<= main_~i~0 41), 111699#(<= main_~i~0 44), 111698#(<= main_~i~0 43), 111701#(<= main_~i~0 46), 111700#(<= main_~i~0 45), 111703#(<= main_~i~0 48), 111702#(<= main_~i~0 47), 111705#(<= main_~i~0 50), 111704#(<= main_~i~0 49), 111707#(<= main_~i~0 52), 111706#(<= main_~i~0 51), 111709#(<= main_~i~0 54), 111708#(<= main_~i~0 53), 111711#(<= main_~i~0 56), 111710#(<= main_~i~0 55), 111713#(<= main_~i~0 58), 111712#(<= main_~i~0 57), 111715#(<= main_~i~0 60), 111714#(<= main_~i~0 59), 111717#(<= main_~i~0 62), 111716#(<= main_~i~0 61), 111719#(<= main_~i~0 64), 111718#(<= main_~i~0 63), 111721#(<= main_~i~0 66), 111720#(<= main_~i~0 65), 111723#(<= main_~i~0 68), 111722#(<= main_~i~0 67), 111725#(<= main_~i~0 70), 111724#(<= main_~i~0 69), 111727#(<= main_~i~0 72), 111726#(<= main_~i~0 71), 111729#(<= main_~i~0 74), 111728#(<= main_~i~0 73), 111731#(<= main_~i~0 76), 111730#(<= main_~i~0 75), 111733#(<= main_~i~0 78), 111732#(<= main_~i~0 77), 111735#(<= main_~i~0 80), 111734#(<= main_~i~0 79), 111737#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 111736#(and (<= 0 main_~i~0) (<= main_~i~0 80))] [2018-04-12 02:56:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16443 backedges. 0 proven. 16443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:21,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-12 02:56:21,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-12 02:56:21,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3408, Invalid=3732, Unknown=0, NotChecked=0, Total=7140 [2018-04-12 02:56:21,482 INFO L87 Difference]: Start difference. First operand 1166 states and 1573 transitions. Second operand 85 states. [2018-04-12 02:56:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:26,015 INFO L93 Difference]: Finished difference Result 1266 states and 1680 transitions. [2018-04-12 02:56:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-12 02:56:26,015 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 413 [2018-04-12 02:56:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:26,016 INFO L225 Difference]: With dead ends: 1266 [2018-04-12 02:56:26,016 INFO L226 Difference]: Without dead ends: 1266 [2018-04-12 02:56:26,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=10212, Invalid=17178, Unknown=0, NotChecked=0, Total=27390 [2018-04-12 02:56:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2018-04-12 02:56:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1180. [2018-04-12 02:56:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-04-12 02:56:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1592 transitions. [2018-04-12 02:56:26,023 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1592 transitions. Word has length 413 [2018-04-12 02:56:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:26,023 INFO L459 AbstractCegarLoop]: Abstraction has 1180 states and 1592 transitions. [2018-04-12 02:56:26,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-12 02:56:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1592 transitions. [2018-04-12 02:56:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-04-12 02:56:26,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:26,025 INFO L355 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:26,025 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2096542371, now seen corresponding path program 82 times [2018-04-12 02:56:26,025 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:26,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16851 backedges. 0 proven. 16851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:28,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:28,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-12 02:56:28,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:28,102 INFO L182 omatonBuilderFactory]: Interpolants [114347#false, 114346#true, 114349#(<= main_~i~0 1), 114348#(<= main_~i~0 0), 114351#(<= main_~i~0 3), 114350#(<= main_~i~0 2), 114353#(<= main_~i~0 5), 114352#(<= main_~i~0 4), 114355#(<= main_~i~0 7), 114354#(<= main_~i~0 6), 114357#(<= main_~i~0 9), 114356#(<= main_~i~0 8), 114359#(<= main_~i~0 11), 114358#(<= main_~i~0 10), 114361#(<= main_~i~0 13), 114360#(<= main_~i~0 12), 114363#(<= main_~i~0 15), 114362#(<= main_~i~0 14), 114365#(<= main_~i~0 17), 114364#(<= main_~i~0 16), 114367#(<= main_~i~0 19), 114366#(<= main_~i~0 18), 114369#(<= main_~i~0 21), 114368#(<= main_~i~0 20), 114371#(<= main_~i~0 23), 114370#(<= main_~i~0 22), 114373#(<= main_~i~0 25), 114372#(<= main_~i~0 24), 114375#(<= main_~i~0 27), 114374#(<= main_~i~0 26), 114377#(<= main_~i~0 29), 114376#(<= main_~i~0 28), 114379#(<= main_~i~0 31), 114378#(<= main_~i~0 30), 114381#(<= main_~i~0 33), 114380#(<= main_~i~0 32), 114383#(<= main_~i~0 35), 114382#(<= main_~i~0 34), 114385#(<= main_~i~0 37), 114384#(<= main_~i~0 36), 114387#(<= main_~i~0 39), 114386#(<= main_~i~0 38), 114389#(<= main_~i~0 41), 114388#(<= main_~i~0 40), 114391#(<= main_~i~0 43), 114390#(<= main_~i~0 42), 114393#(<= main_~i~0 45), 114392#(<= main_~i~0 44), 114395#(<= main_~i~0 47), 114394#(<= main_~i~0 46), 114397#(<= main_~i~0 49), 114396#(<= main_~i~0 48), 114399#(<= main_~i~0 51), 114398#(<= main_~i~0 50), 114401#(<= main_~i~0 53), 114400#(<= main_~i~0 52), 114403#(<= main_~i~0 55), 114402#(<= main_~i~0 54), 114405#(<= main_~i~0 57), 114404#(<= main_~i~0 56), 114407#(<= main_~i~0 59), 114406#(<= main_~i~0 58), 114409#(<= main_~i~0 61), 114408#(<= main_~i~0 60), 114411#(<= main_~i~0 63), 114410#(<= main_~i~0 62), 114413#(<= main_~i~0 65), 114412#(<= main_~i~0 64), 114415#(<= main_~i~0 67), 114414#(<= main_~i~0 66), 114417#(<= main_~i~0 69), 114416#(<= main_~i~0 68), 114419#(<= main_~i~0 71), 114418#(<= main_~i~0 70), 114421#(<= main_~i~0 73), 114420#(<= main_~i~0 72), 114423#(<= main_~i~0 75), 114422#(<= main_~i~0 74), 114425#(<= main_~i~0 77), 114424#(<= main_~i~0 76), 114427#(<= main_~i~0 79), 114426#(<= main_~i~0 78), 114429#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 114428#(<= main_~i~0 80), 114431#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 114430#(and (<= 1 main_~i~0) (<= main_~i~0 81))] [2018-04-12 02:56:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16851 backedges. 0 proven. 16851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:28,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-12 02:56:28,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-12 02:56:28,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3410, Invalid=3900, Unknown=0, NotChecked=0, Total=7310 [2018-04-12 02:56:28,103 INFO L87 Difference]: Start difference. First operand 1180 states and 1592 transitions. Second operand 86 states. [2018-04-12 02:56:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:32,959 INFO L93 Difference]: Finished difference Result 1281 states and 1700 transitions. [2018-04-12 02:56:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-12 02:56:32,959 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 418 [2018-04-12 02:56:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:32,960 INFO L225 Difference]: With dead ends: 1281 [2018-04-12 02:56:32,960 INFO L226 Difference]: Without dead ends: 1281 [2018-04-12 02:56:32,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=10297, Invalid=17759, Unknown=0, NotChecked=0, Total=28056 [2018-04-12 02:56:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2018-04-12 02:56:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1194. [2018-04-12 02:56:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2018-04-12 02:56:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1611 transitions. [2018-04-12 02:56:32,966 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1611 transitions. Word has length 418 [2018-04-12 02:56:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:32,966 INFO L459 AbstractCegarLoop]: Abstraction has 1194 states and 1611 transitions. [2018-04-12 02:56:32,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-12 02:56:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1611 transitions. [2018-04-12 02:56:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-04-12 02:56:32,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:32,968 INFO L355 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:32,968 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 36914102, now seen corresponding path program 83 times [2018-04-12 02:56:32,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:33,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 17264 backedges. 0 proven. 17264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:35,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:35,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-12 02:56:35,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:35,016 INFO L182 omatonBuilderFactory]: Interpolants [117121#(<= main_~i~0 48), 117120#(<= main_~i~0 47), 117123#(<= main_~i~0 50), 117122#(<= main_~i~0 49), 117125#(<= main_~i~0 52), 117124#(<= main_~i~0 51), 117127#(<= main_~i~0 54), 117126#(<= main_~i~0 53), 117129#(<= main_~i~0 56), 117128#(<= main_~i~0 55), 117131#(<= main_~i~0 58), 117130#(<= main_~i~0 57), 117133#(<= main_~i~0 60), 117132#(<= main_~i~0 59), 117135#(<= main_~i~0 62), 117134#(<= main_~i~0 61), 117137#(<= main_~i~0 64), 117136#(<= main_~i~0 63), 117139#(<= main_~i~0 66), 117138#(<= main_~i~0 65), 117141#(<= main_~i~0 68), 117140#(<= main_~i~0 67), 117143#(<= main_~i~0 70), 117142#(<= main_~i~0 69), 117145#(<= main_~i~0 72), 117144#(<= main_~i~0 71), 117147#(<= main_~i~0 74), 117146#(<= main_~i~0 73), 117149#(<= main_~i~0 76), 117148#(<= main_~i~0 75), 117151#(<= main_~i~0 78), 117150#(<= main_~i~0 77), 117153#(<= main_~i~0 80), 117152#(<= main_~i~0 79), 117155#(<= main_~i~0 82), 117154#(<= main_~i~0 81), 117157#(and (<= 1 main_~i~0) (<= main_~i~0 83)), 117156#(and (<= 0 main_~i~0) (<= main_~i~0 82)), 117071#true, 117073#(<= main_~i~0 0), 117072#false, 117075#(<= main_~i~0 2), 117074#(<= main_~i~0 1), 117077#(<= main_~i~0 4), 117076#(<= main_~i~0 3), 117079#(<= main_~i~0 6), 117078#(<= main_~i~0 5), 117081#(<= main_~i~0 8), 117080#(<= main_~i~0 7), 117083#(<= main_~i~0 10), 117082#(<= main_~i~0 9), 117085#(<= main_~i~0 12), 117084#(<= main_~i~0 11), 117087#(<= main_~i~0 14), 117086#(<= main_~i~0 13), 117089#(<= main_~i~0 16), 117088#(<= main_~i~0 15), 117091#(<= main_~i~0 18), 117090#(<= main_~i~0 17), 117093#(<= main_~i~0 20), 117092#(<= main_~i~0 19), 117095#(<= main_~i~0 22), 117094#(<= main_~i~0 21), 117097#(<= main_~i~0 24), 117096#(<= main_~i~0 23), 117099#(<= main_~i~0 26), 117098#(<= main_~i~0 25), 117101#(<= main_~i~0 28), 117100#(<= main_~i~0 27), 117103#(<= main_~i~0 30), 117102#(<= main_~i~0 29), 117105#(<= main_~i~0 32), 117104#(<= main_~i~0 31), 117107#(<= main_~i~0 34), 117106#(<= main_~i~0 33), 117109#(<= main_~i~0 36), 117108#(<= main_~i~0 35), 117111#(<= main_~i~0 38), 117110#(<= main_~i~0 37), 117113#(<= main_~i~0 40), 117112#(<= main_~i~0 39), 117115#(<= main_~i~0 42), 117114#(<= main_~i~0 41), 117117#(<= main_~i~0 44), 117116#(<= main_~i~0 43), 117119#(<= main_~i~0 46), 117118#(<= main_~i~0 45)] [2018-04-12 02:56:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 17264 backedges. 0 proven. 17264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:35,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-12 02:56:35,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-12 02:56:35,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3575, Invalid=3907, Unknown=0, NotChecked=0, Total=7482 [2018-04-12 02:56:35,017 INFO L87 Difference]: Start difference. First operand 1194 states and 1611 transitions. Second operand 87 states. [2018-04-12 02:56:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:39,421 INFO L93 Difference]: Finished difference Result 1296 states and 1720 transitions. [2018-04-12 02:56:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-12 02:56:39,422 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 423 [2018-04-12 02:56:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:39,423 INFO L225 Difference]: With dead ends: 1296 [2018-04-12 02:56:39,423 INFO L226 Difference]: Without dead ends: 1296 [2018-04-12 02:56:39,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=10713, Invalid=18017, Unknown=0, NotChecked=0, Total=28730 [2018-04-12 02:56:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-04-12 02:56:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1208. [2018-04-12 02:56:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-04-12 02:56:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1630 transitions. [2018-04-12 02:56:39,432 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1630 transitions. Word has length 423 [2018-04-12 02:56:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:39,432 INFO L459 AbstractCegarLoop]: Abstraction has 1208 states and 1630 transitions. [2018-04-12 02:56:39,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-12 02:56:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1630 transitions. [2018-04-12 02:56:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-04-12 02:56:39,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:39,434 INFO L355 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:39,434 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -189637379, now seen corresponding path program 84 times [2018-04-12 02:56:39,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:39,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17682 backedges. 0 proven. 17682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:41,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:41,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-12 02:56:41,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:41,541 INFO L182 omatonBuilderFactory]: Interpolants [119829#false, 119828#true, 119831#(<= main_~i~0 1), 119830#(<= main_~i~0 0), 119833#(<= main_~i~0 3), 119832#(<= main_~i~0 2), 119835#(<= main_~i~0 5), 119834#(<= main_~i~0 4), 119837#(<= main_~i~0 7), 119836#(<= main_~i~0 6), 119839#(<= main_~i~0 9), 119838#(<= main_~i~0 8), 119841#(<= main_~i~0 11), 119840#(<= main_~i~0 10), 119843#(<= main_~i~0 13), 119842#(<= main_~i~0 12), 119845#(<= main_~i~0 15), 119844#(<= main_~i~0 14), 119847#(<= main_~i~0 17), 119846#(<= main_~i~0 16), 119849#(<= main_~i~0 19), 119848#(<= main_~i~0 18), 119851#(<= main_~i~0 21), 119850#(<= main_~i~0 20), 119853#(<= main_~i~0 23), 119852#(<= main_~i~0 22), 119855#(<= main_~i~0 25), 119854#(<= main_~i~0 24), 119857#(<= main_~i~0 27), 119856#(<= main_~i~0 26), 119859#(<= main_~i~0 29), 119858#(<= main_~i~0 28), 119861#(<= main_~i~0 31), 119860#(<= main_~i~0 30), 119863#(<= main_~i~0 33), 119862#(<= main_~i~0 32), 119865#(<= main_~i~0 35), 119864#(<= main_~i~0 34), 119867#(<= main_~i~0 37), 119866#(<= main_~i~0 36), 119869#(<= main_~i~0 39), 119868#(<= main_~i~0 38), 119871#(<= main_~i~0 41), 119870#(<= main_~i~0 40), 119873#(<= main_~i~0 43), 119872#(<= main_~i~0 42), 119875#(<= main_~i~0 45), 119874#(<= main_~i~0 44), 119877#(<= main_~i~0 47), 119876#(<= main_~i~0 46), 119879#(<= main_~i~0 49), 119878#(<= main_~i~0 48), 119881#(<= main_~i~0 51), 119880#(<= main_~i~0 50), 119883#(<= main_~i~0 53), 119882#(<= main_~i~0 52), 119885#(<= main_~i~0 55), 119884#(<= main_~i~0 54), 119887#(<= main_~i~0 57), 119886#(<= main_~i~0 56), 119889#(<= main_~i~0 59), 119888#(<= main_~i~0 58), 119891#(<= main_~i~0 61), 119890#(<= main_~i~0 60), 119893#(<= main_~i~0 63), 119892#(<= main_~i~0 62), 119895#(<= main_~i~0 65), 119894#(<= main_~i~0 64), 119897#(<= main_~i~0 67), 119896#(<= main_~i~0 66), 119899#(<= main_~i~0 69), 119898#(<= main_~i~0 68), 119901#(<= main_~i~0 71), 119900#(<= main_~i~0 70), 119903#(<= main_~i~0 73), 119902#(<= main_~i~0 72), 119905#(<= main_~i~0 75), 119904#(<= main_~i~0 74), 119907#(<= main_~i~0 77), 119906#(<= main_~i~0 76), 119909#(<= main_~i~0 79), 119908#(<= main_~i~0 78), 119911#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 119910#(<= main_~i~0 80), 119913#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 119912#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 119915#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 119914#(and (<= main_~i~0 83) (<= 3 main_~i~0))] [2018-04-12 02:56:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17682 backedges. 0 proven. 17682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:41,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-12 02:56:41,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-12 02:56:41,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3414, Invalid=4242, Unknown=0, NotChecked=0, Total=7656 [2018-04-12 02:56:41,543 INFO L87 Difference]: Start difference. First operand 1208 states and 1630 transitions. Second operand 88 states. [2018-04-12 02:56:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:46,844 INFO L93 Difference]: Finished difference Result 1311 states and 1740 transitions. [2018-04-12 02:56:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-12 02:56:46,844 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 428 [2018-04-12 02:56:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:46,845 INFO L225 Difference]: With dead ends: 1311 [2018-04-12 02:56:46,845 INFO L226 Difference]: Without dead ends: 1311 [2018-04-12 02:56:46,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3893 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10467, Invalid=18945, Unknown=0, NotChecked=0, Total=29412 [2018-04-12 02:56:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2018-04-12 02:56:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1222. [2018-04-12 02:56:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-04-12 02:56:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1649 transitions. [2018-04-12 02:56:46,852 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1649 transitions. Word has length 428 [2018-04-12 02:56:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:46,852 INFO L459 AbstractCegarLoop]: Abstraction has 1222 states and 1649 transitions. [2018-04-12 02:56:46,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-12 02:56:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1649 transitions. [2018-04-12 02:56:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-04-12 02:56:46,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:46,854 INFO L355 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:46,854 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash -605882346, now seen corresponding path program 85 times [2018-04-12 02:56:46,855 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:46,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18105 backedges. 0 proven. 18105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:49,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:49,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-12 02:56:49,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:49,026 INFO L182 omatonBuilderFactory]: Interpolants [122625#(<= main_~i~0 6), 122624#(<= main_~i~0 5), 122627#(<= main_~i~0 8), 122626#(<= main_~i~0 7), 122629#(<= main_~i~0 10), 122628#(<= main_~i~0 9), 122631#(<= main_~i~0 12), 122630#(<= main_~i~0 11), 122633#(<= main_~i~0 14), 122632#(<= main_~i~0 13), 122635#(<= main_~i~0 16), 122634#(<= main_~i~0 15), 122637#(<= main_~i~0 18), 122636#(<= main_~i~0 17), 122639#(<= main_~i~0 20), 122638#(<= main_~i~0 19), 122641#(<= main_~i~0 22), 122640#(<= main_~i~0 21), 122643#(<= main_~i~0 24), 122642#(<= main_~i~0 23), 122645#(<= main_~i~0 26), 122644#(<= main_~i~0 25), 122647#(<= main_~i~0 28), 122646#(<= main_~i~0 27), 122649#(<= main_~i~0 30), 122648#(<= main_~i~0 29), 122651#(<= main_~i~0 32), 122650#(<= main_~i~0 31), 122653#(<= main_~i~0 34), 122652#(<= main_~i~0 33), 122655#(<= main_~i~0 36), 122654#(<= main_~i~0 35), 122657#(<= main_~i~0 38), 122656#(<= main_~i~0 37), 122659#(<= main_~i~0 40), 122658#(<= main_~i~0 39), 122661#(<= main_~i~0 42), 122660#(<= main_~i~0 41), 122663#(<= main_~i~0 44), 122662#(<= main_~i~0 43), 122665#(<= main_~i~0 46), 122664#(<= main_~i~0 45), 122667#(<= main_~i~0 48), 122666#(<= main_~i~0 47), 122669#(<= main_~i~0 50), 122668#(<= main_~i~0 49), 122671#(<= main_~i~0 52), 122670#(<= main_~i~0 51), 122673#(<= main_~i~0 54), 122672#(<= main_~i~0 53), 122675#(<= main_~i~0 56), 122674#(<= main_~i~0 55), 122677#(<= main_~i~0 58), 122676#(<= main_~i~0 57), 122679#(<= main_~i~0 60), 122678#(<= main_~i~0 59), 122681#(<= main_~i~0 62), 122680#(<= main_~i~0 61), 122683#(<= main_~i~0 64), 122682#(<= main_~i~0 63), 122685#(<= main_~i~0 66), 122684#(<= main_~i~0 65), 122687#(<= main_~i~0 68), 122686#(<= main_~i~0 67), 122689#(<= main_~i~0 70), 122688#(<= main_~i~0 69), 122691#(<= main_~i~0 72), 122690#(<= main_~i~0 71), 122693#(<= main_~i~0 74), 122692#(<= main_~i~0 73), 122695#(<= main_~i~0 76), 122694#(<= main_~i~0 75), 122697#(<= main_~i~0 78), 122696#(<= main_~i~0 77), 122699#(<= main_~i~0 80), 122698#(<= main_~i~0 79), 122701#(<= main_~i~0 82), 122700#(<= main_~i~0 81), 122703#(<= main_~i~0 84), 122702#(<= main_~i~0 83), 122705#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 122704#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 122617#true, 122619#(<= main_~i~0 0), 122618#false, 122621#(<= main_~i~0 2), 122620#(<= main_~i~0 1), 122623#(<= main_~i~0 4), 122622#(<= main_~i~0 3)] [2018-04-12 02:56:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18105 backedges. 0 proven. 18105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:49,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-12 02:56:49,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-12 02:56:49,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3746, Invalid=4086, Unknown=0, NotChecked=0, Total=7832 [2018-04-12 02:56:49,028 INFO L87 Difference]: Start difference. First operand 1222 states and 1649 transitions. Second operand 89 states. [2018-04-12 02:56:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:56:53,996 INFO L93 Difference]: Finished difference Result 1326 states and 1760 transitions. [2018-04-12 02:56:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-12 02:56:53,997 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 433 [2018-04-12 02:56:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:56:53,998 INFO L225 Difference]: With dead ends: 1326 [2018-04-12 02:56:53,998 INFO L226 Difference]: Without dead ends: 1326 [2018-04-12 02:56:53,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=11226, Invalid=18876, Unknown=0, NotChecked=0, Total=30102 [2018-04-12 02:56:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-04-12 02:56:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1236. [2018-04-12 02:56:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-04-12 02:56:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1668 transitions. [2018-04-12 02:56:54,006 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1668 transitions. Word has length 433 [2018-04-12 02:56:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:56:54,006 INFO L459 AbstractCegarLoop]: Abstraction has 1236 states and 1668 transitions. [2018-04-12 02:56:54,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-12 02:56:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1668 transitions. [2018-04-12 02:56:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-04-12 02:56:54,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:56:54,008 INFO L355 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-04-12 02:56:54,008 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:56:54,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1669045091, now seen corresponding path program 86 times [2018-04-12 02:56:54,008 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:56:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:56:54,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:56:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18533 backedges. 0 proven. 18533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:56,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:56:56,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-12 02:56:56,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:56:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:56,234 INFO L182 omatonBuilderFactory]: Interpolants [125441#(<= main_~i~0 1), 125440#(<= main_~i~0 0), 125443#(<= main_~i~0 3), 125442#(<= main_~i~0 2), 125445#(<= main_~i~0 5), 125444#(<= main_~i~0 4), 125447#(<= main_~i~0 7), 125446#(<= main_~i~0 6), 125449#(<= main_~i~0 9), 125448#(<= main_~i~0 8), 125451#(<= main_~i~0 11), 125450#(<= main_~i~0 10), 125453#(<= main_~i~0 13), 125452#(<= main_~i~0 12), 125455#(<= main_~i~0 15), 125454#(<= main_~i~0 14), 125457#(<= main_~i~0 17), 125456#(<= main_~i~0 16), 125459#(<= main_~i~0 19), 125458#(<= main_~i~0 18), 125461#(<= main_~i~0 21), 125460#(<= main_~i~0 20), 125463#(<= main_~i~0 23), 125462#(<= main_~i~0 22), 125465#(<= main_~i~0 25), 125464#(<= main_~i~0 24), 125467#(<= main_~i~0 27), 125466#(<= main_~i~0 26), 125469#(<= main_~i~0 29), 125468#(<= main_~i~0 28), 125471#(<= main_~i~0 31), 125470#(<= main_~i~0 30), 125473#(<= main_~i~0 33), 125472#(<= main_~i~0 32), 125475#(<= main_~i~0 35), 125474#(<= main_~i~0 34), 125477#(<= main_~i~0 37), 125476#(<= main_~i~0 36), 125479#(<= main_~i~0 39), 125478#(<= main_~i~0 38), 125481#(<= main_~i~0 41), 125480#(<= main_~i~0 40), 125483#(<= main_~i~0 43), 125482#(<= main_~i~0 42), 125485#(<= main_~i~0 45), 125484#(<= main_~i~0 44), 125487#(<= main_~i~0 47), 125486#(<= main_~i~0 46), 125489#(<= main_~i~0 49), 125488#(<= main_~i~0 48), 125491#(<= main_~i~0 51), 125490#(<= main_~i~0 50), 125493#(<= main_~i~0 53), 125492#(<= main_~i~0 52), 125495#(<= main_~i~0 55), 125494#(<= main_~i~0 54), 125497#(<= main_~i~0 57), 125496#(<= main_~i~0 56), 125499#(<= main_~i~0 59), 125498#(<= main_~i~0 58), 125501#(<= main_~i~0 61), 125500#(<= main_~i~0 60), 125503#(<= main_~i~0 63), 125502#(<= main_~i~0 62), 125505#(<= main_~i~0 65), 125504#(<= main_~i~0 64), 125507#(<= main_~i~0 67), 125506#(<= main_~i~0 66), 125509#(<= main_~i~0 69), 125508#(<= main_~i~0 68), 125511#(<= main_~i~0 71), 125510#(<= main_~i~0 70), 125513#(<= main_~i~0 73), 125512#(<= main_~i~0 72), 125515#(<= main_~i~0 75), 125514#(<= main_~i~0 74), 125517#(<= main_~i~0 77), 125516#(<= main_~i~0 76), 125519#(<= main_~i~0 79), 125518#(<= main_~i~0 78), 125521#(<= main_~i~0 81), 125520#(<= main_~i~0 80), 125523#(<= main_~i~0 83), 125522#(<= main_~i~0 82), 125525#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 125524#(<= main_~i~0 84), 125527#(and (<= main_~i~0 86) (<= 2 main_~i~0)), 125526#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 125439#false, 125438#true] [2018-04-12 02:56:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18533 backedges. 0 proven. 18533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:56:56,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-12 02:56:56,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-12 02:56:56,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3748, Invalid=4262, Unknown=0, NotChecked=0, Total=8010 [2018-04-12 02:56:56,235 INFO L87 Difference]: Start difference. First operand 1236 states and 1668 transitions. Second operand 90 states. [2018-04-12 02:57:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:01,626 INFO L93 Difference]: Finished difference Result 1341 states and 1780 transitions. [2018-04-12 02:57:01,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-12 02:57:01,626 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 438 [2018-04-12 02:57:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:01,627 INFO L225 Difference]: With dead ends: 1341 [2018-04-12 02:57:01,627 INFO L226 Difference]: Without dead ends: 1341 [2018-04-12 02:57:01,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3910 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=11315, Invalid=19485, Unknown=0, NotChecked=0, Total=30800 [2018-04-12 02:57:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2018-04-12 02:57:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1250. [2018-04-12 02:57:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2018-04-12 02:57:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1687 transitions. [2018-04-12 02:57:01,634 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1687 transitions. Word has length 438 [2018-04-12 02:57:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:01,634 INFO L459 AbstractCegarLoop]: Abstraction has 1250 states and 1687 transitions. [2018-04-12 02:57:01,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-12 02:57:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1687 transitions. [2018-04-12 02:57:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-04-12 02:57:01,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:01,636 INFO L355 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:01,636 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1246016630, now seen corresponding path program 87 times [2018-04-12 02:57:01,636 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:01,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:57:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18966 backedges. 0 proven. 18966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:03,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:57:03,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-12 02:57:03,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:57:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:03,973 INFO L182 omatonBuilderFactory]: Interpolants [128291#true, 128293#(<= main_~i~0 0), 128292#false, 128295#(<= main_~i~0 2), 128294#(<= main_~i~0 1), 128297#(<= main_~i~0 4), 128296#(<= main_~i~0 3), 128299#(<= main_~i~0 6), 128298#(<= main_~i~0 5), 128301#(<= main_~i~0 8), 128300#(<= main_~i~0 7), 128303#(<= main_~i~0 10), 128302#(<= main_~i~0 9), 128305#(<= main_~i~0 12), 128304#(<= main_~i~0 11), 128307#(<= main_~i~0 14), 128306#(<= main_~i~0 13), 128309#(<= main_~i~0 16), 128308#(<= main_~i~0 15), 128311#(<= main_~i~0 18), 128310#(<= main_~i~0 17), 128313#(<= main_~i~0 20), 128312#(<= main_~i~0 19), 128315#(<= main_~i~0 22), 128314#(<= main_~i~0 21), 128317#(<= main_~i~0 24), 128316#(<= main_~i~0 23), 128319#(<= main_~i~0 26), 128318#(<= main_~i~0 25), 128321#(<= main_~i~0 28), 128320#(<= main_~i~0 27), 128323#(<= main_~i~0 30), 128322#(<= main_~i~0 29), 128325#(<= main_~i~0 32), 128324#(<= main_~i~0 31), 128327#(<= main_~i~0 34), 128326#(<= main_~i~0 33), 128329#(<= main_~i~0 36), 128328#(<= main_~i~0 35), 128331#(<= main_~i~0 38), 128330#(<= main_~i~0 37), 128333#(<= main_~i~0 40), 128332#(<= main_~i~0 39), 128335#(<= main_~i~0 42), 128334#(<= main_~i~0 41), 128337#(<= main_~i~0 44), 128336#(<= main_~i~0 43), 128339#(<= main_~i~0 46), 128338#(<= main_~i~0 45), 128341#(<= main_~i~0 48), 128340#(<= main_~i~0 47), 128343#(<= main_~i~0 50), 128342#(<= main_~i~0 49), 128345#(<= main_~i~0 52), 128344#(<= main_~i~0 51), 128347#(<= main_~i~0 54), 128346#(<= main_~i~0 53), 128349#(<= main_~i~0 56), 128348#(<= main_~i~0 55), 128351#(<= main_~i~0 58), 128350#(<= main_~i~0 57), 128353#(<= main_~i~0 60), 128352#(<= main_~i~0 59), 128355#(<= main_~i~0 62), 128354#(<= main_~i~0 61), 128357#(<= main_~i~0 64), 128356#(<= main_~i~0 63), 128359#(<= main_~i~0 66), 128358#(<= main_~i~0 65), 128361#(<= main_~i~0 68), 128360#(<= main_~i~0 67), 128363#(<= main_~i~0 70), 128362#(<= main_~i~0 69), 128365#(<= main_~i~0 72), 128364#(<= main_~i~0 71), 128367#(<= main_~i~0 74), 128366#(<= main_~i~0 73), 128369#(<= main_~i~0 76), 128368#(<= main_~i~0 75), 128371#(<= main_~i~0 78), 128370#(<= main_~i~0 77), 128373#(<= main_~i~0 80), 128372#(<= main_~i~0 79), 128375#(<= main_~i~0 82), 128374#(<= main_~i~0 81), 128377#(<= main_~i~0 84), 128376#(<= main_~i~0 83), 128379#(<= main_~i~0 86), 128378#(<= main_~i~0 85), 128381#(and (<= 1 main_~i~0) (<= main_~i~0 87)), 128380#(and (<= main_~i~0 86) (<= 0 main_~i~0))] [2018-04-12 02:57:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18966 backedges. 0 proven. 18966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:03,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-12 02:57:03,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-12 02:57:03,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=4269, Unknown=0, NotChecked=0, Total=8190 [2018-04-12 02:57:03,974 INFO L87 Difference]: Start difference. First operand 1250 states and 1687 transitions. Second operand 91 states. [2018-04-12 02:57:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:09,291 INFO L93 Difference]: Finished difference Result 1356 states and 1800 transitions. [2018-04-12 02:57:09,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-12 02:57:09,291 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 443 [2018-04-12 02:57:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:09,292 INFO L225 Difference]: With dead ends: 1356 [2018-04-12 02:57:09,293 INFO L226 Difference]: Without dead ends: 1356 [2018-04-12 02:57:09,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11751, Invalid=19755, Unknown=0, NotChecked=0, Total=31506 [2018-04-12 02:57:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2018-04-12 02:57:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1264. [2018-04-12 02:57:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2018-04-12 02:57:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1706 transitions. [2018-04-12 02:57:09,301 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1706 transitions. Word has length 443 [2018-04-12 02:57:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:09,301 INFO L459 AbstractCegarLoop]: Abstraction has 1264 states and 1706 transitions. [2018-04-12 02:57:09,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-12 02:57:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1706 transitions. [2018-04-12 02:57:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-04-12 02:57:09,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:09,303 INFO L355 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:09,303 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1974035517, now seen corresponding path program 88 times [2018-04-12 02:57:09,304 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:09,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:57:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 19404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:11,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:57:11,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-12 02:57:11,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:57:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:11,567 INFO L182 omatonBuilderFactory]: Interpolants [131202#(<= main_~i~0 24), 131203#(<= main_~i~0 25), 131200#(<= main_~i~0 22), 131201#(<= main_~i~0 23), 131206#(<= main_~i~0 28), 131207#(<= main_~i~0 29), 131204#(<= main_~i~0 26), 131205#(<= main_~i~0 27), 131210#(<= main_~i~0 32), 131211#(<= main_~i~0 33), 131208#(<= main_~i~0 30), 131209#(<= main_~i~0 31), 131214#(<= main_~i~0 36), 131215#(<= main_~i~0 37), 131212#(<= main_~i~0 34), 131213#(<= main_~i~0 35), 131218#(<= main_~i~0 40), 131219#(<= main_~i~0 41), 131216#(<= main_~i~0 38), 131217#(<= main_~i~0 39), 131222#(<= main_~i~0 44), 131223#(<= main_~i~0 45), 131220#(<= main_~i~0 42), 131221#(<= main_~i~0 43), 131226#(<= main_~i~0 48), 131227#(<= main_~i~0 49), 131224#(<= main_~i~0 46), 131225#(<= main_~i~0 47), 131230#(<= main_~i~0 52), 131231#(<= main_~i~0 53), 131228#(<= main_~i~0 50), 131229#(<= main_~i~0 51), 131234#(<= main_~i~0 56), 131235#(<= main_~i~0 57), 131232#(<= main_~i~0 54), 131233#(<= main_~i~0 55), 131238#(<= main_~i~0 60), 131239#(<= main_~i~0 61), 131236#(<= main_~i~0 58), 131237#(<= main_~i~0 59), 131242#(<= main_~i~0 64), 131243#(<= main_~i~0 65), 131240#(<= main_~i~0 62), 131241#(<= main_~i~0 63), 131246#(<= main_~i~0 68), 131247#(<= main_~i~0 69), 131244#(<= main_~i~0 66), 131245#(<= main_~i~0 67), 131250#(<= main_~i~0 72), 131251#(<= main_~i~0 73), 131248#(<= main_~i~0 70), 131249#(<= main_~i~0 71), 131254#(<= main_~i~0 76), 131255#(<= main_~i~0 77), 131252#(<= main_~i~0 74), 131253#(<= main_~i~0 75), 131258#(<= main_~i~0 80), 131259#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 131256#(<= main_~i~0 78), 131257#(<= main_~i~0 79), 131262#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 131263#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 131260#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 131261#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 131266#(and (<= 7 main_~i~0) (<= main_~i~0 87)), 131267#(and (<= 8 main_~i~0) (<= main_~i~0 88)), 131264#(and (<= 5 main_~i~0) (<= main_~i~0 85)), 131265#(and (<= main_~i~0 86) (<= 6 main_~i~0)), 131178#(<= main_~i~0 0), 131179#(<= main_~i~0 1), 131176#true, 131177#false, 131182#(<= main_~i~0 4), 131183#(<= main_~i~0 5), 131180#(<= main_~i~0 2), 131181#(<= main_~i~0 3), 131186#(<= main_~i~0 8), 131187#(<= main_~i~0 9), 131184#(<= main_~i~0 6), 131185#(<= main_~i~0 7), 131190#(<= main_~i~0 12), 131191#(<= main_~i~0 13), 131188#(<= main_~i~0 10), 131189#(<= main_~i~0 11), 131194#(<= main_~i~0 16), 131195#(<= main_~i~0 17), 131192#(<= main_~i~0 14), 131193#(<= main_~i~0 15), 131198#(<= main_~i~0 20), 131199#(<= main_~i~0 21), 131196#(<= main_~i~0 18), 131197#(<= main_~i~0 19)] [2018-04-12 02:57:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 19404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:11,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-12 02:57:11,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-12 02:57:11,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3422, Invalid=4950, Unknown=0, NotChecked=0, Total=8372 [2018-04-12 02:57:11,569 INFO L87 Difference]: Start difference. First operand 1264 states and 1706 transitions. Second operand 92 states. [2018-04-12 02:57:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:17,990 INFO L93 Difference]: Finished difference Result 1371 states and 1820 transitions. [2018-04-12 02:57:17,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-12 02:57:17,990 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 448 [2018-04-12 02:57:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:17,991 INFO L225 Difference]: With dead ends: 1371 [2018-04-12 02:57:17,991 INFO L226 Difference]: Without dead ends: 1371 [2018-04-12 02:57:17,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=10807, Invalid=21413, Unknown=0, NotChecked=0, Total=32220 [2018-04-12 02:57:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-04-12 02:57:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1278. [2018-04-12 02:57:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2018-04-12 02:57:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1725 transitions. [2018-04-12 02:57:17,998 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1725 transitions. Word has length 448 [2018-04-12 02:57:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:17,998 INFO L459 AbstractCegarLoop]: Abstraction has 1278 states and 1725 transitions. [2018-04-12 02:57:17,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-12 02:57:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1725 transitions. [2018-04-12 02:57:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-04-12 02:57:18,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:18,000 INFO L355 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:18,000 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:18,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1133610794, now seen corresponding path program 89 times [2018-04-12 02:57:18,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:18,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:57:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19847 backedges. 0 proven. 19847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:20,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:57:20,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-12 02:57:20,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:57:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:20,437 INFO L182 omatonBuilderFactory]: Interpolants [134146#(<= main_~i~0 51), 134147#(<= main_~i~0 52), 134144#(<= main_~i~0 49), 134145#(<= main_~i~0 50), 134150#(<= main_~i~0 55), 134151#(<= main_~i~0 56), 134148#(<= main_~i~0 53), 134149#(<= main_~i~0 54), 134154#(<= main_~i~0 59), 134155#(<= main_~i~0 60), 134152#(<= main_~i~0 57), 134153#(<= main_~i~0 58), 134158#(<= main_~i~0 63), 134159#(<= main_~i~0 64), 134156#(<= main_~i~0 61), 134157#(<= main_~i~0 62), 134162#(<= main_~i~0 67), 134163#(<= main_~i~0 68), 134160#(<= main_~i~0 65), 134161#(<= main_~i~0 66), 134166#(<= main_~i~0 71), 134167#(<= main_~i~0 72), 134164#(<= main_~i~0 69), 134165#(<= main_~i~0 70), 134170#(<= main_~i~0 75), 134171#(<= main_~i~0 76), 134168#(<= main_~i~0 73), 134169#(<= main_~i~0 74), 134174#(<= main_~i~0 79), 134175#(<= main_~i~0 80), 134172#(<= main_~i~0 77), 134173#(<= main_~i~0 78), 134178#(<= main_~i~0 83), 134179#(<= main_~i~0 84), 134176#(<= main_~i~0 81), 134177#(<= main_~i~0 82), 134182#(<= main_~i~0 87), 134183#(<= main_~i~0 88), 134180#(<= main_~i~0 85), 134181#(<= main_~i~0 86), 134184#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 134185#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 134094#false, 134095#(<= main_~i~0 0), 134093#true, 134098#(<= main_~i~0 3), 134099#(<= main_~i~0 4), 134096#(<= main_~i~0 1), 134097#(<= main_~i~0 2), 134102#(<= main_~i~0 7), 134103#(<= main_~i~0 8), 134100#(<= main_~i~0 5), 134101#(<= main_~i~0 6), 134106#(<= main_~i~0 11), 134107#(<= main_~i~0 12), 134104#(<= main_~i~0 9), 134105#(<= main_~i~0 10), 134110#(<= main_~i~0 15), 134111#(<= main_~i~0 16), 134108#(<= main_~i~0 13), 134109#(<= main_~i~0 14), 134114#(<= main_~i~0 19), 134115#(<= main_~i~0 20), 134112#(<= main_~i~0 17), 134113#(<= main_~i~0 18), 134118#(<= main_~i~0 23), 134119#(<= main_~i~0 24), 134116#(<= main_~i~0 21), 134117#(<= main_~i~0 22), 134122#(<= main_~i~0 27), 134123#(<= main_~i~0 28), 134120#(<= main_~i~0 25), 134121#(<= main_~i~0 26), 134126#(<= main_~i~0 31), 134127#(<= main_~i~0 32), 134124#(<= main_~i~0 29), 134125#(<= main_~i~0 30), 134130#(<= main_~i~0 35), 134131#(<= main_~i~0 36), 134128#(<= main_~i~0 33), 134129#(<= main_~i~0 34), 134134#(<= main_~i~0 39), 134135#(<= main_~i~0 40), 134132#(<= main_~i~0 37), 134133#(<= main_~i~0 38), 134138#(<= main_~i~0 43), 134139#(<= main_~i~0 44), 134136#(<= main_~i~0 41), 134137#(<= main_~i~0 42), 134142#(<= main_~i~0 47), 134143#(<= main_~i~0 48), 134140#(<= main_~i~0 45), 134141#(<= main_~i~0 46)] [2018-04-12 02:57:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19847 backedges. 0 proven. 19847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:20,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-12 02:57:20,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-12 02:57:20,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4100, Invalid=4456, Unknown=0, NotChecked=0, Total=8556 [2018-04-12 02:57:20,438 INFO L87 Difference]: Start difference. First operand 1278 states and 1725 transitions. Second operand 93 states. [2018-04-12 02:57:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:25,593 INFO L93 Difference]: Finished difference Result 1386 states and 1840 transitions. [2018-04-12 02:57:25,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-12 02:57:25,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 453 [2018-04-12 02:57:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:25,594 INFO L225 Difference]: With dead ends: 1386 [2018-04-12 02:57:25,594 INFO L226 Difference]: Without dead ends: 1386 [2018-04-12 02:57:25,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=12288, Invalid=20654, Unknown=0, NotChecked=0, Total=32942 [2018-04-12 02:57:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-04-12 02:57:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1292. [2018-04-12 02:57:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2018-04-12 02:57:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1744 transitions. [2018-04-12 02:57:25,601 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1744 transitions. Word has length 453 [2018-04-12 02:57:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:25,601 INFO L459 AbstractCegarLoop]: Abstraction has 1292 states and 1744 transitions. [2018-04-12 02:57:25,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-12 02:57:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1744 transitions. [2018-04-12 02:57:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-04-12 02:57:25,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:25,603 INFO L355 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:25,603 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash 248208349, now seen corresponding path program 90 times [2018-04-12 02:57:25,603 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:25,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:57:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20295 backedges. 0 proven. 20295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:28,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:57:28,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-12 02:57:28,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:57:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:28,080 INFO L182 omatonBuilderFactory]: Interpolants [137090#(<= main_~i~0 46), 137091#(<= main_~i~0 47), 137088#(<= main_~i~0 44), 137089#(<= main_~i~0 45), 137094#(<= main_~i~0 50), 137095#(<= main_~i~0 51), 137092#(<= main_~i~0 48), 137093#(<= main_~i~0 49), 137098#(<= main_~i~0 54), 137099#(<= main_~i~0 55), 137096#(<= main_~i~0 52), 137097#(<= main_~i~0 53), 137102#(<= main_~i~0 58), 137103#(<= main_~i~0 59), 137100#(<= main_~i~0 56), 137101#(<= main_~i~0 57), 137106#(<= main_~i~0 62), 137107#(<= main_~i~0 63), 137104#(<= main_~i~0 60), 137105#(<= main_~i~0 61), 137110#(<= main_~i~0 66), 137111#(<= main_~i~0 67), 137108#(<= main_~i~0 64), 137109#(<= main_~i~0 65), 137114#(<= main_~i~0 70), 137115#(<= main_~i~0 71), 137112#(<= main_~i~0 68), 137113#(<= main_~i~0 69), 137118#(<= main_~i~0 74), 137119#(<= main_~i~0 75), 137116#(<= main_~i~0 72), 137117#(<= main_~i~0 73), 137122#(<= main_~i~0 78), 137123#(<= main_~i~0 79), 137120#(<= main_~i~0 76), 137121#(<= main_~i~0 77), 137126#(<= main_~i~0 82), 137127#(<= main_~i~0 83), 137124#(<= main_~i~0 80), 137125#(<= main_~i~0 81), 137130#(<= main_~i~0 86), 137131#(<= main_~i~0 87), 137128#(<= main_~i~0 84), 137129#(<= main_~i~0 85), 137134#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 137135#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 137132#(<= main_~i~0 88), 137133#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 137042#true, 137043#false, 137046#(<= main_~i~0 2), 137047#(<= main_~i~0 3), 137044#(<= main_~i~0 0), 137045#(<= main_~i~0 1), 137050#(<= main_~i~0 6), 137051#(<= main_~i~0 7), 137048#(<= main_~i~0 4), 137049#(<= main_~i~0 5), 137054#(<= main_~i~0 10), 137055#(<= main_~i~0 11), 137052#(<= main_~i~0 8), 137053#(<= main_~i~0 9), 137058#(<= main_~i~0 14), 137059#(<= main_~i~0 15), 137056#(<= main_~i~0 12), 137057#(<= main_~i~0 13), 137062#(<= main_~i~0 18), 137063#(<= main_~i~0 19), 137060#(<= main_~i~0 16), 137061#(<= main_~i~0 17), 137066#(<= main_~i~0 22), 137067#(<= main_~i~0 23), 137064#(<= main_~i~0 20), 137065#(<= main_~i~0 21), 137070#(<= main_~i~0 26), 137071#(<= main_~i~0 27), 137068#(<= main_~i~0 24), 137069#(<= main_~i~0 25), 137074#(<= main_~i~0 30), 137075#(<= main_~i~0 31), 137072#(<= main_~i~0 28), 137073#(<= main_~i~0 29), 137078#(<= main_~i~0 34), 137079#(<= main_~i~0 35), 137076#(<= main_~i~0 32), 137077#(<= main_~i~0 33), 137082#(<= main_~i~0 38), 137083#(<= main_~i~0 39), 137080#(<= main_~i~0 36), 137081#(<= main_~i~0 37), 137086#(<= main_~i~0 42), 137087#(<= main_~i~0 43), 137084#(<= main_~i~0 40), 137085#(<= main_~i~0 41)] [2018-04-12 02:57:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20295 backedges. 0 proven. 20295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:28,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-12 02:57:28,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-12 02:57:28,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4102, Invalid=4640, Unknown=0, NotChecked=0, Total=8742 [2018-04-12 02:57:28,082 INFO L87 Difference]: Start difference. First operand 1292 states and 1744 transitions. Second operand 94 states. [2018-04-12 02:57:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:33,487 INFO L93 Difference]: Finished difference Result 1401 states and 1860 transitions. [2018-04-12 02:57:33,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-12 02:57:33,487 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 458 [2018-04-12 02:57:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:33,489 INFO L225 Difference]: With dead ends: 1401 [2018-04-12 02:57:33,489 INFO L226 Difference]: Without dead ends: 1401 [2018-04-12 02:57:33,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4272 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=12381, Invalid=21291, Unknown=0, NotChecked=0, Total=33672 [2018-04-12 02:57:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-04-12 02:57:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1306. [2018-04-12 02:57:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2018-04-12 02:57:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1763 transitions. [2018-04-12 02:57:33,498 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1763 transitions. Word has length 458 [2018-04-12 02:57:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:33,498 INFO L459 AbstractCegarLoop]: Abstraction has 1306 states and 1763 transitions. [2018-04-12 02:57:33,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-12 02:57:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1763 transitions. [2018-04-12 02:57:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-04-12 02:57:33,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:33,500 INFO L355 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:33,500 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1039549750, now seen corresponding path program 91 times [2018-04-12 02:57:33,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:33,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:57:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20748 backedges. 0 proven. 20748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:36,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:57:36,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-12 02:57:36,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:57:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:36,041 INFO L182 omatonBuilderFactory]: Interpolants [140034#(<= main_~i~0 9), 140035#(<= main_~i~0 10), 140032#(<= main_~i~0 7), 140033#(<= main_~i~0 8), 140038#(<= main_~i~0 13), 140039#(<= main_~i~0 14), 140036#(<= main_~i~0 11), 140037#(<= main_~i~0 12), 140042#(<= main_~i~0 17), 140043#(<= main_~i~0 18), 140040#(<= main_~i~0 15), 140041#(<= main_~i~0 16), 140046#(<= main_~i~0 21), 140047#(<= main_~i~0 22), 140044#(<= main_~i~0 19), 140045#(<= main_~i~0 20), 140050#(<= main_~i~0 25), 140051#(<= main_~i~0 26), 140048#(<= main_~i~0 23), 140049#(<= main_~i~0 24), 140054#(<= main_~i~0 29), 140055#(<= main_~i~0 30), 140052#(<= main_~i~0 27), 140053#(<= main_~i~0 28), 140058#(<= main_~i~0 33), 140059#(<= main_~i~0 34), 140056#(<= main_~i~0 31), 140057#(<= main_~i~0 32), 140062#(<= main_~i~0 37), 140063#(<= main_~i~0 38), 140060#(<= main_~i~0 35), 140061#(<= main_~i~0 36), 140066#(<= main_~i~0 41), 140067#(<= main_~i~0 42), 140064#(<= main_~i~0 39), 140065#(<= main_~i~0 40), 140070#(<= main_~i~0 45), 140071#(<= main_~i~0 46), 140068#(<= main_~i~0 43), 140069#(<= main_~i~0 44), 140074#(<= main_~i~0 49), 140075#(<= main_~i~0 50), 140072#(<= main_~i~0 47), 140073#(<= main_~i~0 48), 140078#(<= main_~i~0 53), 140079#(<= main_~i~0 54), 140076#(<= main_~i~0 51), 140077#(<= main_~i~0 52), 140082#(<= main_~i~0 57), 140083#(<= main_~i~0 58), 140080#(<= main_~i~0 55), 140081#(<= main_~i~0 56), 140086#(<= main_~i~0 61), 140087#(<= main_~i~0 62), 140084#(<= main_~i~0 59), 140085#(<= main_~i~0 60), 140090#(<= main_~i~0 65), 140091#(<= main_~i~0 66), 140088#(<= main_~i~0 63), 140089#(<= main_~i~0 64), 140094#(<= main_~i~0 69), 140095#(<= main_~i~0 70), 140092#(<= main_~i~0 67), 140093#(<= main_~i~0 68), 140098#(<= main_~i~0 73), 140099#(<= main_~i~0 74), 140096#(<= main_~i~0 71), 140097#(<= main_~i~0 72), 140102#(<= main_~i~0 77), 140103#(<= main_~i~0 78), 140100#(<= main_~i~0 75), 140101#(<= main_~i~0 76), 140106#(<= main_~i~0 81), 140107#(<= main_~i~0 82), 140104#(<= main_~i~0 79), 140105#(<= main_~i~0 80), 140110#(<= main_~i~0 85), 140111#(<= main_~i~0 86), 140108#(<= main_~i~0 83), 140109#(<= main_~i~0 84), 140114#(<= main_~i~0 89), 140115#(<= main_~i~0 90), 140112#(<= main_~i~0 87), 140113#(<= main_~i~0 88), 140116#(and (<= 0 main_~i~0) (<= main_~i~0 90)), 140117#(and (<= main_~i~0 91) (<= 1 main_~i~0)), 140023#true, 140026#(<= main_~i~0 1), 140027#(<= main_~i~0 2), 140024#false, 140025#(<= main_~i~0 0), 140030#(<= main_~i~0 5), 140031#(<= main_~i~0 6), 140028#(<= main_~i~0 3), 140029#(<= main_~i~0 4)] [2018-04-12 02:57:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20748 backedges. 0 proven. 20748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:36,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-12 02:57:36,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-12 02:57:36,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4283, Invalid=4647, Unknown=0, NotChecked=0, Total=8930 [2018-04-12 02:57:36,042 INFO L87 Difference]: Start difference. First operand 1306 states and 1763 transitions. Second operand 95 states. [2018-04-12 02:57:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:41,700 INFO L93 Difference]: Finished difference Result 1416 states and 1880 transitions. [2018-04-12 02:57:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-12 02:57:41,700 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 463 [2018-04-12 02:57:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:41,701 INFO L225 Difference]: With dead ends: 1416 [2018-04-12 02:57:41,701 INFO L226 Difference]: Without dead ends: 1416 [2018-04-12 02:57:41,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=12837, Invalid=21573, Unknown=0, NotChecked=0, Total=34410 [2018-04-12 02:57:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2018-04-12 02:57:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1320. [2018-04-12 02:57:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-04-12 02:57:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1782 transitions. [2018-04-12 02:57:41,709 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1782 transitions. Word has length 463 [2018-04-12 02:57:41,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:41,710 INFO L459 AbstractCegarLoop]: Abstraction has 1320 states and 1782 transitions. [2018-04-12 02:57:41,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-12 02:57:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1782 transitions. [2018-04-12 02:57:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-04-12 02:57:41,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:41,712 INFO L355 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:41,712 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:41,712 INFO L82 PathProgramCache]: Analyzing trace with hash 705973117, now seen corresponding path program 92 times [2018-04-12 02:57:41,712 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:41,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:57:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21206 backedges. 0 proven. 21206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:44,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:57:44,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-04-12 02:57:44,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:57:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:44,321 INFO L182 omatonBuilderFactory]: Interpolants [143106#(<= main_~i~0 68), 143107#(<= main_~i~0 69), 143104#(<= main_~i~0 66), 143105#(<= main_~i~0 67), 143110#(<= main_~i~0 72), 143111#(<= main_~i~0 73), 143108#(<= main_~i~0 70), 143109#(<= main_~i~0 71), 143114#(<= main_~i~0 76), 143115#(<= main_~i~0 77), 143112#(<= main_~i~0 74), 143113#(<= main_~i~0 75), 143118#(<= main_~i~0 80), 143119#(<= main_~i~0 81), 143116#(<= main_~i~0 78), 143117#(<= main_~i~0 79), 143122#(<= main_~i~0 84), 143123#(<= main_~i~0 85), 143120#(<= main_~i~0 82), 143121#(<= main_~i~0 83), 143126#(<= main_~i~0 88), 143127#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 143124#(<= main_~i~0 86), 143125#(<= main_~i~0 87), 143130#(and (<= main_~i~0 91) (<= 3 main_~i~0)), 143131#(and (<= 4 main_~i~0) (<= main_~i~0 92)), 143128#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 143129#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 143038#(<= main_~i~0 0), 143039#(<= main_~i~0 1), 143036#true, 143037#false, 143042#(<= main_~i~0 4), 143043#(<= main_~i~0 5), 143040#(<= main_~i~0 2), 143041#(<= main_~i~0 3), 143046#(<= main_~i~0 8), 143047#(<= main_~i~0 9), 143044#(<= main_~i~0 6), 143045#(<= main_~i~0 7), 143050#(<= main_~i~0 12), 143051#(<= main_~i~0 13), 143048#(<= main_~i~0 10), 143049#(<= main_~i~0 11), 143054#(<= main_~i~0 16), 143055#(<= main_~i~0 17), 143052#(<= main_~i~0 14), 143053#(<= main_~i~0 15), 143058#(<= main_~i~0 20), 143059#(<= main_~i~0 21), 143056#(<= main_~i~0 18), 143057#(<= main_~i~0 19), 143062#(<= main_~i~0 24), 143063#(<= main_~i~0 25), 143060#(<= main_~i~0 22), 143061#(<= main_~i~0 23), 143066#(<= main_~i~0 28), 143067#(<= main_~i~0 29), 143064#(<= main_~i~0 26), 143065#(<= main_~i~0 27), 143070#(<= main_~i~0 32), 143071#(<= main_~i~0 33), 143068#(<= main_~i~0 30), 143069#(<= main_~i~0 31), 143074#(<= main_~i~0 36), 143075#(<= main_~i~0 37), 143072#(<= main_~i~0 34), 143073#(<= main_~i~0 35), 143078#(<= main_~i~0 40), 143079#(<= main_~i~0 41), 143076#(<= main_~i~0 38), 143077#(<= main_~i~0 39), 143082#(<= main_~i~0 44), 143083#(<= main_~i~0 45), 143080#(<= main_~i~0 42), 143081#(<= main_~i~0 43), 143086#(<= main_~i~0 48), 143087#(<= main_~i~0 49), 143084#(<= main_~i~0 46), 143085#(<= main_~i~0 47), 143090#(<= main_~i~0 52), 143091#(<= main_~i~0 53), 143088#(<= main_~i~0 50), 143089#(<= main_~i~0 51), 143094#(<= main_~i~0 56), 143095#(<= main_~i~0 57), 143092#(<= main_~i~0 54), 143093#(<= main_~i~0 55), 143098#(<= main_~i~0 60), 143099#(<= main_~i~0 61), 143096#(<= main_~i~0 58), 143097#(<= main_~i~0 59), 143102#(<= main_~i~0 64), 143103#(<= main_~i~0 65), 143100#(<= main_~i~0 62), 143101#(<= main_~i~0 63)] [2018-04-12 02:57:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21206 backedges. 0 proven. 21206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:44,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-12 02:57:44,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-12 02:57:44,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4106, Invalid=5014, Unknown=0, NotChecked=0, Total=9120 [2018-04-12 02:57:44,323 INFO L87 Difference]: Start difference. First operand 1320 states and 1782 transitions. Second operand 96 states. [2018-04-12 02:57:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:50,630 INFO L93 Difference]: Finished difference Result 1431 states and 1900 transitions. [2018-04-12 02:57:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-12 02:57:50,630 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 468 [2018-04-12 02:57:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:50,631 INFO L225 Difference]: With dead ends: 1431 [2018-04-12 02:57:50,631 INFO L226 Difference]: Without dead ends: 1431 [2018-04-12 02:57:50,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4633 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=12567, Invalid=22589, Unknown=0, NotChecked=0, Total=35156 [2018-04-12 02:57:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2018-04-12 02:57:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1334. [2018-04-12 02:57:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2018-04-12 02:57:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1801 transitions. [2018-04-12 02:57:50,640 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1801 transitions. Word has length 468 [2018-04-12 02:57:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:50,640 INFO L459 AbstractCegarLoop]: Abstraction has 1334 states and 1801 transitions. [2018-04-12 02:57:50,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-12 02:57:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1801 transitions. [2018-04-12 02:57:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-04-12 02:57:50,642 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:50,643 INFO L355 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:50,643 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash -688776810, now seen corresponding path program 93 times [2018-04-12 02:57:50,643 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:50,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:57:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21669 backedges. 0 proven. 21669 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:53,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:57:53,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-12 02:57:53,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:57:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:53,314 INFO L182 omatonBuilderFactory]: Interpolants [146176#(and (<= 0 main_~i~0) (<= main_~i~0 92)), 146177#(and (<= 1 main_~i~0) (<= main_~i~0 93)), 146082#false, 146083#(<= main_~i~0 0), 146081#true, 146086#(<= main_~i~0 3), 146087#(<= main_~i~0 4), 146084#(<= main_~i~0 1), 146085#(<= main_~i~0 2), 146090#(<= main_~i~0 7), 146091#(<= main_~i~0 8), 146088#(<= main_~i~0 5), 146089#(<= main_~i~0 6), 146094#(<= main_~i~0 11), 146095#(<= main_~i~0 12), 146092#(<= main_~i~0 9), 146093#(<= main_~i~0 10), 146098#(<= main_~i~0 15), 146099#(<= main_~i~0 16), 146096#(<= main_~i~0 13), 146097#(<= main_~i~0 14), 146102#(<= main_~i~0 19), 146103#(<= main_~i~0 20), 146100#(<= main_~i~0 17), 146101#(<= main_~i~0 18), 146106#(<= main_~i~0 23), 146107#(<= main_~i~0 24), 146104#(<= main_~i~0 21), 146105#(<= main_~i~0 22), 146110#(<= main_~i~0 27), 146111#(<= main_~i~0 28), 146108#(<= main_~i~0 25), 146109#(<= main_~i~0 26), 146114#(<= main_~i~0 31), 146115#(<= main_~i~0 32), 146112#(<= main_~i~0 29), 146113#(<= main_~i~0 30), 146118#(<= main_~i~0 35), 146119#(<= main_~i~0 36), 146116#(<= main_~i~0 33), 146117#(<= main_~i~0 34), 146122#(<= main_~i~0 39), 146123#(<= main_~i~0 40), 146120#(<= main_~i~0 37), 146121#(<= main_~i~0 38), 146126#(<= main_~i~0 43), 146127#(<= main_~i~0 44), 146124#(<= main_~i~0 41), 146125#(<= main_~i~0 42), 146130#(<= main_~i~0 47), 146131#(<= main_~i~0 48), 146128#(<= main_~i~0 45), 146129#(<= main_~i~0 46), 146134#(<= main_~i~0 51), 146135#(<= main_~i~0 52), 146132#(<= main_~i~0 49), 146133#(<= main_~i~0 50), 146138#(<= main_~i~0 55), 146139#(<= main_~i~0 56), 146136#(<= main_~i~0 53), 146137#(<= main_~i~0 54), 146142#(<= main_~i~0 59), 146143#(<= main_~i~0 60), 146140#(<= main_~i~0 57), 146141#(<= main_~i~0 58), 146146#(<= main_~i~0 63), 146147#(<= main_~i~0 64), 146144#(<= main_~i~0 61), 146145#(<= main_~i~0 62), 146150#(<= main_~i~0 67), 146151#(<= main_~i~0 68), 146148#(<= main_~i~0 65), 146149#(<= main_~i~0 66), 146154#(<= main_~i~0 71), 146155#(<= main_~i~0 72), 146152#(<= main_~i~0 69), 146153#(<= main_~i~0 70), 146158#(<= main_~i~0 75), 146159#(<= main_~i~0 76), 146156#(<= main_~i~0 73), 146157#(<= main_~i~0 74), 146162#(<= main_~i~0 79), 146163#(<= main_~i~0 80), 146160#(<= main_~i~0 77), 146161#(<= main_~i~0 78), 146166#(<= main_~i~0 83), 146167#(<= main_~i~0 84), 146164#(<= main_~i~0 81), 146165#(<= main_~i~0 82), 146170#(<= main_~i~0 87), 146171#(<= main_~i~0 88), 146168#(<= main_~i~0 85), 146169#(<= main_~i~0 86), 146174#(<= main_~i~0 91), 146175#(<= main_~i~0 92), 146172#(<= main_~i~0 89), 146173#(<= main_~i~0 90)] [2018-04-12 02:57:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21669 backedges. 0 proven. 21669 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:57:53,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-12 02:57:53,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-12 02:57:53,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4470, Invalid=4842, Unknown=0, NotChecked=0, Total=9312 [2018-04-12 02:57:53,316 INFO L87 Difference]: Start difference. First operand 1334 states and 1801 transitions. Second operand 97 states. [2018-04-12 02:57:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:57:59,482 INFO L93 Difference]: Finished difference Result 1446 states and 1920 transitions. [2018-04-12 02:57:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-12 02:57:59,483 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 473 [2018-04-12 02:57:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:57:59,484 INFO L225 Difference]: With dead ends: 1446 [2018-04-12 02:57:59,484 INFO L226 Difference]: Without dead ends: 1446 [2018-04-12 02:57:59,485 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=13398, Invalid=22512, Unknown=0, NotChecked=0, Total=35910 [2018-04-12 02:57:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2018-04-12 02:57:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1348. [2018-04-12 02:57:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-04-12 02:57:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1820 transitions. [2018-04-12 02:57:59,491 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1820 transitions. Word has length 473 [2018-04-12 02:57:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:57:59,492 INFO L459 AbstractCegarLoop]: Abstraction has 1348 states and 1820 transitions. [2018-04-12 02:57:59,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-12 02:57:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1820 transitions. [2018-04-12 02:57:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-04-12 02:57:59,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:57:59,494 INFO L355 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-04-12 02:57:59,494 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:57:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1563308829, now seen corresponding path program 94 times [2018-04-12 02:57:59,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:57:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:57:59,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:58:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:02,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:58:02,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-12 02:58:02,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:58:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:02,470 INFO L182 omatonBuilderFactory]: Interpolants [149250#(<= main_~i~0 90), 149251#(<= main_~i~0 91), 149248#(<= main_~i~0 88), 149249#(<= main_~i~0 89), 149254#(and (<= 1 main_~i~0) (<= main_~i~0 93)), 149255#(and (<= 2 main_~i~0) (<= main_~i~0 94)), 149252#(<= main_~i~0 92), 149253#(and (<= 0 main_~i~0) (<= main_~i~0 92)), 149158#true, 149159#false, 149162#(<= main_~i~0 2), 149163#(<= main_~i~0 3), 149160#(<= main_~i~0 0), 149161#(<= main_~i~0 1), 149166#(<= main_~i~0 6), 149167#(<= main_~i~0 7), 149164#(<= main_~i~0 4), 149165#(<= main_~i~0 5), 149170#(<= main_~i~0 10), 149171#(<= main_~i~0 11), 149168#(<= main_~i~0 8), 149169#(<= main_~i~0 9), 149174#(<= main_~i~0 14), 149175#(<= main_~i~0 15), 149172#(<= main_~i~0 12), 149173#(<= main_~i~0 13), 149178#(<= main_~i~0 18), 149179#(<= main_~i~0 19), 149176#(<= main_~i~0 16), 149177#(<= main_~i~0 17), 149182#(<= main_~i~0 22), 149183#(<= main_~i~0 23), 149180#(<= main_~i~0 20), 149181#(<= main_~i~0 21), 149186#(<= main_~i~0 26), 149187#(<= main_~i~0 27), 149184#(<= main_~i~0 24), 149185#(<= main_~i~0 25), 149190#(<= main_~i~0 30), 149191#(<= main_~i~0 31), 149188#(<= main_~i~0 28), 149189#(<= main_~i~0 29), 149194#(<= main_~i~0 34), 149195#(<= main_~i~0 35), 149192#(<= main_~i~0 32), 149193#(<= main_~i~0 33), 149198#(<= main_~i~0 38), 149199#(<= main_~i~0 39), 149196#(<= main_~i~0 36), 149197#(<= main_~i~0 37), 149202#(<= main_~i~0 42), 149203#(<= main_~i~0 43), 149200#(<= main_~i~0 40), 149201#(<= main_~i~0 41), 149206#(<= main_~i~0 46), 149207#(<= main_~i~0 47), 149204#(<= main_~i~0 44), 149205#(<= main_~i~0 45), 149210#(<= main_~i~0 50), 149211#(<= main_~i~0 51), 149208#(<= main_~i~0 48), 149209#(<= main_~i~0 49), 149214#(<= main_~i~0 54), 149215#(<= main_~i~0 55), 149212#(<= main_~i~0 52), 149213#(<= main_~i~0 53), 149218#(<= main_~i~0 58), 149219#(<= main_~i~0 59), 149216#(<= main_~i~0 56), 149217#(<= main_~i~0 57), 149222#(<= main_~i~0 62), 149223#(<= main_~i~0 63), 149220#(<= main_~i~0 60), 149221#(<= main_~i~0 61), 149226#(<= main_~i~0 66), 149227#(<= main_~i~0 67), 149224#(<= main_~i~0 64), 149225#(<= main_~i~0 65), 149230#(<= main_~i~0 70), 149231#(<= main_~i~0 71), 149228#(<= main_~i~0 68), 149229#(<= main_~i~0 69), 149234#(<= main_~i~0 74), 149235#(<= main_~i~0 75), 149232#(<= main_~i~0 72), 149233#(<= main_~i~0 73), 149238#(<= main_~i~0 78), 149239#(<= main_~i~0 79), 149236#(<= main_~i~0 76), 149237#(<= main_~i~0 77), 149242#(<= main_~i~0 82), 149243#(<= main_~i~0 83), 149240#(<= main_~i~0 80), 149241#(<= main_~i~0 81), 149246#(<= main_~i~0 86), 149247#(<= main_~i~0 87), 149244#(<= main_~i~0 84), 149245#(<= main_~i~0 85)] [2018-04-12 02:58:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:02,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-12 02:58:02,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-12 02:58:02,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4472, Invalid=5034, Unknown=0, NotChecked=0, Total=9506 [2018-04-12 02:58:02,472 INFO L87 Difference]: Start difference. First operand 1348 states and 1820 transitions. Second operand 98 states. [2018-04-12 02:58:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:58:08,959 INFO L93 Difference]: Finished difference Result 1461 states and 1940 transitions. [2018-04-12 02:58:08,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-12 02:58:08,960 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 478 [2018-04-12 02:58:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:58:08,961 INFO L225 Difference]: With dead ends: 1461 [2018-04-12 02:58:08,961 INFO L226 Difference]: Without dead ends: 1461 [2018-04-12 02:58:08,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4650 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=13495, Invalid=23177, Unknown=0, NotChecked=0, Total=36672 [2018-04-12 02:58:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2018-04-12 02:58:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1362. [2018-04-12 02:58:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-04-12 02:58:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1839 transitions. [2018-04-12 02:58:08,970 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1839 transitions. Word has length 478 [2018-04-12 02:58:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:58:08,970 INFO L459 AbstractCegarLoop]: Abstraction has 1362 states and 1839 transitions. [2018-04-12 02:58:08,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-12 02:58:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1839 transitions. [2018-04-12 02:58:08,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-04-12 02:58:08,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:58:08,973 INFO L355 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-04-12 02:58:08,973 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:58:08,973 INFO L82 PathProgramCache]: Analyzing trace with hash -336071178, now seen corresponding path program 95 times [2018-04-12 02:58:08,974 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:58:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:58:09,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:58:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 22610 backedges. 0 proven. 22610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:11,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:58:11,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-12 02:58:11,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:58:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:11,740 INFO L182 omatonBuilderFactory]: Interpolants [152322#(<= main_~i~0 53), 152323#(<= main_~i~0 54), 152320#(<= main_~i~0 51), 152321#(<= main_~i~0 52), 152326#(<= main_~i~0 57), 152327#(<= main_~i~0 58), 152324#(<= main_~i~0 55), 152325#(<= main_~i~0 56), 152330#(<= main_~i~0 61), 152331#(<= main_~i~0 62), 152328#(<= main_~i~0 59), 152329#(<= main_~i~0 60), 152334#(<= main_~i~0 65), 152335#(<= main_~i~0 66), 152332#(<= main_~i~0 63), 152333#(<= main_~i~0 64), 152338#(<= main_~i~0 69), 152339#(<= main_~i~0 70), 152336#(<= main_~i~0 67), 152337#(<= main_~i~0 68), 152342#(<= main_~i~0 73), 152343#(<= main_~i~0 74), 152340#(<= main_~i~0 71), 152341#(<= main_~i~0 72), 152346#(<= main_~i~0 77), 152347#(<= main_~i~0 78), 152344#(<= main_~i~0 75), 152345#(<= main_~i~0 76), 152350#(<= main_~i~0 81), 152351#(<= main_~i~0 82), 152348#(<= main_~i~0 79), 152349#(<= main_~i~0 80), 152354#(<= main_~i~0 85), 152355#(<= main_~i~0 86), 152352#(<= main_~i~0 83), 152353#(<= main_~i~0 84), 152358#(<= main_~i~0 89), 152359#(<= main_~i~0 90), 152356#(<= main_~i~0 87), 152357#(<= main_~i~0 88), 152362#(<= main_~i~0 93), 152363#(<= main_~i~0 94), 152360#(<= main_~i~0 91), 152361#(<= main_~i~0 92), 152364#(and (<= 0 main_~i~0) (<= main_~i~0 94)), 152365#(and (<= 1 main_~i~0) (<= main_~i~0 95)), 152267#true, 152270#(<= main_~i~0 1), 152271#(<= main_~i~0 2), 152268#false, 152269#(<= main_~i~0 0), 152274#(<= main_~i~0 5), 152275#(<= main_~i~0 6), 152272#(<= main_~i~0 3), 152273#(<= main_~i~0 4), 152278#(<= main_~i~0 9), 152279#(<= main_~i~0 10), 152276#(<= main_~i~0 7), 152277#(<= main_~i~0 8), 152282#(<= main_~i~0 13), 152283#(<= main_~i~0 14), 152280#(<= main_~i~0 11), 152281#(<= main_~i~0 12), 152286#(<= main_~i~0 17), 152287#(<= main_~i~0 18), 152284#(<= main_~i~0 15), 152285#(<= main_~i~0 16), 152290#(<= main_~i~0 21), 152291#(<= main_~i~0 22), 152288#(<= main_~i~0 19), 152289#(<= main_~i~0 20), 152294#(<= main_~i~0 25), 152295#(<= main_~i~0 26), 152292#(<= main_~i~0 23), 152293#(<= main_~i~0 24), 152298#(<= main_~i~0 29), 152299#(<= main_~i~0 30), 152296#(<= main_~i~0 27), 152297#(<= main_~i~0 28), 152302#(<= main_~i~0 33), 152303#(<= main_~i~0 34), 152300#(<= main_~i~0 31), 152301#(<= main_~i~0 32), 152306#(<= main_~i~0 37), 152307#(<= main_~i~0 38), 152304#(<= main_~i~0 35), 152305#(<= main_~i~0 36), 152310#(<= main_~i~0 41), 152311#(<= main_~i~0 42), 152308#(<= main_~i~0 39), 152309#(<= main_~i~0 40), 152314#(<= main_~i~0 45), 152315#(<= main_~i~0 46), 152312#(<= main_~i~0 43), 152313#(<= main_~i~0 44), 152318#(<= main_~i~0 49), 152319#(<= main_~i~0 50), 152316#(<= main_~i~0 47), 152317#(<= main_~i~0 48)] [2018-04-12 02:58:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 22610 backedges. 0 proven. 22610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:11,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-12 02:58:11,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-12 02:58:11,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4661, Invalid=5041, Unknown=0, NotChecked=0, Total=9702 [2018-04-12 02:58:11,742 INFO L87 Difference]: Start difference. First operand 1362 states and 1839 transitions. Second operand 99 states. [2018-04-12 02:58:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:58:17,604 INFO L93 Difference]: Finished difference Result 1476 states and 1960 transitions. [2018-04-12 02:58:17,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-12 02:58:17,605 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 483 [2018-04-12 02:58:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:58:17,606 INFO L225 Difference]: With dead ends: 1476 [2018-04-12 02:58:17,606 INFO L226 Difference]: Without dead ends: 1476 [2018-04-12 02:58:17,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=13971, Invalid=23471, Unknown=0, NotChecked=0, Total=37442 [2018-04-12 02:58:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2018-04-12 02:58:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1376. [2018-04-12 02:58:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2018-04-12 02:58:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1858 transitions. [2018-04-12 02:58:17,616 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1858 transitions. Word has length 483 [2018-04-12 02:58:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:58:17,617 INFO L459 AbstractCegarLoop]: Abstraction has 1376 states and 1858 transitions. [2018-04-12 02:58:17,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-12 02:58:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1858 transitions. [2018-04-12 02:58:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-04-12 02:58:17,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:58:17,619 INFO L355 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-04-12 02:58:17,619 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:58:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1321004355, now seen corresponding path program 96 times [2018-04-12 02:58:17,619 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:58:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:58:17,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:58:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23088 backedges. 0 proven. 23088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:20,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:58:20,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-12 02:58:20,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:58:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:20,310 INFO L182 omatonBuilderFactory]: Interpolants [155410#(<= main_~i~0 0), 155411#(<= main_~i~0 1), 155408#true, 155409#false, 155414#(<= main_~i~0 4), 155415#(<= main_~i~0 5), 155412#(<= main_~i~0 2), 155413#(<= main_~i~0 3), 155418#(<= main_~i~0 8), 155419#(<= main_~i~0 9), 155416#(<= main_~i~0 6), 155417#(<= main_~i~0 7), 155422#(<= main_~i~0 12), 155423#(<= main_~i~0 13), 155420#(<= main_~i~0 10), 155421#(<= main_~i~0 11), 155426#(<= main_~i~0 16), 155427#(<= main_~i~0 17), 155424#(<= main_~i~0 14), 155425#(<= main_~i~0 15), 155430#(<= main_~i~0 20), 155431#(<= main_~i~0 21), 155428#(<= main_~i~0 18), 155429#(<= main_~i~0 19), 155434#(<= main_~i~0 24), 155435#(<= main_~i~0 25), 155432#(<= main_~i~0 22), 155433#(<= main_~i~0 23), 155438#(<= main_~i~0 28), 155439#(<= main_~i~0 29), 155436#(<= main_~i~0 26), 155437#(<= main_~i~0 27), 155442#(<= main_~i~0 32), 155443#(<= main_~i~0 33), 155440#(<= main_~i~0 30), 155441#(<= main_~i~0 31), 155446#(<= main_~i~0 36), 155447#(<= main_~i~0 37), 155444#(<= main_~i~0 34), 155445#(<= main_~i~0 35), 155450#(<= main_~i~0 40), 155451#(<= main_~i~0 41), 155448#(<= main_~i~0 38), 155449#(<= main_~i~0 39), 155454#(<= main_~i~0 44), 155455#(<= main_~i~0 45), 155452#(<= main_~i~0 42), 155453#(<= main_~i~0 43), 155458#(<= main_~i~0 48), 155459#(<= main_~i~0 49), 155456#(<= main_~i~0 46), 155457#(<= main_~i~0 47), 155462#(<= main_~i~0 52), 155463#(<= main_~i~0 53), 155460#(<= main_~i~0 50), 155461#(<= main_~i~0 51), 155466#(<= main_~i~0 56), 155467#(<= main_~i~0 57), 155464#(<= main_~i~0 54), 155465#(<= main_~i~0 55), 155470#(<= main_~i~0 60), 155471#(<= main_~i~0 61), 155468#(<= main_~i~0 58), 155469#(<= main_~i~0 59), 155474#(<= main_~i~0 64), 155475#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 155472#(<= main_~i~0 62), 155473#(<= main_~i~0 63), 155478#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 155479#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 155476#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 155477#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 155482#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 155483#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 155480#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 155481#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 155486#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 155487#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 155484#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 155485#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 155490#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 155491#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 155488#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 155489#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 155494#(and (<= 19 main_~i~0) (<= main_~i~0 83)), 155495#(and (<= main_~i~0 84) (<= 20 main_~i~0)), 155492#(and (<= main_~i~0 81) (<= 17 main_~i~0)), 155493#(and (<= main_~i~0 82) (<= 18 main_~i~0)), 155498#(and (<= 23 main_~i~0) (<= main_~i~0 87)), 155499#(and (<= 24 main_~i~0) (<= main_~i~0 88)), 155496#(and (<= 21 main_~i~0) (<= main_~i~0 85)), 155497#(and (<= main_~i~0 86) (<= 22 main_~i~0)), 155502#(and (<= main_~i~0 91) (<= 27 main_~i~0)), 155503#(and (<= main_~i~0 92) (<= 28 main_~i~0)), 155500#(and (<= 25 main_~i~0) (<= main_~i~0 89)), 155501#(and (<= 26 main_~i~0) (<= main_~i~0 90)), 155506#(and (<= main_~i~0 95) (<= 31 main_~i~0)), 155507#(and (<= main_~i~0 96) (<= 32 main_~i~0)), 155504#(and (<= 29 main_~i~0) (<= main_~i~0 93)), 155505#(and (<= main_~i~0 94) (<= 30 main_~i~0))] [2018-04-12 02:58:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 23088 backedges. 0 proven. 23088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:20,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-12 02:58:20,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-12 02:58:20,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=7622, Unknown=0, NotChecked=0, Total=9900 [2018-04-12 02:58:20,312 INFO L87 Difference]: Start difference. First operand 1376 states and 1858 transitions. Second operand 100 states. [2018-04-12 02:58:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:58:34,748 INFO L93 Difference]: Finished difference Result 1491 states and 1980 transitions. [2018-04-12 02:58:34,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-12 02:58:34,748 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 488 [2018-04-12 02:58:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:58:34,749 INFO L225 Difference]: With dead ends: 1491 [2018-04-12 02:58:34,749 INFO L226 Difference]: Without dead ends: 1491 [2018-04-12 02:58:34,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6735 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=8775, Invalid=29445, Unknown=0, NotChecked=0, Total=38220 [2018-04-12 02:58:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2018-04-12 02:58:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1390. [2018-04-12 02:58:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2018-04-12 02:58:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1877 transitions. [2018-04-12 02:58:34,757 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1877 transitions. Word has length 488 [2018-04-12 02:58:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:58:34,757 INFO L459 AbstractCegarLoop]: Abstraction has 1390 states and 1877 transitions. [2018-04-12 02:58:34,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-12 02:58:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1877 transitions. [2018-04-12 02:58:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-04-12 02:58:34,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:58:34,760 INFO L355 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-04-12 02:58:34,760 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:58:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1642210730, now seen corresponding path program 97 times [2018-04-12 02:58:34,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:58:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:58:34,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:58:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23571 backedges. 0 proven. 23571 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:37,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:58:37,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-04-12 02:58:37,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:58:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:37,620 INFO L182 omatonBuilderFactory]: Interpolants [158582#false, 158583#(<= main_~i~0 0), 158581#true, 158586#(<= main_~i~0 3), 158587#(<= main_~i~0 4), 158584#(<= main_~i~0 1), 158585#(<= main_~i~0 2), 158590#(<= main_~i~0 7), 158591#(<= main_~i~0 8), 158588#(<= main_~i~0 5), 158589#(<= main_~i~0 6), 158594#(<= main_~i~0 11), 158595#(<= main_~i~0 12), 158592#(<= main_~i~0 9), 158593#(<= main_~i~0 10), 158598#(<= main_~i~0 15), 158599#(<= main_~i~0 16), 158596#(<= main_~i~0 13), 158597#(<= main_~i~0 14), 158602#(<= main_~i~0 19), 158603#(<= main_~i~0 20), 158600#(<= main_~i~0 17), 158601#(<= main_~i~0 18), 158606#(<= main_~i~0 23), 158607#(<= main_~i~0 24), 158604#(<= main_~i~0 21), 158605#(<= main_~i~0 22), 158610#(<= main_~i~0 27), 158611#(<= main_~i~0 28), 158608#(<= main_~i~0 25), 158609#(<= main_~i~0 26), 158614#(<= main_~i~0 31), 158615#(<= main_~i~0 32), 158612#(<= main_~i~0 29), 158613#(<= main_~i~0 30), 158618#(<= main_~i~0 35), 158619#(<= main_~i~0 36), 158616#(<= main_~i~0 33), 158617#(<= main_~i~0 34), 158622#(<= main_~i~0 39), 158623#(<= main_~i~0 40), 158620#(<= main_~i~0 37), 158621#(<= main_~i~0 38), 158626#(<= main_~i~0 43), 158627#(<= main_~i~0 44), 158624#(<= main_~i~0 41), 158625#(<= main_~i~0 42), 158630#(<= main_~i~0 47), 158631#(<= main_~i~0 48), 158628#(<= main_~i~0 45), 158629#(<= main_~i~0 46), 158634#(<= main_~i~0 51), 158635#(<= main_~i~0 52), 158632#(<= main_~i~0 49), 158633#(<= main_~i~0 50), 158638#(<= main_~i~0 55), 158639#(<= main_~i~0 56), 158636#(<= main_~i~0 53), 158637#(<= main_~i~0 54), 158642#(<= main_~i~0 59), 158643#(<= main_~i~0 60), 158640#(<= main_~i~0 57), 158641#(<= main_~i~0 58), 158646#(<= main_~i~0 63), 158647#(<= main_~i~0 64), 158644#(<= main_~i~0 61), 158645#(<= main_~i~0 62), 158650#(<= main_~i~0 67), 158651#(<= main_~i~0 68), 158648#(<= main_~i~0 65), 158649#(<= main_~i~0 66), 158654#(<= main_~i~0 71), 158655#(<= main_~i~0 72), 158652#(<= main_~i~0 69), 158653#(<= main_~i~0 70), 158658#(<= main_~i~0 75), 158659#(<= main_~i~0 76), 158656#(<= main_~i~0 73), 158657#(<= main_~i~0 74), 158662#(<= main_~i~0 79), 158663#(<= main_~i~0 80), 158660#(<= main_~i~0 77), 158661#(<= main_~i~0 78), 158666#(<= main_~i~0 83), 158667#(<= main_~i~0 84), 158664#(<= main_~i~0 81), 158665#(<= main_~i~0 82), 158670#(<= main_~i~0 87), 158671#(<= main_~i~0 88), 158668#(<= main_~i~0 85), 158669#(<= main_~i~0 86), 158674#(<= main_~i~0 91), 158675#(<= main_~i~0 92), 158672#(<= main_~i~0 89), 158673#(<= main_~i~0 90), 158678#(<= main_~i~0 95), 158679#(<= main_~i~0 96), 158676#(<= main_~i~0 93), 158677#(<= main_~i~0 94), 158680#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 158681#(and (<= 1 main_~i~0) (<= main_~i~0 97))] [2018-04-12 02:58:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23571 backedges. 0 proven. 23571 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:37,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-12 02:58:37,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-12 02:58:37,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4856, Invalid=5244, Unknown=0, NotChecked=0, Total=10100 [2018-04-12 02:58:37,621 INFO L87 Difference]: Start difference. First operand 1390 states and 1877 transitions. Second operand 101 states. [2018-04-12 02:58:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:58:44,288 INFO L93 Difference]: Finished difference Result 1506 states and 2000 transitions. [2018-04-12 02:58:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-12 02:58:44,288 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 493 [2018-04-12 02:58:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:58:44,289 INFO L225 Difference]: With dead ends: 1506 [2018-04-12 02:58:44,289 INFO L226 Difference]: Without dead ends: 1506 [2018-04-12 02:58:44,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=14556, Invalid=24450, Unknown=0, NotChecked=0, Total=39006 [2018-04-12 02:58:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2018-04-12 02:58:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1404. [2018-04-12 02:58:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2018-04-12 02:58:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1896 transitions. [2018-04-12 02:58:44,298 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1896 transitions. Word has length 493 [2018-04-12 02:58:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:58:44,298 INFO L459 AbstractCegarLoop]: Abstraction has 1404 states and 1896 transitions. [2018-04-12 02:58:44,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-12 02:58:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1896 transitions. [2018-04-12 02:58:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-04-12 02:58:44,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:58:44,301 INFO L355 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-04-12 02:58:44,301 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:58:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1123871325, now seen corresponding path program 98 times [2018-04-12 02:58:44,301 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:58:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:58:44,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:58:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 24059 backedges. 0 proven. 24059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:47,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:58:47,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-04-12 02:58:47,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:58:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:47,256 INFO L182 omatonBuilderFactory]: Interpolants [161794#(<= main_~i~0 6), 161795#(<= main_~i~0 7), 161792#(<= main_~i~0 4), 161793#(<= main_~i~0 5), 161798#(<= main_~i~0 10), 161799#(<= main_~i~0 11), 161796#(<= main_~i~0 8), 161797#(<= main_~i~0 9), 161802#(<= main_~i~0 14), 161803#(<= main_~i~0 15), 161800#(<= main_~i~0 12), 161801#(<= main_~i~0 13), 161806#(<= main_~i~0 18), 161807#(<= main_~i~0 19), 161804#(<= main_~i~0 16), 161805#(<= main_~i~0 17), 161810#(<= main_~i~0 22), 161811#(<= main_~i~0 23), 161808#(<= main_~i~0 20), 161809#(<= main_~i~0 21), 161814#(<= main_~i~0 26), 161815#(<= main_~i~0 27), 161812#(<= main_~i~0 24), 161813#(<= main_~i~0 25), 161818#(<= main_~i~0 30), 161819#(<= main_~i~0 31), 161816#(<= main_~i~0 28), 161817#(<= main_~i~0 29), 161822#(<= main_~i~0 34), 161823#(<= main_~i~0 35), 161820#(<= main_~i~0 32), 161821#(<= main_~i~0 33), 161826#(<= main_~i~0 38), 161827#(<= main_~i~0 39), 161824#(<= main_~i~0 36), 161825#(<= main_~i~0 37), 161830#(<= main_~i~0 42), 161831#(<= main_~i~0 43), 161828#(<= main_~i~0 40), 161829#(<= main_~i~0 41), 161834#(<= main_~i~0 46), 161835#(<= main_~i~0 47), 161832#(<= main_~i~0 44), 161833#(<= main_~i~0 45), 161838#(<= main_~i~0 50), 161839#(<= main_~i~0 51), 161836#(<= main_~i~0 48), 161837#(<= main_~i~0 49), 161842#(<= main_~i~0 54), 161843#(<= main_~i~0 55), 161840#(<= main_~i~0 52), 161841#(<= main_~i~0 53), 161846#(<= main_~i~0 58), 161847#(<= main_~i~0 59), 161844#(<= main_~i~0 56), 161845#(<= main_~i~0 57), 161850#(<= main_~i~0 62), 161851#(<= main_~i~0 63), 161848#(<= main_~i~0 60), 161849#(<= main_~i~0 61), 161854#(<= main_~i~0 66), 161855#(<= main_~i~0 67), 161852#(<= main_~i~0 64), 161853#(<= main_~i~0 65), 161858#(<= main_~i~0 70), 161859#(<= main_~i~0 71), 161856#(<= main_~i~0 68), 161857#(<= main_~i~0 69), 161862#(<= main_~i~0 74), 161863#(<= main_~i~0 75), 161860#(<= main_~i~0 72), 161861#(<= main_~i~0 73), 161866#(<= main_~i~0 78), 161867#(<= main_~i~0 79), 161864#(<= main_~i~0 76), 161865#(<= main_~i~0 77), 161870#(<= main_~i~0 82), 161871#(<= main_~i~0 83), 161868#(<= main_~i~0 80), 161869#(<= main_~i~0 81), 161874#(<= main_~i~0 86), 161875#(<= main_~i~0 87), 161872#(<= main_~i~0 84), 161873#(<= main_~i~0 85), 161878#(<= main_~i~0 90), 161879#(<= main_~i~0 91), 161876#(<= main_~i~0 88), 161877#(<= main_~i~0 89), 161882#(<= main_~i~0 94), 161883#(<= main_~i~0 95), 161880#(<= main_~i~0 92), 161881#(<= main_~i~0 93), 161886#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 161887#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 161884#(<= main_~i~0 96), 161885#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 161786#true, 161787#false, 161790#(<= main_~i~0 2), 161791#(<= main_~i~0 3), 161788#(<= main_~i~0 0), 161789#(<= main_~i~0 1)] [2018-04-12 02:58:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 24059 backedges. 0 proven. 24059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:47,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-12 02:58:47,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-12 02:58:47,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4858, Invalid=5444, Unknown=0, NotChecked=0, Total=10302 [2018-04-12 02:58:47,258 INFO L87 Difference]: Start difference. First operand 1404 states and 1896 transitions. Second operand 102 states. [2018-04-12 02:58:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:58:54,176 INFO L93 Difference]: Finished difference Result 1521 states and 2020 transitions. [2018-04-12 02:58:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-12 02:58:54,177 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 498 [2018-04-12 02:58:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:58:54,178 INFO L225 Difference]: With dead ends: 1521 [2018-04-12 02:58:54,178 INFO L226 Difference]: Without dead ends: 1521 [2018-04-12 02:58:54,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5044 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=14657, Invalid=25143, Unknown=0, NotChecked=0, Total=39800 [2018-04-12 02:58:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-04-12 02:58:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1418. [2018-04-12 02:58:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2018-04-12 02:58:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1915 transitions. [2018-04-12 02:58:54,185 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1915 transitions. Word has length 498 [2018-04-12 02:58:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:58:54,185 INFO L459 AbstractCegarLoop]: Abstraction has 1418 states and 1915 transitions. [2018-04-12 02:58:54,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-12 02:58:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1915 transitions. [2018-04-12 02:58:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-04-12 02:58:54,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:58:54,188 INFO L355 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-04-12 02:58:54,188 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:58:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash 721012406, now seen corresponding path program 99 times [2018-04-12 02:58:54,189 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:58:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:58:54,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:58:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 24552 backedges. 0 proven. 24552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:57,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:58:57,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-04-12 02:58:57,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:58:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:57,176 INFO L182 omatonBuilderFactory]: Interpolants [165122#(<= main_~i~0 97), 165123#(<= main_~i~0 98), 165120#(<= main_~i~0 95), 165121#(<= main_~i~0 96), 165124#(and (<= main_~i~0 98) (<= 0 main_~i~0)), 165125#(and (<= 1 main_~i~0) (<= main_~i~0 99)), 165023#true, 165026#(<= main_~i~0 1), 165027#(<= main_~i~0 2), 165024#false, 165025#(<= main_~i~0 0), 165030#(<= main_~i~0 5), 165031#(<= main_~i~0 6), 165028#(<= main_~i~0 3), 165029#(<= main_~i~0 4), 165034#(<= main_~i~0 9), 165035#(<= main_~i~0 10), 165032#(<= main_~i~0 7), 165033#(<= main_~i~0 8), 165038#(<= main_~i~0 13), 165039#(<= main_~i~0 14), 165036#(<= main_~i~0 11), 165037#(<= main_~i~0 12), 165042#(<= main_~i~0 17), 165043#(<= main_~i~0 18), 165040#(<= main_~i~0 15), 165041#(<= main_~i~0 16), 165046#(<= main_~i~0 21), 165047#(<= main_~i~0 22), 165044#(<= main_~i~0 19), 165045#(<= main_~i~0 20), 165050#(<= main_~i~0 25), 165051#(<= main_~i~0 26), 165048#(<= main_~i~0 23), 165049#(<= main_~i~0 24), 165054#(<= main_~i~0 29), 165055#(<= main_~i~0 30), 165052#(<= main_~i~0 27), 165053#(<= main_~i~0 28), 165058#(<= main_~i~0 33), 165059#(<= main_~i~0 34), 165056#(<= main_~i~0 31), 165057#(<= main_~i~0 32), 165062#(<= main_~i~0 37), 165063#(<= main_~i~0 38), 165060#(<= main_~i~0 35), 165061#(<= main_~i~0 36), 165066#(<= main_~i~0 41), 165067#(<= main_~i~0 42), 165064#(<= main_~i~0 39), 165065#(<= main_~i~0 40), 165070#(<= main_~i~0 45), 165071#(<= main_~i~0 46), 165068#(<= main_~i~0 43), 165069#(<= main_~i~0 44), 165074#(<= main_~i~0 49), 165075#(<= main_~i~0 50), 165072#(<= main_~i~0 47), 165073#(<= main_~i~0 48), 165078#(<= main_~i~0 53), 165079#(<= main_~i~0 54), 165076#(<= main_~i~0 51), 165077#(<= main_~i~0 52), 165082#(<= main_~i~0 57), 165083#(<= main_~i~0 58), 165080#(<= main_~i~0 55), 165081#(<= main_~i~0 56), 165086#(<= main_~i~0 61), 165087#(<= main_~i~0 62), 165084#(<= main_~i~0 59), 165085#(<= main_~i~0 60), 165090#(<= main_~i~0 65), 165091#(<= main_~i~0 66), 165088#(<= main_~i~0 63), 165089#(<= main_~i~0 64), 165094#(<= main_~i~0 69), 165095#(<= main_~i~0 70), 165092#(<= main_~i~0 67), 165093#(<= main_~i~0 68), 165098#(<= main_~i~0 73), 165099#(<= main_~i~0 74), 165096#(<= main_~i~0 71), 165097#(<= main_~i~0 72), 165102#(<= main_~i~0 77), 165103#(<= main_~i~0 78), 165100#(<= main_~i~0 75), 165101#(<= main_~i~0 76), 165106#(<= main_~i~0 81), 165107#(<= main_~i~0 82), 165104#(<= main_~i~0 79), 165105#(<= main_~i~0 80), 165110#(<= main_~i~0 85), 165111#(<= main_~i~0 86), 165108#(<= main_~i~0 83), 165109#(<= main_~i~0 84), 165114#(<= main_~i~0 89), 165115#(<= main_~i~0 90), 165112#(<= main_~i~0 87), 165113#(<= main_~i~0 88), 165118#(<= main_~i~0 93), 165119#(<= main_~i~0 94), 165116#(<= main_~i~0 91), 165117#(<= main_~i~0 92)] [2018-04-12 02:58:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24552 backedges. 0 proven. 24552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:58:57,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-12 02:58:57,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-12 02:58:57,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5055, Invalid=5451, Unknown=0, NotChecked=0, Total=10506 [2018-04-12 02:58:57,178 INFO L87 Difference]: Start difference. First operand 1418 states and 1915 transitions. Second operand 103 states. [2018-04-12 02:59:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:59:04,373 INFO L93 Difference]: Finished difference Result 1536 states and 2040 transitions. [2018-04-12 02:59:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-12 02:59:04,373 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 503 [2018-04-12 02:59:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:59:04,374 INFO L225 Difference]: With dead ends: 1536 [2018-04-12 02:59:04,375 INFO L226 Difference]: Without dead ends: 1536 [2018-04-12 02:59:04,376 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=15153, Invalid=25449, Unknown=0, NotChecked=0, Total=40602 [2018-04-12 02:59:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2018-04-12 02:59:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1432. [2018-04-12 02:59:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-04-12 02:59:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1934 transitions. [2018-04-12 02:59:04,384 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1934 transitions. Word has length 503 [2018-04-12 02:59:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:59:04,384 INFO L459 AbstractCegarLoop]: Abstraction has 1432 states and 1934 transitions. [2018-04-12 02:59:04,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-12 02:59:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1934 transitions. [2018-04-12 02:59:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-04-12 02:59:04,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:59:04,387 INFO L355 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-04-12 02:59:04,387 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:59:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash -494552579, now seen corresponding path program 100 times [2018-04-12 02:59:04,388 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:59:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:59:04,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:59:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25050 backedges. 0 proven. 25050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:07,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:59:07,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-04-12 02:59:07,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:59:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:07,485 INFO L182 omatonBuilderFactory]: Interpolants [168294#(<= main_~i~0 0), 168295#(<= main_~i~0 1), 168292#true, 168293#false, 168298#(<= main_~i~0 4), 168299#(<= main_~i~0 5), 168296#(<= main_~i~0 2), 168297#(<= main_~i~0 3), 168302#(<= main_~i~0 8), 168303#(<= main_~i~0 9), 168300#(<= main_~i~0 6), 168301#(<= main_~i~0 7), 168306#(<= main_~i~0 12), 168307#(<= main_~i~0 13), 168304#(<= main_~i~0 10), 168305#(<= main_~i~0 11), 168310#(<= main_~i~0 16), 168311#(<= main_~i~0 17), 168308#(<= main_~i~0 14), 168309#(<= main_~i~0 15), 168314#(<= main_~i~0 20), 168315#(<= main_~i~0 21), 168312#(<= main_~i~0 18), 168313#(<= main_~i~0 19), 168318#(<= main_~i~0 24), 168319#(<= main_~i~0 25), 168316#(<= main_~i~0 22), 168317#(<= main_~i~0 23), 168322#(<= main_~i~0 28), 168323#(<= main_~i~0 29), 168320#(<= main_~i~0 26), 168321#(<= main_~i~0 27), 168326#(<= main_~i~0 32), 168327#(<= main_~i~0 33), 168324#(<= main_~i~0 30), 168325#(<= main_~i~0 31), 168330#(<= main_~i~0 36), 168331#(<= main_~i~0 37), 168328#(<= main_~i~0 34), 168329#(<= main_~i~0 35), 168334#(<= main_~i~0 40), 168335#(<= main_~i~0 41), 168332#(<= main_~i~0 38), 168333#(<= main_~i~0 39), 168338#(<= main_~i~0 44), 168339#(<= main_~i~0 45), 168336#(<= main_~i~0 42), 168337#(<= main_~i~0 43), 168342#(<= main_~i~0 48), 168343#(<= main_~i~0 49), 168340#(<= main_~i~0 46), 168341#(<= main_~i~0 47), 168346#(<= main_~i~0 52), 168347#(<= main_~i~0 53), 168344#(<= main_~i~0 50), 168345#(<= main_~i~0 51), 168350#(<= main_~i~0 56), 168351#(<= main_~i~0 57), 168348#(<= main_~i~0 54), 168349#(<= main_~i~0 55), 168354#(<= main_~i~0 60), 168355#(<= main_~i~0 61), 168352#(<= main_~i~0 58), 168353#(<= main_~i~0 59), 168358#(<= main_~i~0 64), 168359#(<= main_~i~0 65), 168356#(<= main_~i~0 62), 168357#(<= main_~i~0 63), 168362#(<= main_~i~0 68), 168363#(<= main_~i~0 69), 168360#(<= main_~i~0 66), 168361#(<= main_~i~0 67), 168366#(<= main_~i~0 72), 168367#(<= main_~i~0 73), 168364#(<= main_~i~0 70), 168365#(<= main_~i~0 71), 168370#(<= main_~i~0 76), 168371#(<= main_~i~0 77), 168368#(<= main_~i~0 74), 168369#(<= main_~i~0 75), 168374#(<= main_~i~0 80), 168375#(<= main_~i~0 81), 168372#(<= main_~i~0 78), 168373#(<= main_~i~0 79), 168378#(<= main_~i~0 84), 168379#(<= main_~i~0 85), 168376#(<= main_~i~0 82), 168377#(<= main_~i~0 83), 168382#(<= main_~i~0 88), 168383#(<= main_~i~0 89), 168380#(<= main_~i~0 86), 168381#(<= main_~i~0 87), 168386#(<= main_~i~0 92), 168387#(<= main_~i~0 93), 168384#(<= main_~i~0 90), 168385#(<= main_~i~0 91), 168390#(<= main_~i~0 96), 168391#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 168388#(<= main_~i~0 94), 168389#(<= main_~i~0 95), 168394#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 168395#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 168392#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 168393#(and (<= 2 main_~i~0) (<= main_~i~0 98))] [2018-04-12 02:59:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 25050 backedges. 0 proven. 25050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:07,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-12 02:59:07,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-12 02:59:07,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4862, Invalid=5850, Unknown=0, NotChecked=0, Total=10712 [2018-04-12 02:59:07,486 INFO L87 Difference]: Start difference. First operand 1432 states and 1934 transitions. Second operand 104 states. [2018-04-12 02:59:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:59:15,202 INFO L93 Difference]: Finished difference Result 1551 states and 2060 transitions. [2018-04-12 02:59:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-12 02:59:15,202 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 508 [2018-04-12 02:59:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:59:15,203 INFO L225 Difference]: With dead ends: 1551 [2018-04-12 02:59:15,203 INFO L226 Difference]: Without dead ends: 1551 [2018-04-12 02:59:15,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5437 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14859, Invalid=26553, Unknown=0, NotChecked=0, Total=41412 [2018-04-12 02:59:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2018-04-12 02:59:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1446. [2018-04-12 02:59:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2018-04-12 02:59:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1953 transitions. [2018-04-12 02:59:15,212 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1953 transitions. Word has length 508 [2018-04-12 02:59:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:59:15,212 INFO L459 AbstractCegarLoop]: Abstraction has 1446 states and 1953 transitions. [2018-04-12 02:59:15,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-12 02:59:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1953 transitions. [2018-04-12 02:59:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-04-12 02:59:15,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:59:15,214 INFO L355 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-04-12 02:59:15,214 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:59:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1285667606, now seen corresponding path program 101 times [2018-04-12 02:59:15,215 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:59:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:59:15,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:59:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25553 backedges. 0 proven. 25553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:18,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:59:18,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-04-12 02:59:18,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:59:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:18,394 INFO L182 omatonBuilderFactory]: Interpolants [171594#false, 171595#(<= main_~i~0 0), 171593#true, 171598#(<= main_~i~0 3), 171599#(<= main_~i~0 4), 171596#(<= main_~i~0 1), 171597#(<= main_~i~0 2), 171602#(<= main_~i~0 7), 171603#(<= main_~i~0 8), 171600#(<= main_~i~0 5), 171601#(<= main_~i~0 6), 171606#(<= main_~i~0 11), 171607#(<= main_~i~0 12), 171604#(<= main_~i~0 9), 171605#(<= main_~i~0 10), 171610#(<= main_~i~0 15), 171611#(<= main_~i~0 16), 171608#(<= main_~i~0 13), 171609#(<= main_~i~0 14), 171614#(<= main_~i~0 19), 171615#(<= main_~i~0 20), 171612#(<= main_~i~0 17), 171613#(<= main_~i~0 18), 171618#(<= main_~i~0 23), 171619#(<= main_~i~0 24), 171616#(<= main_~i~0 21), 171617#(<= main_~i~0 22), 171622#(<= main_~i~0 27), 171623#(<= main_~i~0 28), 171620#(<= main_~i~0 25), 171621#(<= main_~i~0 26), 171626#(<= main_~i~0 31), 171627#(<= main_~i~0 32), 171624#(<= main_~i~0 29), 171625#(<= main_~i~0 30), 171630#(<= main_~i~0 35), 171631#(<= main_~i~0 36), 171628#(<= main_~i~0 33), 171629#(<= main_~i~0 34), 171634#(<= main_~i~0 39), 171635#(<= main_~i~0 40), 171632#(<= main_~i~0 37), 171633#(<= main_~i~0 38), 171638#(<= main_~i~0 43), 171639#(<= main_~i~0 44), 171636#(<= main_~i~0 41), 171637#(<= main_~i~0 42), 171642#(<= main_~i~0 47), 171643#(<= main_~i~0 48), 171640#(<= main_~i~0 45), 171641#(<= main_~i~0 46), 171646#(<= main_~i~0 51), 171647#(<= main_~i~0 52), 171644#(<= main_~i~0 49), 171645#(<= main_~i~0 50), 171650#(<= main_~i~0 55), 171651#(<= main_~i~0 56), 171648#(<= main_~i~0 53), 171649#(<= main_~i~0 54), 171654#(<= main_~i~0 59), 171655#(<= main_~i~0 60), 171652#(<= main_~i~0 57), 171653#(<= main_~i~0 58), 171658#(<= main_~i~0 63), 171659#(<= main_~i~0 64), 171656#(<= main_~i~0 61), 171657#(<= main_~i~0 62), 171662#(<= main_~i~0 67), 171663#(<= main_~i~0 68), 171660#(<= main_~i~0 65), 171661#(<= main_~i~0 66), 171666#(<= main_~i~0 71), 171667#(<= main_~i~0 72), 171664#(<= main_~i~0 69), 171665#(<= main_~i~0 70), 171670#(<= main_~i~0 75), 171671#(<= main_~i~0 76), 171668#(<= main_~i~0 73), 171669#(<= main_~i~0 74), 171674#(<= main_~i~0 79), 171675#(<= main_~i~0 80), 171672#(<= main_~i~0 77), 171673#(<= main_~i~0 78), 171678#(<= main_~i~0 83), 171679#(<= main_~i~0 84), 171676#(<= main_~i~0 81), 171677#(<= main_~i~0 82), 171682#(<= main_~i~0 87), 171683#(<= main_~i~0 88), 171680#(<= main_~i~0 85), 171681#(<= main_~i~0 86), 171686#(<= main_~i~0 91), 171687#(<= main_~i~0 92), 171684#(<= main_~i~0 89), 171685#(<= main_~i~0 90), 171690#(<= main_~i~0 95), 171691#(<= main_~i~0 96), 171688#(<= main_~i~0 93), 171689#(<= main_~i~0 94), 171694#(<= main_~i~0 99), 171695#(<= main_~i~0 100), 171692#(<= main_~i~0 97), 171693#(<= main_~i~0 98), 171696#(and (<= 0 main_~i~0) (<= main_~i~0 100)), 171697#(and (<= 1 main_~i~0) (<= main_~i~0 101))] [2018-04-12 02:59:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25553 backedges. 0 proven. 25553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:18,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-12 02:59:18,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-12 02:59:18,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2018-04-12 02:59:18,395 INFO L87 Difference]: Start difference. First operand 1446 states and 1953 transitions. Second operand 105 states. [2018-04-12 02:59:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:59:25,661 INFO L93 Difference]: Finished difference Result 1566 states and 2080 transitions. [2018-04-12 02:59:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-12 02:59:25,661 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 513 [2018-04-12 02:59:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:59:25,662 INFO L225 Difference]: With dead ends: 1566 [2018-04-12 02:59:25,663 INFO L226 Difference]: Without dead ends: 1566 [2018-04-12 02:59:25,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=15762, Invalid=26468, Unknown=0, NotChecked=0, Total=42230 [2018-04-12 02:59:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2018-04-12 02:59:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1460. [2018-04-12 02:59:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2018-04-12 02:59:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1972 transitions. [2018-04-12 02:59:25,672 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1972 transitions. Word has length 513 [2018-04-12 02:59:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:59:25,672 INFO L459 AbstractCegarLoop]: Abstraction has 1460 states and 1972 transitions. [2018-04-12 02:59:25,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-12 02:59:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1972 transitions. [2018-04-12 02:59:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-04-12 02:59:25,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:59:25,674 INFO L355 BasicCegarLoop]: trace histogram [103, 103, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-04-12 02:59:25,674 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:59:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1282965091, now seen corresponding path program 102 times [2018-04-12 02:59:25,675 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:59:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:59:25,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:59:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26061 backedges. 0 proven. 26061 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:28,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:59:28,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-04-12 02:59:28,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:59:28,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-12 02:59:28,862 INFO L182 omatonBuilderFactory]: Interpolants [174926#true, 174927#false, 174930#(<= main_~i~0 2), 174931#(<= main_~i~0 3), 174928#(<= main_~i~0 0), 174929#(<= main_~i~0 1), 174934#(<= main_~i~0 6), 174935#(<= main_~i~0 7), 174932#(<= main_~i~0 4), 174933#(<= main_~i~0 5), 174938#(<= main_~i~0 10), 174939#(<= main_~i~0 11), 174936#(<= main_~i~0 8), 174937#(<= main_~i~0 9), 174942#(<= main_~i~0 14), 174943#(<= main_~i~0 15), 174940#(<= main_~i~0 12), 174941#(<= main_~i~0 13), 174946#(<= main_~i~0 18), 174947#(<= main_~i~0 19), 174944#(<= main_~i~0 16), 174945#(<= main_~i~0 17), 174950#(<= main_~i~0 22), 174951#(<= main_~i~0 23), 174948#(<= main_~i~0 20), 174949#(<= main_~i~0 21), 174954#(<= main_~i~0 26), 174955#(<= main_~i~0 27), 174952#(<= main_~i~0 24), 174953#(<= main_~i~0 25), 174958#(<= main_~i~0 30), 174959#(<= main_~i~0 31), 174956#(<= main_~i~0 28), 174957#(<= main_~i~0 29), 174962#(<= main_~i~0 34), 174963#(<= main_~i~0 35), 174960#(<= main_~i~0 32), 174961#(<= main_~i~0 33), 174966#(<= main_~i~0 38), 174967#(<= main_~i~0 39), 174964#(<= main_~i~0 36), 174965#(<= main_~i~0 37), 174970#(<= main_~i~0 42), 174971#(<= main_~i~0 43), 174968#(<= main_~i~0 40), 174969#(<= main_~i~0 41), 174974#(<= main_~i~0 46), 174975#(<= main_~i~0 47), 174972#(<= main_~i~0 44), 174973#(<= main_~i~0 45), 174978#(<= main_~i~0 50), 174979#(<= main_~i~0 51), 174976#(<= main_~i~0 48), 174977#(<= main_~i~0 49), 174982#(<= main_~i~0 54), 174983#(<= main_~i~0 55), 174980#(<= main_~i~0 52), 174981#(<= main_~i~0 53), 174986#(<= main_~i~0 58), 174987#(<= main_~i~0 59), 174984#(<= main_~i~0 56), 174985#(<= main_~i~0 57), 174990#(<= main_~i~0 62), 174991#(<= main_~i~0 63), 174988#(<= main_~i~0 60), 174989#(<= main_~i~0 61), 174994#(<= main_~i~0 66), 174995#(<= main_~i~0 67), 174992#(<= main_~i~0 64), 174993#(<= main_~i~0 65), 174998#(<= main_~i~0 70), 174999#(<= main_~i~0 71), 174996#(<= main_~i~0 68), 174997#(<= main_~i~0 69), 175002#(<= main_~i~0 74), 175003#(<= main_~i~0 75), 175000#(<= main_~i~0 72), 175001#(<= main_~i~0 73), 175006#(<= main_~i~0 78), 175007#(<= main_~i~0 79), 175004#(<= main_~i~0 76), 175005#(<= main_~i~0 77), 175010#(<= main_~i~0 82), 175011#(<= main_~i~0 83), 175008#(<= main_~i~0 80), 175009#(<= main_~i~0 81), 175014#(<= main_~i~0 86), 175015#(<= main_~i~0 87), 175012#(<= main_~i~0 84), 175013#(<= main_~i~0 85), 175018#(<= main_~i~0 90), 175019#(<= main_~i~0 91), 175016#(<= main_~i~0 88), 175017#(<= main_~i~0 89), 175022#(<= main_~i~0 94), 175023#(<= main_~i~0 95), 175020#(<= main_~i~0 92), 175021#(<= main_~i~0 93), 175026#(<= main_~i~0 98), 175027#(<= main_~i~0 99), 175024#(<= main_~i~0 96), 175025#(<= main_~i~0 97), 175030#(and (<= 1 main_~i~0) (<= main_~i~0 101)), 175031#(and (<= 2 main_~i~0) (<= main_~i~0 102)), 175028#(<= main_~i~0 100), 175029#(and (<= 0 main_~i~0) (<= main_~i~0 100))] [2018-04-12 02:59:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 26061 backedges. 0 proven. 26061 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:28,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-12 02:59:28,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-12 02:59:28,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5260, Invalid=5870, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 02:59:28,863 INFO L87 Difference]: Start difference. First operand 1460 states and 1972 transitions. Second operand 106 states. [2018-04-12 02:59:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:59:36,595 INFO L93 Difference]: Finished difference Result 1581 states and 2100 transitions. [2018-04-12 02:59:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-12 02:59:36,595 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 518 [2018-04-12 02:59:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:59:36,597 INFO L225 Difference]: With dead ends: 1581 [2018-04-12 02:59:36,597 INFO L226 Difference]: Without dead ends: 1581 [2018-04-12 02:59:36,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5454 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=15867, Invalid=27189, Unknown=0, NotChecked=0, Total=43056 [2018-04-12 02:59:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2018-04-12 02:59:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1474. [2018-04-12 02:59:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-04-12 02:59:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1991 transitions. [2018-04-12 02:59:36,606 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1991 transitions. Word has length 518 [2018-04-12 02:59:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:59:36,607 INFO L459 AbstractCegarLoop]: Abstraction has 1474 states and 1991 transitions. [2018-04-12 02:59:36,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-12 02:59:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1991 transitions. [2018-04-12 02:59:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-04-12 02:59:36,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:59:36,609 INFO L355 BasicCegarLoop]: trace histogram [104, 104, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-04-12 02:59:36,609 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:59:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1716799626, now seen corresponding path program 103 times [2018-04-12 02:59:36,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:59:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:59:36,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:59:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 26574 backedges. 0 proven. 26574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:39,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:59:39,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-04-12 02:59:39,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:59:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:39,891 INFO L182 omatonBuilderFactory]: Interpolants [178291#true, 178294#(<= main_~i~0 1), 178295#(<= main_~i~0 2), 178292#false, 178293#(<= main_~i~0 0), 178298#(<= main_~i~0 5), 178299#(<= main_~i~0 6), 178296#(<= main_~i~0 3), 178297#(<= main_~i~0 4), 178302#(<= main_~i~0 9), 178303#(<= main_~i~0 10), 178300#(<= main_~i~0 7), 178301#(<= main_~i~0 8), 178306#(<= main_~i~0 13), 178307#(<= main_~i~0 14), 178304#(<= main_~i~0 11), 178305#(<= main_~i~0 12), 178310#(<= main_~i~0 17), 178311#(<= main_~i~0 18), 178308#(<= main_~i~0 15), 178309#(<= main_~i~0 16), 178314#(<= main_~i~0 21), 178315#(<= main_~i~0 22), 178312#(<= main_~i~0 19), 178313#(<= main_~i~0 20), 178318#(<= main_~i~0 25), 178319#(<= main_~i~0 26), 178316#(<= main_~i~0 23), 178317#(<= main_~i~0 24), 178322#(<= main_~i~0 29), 178323#(<= main_~i~0 30), 178320#(<= main_~i~0 27), 178321#(<= main_~i~0 28), 178326#(<= main_~i~0 33), 178327#(<= main_~i~0 34), 178324#(<= main_~i~0 31), 178325#(<= main_~i~0 32), 178330#(<= main_~i~0 37), 178331#(<= main_~i~0 38), 178328#(<= main_~i~0 35), 178329#(<= main_~i~0 36), 178334#(<= main_~i~0 41), 178335#(<= main_~i~0 42), 178332#(<= main_~i~0 39), 178333#(<= main_~i~0 40), 178338#(<= main_~i~0 45), 178339#(<= main_~i~0 46), 178336#(<= main_~i~0 43), 178337#(<= main_~i~0 44), 178342#(<= main_~i~0 49), 178343#(<= main_~i~0 50), 178340#(<= main_~i~0 47), 178341#(<= main_~i~0 48), 178346#(<= main_~i~0 53), 178347#(<= main_~i~0 54), 178344#(<= main_~i~0 51), 178345#(<= main_~i~0 52), 178350#(<= main_~i~0 57), 178351#(<= main_~i~0 58), 178348#(<= main_~i~0 55), 178349#(<= main_~i~0 56), 178354#(<= main_~i~0 61), 178355#(<= main_~i~0 62), 178352#(<= main_~i~0 59), 178353#(<= main_~i~0 60), 178358#(<= main_~i~0 65), 178359#(<= main_~i~0 66), 178356#(<= main_~i~0 63), 178357#(<= main_~i~0 64), 178362#(<= main_~i~0 69), 178363#(<= main_~i~0 70), 178360#(<= main_~i~0 67), 178361#(<= main_~i~0 68), 178366#(<= main_~i~0 73), 178367#(<= main_~i~0 74), 178364#(<= main_~i~0 71), 178365#(<= main_~i~0 72), 178370#(<= main_~i~0 77), 178371#(<= main_~i~0 78), 178368#(<= main_~i~0 75), 178369#(<= main_~i~0 76), 178374#(<= main_~i~0 81), 178375#(<= main_~i~0 82), 178372#(<= main_~i~0 79), 178373#(<= main_~i~0 80), 178378#(<= main_~i~0 85), 178379#(<= main_~i~0 86), 178376#(<= main_~i~0 83), 178377#(<= main_~i~0 84), 178382#(<= main_~i~0 89), 178383#(<= main_~i~0 90), 178380#(<= main_~i~0 87), 178381#(<= main_~i~0 88), 178386#(<= main_~i~0 93), 178387#(<= main_~i~0 94), 178384#(<= main_~i~0 91), 178385#(<= main_~i~0 92), 178390#(<= main_~i~0 97), 178391#(<= main_~i~0 98), 178388#(<= main_~i~0 95), 178389#(<= main_~i~0 96), 178394#(<= main_~i~0 101), 178395#(<= main_~i~0 102), 178392#(<= main_~i~0 99), 178393#(<= main_~i~0 100), 178396#(and (<= 0 main_~i~0) (<= main_~i~0 102)), 178397#(and (<= 1 main_~i~0) (<= main_~i~0 103))] [2018-04-12 02:59:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 26574 backedges. 0 proven. 26574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:39,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-12 02:59:39,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-12 02:59:39,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5465, Invalid=5877, Unknown=0, NotChecked=0, Total=11342 [2018-04-12 02:59:39,893 INFO L87 Difference]: Start difference. First operand 1474 states and 1991 transitions. Second operand 107 states. [2018-04-12 02:59:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:59:47,657 INFO L93 Difference]: Finished difference Result 1596 states and 2120 transitions. [2018-04-12 02:59:47,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-12 02:59:47,657 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 523 [2018-04-12 02:59:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:59:47,658 INFO L225 Difference]: With dead ends: 1596 [2018-04-12 02:59:47,658 INFO L226 Difference]: Without dead ends: 1596 [2018-04-12 02:59:47,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=16383, Invalid=27507, Unknown=0, NotChecked=0, Total=43890 [2018-04-12 02:59:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-04-12 02:59:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1488. [2018-04-12 02:59:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2018-04-12 02:59:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2010 transitions. [2018-04-12 02:59:47,667 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2010 transitions. Word has length 523 [2018-04-12 02:59:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:59:47,667 INFO L459 AbstractCegarLoop]: Abstraction has 1488 states and 2010 transitions. [2018-04-12 02:59:47,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-12 02:59:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2010 transitions. [2018-04-12 02:59:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-04-12 02:59:47,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:59:47,669 INFO L355 BasicCegarLoop]: trace histogram [105, 105, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-04-12 02:59:47,669 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:59:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash -852737731, now seen corresponding path program 104 times [2018-04-12 02:59:47,670 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:59:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:59:47,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:59:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 27092 backedges. 0 proven. 27092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:50,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 02:59:50,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-04-12 02:59:50,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 02:59:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:50,892 INFO L182 omatonBuilderFactory]: Interpolants [181762#(<= main_~i~0 72), 181763#(<= main_~i~0 73), 181760#(<= main_~i~0 70), 181761#(<= main_~i~0 71), 181766#(<= main_~i~0 76), 181767#(<= main_~i~0 77), 181764#(<= main_~i~0 74), 181765#(<= main_~i~0 75), 181770#(<= main_~i~0 80), 181771#(<= main_~i~0 81), 181768#(<= main_~i~0 78), 181769#(<= main_~i~0 79), 181774#(<= main_~i~0 84), 181775#(<= main_~i~0 85), 181772#(<= main_~i~0 82), 181773#(<= main_~i~0 83), 181778#(<= main_~i~0 88), 181779#(<= main_~i~0 89), 181776#(<= main_~i~0 86), 181777#(<= main_~i~0 87), 181782#(<= main_~i~0 92), 181783#(<= main_~i~0 93), 181780#(<= main_~i~0 90), 181781#(<= main_~i~0 91), 181786#(<= main_~i~0 96), 181787#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 181784#(<= main_~i~0 94), 181785#(<= main_~i~0 95), 181790#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 181791#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 181788#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 181789#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 181794#(and (<= 7 main_~i~0) (<= main_~i~0 103)), 181795#(and (<= main_~i~0 104) (<= 8 main_~i~0)), 181792#(and (<= 5 main_~i~0) (<= main_~i~0 101)), 181793#(and (<= 6 main_~i~0) (<= main_~i~0 102)), 181690#(<= main_~i~0 0), 181691#(<= main_~i~0 1), 181688#true, 181689#false, 181694#(<= main_~i~0 4), 181695#(<= main_~i~0 5), 181692#(<= main_~i~0 2), 181693#(<= main_~i~0 3), 181698#(<= main_~i~0 8), 181699#(<= main_~i~0 9), 181696#(<= main_~i~0 6), 181697#(<= main_~i~0 7), 181702#(<= main_~i~0 12), 181703#(<= main_~i~0 13), 181700#(<= main_~i~0 10), 181701#(<= main_~i~0 11), 181706#(<= main_~i~0 16), 181707#(<= main_~i~0 17), 181704#(<= main_~i~0 14), 181705#(<= main_~i~0 15), 181710#(<= main_~i~0 20), 181711#(<= main_~i~0 21), 181708#(<= main_~i~0 18), 181709#(<= main_~i~0 19), 181714#(<= main_~i~0 24), 181715#(<= main_~i~0 25), 181712#(<= main_~i~0 22), 181713#(<= main_~i~0 23), 181718#(<= main_~i~0 28), 181719#(<= main_~i~0 29), 181716#(<= main_~i~0 26), 181717#(<= main_~i~0 27), 181722#(<= main_~i~0 32), 181723#(<= main_~i~0 33), 181720#(<= main_~i~0 30), 181721#(<= main_~i~0 31), 181726#(<= main_~i~0 36), 181727#(<= main_~i~0 37), 181724#(<= main_~i~0 34), 181725#(<= main_~i~0 35), 181730#(<= main_~i~0 40), 181731#(<= main_~i~0 41), 181728#(<= main_~i~0 38), 181729#(<= main_~i~0 39), 181734#(<= main_~i~0 44), 181735#(<= main_~i~0 45), 181732#(<= main_~i~0 42), 181733#(<= main_~i~0 43), 181738#(<= main_~i~0 48), 181739#(<= main_~i~0 49), 181736#(<= main_~i~0 46), 181737#(<= main_~i~0 47), 181742#(<= main_~i~0 52), 181743#(<= main_~i~0 53), 181740#(<= main_~i~0 50), 181741#(<= main_~i~0 51), 181746#(<= main_~i~0 56), 181747#(<= main_~i~0 57), 181744#(<= main_~i~0 54), 181745#(<= main_~i~0 55), 181750#(<= main_~i~0 60), 181751#(<= main_~i~0 61), 181748#(<= main_~i~0 58), 181749#(<= main_~i~0 59), 181754#(<= main_~i~0 64), 181755#(<= main_~i~0 65), 181752#(<= main_~i~0 62), 181753#(<= main_~i~0 63), 181758#(<= main_~i~0 68), 181759#(<= main_~i~0 69), 181756#(<= main_~i~0 66), 181757#(<= main_~i~0 67)] [2018-04-12 02:59:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 27092 backedges. 0 proven. 27092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:59:50,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-12 02:59:50,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-12 02:59:50,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4870, Invalid=6686, Unknown=0, NotChecked=0, Total=11556 [2018-04-12 02:59:50,895 INFO L87 Difference]: Start difference. First operand 1488 states and 2010 transitions. Second operand 108 states. [2018-04-12 02:59:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:59:59,895 INFO L93 Difference]: Finished difference Result 1611 states and 2140 transitions. [2018-04-12 02:59:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-12 02:59:59,895 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 528 [2018-04-12 02:59:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:59:59,897 INFO L225 Difference]: With dead ends: 1611 [2018-04-12 02:59:59,897 INFO L226 Difference]: Without dead ends: 1611 [2018-04-12 02:59:59,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6235 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=15263, Invalid=29469, Unknown=0, NotChecked=0, Total=44732 [2018-04-12 02:59:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-04-12 02:59:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1502. [2018-04-12 02:59:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2018-04-12 02:59:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2029 transitions. [2018-04-12 02:59:59,907 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2029 transitions. Word has length 528 [2018-04-12 02:59:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:59:59,907 INFO L459 AbstractCegarLoop]: Abstraction has 1502 states and 2029 transitions. [2018-04-12 02:59:59,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-12 02:59:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2029 transitions. [2018-04-12 02:59:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2018-04-12 02:59:59,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:59:59,911 INFO L355 BasicCegarLoop]: trace histogram [106, 106, 105, 105, 105, 1, 1, 1, 1, 1, 1] [2018-04-12 02:59:59,911 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 02:59:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -449987626, now seen corresponding path program 105 times [2018-04-12 02:59:59,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 02:59:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:59:59,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:00:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 27615 backedges. 0 proven. 27615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:03,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:00:03,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-04-12 03:00:03,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:00:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:03,566 INFO L182 omatonBuilderFactory]: Interpolants [185118#false, 185119#(<= main_~i~0 0), 185117#true, 185122#(<= main_~i~0 3), 185123#(<= main_~i~0 4), 185120#(<= main_~i~0 1), 185121#(<= main_~i~0 2), 185126#(<= main_~i~0 7), 185127#(<= main_~i~0 8), 185124#(<= main_~i~0 5), 185125#(<= main_~i~0 6), 185130#(<= main_~i~0 11), 185131#(<= main_~i~0 12), 185128#(<= main_~i~0 9), 185129#(<= main_~i~0 10), 185134#(<= main_~i~0 15), 185135#(<= main_~i~0 16), 185132#(<= main_~i~0 13), 185133#(<= main_~i~0 14), 185138#(<= main_~i~0 19), 185139#(<= main_~i~0 20), 185136#(<= main_~i~0 17), 185137#(<= main_~i~0 18), 185142#(<= main_~i~0 23), 185143#(<= main_~i~0 24), 185140#(<= main_~i~0 21), 185141#(<= main_~i~0 22), 185146#(<= main_~i~0 27), 185147#(<= main_~i~0 28), 185144#(<= main_~i~0 25), 185145#(<= main_~i~0 26), 185150#(<= main_~i~0 31), 185151#(<= main_~i~0 32), 185148#(<= main_~i~0 29), 185149#(<= main_~i~0 30), 185154#(<= main_~i~0 35), 185155#(<= main_~i~0 36), 185152#(<= main_~i~0 33), 185153#(<= main_~i~0 34), 185158#(<= main_~i~0 39), 185159#(<= main_~i~0 40), 185156#(<= main_~i~0 37), 185157#(<= main_~i~0 38), 185162#(<= main_~i~0 43), 185163#(<= main_~i~0 44), 185160#(<= main_~i~0 41), 185161#(<= main_~i~0 42), 185166#(<= main_~i~0 47), 185167#(<= main_~i~0 48), 185164#(<= main_~i~0 45), 185165#(<= main_~i~0 46), 185170#(<= main_~i~0 51), 185171#(<= main_~i~0 52), 185168#(<= main_~i~0 49), 185169#(<= main_~i~0 50), 185174#(<= main_~i~0 55), 185175#(<= main_~i~0 56), 185172#(<= main_~i~0 53), 185173#(<= main_~i~0 54), 185178#(<= main_~i~0 59), 185179#(<= main_~i~0 60), 185176#(<= main_~i~0 57), 185177#(<= main_~i~0 58), 185182#(<= main_~i~0 63), 185183#(<= main_~i~0 64), 185180#(<= main_~i~0 61), 185181#(<= main_~i~0 62), 185186#(<= main_~i~0 67), 185187#(<= main_~i~0 68), 185184#(<= main_~i~0 65), 185185#(<= main_~i~0 66), 185190#(<= main_~i~0 71), 185191#(<= main_~i~0 72), 185188#(<= main_~i~0 69), 185189#(<= main_~i~0 70), 185194#(<= main_~i~0 75), 185195#(<= main_~i~0 76), 185192#(<= main_~i~0 73), 185193#(<= main_~i~0 74), 185198#(<= main_~i~0 79), 185199#(<= main_~i~0 80), 185196#(<= main_~i~0 77), 185197#(<= main_~i~0 78), 185202#(<= main_~i~0 83), 185203#(<= main_~i~0 84), 185200#(<= main_~i~0 81), 185201#(<= main_~i~0 82), 185206#(<= main_~i~0 87), 185207#(<= main_~i~0 88), 185204#(<= main_~i~0 85), 185205#(<= main_~i~0 86), 185210#(<= main_~i~0 91), 185211#(<= main_~i~0 92), 185208#(<= main_~i~0 89), 185209#(<= main_~i~0 90), 185214#(<= main_~i~0 95), 185215#(<= main_~i~0 96), 185212#(<= main_~i~0 93), 185213#(<= main_~i~0 94), 185218#(<= main_~i~0 99), 185219#(<= main_~i~0 100), 185216#(<= main_~i~0 97), 185217#(<= main_~i~0 98), 185222#(<= main_~i~0 103), 185223#(<= main_~i~0 104), 185220#(<= main_~i~0 101), 185221#(<= main_~i~0 102), 185224#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 185225#(and (<= 1 main_~i~0) (<= main_~i~0 105))] [2018-04-12 03:00:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 27615 backedges. 0 proven. 27615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:03,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-12 03:00:03,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-12 03:00:03,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5676, Invalid=6096, Unknown=0, NotChecked=0, Total=11772 [2018-04-12 03:00:03,567 INFO L87 Difference]: Start difference. First operand 1502 states and 2029 transitions. Second operand 109 states. [2018-04-12 03:00:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:00:11,584 INFO L93 Difference]: Finished difference Result 1626 states and 2160 transitions. [2018-04-12 03:00:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-12 03:00:11,584 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 533 [2018-04-12 03:00:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:00:11,585 INFO L225 Difference]: With dead ends: 1626 [2018-04-12 03:00:11,586 INFO L226 Difference]: Without dead ends: 1626 [2018-04-12 03:00:11,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=17016, Invalid=28566, Unknown=0, NotChecked=0, Total=45582 [2018-04-12 03:00:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-04-12 03:00:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1516. [2018-04-12 03:00:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2018-04-12 03:00:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2048 transitions. [2018-04-12 03:00:11,594 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2048 transitions. Word has length 533 [2018-04-12 03:00:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:00:11,594 INFO L459 AbstractCegarLoop]: Abstraction has 1516 states and 2048 transitions. [2018-04-12 03:00:11,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-12 03:00:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2048 transitions. [2018-04-12 03:00:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-04-12 03:00:11,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:00:11,596 INFO L355 BasicCegarLoop]: trace histogram [107, 107, 106, 106, 106, 1, 1, 1, 1, 1, 1] [2018-04-12 03:00:11,596 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:00:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash -635569955, now seen corresponding path program 106 times [2018-04-12 03:00:11,597 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:00:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:00:11,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:00:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 28143 backedges. 0 proven. 28143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:15,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:00:15,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-04-12 03:00:15,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:00:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:15,034 INFO L182 omatonBuilderFactory]: Interpolants [188674#(<= main_~i~0 94), 188675#(<= main_~i~0 95), 188672#(<= main_~i~0 92), 188673#(<= main_~i~0 93), 188678#(<= main_~i~0 98), 188679#(<= main_~i~0 99), 188676#(<= main_~i~0 96), 188677#(<= main_~i~0 97), 188682#(<= main_~i~0 102), 188683#(<= main_~i~0 103), 188680#(<= main_~i~0 100), 188681#(<= main_~i~0 101), 188686#(and (<= 1 main_~i~0) (<= main_~i~0 105)), 188687#(and (<= 2 main_~i~0) (<= main_~i~0 106)), 188684#(<= main_~i~0 104), 188685#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 188578#true, 188579#false, 188582#(<= main_~i~0 2), 188583#(<= main_~i~0 3), 188580#(<= main_~i~0 0), 188581#(<= main_~i~0 1), 188586#(<= main_~i~0 6), 188587#(<= main_~i~0 7), 188584#(<= main_~i~0 4), 188585#(<= main_~i~0 5), 188590#(<= main_~i~0 10), 188591#(<= main_~i~0 11), 188588#(<= main_~i~0 8), 188589#(<= main_~i~0 9), 188594#(<= main_~i~0 14), 188595#(<= main_~i~0 15), 188592#(<= main_~i~0 12), 188593#(<= main_~i~0 13), 188598#(<= main_~i~0 18), 188599#(<= main_~i~0 19), 188596#(<= main_~i~0 16), 188597#(<= main_~i~0 17), 188602#(<= main_~i~0 22), 188603#(<= main_~i~0 23), 188600#(<= main_~i~0 20), 188601#(<= main_~i~0 21), 188606#(<= main_~i~0 26), 188607#(<= main_~i~0 27), 188604#(<= main_~i~0 24), 188605#(<= main_~i~0 25), 188610#(<= main_~i~0 30), 188611#(<= main_~i~0 31), 188608#(<= main_~i~0 28), 188609#(<= main_~i~0 29), 188614#(<= main_~i~0 34), 188615#(<= main_~i~0 35), 188612#(<= main_~i~0 32), 188613#(<= main_~i~0 33), 188618#(<= main_~i~0 38), 188619#(<= main_~i~0 39), 188616#(<= main_~i~0 36), 188617#(<= main_~i~0 37), 188622#(<= main_~i~0 42), 188623#(<= main_~i~0 43), 188620#(<= main_~i~0 40), 188621#(<= main_~i~0 41), 188626#(<= main_~i~0 46), 188627#(<= main_~i~0 47), 188624#(<= main_~i~0 44), 188625#(<= main_~i~0 45), 188630#(<= main_~i~0 50), 188631#(<= main_~i~0 51), 188628#(<= main_~i~0 48), 188629#(<= main_~i~0 49), 188634#(<= main_~i~0 54), 188635#(<= main_~i~0 55), 188632#(<= main_~i~0 52), 188633#(<= main_~i~0 53), 188638#(<= main_~i~0 58), 188639#(<= main_~i~0 59), 188636#(<= main_~i~0 56), 188637#(<= main_~i~0 57), 188642#(<= main_~i~0 62), 188643#(<= main_~i~0 63), 188640#(<= main_~i~0 60), 188641#(<= main_~i~0 61), 188646#(<= main_~i~0 66), 188647#(<= main_~i~0 67), 188644#(<= main_~i~0 64), 188645#(<= main_~i~0 65), 188650#(<= main_~i~0 70), 188651#(<= main_~i~0 71), 188648#(<= main_~i~0 68), 188649#(<= main_~i~0 69), 188654#(<= main_~i~0 74), 188655#(<= main_~i~0 75), 188652#(<= main_~i~0 72), 188653#(<= main_~i~0 73), 188658#(<= main_~i~0 78), 188659#(<= main_~i~0 79), 188656#(<= main_~i~0 76), 188657#(<= main_~i~0 77), 188662#(<= main_~i~0 82), 188663#(<= main_~i~0 83), 188660#(<= main_~i~0 80), 188661#(<= main_~i~0 81), 188666#(<= main_~i~0 86), 188667#(<= main_~i~0 87), 188664#(<= main_~i~0 84), 188665#(<= main_~i~0 85), 188670#(<= main_~i~0 90), 188671#(<= main_~i~0 91), 188668#(<= main_~i~0 88), 188669#(<= main_~i~0 89)] [2018-04-12 03:00:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 28143 backedges. 0 proven. 28143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:15,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-12 03:00:15,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-12 03:00:15,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5678, Invalid=6312, Unknown=0, NotChecked=0, Total=11990 [2018-04-12 03:00:15,037 INFO L87 Difference]: Start difference. First operand 1516 states and 2048 transitions. Second operand 110 states. [2018-04-12 03:00:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:00:23,410 INFO L93 Difference]: Finished difference Result 1641 states and 2180 transitions. [2018-04-12 03:00:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-04-12 03:00:23,410 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 538 [2018-04-12 03:00:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:00:23,411 INFO L225 Difference]: With dead ends: 1641 [2018-04-12 03:00:23,411 INFO L226 Difference]: Without dead ends: 1641 [2018-04-12 03:00:23,412 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=17125, Invalid=29315, Unknown=0, NotChecked=0, Total=46440 [2018-04-12 03:00:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2018-04-12 03:00:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1530. [2018-04-12 03:00:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2018-04-12 03:00:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2067 transitions. [2018-04-12 03:00:23,419 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2067 transitions. Word has length 538 [2018-04-12 03:00:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:00:23,419 INFO L459 AbstractCegarLoop]: Abstraction has 1530 states and 2067 transitions. [2018-04-12 03:00:23,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-12 03:00:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2067 transitions. [2018-04-12 03:00:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-04-12 03:00:23,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:00:23,422 INFO L355 BasicCegarLoop]: trace histogram [108, 108, 107, 107, 107, 1, 1, 1, 1, 1, 1] [2018-04-12 03:00:23,422 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:00:23,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1631729610, now seen corresponding path program 107 times [2018-04-12 03:00:23,422 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:00:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:00:23,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:00:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28676 backedges. 0 proven. 28676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:26,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:00:26,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-04-12 03:00:26,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:00:26,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-12 03:00:26,947 INFO L182 omatonBuilderFactory]: Interpolants [192071#true, 192074#(<= main_~i~0 1), 192075#(<= main_~i~0 2), 192072#false, 192073#(<= main_~i~0 0), 192078#(<= main_~i~0 5), 192079#(<= main_~i~0 6), 192076#(<= main_~i~0 3), 192077#(<= main_~i~0 4), 192082#(<= main_~i~0 9), 192083#(<= main_~i~0 10), 192080#(<= main_~i~0 7), 192081#(<= main_~i~0 8), 192086#(<= main_~i~0 13), 192087#(<= main_~i~0 14), 192084#(<= main_~i~0 11), 192085#(<= main_~i~0 12), 192090#(<= main_~i~0 17), 192091#(<= main_~i~0 18), 192088#(<= main_~i~0 15), 192089#(<= main_~i~0 16), 192094#(<= main_~i~0 21), 192095#(<= main_~i~0 22), 192092#(<= main_~i~0 19), 192093#(<= main_~i~0 20), 192098#(<= main_~i~0 25), 192099#(<= main_~i~0 26), 192096#(<= main_~i~0 23), 192097#(<= main_~i~0 24), 192102#(<= main_~i~0 29), 192103#(<= main_~i~0 30), 192100#(<= main_~i~0 27), 192101#(<= main_~i~0 28), 192106#(<= main_~i~0 33), 192107#(<= main_~i~0 34), 192104#(<= main_~i~0 31), 192105#(<= main_~i~0 32), 192110#(<= main_~i~0 37), 192111#(<= main_~i~0 38), 192108#(<= main_~i~0 35), 192109#(<= main_~i~0 36), 192114#(<= main_~i~0 41), 192115#(<= main_~i~0 42), 192112#(<= main_~i~0 39), 192113#(<= main_~i~0 40), 192118#(<= main_~i~0 45), 192119#(<= main_~i~0 46), 192116#(<= main_~i~0 43), 192117#(<= main_~i~0 44), 192122#(<= main_~i~0 49), 192123#(<= main_~i~0 50), 192120#(<= main_~i~0 47), 192121#(<= main_~i~0 48), 192126#(<= main_~i~0 53), 192127#(<= main_~i~0 54), 192124#(<= main_~i~0 51), 192125#(<= main_~i~0 52), 192130#(<= main_~i~0 57), 192131#(<= main_~i~0 58), 192128#(<= main_~i~0 55), 192129#(<= main_~i~0 56), 192134#(<= main_~i~0 61), 192135#(<= main_~i~0 62), 192132#(<= main_~i~0 59), 192133#(<= main_~i~0 60), 192138#(<= main_~i~0 65), 192139#(<= main_~i~0 66), 192136#(<= main_~i~0 63), 192137#(<= main_~i~0 64), 192142#(<= main_~i~0 69), 192143#(<= main_~i~0 70), 192140#(<= main_~i~0 67), 192141#(<= main_~i~0 68), 192146#(<= main_~i~0 73), 192147#(<= main_~i~0 74), 192144#(<= main_~i~0 71), 192145#(<= main_~i~0 72), 192150#(<= main_~i~0 77), 192151#(<= main_~i~0 78), 192148#(<= main_~i~0 75), 192149#(<= main_~i~0 76), 192154#(<= main_~i~0 81), 192155#(<= main_~i~0 82), 192152#(<= main_~i~0 79), 192153#(<= main_~i~0 80), 192158#(<= main_~i~0 85), 192159#(<= main_~i~0 86), 192156#(<= main_~i~0 83), 192157#(<= main_~i~0 84), 192162#(<= main_~i~0 89), 192163#(<= main_~i~0 90), 192160#(<= main_~i~0 87), 192161#(<= main_~i~0 88), 192166#(<= main_~i~0 93), 192167#(<= main_~i~0 94), 192164#(<= main_~i~0 91), 192165#(<= main_~i~0 92), 192170#(<= main_~i~0 97), 192171#(<= main_~i~0 98), 192168#(<= main_~i~0 95), 192169#(<= main_~i~0 96), 192174#(<= main_~i~0 101), 192175#(<= main_~i~0 102), 192172#(<= main_~i~0 99), 192173#(<= main_~i~0 100), 192178#(<= main_~i~0 105), 192179#(<= main_~i~0 106), 192176#(<= main_~i~0 103), 192177#(<= main_~i~0 104), 192180#(and (<= 0 main_~i~0) (<= main_~i~0 106)), 192181#(and (<= 1 main_~i~0) (<= main_~i~0 107))] [2018-04-12 03:00:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 28676 backedges. 0 proven. 28676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:26,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-12 03:00:26,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-12 03:00:26,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5891, Invalid=6319, Unknown=0, NotChecked=0, Total=12210 [2018-04-12 03:00:26,949 INFO L87 Difference]: Start difference. First operand 1530 states and 2067 transitions. Second operand 111 states. [2018-04-12 03:00:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:00:35,341 INFO L93 Difference]: Finished difference Result 1656 states and 2200 transitions. [2018-04-12 03:00:35,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-12 03:00:35,341 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 543 [2018-04-12 03:00:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:00:35,342 INFO L225 Difference]: With dead ends: 1656 [2018-04-12 03:00:35,343 INFO L226 Difference]: Without dead ends: 1656 [2018-04-12 03:00:35,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=17661, Invalid=29645, Unknown=0, NotChecked=0, Total=47306 [2018-04-12 03:00:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2018-04-12 03:00:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1544. [2018-04-12 03:00:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-04-12 03:00:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2086 transitions. [2018-04-12 03:00:35,351 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2086 transitions. Word has length 543 [2018-04-12 03:00:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:00:35,351 INFO L459 AbstractCegarLoop]: Abstraction has 1544 states and 2086 transitions. [2018-04-12 03:00:35,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-12 03:00:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2086 transitions. [2018-04-12 03:00:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2018-04-12 03:00:35,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:00:35,354 INFO L355 BasicCegarLoop]: trace histogram [109, 109, 108, 108, 108, 1, 1, 1, 1, 1, 1] [2018-04-12 03:00:35,354 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:00:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1199134595, now seen corresponding path program 108 times [2018-04-12 03:00:35,354 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:00:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:00:35,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:00:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29214 backedges. 0 proven. 29214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:39,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:00:39,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-04-12 03:00:39,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:00:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:39,019 INFO L182 omatonBuilderFactory]: Interpolants [195598#(<= main_~i~0 0), 195599#(<= main_~i~0 1), 195596#true, 195597#false, 195602#(<= main_~i~0 4), 195603#(<= main_~i~0 5), 195600#(<= main_~i~0 2), 195601#(<= main_~i~0 3), 195606#(<= main_~i~0 8), 195607#(<= main_~i~0 9), 195604#(<= main_~i~0 6), 195605#(<= main_~i~0 7), 195610#(<= main_~i~0 12), 195611#(<= main_~i~0 13), 195608#(<= main_~i~0 10), 195609#(<= main_~i~0 11), 195614#(<= main_~i~0 16), 195615#(<= main_~i~0 17), 195612#(<= main_~i~0 14), 195613#(<= main_~i~0 15), 195618#(<= main_~i~0 20), 195619#(<= main_~i~0 21), 195616#(<= main_~i~0 18), 195617#(<= main_~i~0 19), 195622#(<= main_~i~0 24), 195623#(<= main_~i~0 25), 195620#(<= main_~i~0 22), 195621#(<= main_~i~0 23), 195626#(<= main_~i~0 28), 195627#(<= main_~i~0 29), 195624#(<= main_~i~0 26), 195625#(<= main_~i~0 27), 195630#(<= main_~i~0 32), 195631#(<= main_~i~0 33), 195628#(<= main_~i~0 30), 195629#(<= main_~i~0 31), 195634#(<= main_~i~0 36), 195635#(<= main_~i~0 37), 195632#(<= main_~i~0 34), 195633#(<= main_~i~0 35), 195638#(<= main_~i~0 40), 195639#(<= main_~i~0 41), 195636#(<= main_~i~0 38), 195637#(<= main_~i~0 39), 195642#(<= main_~i~0 44), 195643#(<= main_~i~0 45), 195640#(<= main_~i~0 42), 195641#(<= main_~i~0 43), 195646#(<= main_~i~0 48), 195647#(<= main_~i~0 49), 195644#(<= main_~i~0 46), 195645#(<= main_~i~0 47), 195650#(<= main_~i~0 52), 195651#(<= main_~i~0 53), 195648#(<= main_~i~0 50), 195649#(<= main_~i~0 51), 195654#(<= main_~i~0 56), 195655#(<= main_~i~0 57), 195652#(<= main_~i~0 54), 195653#(<= main_~i~0 55), 195658#(<= main_~i~0 60), 195659#(<= main_~i~0 61), 195656#(<= main_~i~0 58), 195657#(<= main_~i~0 59), 195662#(<= main_~i~0 64), 195663#(<= main_~i~0 65), 195660#(<= main_~i~0 62), 195661#(<= main_~i~0 63), 195666#(<= main_~i~0 68), 195667#(<= main_~i~0 69), 195664#(<= main_~i~0 66), 195665#(<= main_~i~0 67), 195670#(<= main_~i~0 72), 195671#(<= main_~i~0 73), 195668#(<= main_~i~0 70), 195669#(<= main_~i~0 71), 195674#(<= main_~i~0 76), 195675#(<= main_~i~0 77), 195672#(<= main_~i~0 74), 195673#(<= main_~i~0 75), 195678#(<= main_~i~0 80), 195679#(<= main_~i~0 81), 195676#(<= main_~i~0 78), 195677#(<= main_~i~0 79), 195682#(<= main_~i~0 84), 195683#(<= main_~i~0 85), 195680#(<= main_~i~0 82), 195681#(<= main_~i~0 83), 195686#(<= main_~i~0 88), 195687#(<= main_~i~0 89), 195684#(<= main_~i~0 86), 195685#(<= main_~i~0 87), 195690#(<= main_~i~0 92), 195691#(<= main_~i~0 93), 195688#(<= main_~i~0 90), 195689#(<= main_~i~0 91), 195694#(<= main_~i~0 96), 195695#(<= main_~i~0 97), 195692#(<= main_~i~0 94), 195693#(<= main_~i~0 95), 195698#(<= main_~i~0 100), 195699#(<= main_~i~0 101), 195696#(<= main_~i~0 98), 195697#(<= main_~i~0 99), 195702#(<= main_~i~0 104), 195703#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 195700#(<= main_~i~0 102), 195701#(<= main_~i~0 103), 195706#(and (<= 3 main_~i~0) (<= main_~i~0 107)), 195707#(and (<= 4 main_~i~0) (<= main_~i~0 108)), 195704#(and (<= 1 main_~i~0) (<= main_~i~0 105)), 195705#(and (<= 2 main_~i~0) (<= main_~i~0 106))] [2018-04-12 03:00:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 29214 backedges. 0 proven. 29214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:39,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-04-12 03:00:39,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-04-12 03:00:39,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5682, Invalid=6750, Unknown=0, NotChecked=0, Total=12432 [2018-04-12 03:00:39,021 INFO L87 Difference]: Start difference. First operand 1544 states and 2086 transitions. Second operand 112 states. [2018-04-12 03:00:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:00:48,228 INFO L93 Difference]: Finished difference Result 1671 states and 2220 transitions. [2018-04-12 03:00:48,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-12 03:00:48,228 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 548 [2018-04-12 03:00:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:00:48,229 INFO L225 Difference]: With dead ends: 1671 [2018-04-12 03:00:48,229 INFO L226 Difference]: Without dead ends: 1671 [2018-04-12 03:00:48,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6305 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=17343, Invalid=30837, Unknown=0, NotChecked=0, Total=48180 [2018-04-12 03:00:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-04-12 03:00:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1558. [2018-04-12 03:00:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-04-12 03:00:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2105 transitions. [2018-04-12 03:00:48,238 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2105 transitions. Word has length 548 [2018-04-12 03:00:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:00:48,238 INFO L459 AbstractCegarLoop]: Abstraction has 1558 states and 2105 transitions. [2018-04-12 03:00:48,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-04-12 03:00:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2105 transitions. [2018-04-12 03:00:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-04-12 03:00:48,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:00:48,241 INFO L355 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 109, 1, 1, 1, 1, 1, 1] [2018-04-12 03:00:48,241 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:00:48,241 INFO L82 PathProgramCache]: Analyzing trace with hash 846322838, now seen corresponding path program 109 times [2018-04-12 03:00:48,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:00:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:00:48,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:00:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29757 backedges. 0 proven. 29757 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:51,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:00:51,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-04-12 03:00:51,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:00:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:51,895 INFO L182 omatonBuilderFactory]: Interpolants [199171#(<= main_~i~0 16), 199170#(<= main_~i~0 15), 199169#(<= main_~i~0 14), 199168#(<= main_~i~0 13), 199175#(<= main_~i~0 20), 199174#(<= main_~i~0 19), 199173#(<= main_~i~0 18), 199172#(<= main_~i~0 17), 199179#(<= main_~i~0 24), 199178#(<= main_~i~0 23), 199177#(<= main_~i~0 22), 199176#(<= main_~i~0 21), 199183#(<= main_~i~0 28), 199182#(<= main_~i~0 27), 199181#(<= main_~i~0 26), 199180#(<= main_~i~0 25), 199187#(<= main_~i~0 32), 199186#(<= main_~i~0 31), 199185#(<= main_~i~0 30), 199184#(<= main_~i~0 29), 199191#(<= main_~i~0 36), 199190#(<= main_~i~0 35), 199189#(<= main_~i~0 34), 199188#(<= main_~i~0 33), 199195#(<= main_~i~0 40), 199194#(<= main_~i~0 39), 199193#(<= main_~i~0 38), 199192#(<= main_~i~0 37), 199199#(<= main_~i~0 44), 199198#(<= main_~i~0 43), 199197#(<= main_~i~0 42), 199196#(<= main_~i~0 41), 199203#(<= main_~i~0 48), 199202#(<= main_~i~0 47), 199201#(<= main_~i~0 46), 199200#(<= main_~i~0 45), 199207#(<= main_~i~0 52), 199206#(<= main_~i~0 51), 199205#(<= main_~i~0 50), 199204#(<= main_~i~0 49), 199211#(<= main_~i~0 56), 199210#(<= main_~i~0 55), 199209#(<= main_~i~0 54), 199208#(<= main_~i~0 53), 199215#(<= main_~i~0 60), 199214#(<= main_~i~0 59), 199213#(<= main_~i~0 58), 199212#(<= main_~i~0 57), 199219#(<= main_~i~0 64), 199218#(<= main_~i~0 63), 199217#(<= main_~i~0 62), 199216#(<= main_~i~0 61), 199223#(<= main_~i~0 68), 199222#(<= main_~i~0 67), 199221#(<= main_~i~0 66), 199220#(<= main_~i~0 65), 199227#(<= main_~i~0 72), 199226#(<= main_~i~0 71), 199225#(<= main_~i~0 70), 199224#(<= main_~i~0 69), 199231#(<= main_~i~0 76), 199230#(<= main_~i~0 75), 199229#(<= main_~i~0 74), 199228#(<= main_~i~0 73), 199235#(<= main_~i~0 80), 199234#(<= main_~i~0 79), 199233#(<= main_~i~0 78), 199232#(<= main_~i~0 77), 199239#(<= main_~i~0 84), 199238#(<= main_~i~0 83), 199237#(<= main_~i~0 82), 199236#(<= main_~i~0 81), 199243#(<= main_~i~0 88), 199242#(<= main_~i~0 87), 199241#(<= main_~i~0 86), 199240#(<= main_~i~0 85), 199247#(<= main_~i~0 92), 199246#(<= main_~i~0 91), 199245#(<= main_~i~0 90), 199244#(<= main_~i~0 89), 199251#(<= main_~i~0 96), 199250#(<= main_~i~0 95), 199249#(<= main_~i~0 94), 199248#(<= main_~i~0 93), 199255#(<= main_~i~0 100), 199254#(<= main_~i~0 99), 199253#(<= main_~i~0 98), 199252#(<= main_~i~0 97), 199259#(<= main_~i~0 104), 199258#(<= main_~i~0 103), 199257#(<= main_~i~0 102), 199256#(<= main_~i~0 101), 199263#(<= main_~i~0 108), 199262#(<= main_~i~0 107), 199261#(<= main_~i~0 106), 199260#(<= main_~i~0 105), 199265#(and (<= 1 main_~i~0) (<= main_~i~0 109)), 199264#(and (<= 0 main_~i~0) (<= main_~i~0 108)), 199155#(<= main_~i~0 0), 199154#false, 199153#true, 199159#(<= main_~i~0 4), 199158#(<= main_~i~0 3), 199157#(<= main_~i~0 2), 199156#(<= main_~i~0 1), 199163#(<= main_~i~0 8), 199162#(<= main_~i~0 7), 199161#(<= main_~i~0 6), 199160#(<= main_~i~0 5), 199167#(<= main_~i~0 12), 199166#(<= main_~i~0 11), 199165#(<= main_~i~0 10), 199164#(<= main_~i~0 9)] [2018-04-12 03:00:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 29757 backedges. 0 proven. 29757 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:00:51,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-12 03:00:51,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-12 03:00:51,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6110, Invalid=6546, Unknown=0, NotChecked=0, Total=12656 [2018-04-12 03:00:51,897 INFO L87 Difference]: Start difference. First operand 1558 states and 2105 transitions. Second operand 113 states. [2018-04-12 03:00:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:00:59,937 INFO L93 Difference]: Finished difference Result 1686 states and 2240 transitions. [2018-04-12 03:00:59,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-12 03:00:59,937 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 553 [2018-04-12 03:00:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:00:59,939 INFO L225 Difference]: With dead ends: 1686 [2018-04-12 03:00:59,939 INFO L226 Difference]: Without dead ends: 1686 [2018-04-12 03:00:59,941 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=18318, Invalid=30744, Unknown=0, NotChecked=0, Total=49062 [2018-04-12 03:00:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2018-04-12 03:00:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1572. [2018-04-12 03:00:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2018-04-12 03:00:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2124 transitions. [2018-04-12 03:00:59,950 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2124 transitions. Word has length 553 [2018-04-12 03:00:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:00:59,950 INFO L459 AbstractCegarLoop]: Abstraction has 1572 states and 2124 transitions. [2018-04-12 03:00:59,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-12 03:00:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2124 transitions. [2018-04-12 03:00:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-04-12 03:00:59,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:00:59,952 INFO L355 BasicCegarLoop]: trace histogram [111, 111, 110, 110, 110, 1, 1, 1, 1, 1, 1] [2018-04-12 03:00:59,952 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:00:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 437276701, now seen corresponding path program 110 times [2018-04-12 03:00:59,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:01:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:01:00,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:01:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 30305 backedges. 0 proven. 30305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:04,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:01:04,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-04-12 03:01:04,031 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:01:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:04,032 INFO L182 omatonBuilderFactory]: Interpolants [202755#(<= main_~i~0 11), 202754#(<= main_~i~0 10), 202753#(<= main_~i~0 9), 202752#(<= main_~i~0 8), 202759#(<= main_~i~0 15), 202758#(<= main_~i~0 14), 202757#(<= main_~i~0 13), 202756#(<= main_~i~0 12), 202763#(<= main_~i~0 19), 202762#(<= main_~i~0 18), 202761#(<= main_~i~0 17), 202760#(<= main_~i~0 16), 202767#(<= main_~i~0 23), 202766#(<= main_~i~0 22), 202765#(<= main_~i~0 21), 202764#(<= main_~i~0 20), 202771#(<= main_~i~0 27), 202770#(<= main_~i~0 26), 202769#(<= main_~i~0 25), 202768#(<= main_~i~0 24), 202775#(<= main_~i~0 31), 202774#(<= main_~i~0 30), 202773#(<= main_~i~0 29), 202772#(<= main_~i~0 28), 202779#(<= main_~i~0 35), 202778#(<= main_~i~0 34), 202777#(<= main_~i~0 33), 202776#(<= main_~i~0 32), 202783#(<= main_~i~0 39), 202782#(<= main_~i~0 38), 202781#(<= main_~i~0 37), 202780#(<= main_~i~0 36), 202787#(<= main_~i~0 43), 202786#(<= main_~i~0 42), 202785#(<= main_~i~0 41), 202784#(<= main_~i~0 40), 202791#(<= main_~i~0 47), 202790#(<= main_~i~0 46), 202789#(<= main_~i~0 45), 202788#(<= main_~i~0 44), 202795#(<= main_~i~0 51), 202794#(<= main_~i~0 50), 202793#(<= main_~i~0 49), 202792#(<= main_~i~0 48), 202799#(<= main_~i~0 55), 202798#(<= main_~i~0 54), 202797#(<= main_~i~0 53), 202796#(<= main_~i~0 52), 202803#(<= main_~i~0 59), 202802#(<= main_~i~0 58), 202801#(<= main_~i~0 57), 202800#(<= main_~i~0 56), 202807#(<= main_~i~0 63), 202806#(<= main_~i~0 62), 202805#(<= main_~i~0 61), 202804#(<= main_~i~0 60), 202811#(<= main_~i~0 67), 202810#(<= main_~i~0 66), 202809#(<= main_~i~0 65), 202808#(<= main_~i~0 64), 202815#(<= main_~i~0 71), 202814#(<= main_~i~0 70), 202813#(<= main_~i~0 69), 202812#(<= main_~i~0 68), 202819#(<= main_~i~0 75), 202818#(<= main_~i~0 74), 202817#(<= main_~i~0 73), 202816#(<= main_~i~0 72), 202823#(<= main_~i~0 79), 202822#(<= main_~i~0 78), 202821#(<= main_~i~0 77), 202820#(<= main_~i~0 76), 202827#(<= main_~i~0 83), 202826#(<= main_~i~0 82), 202825#(<= main_~i~0 81), 202824#(<= main_~i~0 80), 202831#(<= main_~i~0 87), 202830#(<= main_~i~0 86), 202829#(<= main_~i~0 85), 202828#(<= main_~i~0 84), 202835#(<= main_~i~0 91), 202834#(<= main_~i~0 90), 202833#(<= main_~i~0 89), 202832#(<= main_~i~0 88), 202839#(<= main_~i~0 95), 202838#(<= main_~i~0 94), 202837#(<= main_~i~0 93), 202836#(<= main_~i~0 92), 202843#(<= main_~i~0 99), 202842#(<= main_~i~0 98), 202841#(<= main_~i~0 97), 202840#(<= main_~i~0 96), 202847#(<= main_~i~0 103), 202846#(<= main_~i~0 102), 202845#(<= main_~i~0 101), 202844#(<= main_~i~0 100), 202851#(<= main_~i~0 107), 202850#(<= main_~i~0 106), 202849#(<= main_~i~0 105), 202848#(<= main_~i~0 104), 202855#(and (<= 2 main_~i~0) (<= main_~i~0 110)), 202854#(and (<= 1 main_~i~0) (<= main_~i~0 109)), 202853#(and (<= 0 main_~i~0) (<= main_~i~0 108)), 202852#(<= main_~i~0 108), 202743#false, 202742#true, 202747#(<= main_~i~0 3), 202746#(<= main_~i~0 2), 202745#(<= main_~i~0 1), 202744#(<= main_~i~0 0), 202751#(<= main_~i~0 7), 202750#(<= main_~i~0 6), 202749#(<= main_~i~0 5), 202748#(<= main_~i~0 4)] [2018-04-12 03:01:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30305 backedges. 0 proven. 30305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:04,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-12 03:01:04,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-12 03:01:04,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6112, Invalid=6770, Unknown=0, NotChecked=0, Total=12882 [2018-04-12 03:01:04,034 INFO L87 Difference]: Start difference. First operand 1572 states and 2124 transitions. Second operand 114 states. [2018-04-12 03:01:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:01:12,601 INFO L93 Difference]: Finished difference Result 1701 states and 2260 transitions. [2018-04-12 03:01:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-12 03:01:12,601 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 558 [2018-04-12 03:01:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:01:12,602 INFO L225 Difference]: With dead ends: 1701 [2018-04-12 03:01:12,602 INFO L226 Difference]: Without dead ends: 1701 [2018-04-12 03:01:12,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6322 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=18431, Invalid=31521, Unknown=0, NotChecked=0, Total=49952 [2018-04-12 03:01:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2018-04-12 03:01:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1586. [2018-04-12 03:01:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2018-04-12 03:01:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2143 transitions. [2018-04-12 03:01:12,610 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2143 transitions. Word has length 558 [2018-04-12 03:01:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:01:12,611 INFO L459 AbstractCegarLoop]: Abstraction has 1586 states and 2143 transitions. [2018-04-12 03:01:12,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-12 03:01:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2143 transitions. [2018-04-12 03:01:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-04-12 03:01:12,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:01:12,615 INFO L355 BasicCegarLoop]: trace histogram [112, 112, 111, 111, 111, 1, 1, 1, 1, 1, 1] [2018-04-12 03:01:12,615 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:01:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1759508726, now seen corresponding path program 111 times [2018-04-12 03:01:12,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:01:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:01:12,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:01:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30858 backedges. 0 proven. 30858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:16,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:01:16,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-04-12 03:01:16,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:01:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:16,500 INFO L182 omatonBuilderFactory]: Interpolants [206363#true, 206367#(<= main_~i~0 2), 206366#(<= main_~i~0 1), 206365#(<= main_~i~0 0), 206364#false, 206371#(<= main_~i~0 6), 206370#(<= main_~i~0 5), 206369#(<= main_~i~0 4), 206368#(<= main_~i~0 3), 206375#(<= main_~i~0 10), 206374#(<= main_~i~0 9), 206373#(<= main_~i~0 8), 206372#(<= main_~i~0 7), 206379#(<= main_~i~0 14), 206378#(<= main_~i~0 13), 206377#(<= main_~i~0 12), 206376#(<= main_~i~0 11), 206383#(<= main_~i~0 18), 206382#(<= main_~i~0 17), 206381#(<= main_~i~0 16), 206380#(<= main_~i~0 15), 206387#(<= main_~i~0 22), 206386#(<= main_~i~0 21), 206385#(<= main_~i~0 20), 206384#(<= main_~i~0 19), 206391#(<= main_~i~0 26), 206390#(<= main_~i~0 25), 206389#(<= main_~i~0 24), 206388#(<= main_~i~0 23), 206395#(<= main_~i~0 30), 206394#(<= main_~i~0 29), 206393#(<= main_~i~0 28), 206392#(<= main_~i~0 27), 206399#(<= main_~i~0 34), 206398#(<= main_~i~0 33), 206397#(<= main_~i~0 32), 206396#(<= main_~i~0 31), 206403#(<= main_~i~0 38), 206402#(<= main_~i~0 37), 206401#(<= main_~i~0 36), 206400#(<= main_~i~0 35), 206407#(<= main_~i~0 42), 206406#(<= main_~i~0 41), 206405#(<= main_~i~0 40), 206404#(<= main_~i~0 39), 206411#(<= main_~i~0 46), 206410#(<= main_~i~0 45), 206409#(<= main_~i~0 44), 206408#(<= main_~i~0 43), 206415#(<= main_~i~0 50), 206414#(<= main_~i~0 49), 206413#(<= main_~i~0 48), 206412#(<= main_~i~0 47), 206419#(<= main_~i~0 54), 206418#(<= main_~i~0 53), 206417#(<= main_~i~0 52), 206416#(<= main_~i~0 51), 206423#(<= main_~i~0 58), 206422#(<= main_~i~0 57), 206421#(<= main_~i~0 56), 206420#(<= main_~i~0 55), 206427#(<= main_~i~0 62), 206426#(<= main_~i~0 61), 206425#(<= main_~i~0 60), 206424#(<= main_~i~0 59), 206431#(<= main_~i~0 66), 206430#(<= main_~i~0 65), 206429#(<= main_~i~0 64), 206428#(<= main_~i~0 63), 206435#(<= main_~i~0 70), 206434#(<= main_~i~0 69), 206433#(<= main_~i~0 68), 206432#(<= main_~i~0 67), 206439#(<= main_~i~0 74), 206438#(<= main_~i~0 73), 206437#(<= main_~i~0 72), 206436#(<= main_~i~0 71), 206443#(<= main_~i~0 78), 206442#(<= main_~i~0 77), 206441#(<= main_~i~0 76), 206440#(<= main_~i~0 75), 206447#(<= main_~i~0 82), 206446#(<= main_~i~0 81), 206445#(<= main_~i~0 80), 206444#(<= main_~i~0 79), 206451#(<= main_~i~0 86), 206450#(<= main_~i~0 85), 206449#(<= main_~i~0 84), 206448#(<= main_~i~0 83), 206455#(<= main_~i~0 90), 206454#(<= main_~i~0 89), 206453#(<= main_~i~0 88), 206452#(<= main_~i~0 87), 206459#(<= main_~i~0 94), 206458#(<= main_~i~0 93), 206457#(<= main_~i~0 92), 206456#(<= main_~i~0 91), 206463#(<= main_~i~0 98), 206462#(<= main_~i~0 97), 206461#(<= main_~i~0 96), 206460#(<= main_~i~0 95), 206467#(<= main_~i~0 102), 206466#(<= main_~i~0 101), 206465#(<= main_~i~0 100), 206464#(<= main_~i~0 99), 206471#(<= main_~i~0 106), 206470#(<= main_~i~0 105), 206469#(<= main_~i~0 104), 206468#(<= main_~i~0 103), 206475#(<= main_~i~0 110), 206474#(<= main_~i~0 109), 206473#(<= main_~i~0 108), 206472#(<= main_~i~0 107), 206477#(and (<= 1 main_~i~0) (<= main_~i~0 111)), 206476#(and (<= 0 main_~i~0) (<= main_~i~0 110))] [2018-04-12 03:01:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30858 backedges. 0 proven. 30858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:16,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-04-12 03:01:16,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-04-12 03:01:16,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6333, Invalid=6777, Unknown=0, NotChecked=0, Total=13110 [2018-04-12 03:01:16,502 INFO L87 Difference]: Start difference. First operand 1586 states and 2143 transitions. Second operand 115 states. [2018-04-12 03:01:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:01:25,082 INFO L93 Difference]: Finished difference Result 1716 states and 2280 transitions. [2018-04-12 03:01:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-12 03:01:25,082 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 563 [2018-04-12 03:01:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:01:25,083 INFO L225 Difference]: With dead ends: 1716 [2018-04-12 03:01:25,083 INFO L226 Difference]: Without dead ends: 1716 [2018-04-12 03:01:25,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6326 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=18987, Invalid=31863, Unknown=0, NotChecked=0, Total=50850 [2018-04-12 03:01:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2018-04-12 03:01:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1600. [2018-04-12 03:01:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-04-12 03:01:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2162 transitions. [2018-04-12 03:01:25,092 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2162 transitions. Word has length 563 [2018-04-12 03:01:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:01:25,093 INFO L459 AbstractCegarLoop]: Abstraction has 1600 states and 2162 transitions. [2018-04-12 03:01:25,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-04-12 03:01:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2162 transitions. [2018-04-12 03:01:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-04-12 03:01:25,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:01:25,095 INFO L355 BasicCegarLoop]: trace histogram [113, 113, 112, 112, 112, 1, 1, 1, 1, 1, 1] [2018-04-12 03:01:25,095 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:01:25,095 INFO L82 PathProgramCache]: Analyzing trace with hash 602206141, now seen corresponding path program 112 times [2018-04-12 03:01:25,096 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:01:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:01:25,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:01:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 31416 backedges. 0 proven. 31416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:28,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:01:28,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-04-12 03:01:28,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:01:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:28,777 INFO L182 omatonBuilderFactory]: Interpolants [210019#(<= main_~i~0 1), 210018#(<= main_~i~0 0), 210017#false, 210016#true, 210023#(<= main_~i~0 5), 210022#(<= main_~i~0 4), 210021#(<= main_~i~0 3), 210020#(<= main_~i~0 2), 210027#(<= main_~i~0 9), 210026#(<= main_~i~0 8), 210025#(<= main_~i~0 7), 210024#(<= main_~i~0 6), 210031#(<= main_~i~0 13), 210030#(<= main_~i~0 12), 210029#(<= main_~i~0 11), 210028#(<= main_~i~0 10), 210035#(<= main_~i~0 17), 210034#(<= main_~i~0 16), 210033#(<= main_~i~0 15), 210032#(<= main_~i~0 14), 210039#(<= main_~i~0 21), 210038#(<= main_~i~0 20), 210037#(<= main_~i~0 19), 210036#(<= main_~i~0 18), 210043#(<= main_~i~0 25), 210042#(<= main_~i~0 24), 210041#(<= main_~i~0 23), 210040#(<= main_~i~0 22), 210047#(<= main_~i~0 29), 210046#(<= main_~i~0 28), 210045#(<= main_~i~0 27), 210044#(<= main_~i~0 26), 210051#(<= main_~i~0 33), 210050#(<= main_~i~0 32), 210049#(<= main_~i~0 31), 210048#(<= main_~i~0 30), 210055#(<= main_~i~0 37), 210054#(<= main_~i~0 36), 210053#(<= main_~i~0 35), 210052#(<= main_~i~0 34), 210059#(<= main_~i~0 41), 210058#(<= main_~i~0 40), 210057#(<= main_~i~0 39), 210056#(<= main_~i~0 38), 210063#(<= main_~i~0 45), 210062#(<= main_~i~0 44), 210061#(<= main_~i~0 43), 210060#(<= main_~i~0 42), 210067#(<= main_~i~0 49), 210066#(<= main_~i~0 48), 210065#(<= main_~i~0 47), 210064#(<= main_~i~0 46), 210071#(<= main_~i~0 53), 210070#(<= main_~i~0 52), 210069#(<= main_~i~0 51), 210068#(<= main_~i~0 50), 210075#(<= main_~i~0 57), 210074#(<= main_~i~0 56), 210073#(<= main_~i~0 55), 210072#(<= main_~i~0 54), 210079#(<= main_~i~0 61), 210078#(<= main_~i~0 60), 210077#(<= main_~i~0 59), 210076#(<= main_~i~0 58), 210083#(<= main_~i~0 65), 210082#(<= main_~i~0 64), 210081#(<= main_~i~0 63), 210080#(<= main_~i~0 62), 210087#(<= main_~i~0 69), 210086#(<= main_~i~0 68), 210085#(<= main_~i~0 67), 210084#(<= main_~i~0 66), 210091#(<= main_~i~0 73), 210090#(<= main_~i~0 72), 210089#(<= main_~i~0 71), 210088#(<= main_~i~0 70), 210095#(<= main_~i~0 77), 210094#(<= main_~i~0 76), 210093#(<= main_~i~0 75), 210092#(<= main_~i~0 74), 210099#(<= main_~i~0 81), 210098#(<= main_~i~0 80), 210097#(<= main_~i~0 79), 210096#(<= main_~i~0 78), 210103#(<= main_~i~0 85), 210102#(<= main_~i~0 84), 210101#(<= main_~i~0 83), 210100#(<= main_~i~0 82), 210107#(<= main_~i~0 89), 210106#(<= main_~i~0 88), 210105#(<= main_~i~0 87), 210104#(<= main_~i~0 86), 210111#(<= main_~i~0 93), 210110#(<= main_~i~0 92), 210109#(<= main_~i~0 91), 210108#(<= main_~i~0 90), 210115#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 210114#(<= main_~i~0 96), 210113#(<= main_~i~0 95), 210112#(<= main_~i~0 94), 210119#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 210118#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 210117#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 210116#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 210123#(and (<= main_~i~0 104) (<= 8 main_~i~0)), 210122#(and (<= 7 main_~i~0) (<= main_~i~0 103)), 210121#(and (<= 6 main_~i~0) (<= main_~i~0 102)), 210120#(and (<= 5 main_~i~0) (<= main_~i~0 101)), 210127#(and (<= 12 main_~i~0) (<= main_~i~0 108)), 210126#(and (<= 11 main_~i~0) (<= main_~i~0 107)), 210125#(and (<= main_~i~0 106) (<= 10 main_~i~0)), 210124#(and (<= 9 main_~i~0) (<= main_~i~0 105)), 210131#(and (<= main_~i~0 112) (<= 16 main_~i~0)), 210130#(and (<= main_~i~0 111) (<= 15 main_~i~0)), 210129#(and (<= main_~i~0 110) (<= 14 main_~i~0)), 210128#(and (<= main_~i~0 109) (<= 13 main_~i~0))] [2018-04-12 03:01:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31416 backedges. 0 proven. 31416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:28,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-12 03:01:28,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-12 03:01:28,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4886, Invalid=8454, Unknown=0, NotChecked=0, Total=13340 [2018-04-12 03:01:28,778 INFO L87 Difference]: Start difference. First operand 1600 states and 2162 transitions. Second operand 116 states. [2018-04-12 03:01:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:01:41,090 INFO L93 Difference]: Finished difference Result 1731 states and 2300 transitions. [2018-04-12 03:01:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-12 03:01:41,090 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 568 [2018-04-12 03:01:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:01:41,092 INFO L225 Difference]: With dead ends: 1731 [2018-04-12 03:01:41,092 INFO L226 Difference]: Without dead ends: 1731 [2018-04-12 03:01:41,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7879 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=16071, Invalid=35685, Unknown=0, NotChecked=0, Total=51756 [2018-04-12 03:01:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-04-12 03:01:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1614. [2018-04-12 03:01:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2018-04-12 03:01:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2181 transitions. [2018-04-12 03:01:41,101 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2181 transitions. Word has length 568 [2018-04-12 03:01:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:01:41,101 INFO L459 AbstractCegarLoop]: Abstraction has 1614 states and 2181 transitions. [2018-04-12 03:01:41,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-12 03:01:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2181 transitions. [2018-04-12 03:01:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-04-12 03:01:41,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:01:41,104 INFO L355 BasicCegarLoop]: trace histogram [114, 114, 113, 113, 113, 1, 1, 1, 1, 1, 1] [2018-04-12 03:01:41,104 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:01:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash -954327722, now seen corresponding path program 113 times [2018-04-12 03:01:41,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:01:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:01:41,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:01:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 31979 backedges. 0 proven. 31979 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:45,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:01:45,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-04-12 03:01:45,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:01:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:45,211 INFO L182 omatonBuilderFactory]: Interpolants [213763#(<= main_~i~0 60), 213762#(<= main_~i~0 59), 213761#(<= main_~i~0 58), 213760#(<= main_~i~0 57), 213767#(<= main_~i~0 64), 213766#(<= main_~i~0 63), 213765#(<= main_~i~0 62), 213764#(<= main_~i~0 61), 213771#(<= main_~i~0 68), 213770#(<= main_~i~0 67), 213769#(<= main_~i~0 66), 213768#(<= main_~i~0 65), 213775#(<= main_~i~0 72), 213774#(<= main_~i~0 71), 213773#(<= main_~i~0 70), 213772#(<= main_~i~0 69), 213779#(<= main_~i~0 76), 213778#(<= main_~i~0 75), 213777#(<= main_~i~0 74), 213776#(<= main_~i~0 73), 213783#(<= main_~i~0 80), 213782#(<= main_~i~0 79), 213781#(<= main_~i~0 78), 213780#(<= main_~i~0 77), 213787#(<= main_~i~0 84), 213786#(<= main_~i~0 83), 213785#(<= main_~i~0 82), 213784#(<= main_~i~0 81), 213791#(<= main_~i~0 88), 213790#(<= main_~i~0 87), 213789#(<= main_~i~0 86), 213788#(<= main_~i~0 85), 213795#(<= main_~i~0 92), 213794#(<= main_~i~0 91), 213793#(<= main_~i~0 90), 213792#(<= main_~i~0 89), 213799#(<= main_~i~0 96), 213798#(<= main_~i~0 95), 213797#(<= main_~i~0 94), 213796#(<= main_~i~0 93), 213803#(<= main_~i~0 100), 213802#(<= main_~i~0 99), 213801#(<= main_~i~0 98), 213800#(<= main_~i~0 97), 213807#(<= main_~i~0 104), 213806#(<= main_~i~0 103), 213805#(<= main_~i~0 102), 213804#(<= main_~i~0 101), 213811#(<= main_~i~0 108), 213810#(<= main_~i~0 107), 213809#(<= main_~i~0 106), 213808#(<= main_~i~0 105), 213815#(<= main_~i~0 112), 213814#(<= main_~i~0 111), 213813#(<= main_~i~0 110), 213812#(<= main_~i~0 109), 213817#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 213816#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 213703#(<= main_~i~0 0), 213702#false, 213701#true, 213707#(<= main_~i~0 4), 213706#(<= main_~i~0 3), 213705#(<= main_~i~0 2), 213704#(<= main_~i~0 1), 213711#(<= main_~i~0 8), 213710#(<= main_~i~0 7), 213709#(<= main_~i~0 6), 213708#(<= main_~i~0 5), 213715#(<= main_~i~0 12), 213714#(<= main_~i~0 11), 213713#(<= main_~i~0 10), 213712#(<= main_~i~0 9), 213719#(<= main_~i~0 16), 213718#(<= main_~i~0 15), 213717#(<= main_~i~0 14), 213716#(<= main_~i~0 13), 213723#(<= main_~i~0 20), 213722#(<= main_~i~0 19), 213721#(<= main_~i~0 18), 213720#(<= main_~i~0 17), 213727#(<= main_~i~0 24), 213726#(<= main_~i~0 23), 213725#(<= main_~i~0 22), 213724#(<= main_~i~0 21), 213731#(<= main_~i~0 28), 213730#(<= main_~i~0 27), 213729#(<= main_~i~0 26), 213728#(<= main_~i~0 25), 213735#(<= main_~i~0 32), 213734#(<= main_~i~0 31), 213733#(<= main_~i~0 30), 213732#(<= main_~i~0 29), 213739#(<= main_~i~0 36), 213738#(<= main_~i~0 35), 213737#(<= main_~i~0 34), 213736#(<= main_~i~0 33), 213743#(<= main_~i~0 40), 213742#(<= main_~i~0 39), 213741#(<= main_~i~0 38), 213740#(<= main_~i~0 37), 213747#(<= main_~i~0 44), 213746#(<= main_~i~0 43), 213745#(<= main_~i~0 42), 213744#(<= main_~i~0 41), 213751#(<= main_~i~0 48), 213750#(<= main_~i~0 47), 213749#(<= main_~i~0 46), 213748#(<= main_~i~0 45), 213755#(<= main_~i~0 52), 213754#(<= main_~i~0 51), 213753#(<= main_~i~0 50), 213752#(<= main_~i~0 49), 213759#(<= main_~i~0 56), 213758#(<= main_~i~0 55), 213757#(<= main_~i~0 54), 213756#(<= main_~i~0 53)] [2018-04-12 03:01:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 31979 backedges. 0 proven. 31979 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:45,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-12 03:01:45,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-12 03:01:45,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6560, Invalid=7012, Unknown=0, NotChecked=0, Total=13572 [2018-04-12 03:01:45,214 INFO L87 Difference]: Start difference. First operand 1614 states and 2181 transitions. Second operand 117 states. [2018-04-12 03:01:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:01:53,952 INFO L93 Difference]: Finished difference Result 1746 states and 2320 transitions. [2018-04-12 03:01:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-12 03:01:53,952 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 573 [2018-04-12 03:01:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:01:53,953 INFO L225 Difference]: With dead ends: 1746 [2018-04-12 03:01:53,953 INFO L226 Difference]: Without dead ends: 1746 [2018-04-12 03:01:53,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6553 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=19668, Invalid=33002, Unknown=0, NotChecked=0, Total=52670 [2018-04-12 03:01:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-04-12 03:01:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1628. [2018-04-12 03:01:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-04-12 03:01:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2200 transitions. [2018-04-12 03:01:53,964 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2200 transitions. Word has length 573 [2018-04-12 03:01:53,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:01:53,965 INFO L459 AbstractCegarLoop]: Abstraction has 1628 states and 2200 transitions. [2018-04-12 03:01:53,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-12 03:01:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2200 transitions. [2018-04-12 03:01:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-04-12 03:01:53,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:01:53,967 INFO L355 BasicCegarLoop]: trace histogram [115, 115, 114, 114, 114, 1, 1, 1, 1, 1, 1] [2018-04-12 03:01:53,967 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:01:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash 246318941, now seen corresponding path program 114 times [2018-04-12 03:01:53,968 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:01:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:01:54,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:01:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 32547 backedges. 0 proven. 32547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:57,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:01:57,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-04-12 03:01:57,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:01:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:57,988 INFO L182 omatonBuilderFactory]: Interpolants [217419#false, 217418#true, 217423#(<= main_~i~0 3), 217422#(<= main_~i~0 2), 217421#(<= main_~i~0 1), 217420#(<= main_~i~0 0), 217427#(<= main_~i~0 7), 217426#(<= main_~i~0 6), 217425#(<= main_~i~0 5), 217424#(<= main_~i~0 4), 217431#(<= main_~i~0 11), 217430#(<= main_~i~0 10), 217429#(<= main_~i~0 9), 217428#(<= main_~i~0 8), 217435#(<= main_~i~0 15), 217434#(<= main_~i~0 14), 217433#(<= main_~i~0 13), 217432#(<= main_~i~0 12), 217439#(<= main_~i~0 19), 217438#(<= main_~i~0 18), 217437#(<= main_~i~0 17), 217436#(<= main_~i~0 16), 217443#(<= main_~i~0 23), 217442#(<= main_~i~0 22), 217441#(<= main_~i~0 21), 217440#(<= main_~i~0 20), 217447#(<= main_~i~0 27), 217446#(<= main_~i~0 26), 217445#(<= main_~i~0 25), 217444#(<= main_~i~0 24), 217451#(<= main_~i~0 31), 217450#(<= main_~i~0 30), 217449#(<= main_~i~0 29), 217448#(<= main_~i~0 28), 217455#(<= main_~i~0 35), 217454#(<= main_~i~0 34), 217453#(<= main_~i~0 33), 217452#(<= main_~i~0 32), 217459#(<= main_~i~0 39), 217458#(<= main_~i~0 38), 217457#(<= main_~i~0 37), 217456#(<= main_~i~0 36), 217463#(<= main_~i~0 43), 217462#(<= main_~i~0 42), 217461#(<= main_~i~0 41), 217460#(<= main_~i~0 40), 217467#(<= main_~i~0 47), 217466#(<= main_~i~0 46), 217465#(<= main_~i~0 45), 217464#(<= main_~i~0 44), 217471#(<= main_~i~0 51), 217470#(<= main_~i~0 50), 217469#(<= main_~i~0 49), 217468#(<= main_~i~0 48), 217475#(<= main_~i~0 55), 217474#(<= main_~i~0 54), 217473#(<= main_~i~0 53), 217472#(<= main_~i~0 52), 217479#(<= main_~i~0 59), 217478#(<= main_~i~0 58), 217477#(<= main_~i~0 57), 217476#(<= main_~i~0 56), 217483#(<= main_~i~0 63), 217482#(<= main_~i~0 62), 217481#(<= main_~i~0 61), 217480#(<= main_~i~0 60), 217487#(<= main_~i~0 67), 217486#(<= main_~i~0 66), 217485#(<= main_~i~0 65), 217484#(<= main_~i~0 64), 217491#(<= main_~i~0 71), 217490#(<= main_~i~0 70), 217489#(<= main_~i~0 69), 217488#(<= main_~i~0 68), 217495#(<= main_~i~0 75), 217494#(<= main_~i~0 74), 217493#(<= main_~i~0 73), 217492#(<= main_~i~0 72), 217499#(<= main_~i~0 79), 217498#(<= main_~i~0 78), 217497#(<= main_~i~0 77), 217496#(<= main_~i~0 76), 217503#(<= main_~i~0 83), 217502#(<= main_~i~0 82), 217501#(<= main_~i~0 81), 217500#(<= main_~i~0 80), 217507#(<= main_~i~0 87), 217506#(<= main_~i~0 86), 217505#(<= main_~i~0 85), 217504#(<= main_~i~0 84), 217511#(<= main_~i~0 91), 217510#(<= main_~i~0 90), 217509#(<= main_~i~0 89), 217508#(<= main_~i~0 88), 217515#(<= main_~i~0 95), 217514#(<= main_~i~0 94), 217513#(<= main_~i~0 93), 217512#(<= main_~i~0 92), 217519#(<= main_~i~0 99), 217518#(<= main_~i~0 98), 217517#(<= main_~i~0 97), 217516#(<= main_~i~0 96), 217523#(<= main_~i~0 103), 217522#(<= main_~i~0 102), 217521#(<= main_~i~0 101), 217520#(<= main_~i~0 100), 217527#(<= main_~i~0 107), 217526#(<= main_~i~0 106), 217525#(<= main_~i~0 105), 217524#(<= main_~i~0 104), 217531#(<= main_~i~0 111), 217530#(<= main_~i~0 110), 217529#(<= main_~i~0 109), 217528#(<= main_~i~0 108), 217535#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 217534#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 217533#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 217532#(<= main_~i~0 112)] [2018-04-12 03:01:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32547 backedges. 0 proven. 32547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:01:57,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-12 03:01:57,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-12 03:01:57,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6562, Invalid=7244, Unknown=0, NotChecked=0, Total=13806 [2018-04-12 03:01:57,990 INFO L87 Difference]: Start difference. First operand 1628 states and 2200 transitions. Second operand 118 states. [2018-04-12 03:02:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:02:07,250 INFO L93 Difference]: Finished difference Result 1761 states and 2340 transitions. [2018-04-12 03:02:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-04-12 03:02:07,250 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 578 [2018-04-12 03:02:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:02:07,251 INFO L225 Difference]: With dead ends: 1761 [2018-04-12 03:02:07,252 INFO L226 Difference]: Without dead ends: 1761 [2018-04-12 03:02:07,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6780 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=19785, Invalid=33807, Unknown=0, NotChecked=0, Total=53592 [2018-04-12 03:02:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2018-04-12 03:02:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1642. [2018-04-12 03:02:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2018-04-12 03:02:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2219 transitions. [2018-04-12 03:02:07,260 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2219 transitions. Word has length 578 [2018-04-12 03:02:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:02:07,260 INFO L459 AbstractCegarLoop]: Abstraction has 1642 states and 2219 transitions. [2018-04-12 03:02:07,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-12 03:02:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2219 transitions. [2018-04-12 03:02:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-04-12 03:02:07,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:02:07,263 INFO L355 BasicCegarLoop]: trace histogram [116, 116, 115, 115, 115, 1, 1, 1, 1, 1, 1] [2018-04-12 03:02:07,263 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:02:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -289257034, now seen corresponding path program 115 times [2018-04-12 03:02:07,263 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:02:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:02:07,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:02:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 33120 backedges. 0 proven. 33120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:11,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:02:11,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-04-12 03:02:11,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:02:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:11,439 INFO L182 omatonBuilderFactory]: Interpolants [221187#(<= main_~i~0 18), 221186#(<= main_~i~0 17), 221185#(<= main_~i~0 16), 221184#(<= main_~i~0 15), 221191#(<= main_~i~0 22), 221190#(<= main_~i~0 21), 221189#(<= main_~i~0 20), 221188#(<= main_~i~0 19), 221195#(<= main_~i~0 26), 221194#(<= main_~i~0 25), 221193#(<= main_~i~0 24), 221192#(<= main_~i~0 23), 221199#(<= main_~i~0 30), 221198#(<= main_~i~0 29), 221197#(<= main_~i~0 28), 221196#(<= main_~i~0 27), 221203#(<= main_~i~0 34), 221202#(<= main_~i~0 33), 221201#(<= main_~i~0 32), 221200#(<= main_~i~0 31), 221207#(<= main_~i~0 38), 221206#(<= main_~i~0 37), 221205#(<= main_~i~0 36), 221204#(<= main_~i~0 35), 221211#(<= main_~i~0 42), 221210#(<= main_~i~0 41), 221209#(<= main_~i~0 40), 221208#(<= main_~i~0 39), 221215#(<= main_~i~0 46), 221214#(<= main_~i~0 45), 221213#(<= main_~i~0 44), 221212#(<= main_~i~0 43), 221219#(<= main_~i~0 50), 221218#(<= main_~i~0 49), 221217#(<= main_~i~0 48), 221216#(<= main_~i~0 47), 221223#(<= main_~i~0 54), 221222#(<= main_~i~0 53), 221221#(<= main_~i~0 52), 221220#(<= main_~i~0 51), 221227#(<= main_~i~0 58), 221226#(<= main_~i~0 57), 221225#(<= main_~i~0 56), 221224#(<= main_~i~0 55), 221231#(<= main_~i~0 62), 221230#(<= main_~i~0 61), 221229#(<= main_~i~0 60), 221228#(<= main_~i~0 59), 221235#(<= main_~i~0 66), 221234#(<= main_~i~0 65), 221233#(<= main_~i~0 64), 221232#(<= main_~i~0 63), 221239#(<= main_~i~0 70), 221238#(<= main_~i~0 69), 221237#(<= main_~i~0 68), 221236#(<= main_~i~0 67), 221243#(<= main_~i~0 74), 221242#(<= main_~i~0 73), 221241#(<= main_~i~0 72), 221240#(<= main_~i~0 71), 221247#(<= main_~i~0 78), 221246#(<= main_~i~0 77), 221245#(<= main_~i~0 76), 221244#(<= main_~i~0 75), 221251#(<= main_~i~0 82), 221250#(<= main_~i~0 81), 221249#(<= main_~i~0 80), 221248#(<= main_~i~0 79), 221255#(<= main_~i~0 86), 221254#(<= main_~i~0 85), 221253#(<= main_~i~0 84), 221252#(<= main_~i~0 83), 221259#(<= main_~i~0 90), 221258#(<= main_~i~0 89), 221257#(<= main_~i~0 88), 221256#(<= main_~i~0 87), 221263#(<= main_~i~0 94), 221262#(<= main_~i~0 93), 221261#(<= main_~i~0 92), 221260#(<= main_~i~0 91), 221267#(<= main_~i~0 98), 221266#(<= main_~i~0 97), 221265#(<= main_~i~0 96), 221264#(<= main_~i~0 95), 221271#(<= main_~i~0 102), 221270#(<= main_~i~0 101), 221269#(<= main_~i~0 100), 221268#(<= main_~i~0 99), 221275#(<= main_~i~0 106), 221274#(<= main_~i~0 105), 221273#(<= main_~i~0 104), 221272#(<= main_~i~0 103), 221279#(<= main_~i~0 110), 221278#(<= main_~i~0 109), 221277#(<= main_~i~0 108), 221276#(<= main_~i~0 107), 221283#(<= main_~i~0 114), 221282#(<= main_~i~0 113), 221281#(<= main_~i~0 112), 221280#(<= main_~i~0 111), 221285#(and (<= 1 main_~i~0) (<= main_~i~0 115)), 221284#(and (<= 0 main_~i~0) (<= main_~i~0 114)), 221167#true, 221171#(<= main_~i~0 2), 221170#(<= main_~i~0 1), 221169#(<= main_~i~0 0), 221168#false, 221175#(<= main_~i~0 6), 221174#(<= main_~i~0 5), 221173#(<= main_~i~0 4), 221172#(<= main_~i~0 3), 221179#(<= main_~i~0 10), 221178#(<= main_~i~0 9), 221177#(<= main_~i~0 8), 221176#(<= main_~i~0 7), 221183#(<= main_~i~0 14), 221182#(<= main_~i~0 13), 221181#(<= main_~i~0 12), 221180#(<= main_~i~0 11)] [2018-04-12 03:02:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 33120 backedges. 0 proven. 33120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:11,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-12 03:02:11,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-12 03:02:11,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6791, Invalid=7251, Unknown=0, NotChecked=0, Total=14042 [2018-04-12 03:02:11,441 INFO L87 Difference]: Start difference. First operand 1642 states and 2219 transitions. Second operand 119 states. [2018-04-12 03:02:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:02:20,758 INFO L93 Difference]: Finished difference Result 1776 states and 2360 transitions. [2018-04-12 03:02:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-04-12 03:02:20,758 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 583 [2018-04-12 03:02:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:02:20,760 INFO L225 Difference]: With dead ends: 1776 [2018-04-12 03:02:20,760 INFO L226 Difference]: Without dead ends: 1776 [2018-04-12 03:02:20,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6784 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=20361, Invalid=34161, Unknown=0, NotChecked=0, Total=54522 [2018-04-12 03:02:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2018-04-12 03:02:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1656. [2018-04-12 03:02:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-04-12 03:02:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2238 transitions. [2018-04-12 03:02:20,781 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2238 transitions. Word has length 583 [2018-04-12 03:02:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:02:20,781 INFO L459 AbstractCegarLoop]: Abstraction has 1656 states and 2238 transitions. [2018-04-12 03:02:20,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-12 03:02:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2238 transitions. [2018-04-12 03:02:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-04-12 03:02:20,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:02:20,786 INFO L355 BasicCegarLoop]: trace histogram [117, 117, 116, 116, 116, 1, 1, 1, 1, 1, 1] [2018-04-12 03:02:20,786 INFO L408 AbstractCegarLoop]: === Iteration 117 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:02:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash -963176707, now seen corresponding path program 116 times [2018-04-12 03:02:20,787 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:02:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:02:20,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:02:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33698 backedges. 0 proven. 33698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:25,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:02:25,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-04-12 03:02:25,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:02:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:25,035 INFO L182 omatonBuilderFactory]: Interpolants [225027#(<= main_~i~0 77), 225026#(<= main_~i~0 76), 225025#(<= main_~i~0 75), 225024#(<= main_~i~0 74), 225031#(<= main_~i~0 81), 225030#(<= main_~i~0 80), 225029#(<= main_~i~0 79), 225028#(<= main_~i~0 78), 225035#(<= main_~i~0 85), 225034#(<= main_~i~0 84), 225033#(<= main_~i~0 83), 225032#(<= main_~i~0 82), 225039#(<= main_~i~0 89), 225038#(<= main_~i~0 88), 225037#(<= main_~i~0 87), 225036#(<= main_~i~0 86), 225043#(<= main_~i~0 93), 225042#(<= main_~i~0 92), 225041#(<= main_~i~0 91), 225040#(<= main_~i~0 90), 225047#(<= main_~i~0 97), 225046#(<= main_~i~0 96), 225045#(<= main_~i~0 95), 225044#(<= main_~i~0 94), 225051#(<= main_~i~0 101), 225050#(<= main_~i~0 100), 225049#(<= main_~i~0 99), 225048#(<= main_~i~0 98), 225055#(<= main_~i~0 105), 225054#(<= main_~i~0 104), 225053#(<= main_~i~0 103), 225052#(<= main_~i~0 102), 225059#(<= main_~i~0 109), 225058#(<= main_~i~0 108), 225057#(<= main_~i~0 107), 225056#(<= main_~i~0 106), 225063#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 225062#(<= main_~i~0 112), 225061#(<= main_~i~0 111), 225060#(<= main_~i~0 110), 225067#(and (<= 4 main_~i~0) (<= main_~i~0 116)), 225066#(and (<= main_~i~0 115) (<= 3 main_~i~0)), 225065#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 225064#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 224951#(<= main_~i~0 1), 224950#(<= main_~i~0 0), 224949#false, 224948#true, 224955#(<= main_~i~0 5), 224954#(<= main_~i~0 4), 224953#(<= main_~i~0 3), 224952#(<= main_~i~0 2), 224959#(<= main_~i~0 9), 224958#(<= main_~i~0 8), 224957#(<= main_~i~0 7), 224956#(<= main_~i~0 6), 224963#(<= main_~i~0 13), 224962#(<= main_~i~0 12), 224961#(<= main_~i~0 11), 224960#(<= main_~i~0 10), 224967#(<= main_~i~0 17), 224966#(<= main_~i~0 16), 224965#(<= main_~i~0 15), 224964#(<= main_~i~0 14), 224971#(<= main_~i~0 21), 224970#(<= main_~i~0 20), 224969#(<= main_~i~0 19), 224968#(<= main_~i~0 18), 224975#(<= main_~i~0 25), 224974#(<= main_~i~0 24), 224973#(<= main_~i~0 23), 224972#(<= main_~i~0 22), 224979#(<= main_~i~0 29), 224978#(<= main_~i~0 28), 224977#(<= main_~i~0 27), 224976#(<= main_~i~0 26), 224983#(<= main_~i~0 33), 224982#(<= main_~i~0 32), 224981#(<= main_~i~0 31), 224980#(<= main_~i~0 30), 224987#(<= main_~i~0 37), 224986#(<= main_~i~0 36), 224985#(<= main_~i~0 35), 224984#(<= main_~i~0 34), 224991#(<= main_~i~0 41), 224990#(<= main_~i~0 40), 224989#(<= main_~i~0 39), 224988#(<= main_~i~0 38), 224995#(<= main_~i~0 45), 224994#(<= main_~i~0 44), 224993#(<= main_~i~0 43), 224992#(<= main_~i~0 42), 224999#(<= main_~i~0 49), 224998#(<= main_~i~0 48), 224997#(<= main_~i~0 47), 224996#(<= main_~i~0 46), 225003#(<= main_~i~0 53), 225002#(<= main_~i~0 52), 225001#(<= main_~i~0 51), 225000#(<= main_~i~0 50), 225007#(<= main_~i~0 57), 225006#(<= main_~i~0 56), 225005#(<= main_~i~0 55), 225004#(<= main_~i~0 54), 225011#(<= main_~i~0 61), 225010#(<= main_~i~0 60), 225009#(<= main_~i~0 59), 225008#(<= main_~i~0 58), 225015#(<= main_~i~0 65), 225014#(<= main_~i~0 64), 225013#(<= main_~i~0 63), 225012#(<= main_~i~0 62), 225019#(<= main_~i~0 69), 225018#(<= main_~i~0 68), 225017#(<= main_~i~0 67), 225016#(<= main_~i~0 66), 225023#(<= main_~i~0 73), 225022#(<= main_~i~0 72), 225021#(<= main_~i~0 71), 225020#(<= main_~i~0 70)] [2018-04-12 03:02:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 33698 backedges. 0 proven. 33698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:25,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-12 03:02:25,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-12 03:02:25,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=7714, Unknown=0, NotChecked=0, Total=14280 [2018-04-12 03:02:25,037 INFO L87 Difference]: Start difference. First operand 1656 states and 2238 transitions. Second operand 120 states. [2018-04-12 03:02:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:02:35,206 INFO L93 Difference]: Finished difference Result 1791 states and 2380 transitions. [2018-04-12 03:02:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-12 03:02:35,206 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 588 [2018-04-12 03:02:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:02:35,208 INFO L225 Difference]: With dead ends: 1791 [2018-04-12 03:02:35,208 INFO L226 Difference]: Without dead ends: 1791 [2018-04-12 03:02:35,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7237 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=20019, Invalid=35441, Unknown=0, NotChecked=0, Total=55460 [2018-04-12 03:02:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2018-04-12 03:02:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1670. [2018-04-12 03:02:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2018-04-12 03:02:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2257 transitions. [2018-04-12 03:02:35,219 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2257 transitions. Word has length 588 [2018-04-12 03:02:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:02:35,220 INFO L459 AbstractCegarLoop]: Abstraction has 1670 states and 2257 transitions. [2018-04-12 03:02:35,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-12 03:02:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2257 transitions. [2018-04-12 03:02:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-04-12 03:02:35,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:02:35,222 INFO L355 BasicCegarLoop]: trace histogram [118, 118, 117, 117, 117, 1, 1, 1, 1, 1, 1] [2018-04-12 03:02:35,223 INFO L408 AbstractCegarLoop]: === Iteration 118 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:02:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash -35488234, now seen corresponding path program 117 times [2018-04-12 03:02:35,223 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:02:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:02:35,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:02:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34281 backedges. 0 proven. 34281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:39,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:02:39,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-04-12 03:02:39,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:02:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:39,552 INFO L182 omatonBuilderFactory]: Interpolants [228867#(<= main_~i~0 104), 228866#(<= main_~i~0 103), 228865#(<= main_~i~0 102), 228864#(<= main_~i~0 101), 228871#(<= main_~i~0 108), 228870#(<= main_~i~0 107), 228869#(<= main_~i~0 106), 228868#(<= main_~i~0 105), 228875#(<= main_~i~0 112), 228874#(<= main_~i~0 111), 228873#(<= main_~i~0 110), 228872#(<= main_~i~0 109), 228879#(<= main_~i~0 116), 228878#(<= main_~i~0 115), 228877#(<= main_~i~0 114), 228876#(<= main_~i~0 113), 228881#(and (<= 1 main_~i~0) (<= main_~i~0 117)), 228880#(and (<= 0 main_~i~0) (<= main_~i~0 116)), 228763#(<= main_~i~0 0), 228762#false, 228761#true, 228767#(<= main_~i~0 4), 228766#(<= main_~i~0 3), 228765#(<= main_~i~0 2), 228764#(<= main_~i~0 1), 228771#(<= main_~i~0 8), 228770#(<= main_~i~0 7), 228769#(<= main_~i~0 6), 228768#(<= main_~i~0 5), 228775#(<= main_~i~0 12), 228774#(<= main_~i~0 11), 228773#(<= main_~i~0 10), 228772#(<= main_~i~0 9), 228779#(<= main_~i~0 16), 228778#(<= main_~i~0 15), 228777#(<= main_~i~0 14), 228776#(<= main_~i~0 13), 228783#(<= main_~i~0 20), 228782#(<= main_~i~0 19), 228781#(<= main_~i~0 18), 228780#(<= main_~i~0 17), 228787#(<= main_~i~0 24), 228786#(<= main_~i~0 23), 228785#(<= main_~i~0 22), 228784#(<= main_~i~0 21), 228791#(<= main_~i~0 28), 228790#(<= main_~i~0 27), 228789#(<= main_~i~0 26), 228788#(<= main_~i~0 25), 228795#(<= main_~i~0 32), 228794#(<= main_~i~0 31), 228793#(<= main_~i~0 30), 228792#(<= main_~i~0 29), 228799#(<= main_~i~0 36), 228798#(<= main_~i~0 35), 228797#(<= main_~i~0 34), 228796#(<= main_~i~0 33), 228803#(<= main_~i~0 40), 228802#(<= main_~i~0 39), 228801#(<= main_~i~0 38), 228800#(<= main_~i~0 37), 228807#(<= main_~i~0 44), 228806#(<= main_~i~0 43), 228805#(<= main_~i~0 42), 228804#(<= main_~i~0 41), 228811#(<= main_~i~0 48), 228810#(<= main_~i~0 47), 228809#(<= main_~i~0 46), 228808#(<= main_~i~0 45), 228815#(<= main_~i~0 52), 228814#(<= main_~i~0 51), 228813#(<= main_~i~0 50), 228812#(<= main_~i~0 49), 228819#(<= main_~i~0 56), 228818#(<= main_~i~0 55), 228817#(<= main_~i~0 54), 228816#(<= main_~i~0 53), 228823#(<= main_~i~0 60), 228822#(<= main_~i~0 59), 228821#(<= main_~i~0 58), 228820#(<= main_~i~0 57), 228827#(<= main_~i~0 64), 228826#(<= main_~i~0 63), 228825#(<= main_~i~0 62), 228824#(<= main_~i~0 61), 228831#(<= main_~i~0 68), 228830#(<= main_~i~0 67), 228829#(<= main_~i~0 66), 228828#(<= main_~i~0 65), 228835#(<= main_~i~0 72), 228834#(<= main_~i~0 71), 228833#(<= main_~i~0 70), 228832#(<= main_~i~0 69), 228839#(<= main_~i~0 76), 228838#(<= main_~i~0 75), 228837#(<= main_~i~0 74), 228836#(<= main_~i~0 73), 228843#(<= main_~i~0 80), 228842#(<= main_~i~0 79), 228841#(<= main_~i~0 78), 228840#(<= main_~i~0 77), 228847#(<= main_~i~0 84), 228846#(<= main_~i~0 83), 228845#(<= main_~i~0 82), 228844#(<= main_~i~0 81), 228851#(<= main_~i~0 88), 228850#(<= main_~i~0 87), 228849#(<= main_~i~0 86), 228848#(<= main_~i~0 85), 228855#(<= main_~i~0 92), 228854#(<= main_~i~0 91), 228853#(<= main_~i~0 90), 228852#(<= main_~i~0 89), 228859#(<= main_~i~0 96), 228858#(<= main_~i~0 95), 228857#(<= main_~i~0 94), 228856#(<= main_~i~0 93), 228863#(<= main_~i~0 100), 228862#(<= main_~i~0 99), 228861#(<= main_~i~0 98), 228860#(<= main_~i~0 97)] [2018-04-12 03:02:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 34281 backedges. 0 proven. 34281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:39,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-12 03:02:39,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-12 03:02:39,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7026, Invalid=7494, Unknown=0, NotChecked=0, Total=14520 [2018-04-12 03:02:39,554 INFO L87 Difference]: Start difference. First operand 1670 states and 2257 transitions. Second operand 121 states. [2018-04-12 03:02:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:02:49,456 INFO L93 Difference]: Finished difference Result 1806 states and 2400 transitions. [2018-04-12 03:02:49,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-04-12 03:02:49,456 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 593 [2018-04-12 03:02:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:02:49,458 INFO L225 Difference]: With dead ends: 1806 [2018-04-12 03:02:49,458 INFO L226 Difference]: Without dead ends: 1806 [2018-04-12 03:02:49,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7019 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=21066, Invalid=35340, Unknown=0, NotChecked=0, Total=56406 [2018-04-12 03:02:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2018-04-12 03:02:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1684. [2018-04-12 03:02:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2018-04-12 03:02:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2276 transitions. [2018-04-12 03:02:49,469 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2276 transitions. Word has length 593 [2018-04-12 03:02:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:02:49,469 INFO L459 AbstractCegarLoop]: Abstraction has 1684 states and 2276 transitions. [2018-04-12 03:02:49,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-12 03:02:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2276 transitions. [2018-04-12 03:02:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-04-12 03:02:49,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:02:49,472 INFO L355 BasicCegarLoop]: trace histogram [119, 119, 118, 118, 118, 1, 1, 1, 1, 1, 1] [2018-04-12 03:02:49,472 INFO L408 AbstractCegarLoop]: === Iteration 119 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:02:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1958175075, now seen corresponding path program 118 times [2018-04-12 03:02:49,472 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:02:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:02:49,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:02:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34869 backedges. 0 proven. 34869 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:53,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:02:53,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-04-12 03:02:53,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:02:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:53,895 INFO L182 omatonBuilderFactory]: Interpolants [232707#(<= main_~i~0 99), 232706#(<= main_~i~0 98), 232705#(<= main_~i~0 97), 232704#(<= main_~i~0 96), 232711#(<= main_~i~0 103), 232710#(<= main_~i~0 102), 232709#(<= main_~i~0 101), 232708#(<= main_~i~0 100), 232715#(<= main_~i~0 107), 232714#(<= main_~i~0 106), 232713#(<= main_~i~0 105), 232712#(<= main_~i~0 104), 232719#(<= main_~i~0 111), 232718#(<= main_~i~0 110), 232717#(<= main_~i~0 109), 232716#(<= main_~i~0 108), 232723#(<= main_~i~0 115), 232722#(<= main_~i~0 114), 232721#(<= main_~i~0 113), 232720#(<= main_~i~0 112), 232727#(and (<= 2 main_~i~0) (<= main_~i~0 118)), 232726#(and (<= 1 main_~i~0) (<= main_~i~0 117)), 232725#(and (<= 0 main_~i~0) (<= main_~i~0 116)), 232724#(<= main_~i~0 116), 232607#false, 232606#true, 232611#(<= main_~i~0 3), 232610#(<= main_~i~0 2), 232609#(<= main_~i~0 1), 232608#(<= main_~i~0 0), 232615#(<= main_~i~0 7), 232614#(<= main_~i~0 6), 232613#(<= main_~i~0 5), 232612#(<= main_~i~0 4), 232619#(<= main_~i~0 11), 232618#(<= main_~i~0 10), 232617#(<= main_~i~0 9), 232616#(<= main_~i~0 8), 232623#(<= main_~i~0 15), 232622#(<= main_~i~0 14), 232621#(<= main_~i~0 13), 232620#(<= main_~i~0 12), 232627#(<= main_~i~0 19), 232626#(<= main_~i~0 18), 232625#(<= main_~i~0 17), 232624#(<= main_~i~0 16), 232631#(<= main_~i~0 23), 232630#(<= main_~i~0 22), 232629#(<= main_~i~0 21), 232628#(<= main_~i~0 20), 232635#(<= main_~i~0 27), 232634#(<= main_~i~0 26), 232633#(<= main_~i~0 25), 232632#(<= main_~i~0 24), 232639#(<= main_~i~0 31), 232638#(<= main_~i~0 30), 232637#(<= main_~i~0 29), 232636#(<= main_~i~0 28), 232643#(<= main_~i~0 35), 232642#(<= main_~i~0 34), 232641#(<= main_~i~0 33), 232640#(<= main_~i~0 32), 232647#(<= main_~i~0 39), 232646#(<= main_~i~0 38), 232645#(<= main_~i~0 37), 232644#(<= main_~i~0 36), 232651#(<= main_~i~0 43), 232650#(<= main_~i~0 42), 232649#(<= main_~i~0 41), 232648#(<= main_~i~0 40), 232655#(<= main_~i~0 47), 232654#(<= main_~i~0 46), 232653#(<= main_~i~0 45), 232652#(<= main_~i~0 44), 232659#(<= main_~i~0 51), 232658#(<= main_~i~0 50), 232657#(<= main_~i~0 49), 232656#(<= main_~i~0 48), 232663#(<= main_~i~0 55), 232662#(<= main_~i~0 54), 232661#(<= main_~i~0 53), 232660#(<= main_~i~0 52), 232667#(<= main_~i~0 59), 232666#(<= main_~i~0 58), 232665#(<= main_~i~0 57), 232664#(<= main_~i~0 56), 232671#(<= main_~i~0 63), 232670#(<= main_~i~0 62), 232669#(<= main_~i~0 61), 232668#(<= main_~i~0 60), 232675#(<= main_~i~0 67), 232674#(<= main_~i~0 66), 232673#(<= main_~i~0 65), 232672#(<= main_~i~0 64), 232679#(<= main_~i~0 71), 232678#(<= main_~i~0 70), 232677#(<= main_~i~0 69), 232676#(<= main_~i~0 68), 232683#(<= main_~i~0 75), 232682#(<= main_~i~0 74), 232681#(<= main_~i~0 73), 232680#(<= main_~i~0 72), 232687#(<= main_~i~0 79), 232686#(<= main_~i~0 78), 232685#(<= main_~i~0 77), 232684#(<= main_~i~0 76), 232691#(<= main_~i~0 83), 232690#(<= main_~i~0 82), 232689#(<= main_~i~0 81), 232688#(<= main_~i~0 80), 232695#(<= main_~i~0 87), 232694#(<= main_~i~0 86), 232693#(<= main_~i~0 85), 232692#(<= main_~i~0 84), 232699#(<= main_~i~0 91), 232698#(<= main_~i~0 90), 232697#(<= main_~i~0 89), 232696#(<= main_~i~0 88), 232703#(<= main_~i~0 95), 232702#(<= main_~i~0 94), 232701#(<= main_~i~0 93), 232700#(<= main_~i~0 92)] [2018-04-12 03:02:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 34869 backedges. 0 proven. 34869 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:02:53,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-12 03:02:53,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-12 03:02:53,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7028, Invalid=7734, Unknown=0, NotChecked=0, Total=14762 [2018-04-12 03:02:53,897 INFO L87 Difference]: Start difference. First operand 1684 states and 2276 transitions. Second operand 122 states. [2018-04-12 03:03:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:03:04,513 INFO L93 Difference]: Finished difference Result 1821 states and 2420 transitions. [2018-04-12 03:03:04,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-12 03:03:04,513 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 598 [2018-04-12 03:03:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:03:04,514 INFO L225 Difference]: With dead ends: 1821 [2018-04-12 03:03:04,514 INFO L226 Difference]: Without dead ends: 1821 [2018-04-12 03:03:04,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7254 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=21187, Invalid=36173, Unknown=0, NotChecked=0, Total=57360 [2018-04-12 03:03:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-04-12 03:03:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1698. [2018-04-12 03:03:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1698 states. [2018-04-12 03:03:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2295 transitions. [2018-04-12 03:03:04,525 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2295 transitions. Word has length 598 [2018-04-12 03:03:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:03:04,525 INFO L459 AbstractCegarLoop]: Abstraction has 1698 states and 2295 transitions. [2018-04-12 03:03:04,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-12 03:03:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2295 transitions. [2018-04-12 03:03:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-04-12 03:03:04,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:03:04,528 INFO L355 BasicCegarLoop]: trace histogram [120, 120, 119, 119, 119, 1, 1, 1, 1, 1, 1] [2018-04-12 03:03:04,528 INFO L408 AbstractCegarLoop]: === Iteration 120 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:03:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash -283854218, now seen corresponding path program 119 times [2018-04-12 03:03:04,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:03:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:03:04,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:03:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 35462 backedges. 0 proven. 35462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:09,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:03:09,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-04-12 03:03:09,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:03:09,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-12 03:03:09,030 INFO L182 omatonBuilderFactory]: Interpolants [236547#(<= main_~i~0 62), 236546#(<= main_~i~0 61), 236545#(<= main_~i~0 60), 236544#(<= main_~i~0 59), 236551#(<= main_~i~0 66), 236550#(<= main_~i~0 65), 236549#(<= main_~i~0 64), 236548#(<= main_~i~0 63), 236555#(<= main_~i~0 70), 236554#(<= main_~i~0 69), 236553#(<= main_~i~0 68), 236552#(<= main_~i~0 67), 236559#(<= main_~i~0 74), 236558#(<= main_~i~0 73), 236557#(<= main_~i~0 72), 236556#(<= main_~i~0 71), 236563#(<= main_~i~0 78), 236562#(<= main_~i~0 77), 236561#(<= main_~i~0 76), 236560#(<= main_~i~0 75), 236567#(<= main_~i~0 82), 236566#(<= main_~i~0 81), 236565#(<= main_~i~0 80), 236564#(<= main_~i~0 79), 236571#(<= main_~i~0 86), 236570#(<= main_~i~0 85), 236569#(<= main_~i~0 84), 236568#(<= main_~i~0 83), 236575#(<= main_~i~0 90), 236574#(<= main_~i~0 89), 236573#(<= main_~i~0 88), 236572#(<= main_~i~0 87), 236579#(<= main_~i~0 94), 236578#(<= main_~i~0 93), 236577#(<= main_~i~0 92), 236576#(<= main_~i~0 91), 236583#(<= main_~i~0 98), 236582#(<= main_~i~0 97), 236581#(<= main_~i~0 96), 236580#(<= main_~i~0 95), 236587#(<= main_~i~0 102), 236586#(<= main_~i~0 101), 236585#(<= main_~i~0 100), 236584#(<= main_~i~0 99), 236591#(<= main_~i~0 106), 236590#(<= main_~i~0 105), 236589#(<= main_~i~0 104), 236588#(<= main_~i~0 103), 236595#(<= main_~i~0 110), 236594#(<= main_~i~0 109), 236593#(<= main_~i~0 108), 236592#(<= main_~i~0 107), 236599#(<= main_~i~0 114), 236598#(<= main_~i~0 113), 236597#(<= main_~i~0 112), 236596#(<= main_~i~0 111), 236603#(<= main_~i~0 118), 236602#(<= main_~i~0 117), 236601#(<= main_~i~0 116), 236600#(<= main_~i~0 115), 236605#(and (<= main_~i~0 119) (<= 1 main_~i~0)), 236604#(and (<= 0 main_~i~0) (<= main_~i~0 118)), 236483#true, 236487#(<= main_~i~0 2), 236486#(<= main_~i~0 1), 236485#(<= main_~i~0 0), 236484#false, 236491#(<= main_~i~0 6), 236490#(<= main_~i~0 5), 236489#(<= main_~i~0 4), 236488#(<= main_~i~0 3), 236495#(<= main_~i~0 10), 236494#(<= main_~i~0 9), 236493#(<= main_~i~0 8), 236492#(<= main_~i~0 7), 236499#(<= main_~i~0 14), 236498#(<= main_~i~0 13), 236497#(<= main_~i~0 12), 236496#(<= main_~i~0 11), 236503#(<= main_~i~0 18), 236502#(<= main_~i~0 17), 236501#(<= main_~i~0 16), 236500#(<= main_~i~0 15), 236507#(<= main_~i~0 22), 236506#(<= main_~i~0 21), 236505#(<= main_~i~0 20), 236504#(<= main_~i~0 19), 236511#(<= main_~i~0 26), 236510#(<= main_~i~0 25), 236509#(<= main_~i~0 24), 236508#(<= main_~i~0 23), 236515#(<= main_~i~0 30), 236514#(<= main_~i~0 29), 236513#(<= main_~i~0 28), 236512#(<= main_~i~0 27), 236519#(<= main_~i~0 34), 236518#(<= main_~i~0 33), 236517#(<= main_~i~0 32), 236516#(<= main_~i~0 31), 236523#(<= main_~i~0 38), 236522#(<= main_~i~0 37), 236521#(<= main_~i~0 36), 236520#(<= main_~i~0 35), 236527#(<= main_~i~0 42), 236526#(<= main_~i~0 41), 236525#(<= main_~i~0 40), 236524#(<= main_~i~0 39), 236531#(<= main_~i~0 46), 236530#(<= main_~i~0 45), 236529#(<= main_~i~0 44), 236528#(<= main_~i~0 43), 236535#(<= main_~i~0 50), 236534#(<= main_~i~0 49), 236533#(<= main_~i~0 48), 236532#(<= main_~i~0 47), 236539#(<= main_~i~0 54), 236538#(<= main_~i~0 53), 236537#(<= main_~i~0 52), 236536#(<= main_~i~0 51), 236543#(<= main_~i~0 58), 236542#(<= main_~i~0 57), 236541#(<= main_~i~0 56), 236540#(<= main_~i~0 55)] [2018-04-12 03:03:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 35462 backedges. 0 proven. 35462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:09,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-12 03:03:09,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-12 03:03:09,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7265, Invalid=7741, Unknown=0, NotChecked=0, Total=15006 [2018-04-12 03:03:09,033 INFO L87 Difference]: Start difference. First operand 1698 states and 2295 transitions. Second operand 123 states. [2018-04-12 03:03:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:03:19,172 INFO L93 Difference]: Finished difference Result 1836 states and 2440 transitions. [2018-04-12 03:03:19,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-12 03:03:19,172 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 603 [2018-04-12 03:03:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:03:19,174 INFO L225 Difference]: With dead ends: 1836 [2018-04-12 03:03:19,174 INFO L226 Difference]: Without dead ends: 1836 [2018-04-12 03:03:19,176 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7258 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=21783, Invalid=36539, Unknown=0, NotChecked=0, Total=58322 [2018-04-12 03:03:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-04-12 03:03:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1712. [2018-04-12 03:03:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-04-12 03:03:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2314 transitions. [2018-04-12 03:03:19,186 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2314 transitions. Word has length 603 [2018-04-12 03:03:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:03:19,186 INFO L459 AbstractCegarLoop]: Abstraction has 1712 states and 2314 transitions. [2018-04-12 03:03:19,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-12 03:03:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2314 transitions. [2018-04-12 03:03:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2018-04-12 03:03:19,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:03:19,189 INFO L355 BasicCegarLoop]: trace histogram [121, 121, 120, 120, 120, 1, 1, 1, 1, 1, 1] [2018-04-12 03:03:19,189 INFO L408 AbstractCegarLoop]: === Iteration 121 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:03:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1880285635, now seen corresponding path program 120 times [2018-04-12 03:03:19,190 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:03:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:03:19,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:03:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 36060 backedges. 0 proven. 36060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:23,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:03:23,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-04-12 03:03:23,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:03:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:23,654 INFO L182 omatonBuilderFactory]: Interpolants [240395#(<= main_~i~0 1), 240394#(<= main_~i~0 0), 240393#false, 240392#true, 240399#(<= main_~i~0 5), 240398#(<= main_~i~0 4), 240397#(<= main_~i~0 3), 240396#(<= main_~i~0 2), 240403#(<= main_~i~0 9), 240402#(<= main_~i~0 8), 240401#(<= main_~i~0 7), 240400#(<= main_~i~0 6), 240407#(<= main_~i~0 13), 240406#(<= main_~i~0 12), 240405#(<= main_~i~0 11), 240404#(<= main_~i~0 10), 240411#(<= main_~i~0 17), 240410#(<= main_~i~0 16), 240409#(<= main_~i~0 15), 240408#(<= main_~i~0 14), 240415#(<= main_~i~0 21), 240414#(<= main_~i~0 20), 240413#(<= main_~i~0 19), 240412#(<= main_~i~0 18), 240419#(<= main_~i~0 25), 240418#(<= main_~i~0 24), 240417#(<= main_~i~0 23), 240416#(<= main_~i~0 22), 240423#(<= main_~i~0 29), 240422#(<= main_~i~0 28), 240421#(<= main_~i~0 27), 240420#(<= main_~i~0 26), 240427#(<= main_~i~0 33), 240426#(<= main_~i~0 32), 240425#(<= main_~i~0 31), 240424#(<= main_~i~0 30), 240431#(<= main_~i~0 37), 240430#(<= main_~i~0 36), 240429#(<= main_~i~0 35), 240428#(<= main_~i~0 34), 240435#(<= main_~i~0 41), 240434#(<= main_~i~0 40), 240433#(<= main_~i~0 39), 240432#(<= main_~i~0 38), 240439#(<= main_~i~0 45), 240438#(<= main_~i~0 44), 240437#(<= main_~i~0 43), 240436#(<= main_~i~0 42), 240443#(<= main_~i~0 49), 240442#(<= main_~i~0 48), 240441#(<= main_~i~0 47), 240440#(<= main_~i~0 46), 240447#(<= main_~i~0 53), 240446#(<= main_~i~0 52), 240445#(<= main_~i~0 51), 240444#(<= main_~i~0 50), 240451#(<= main_~i~0 57), 240450#(<= main_~i~0 56), 240449#(<= main_~i~0 55), 240448#(<= main_~i~0 54), 240455#(<= main_~i~0 61), 240454#(<= main_~i~0 60), 240453#(<= main_~i~0 59), 240452#(<= main_~i~0 58), 240459#(<= main_~i~0 65), 240458#(<= main_~i~0 64), 240457#(<= main_~i~0 63), 240456#(<= main_~i~0 62), 240463#(<= main_~i~0 69), 240462#(<= main_~i~0 68), 240461#(<= main_~i~0 67), 240460#(<= main_~i~0 66), 240467#(<= main_~i~0 73), 240466#(<= main_~i~0 72), 240465#(<= main_~i~0 71), 240464#(<= main_~i~0 70), 240471#(<= main_~i~0 77), 240470#(<= main_~i~0 76), 240469#(<= main_~i~0 75), 240468#(<= main_~i~0 74), 240475#(<= main_~i~0 81), 240474#(<= main_~i~0 80), 240473#(<= main_~i~0 79), 240472#(<= main_~i~0 78), 240479#(<= main_~i~0 85), 240478#(<= main_~i~0 84), 240477#(<= main_~i~0 83), 240476#(<= main_~i~0 82), 240483#(<= main_~i~0 89), 240482#(<= main_~i~0 88), 240481#(<= main_~i~0 87), 240480#(<= main_~i~0 86), 240487#(<= main_~i~0 93), 240486#(<= main_~i~0 92), 240485#(<= main_~i~0 91), 240484#(<= main_~i~0 90), 240491#(<= main_~i~0 97), 240490#(<= main_~i~0 96), 240489#(<= main_~i~0 95), 240488#(<= main_~i~0 94), 240495#(<= main_~i~0 101), 240494#(<= main_~i~0 100), 240493#(<= main_~i~0 99), 240492#(<= main_~i~0 98), 240499#(<= main_~i~0 105), 240498#(<= main_~i~0 104), 240497#(<= main_~i~0 103), 240496#(<= main_~i~0 102), 240503#(<= main_~i~0 109), 240502#(<= main_~i~0 108), 240501#(<= main_~i~0 107), 240500#(<= main_~i~0 106), 240507#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 240506#(<= main_~i~0 112), 240505#(<= main_~i~0 111), 240504#(<= main_~i~0 110), 240511#(and (<= 4 main_~i~0) (<= main_~i~0 116)), 240510#(and (<= main_~i~0 115) (<= 3 main_~i~0)), 240509#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 240508#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 240515#(and (<= 8 main_~i~0) (<= main_~i~0 120)), 240514#(and (<= main_~i~0 119) (<= 7 main_~i~0)), 240513#(and (<= 6 main_~i~0) (<= main_~i~0 118)), 240512#(and (<= 5 main_~i~0) (<= main_~i~0 117))] [2018-04-12 03:03:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36060 backedges. 0 proven. 36060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:23,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-04-12 03:03:23,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-04-12 03:03:23,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6574, Invalid=8678, Unknown=0, NotChecked=0, Total=15252 [2018-04-12 03:03:23,656 INFO L87 Difference]: Start difference. First operand 1712 states and 2314 transitions. Second operand 124 states. [2018-04-12 03:03:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:03:35,583 INFO L93 Difference]: Finished difference Result 1851 states and 2460 transitions. [2018-04-12 03:03:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-12 03:03:35,584 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 608 [2018-04-12 03:03:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:03:35,585 INFO L225 Difference]: With dead ends: 1851 [2018-04-12 03:03:35,585 INFO L226 Difference]: Without dead ends: 1851 [2018-04-12 03:03:35,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8163 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=20487, Invalid=38805, Unknown=0, NotChecked=0, Total=59292 [2018-04-12 03:03:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-04-12 03:03:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1726. [2018-04-12 03:03:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-04-12 03:03:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2333 transitions. [2018-04-12 03:03:35,599 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2333 transitions. Word has length 608 [2018-04-12 03:03:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:03:35,599 INFO L459 AbstractCegarLoop]: Abstraction has 1726 states and 2333 transitions. [2018-04-12 03:03:35,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-04-12 03:03:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2333 transitions. [2018-04-12 03:03:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-04-12 03:03:35,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:03:35,602 INFO L355 BasicCegarLoop]: trace histogram [122, 122, 121, 121, 121, 1, 1, 1, 1, 1, 1] [2018-04-12 03:03:35,602 INFO L408 AbstractCegarLoop]: === Iteration 122 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:03:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash -110166314, now seen corresponding path program 121 times [2018-04-12 03:03:35,603 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:03:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:03:35,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:03:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36663 backedges. 0 proven. 36663 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:40,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:03:40,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-04-12 03:03:40,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:03:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:40,309 INFO L182 omatonBuilderFactory]: Interpolants [244335#(<= main_~i~0 0), 244334#false, 244333#true, 244339#(<= main_~i~0 4), 244338#(<= main_~i~0 3), 244337#(<= main_~i~0 2), 244336#(<= main_~i~0 1), 244343#(<= main_~i~0 8), 244342#(<= main_~i~0 7), 244341#(<= main_~i~0 6), 244340#(<= main_~i~0 5), 244347#(<= main_~i~0 12), 244346#(<= main_~i~0 11), 244345#(<= main_~i~0 10), 244344#(<= main_~i~0 9), 244351#(<= main_~i~0 16), 244350#(<= main_~i~0 15), 244349#(<= main_~i~0 14), 244348#(<= main_~i~0 13), 244355#(<= main_~i~0 20), 244354#(<= main_~i~0 19), 244353#(<= main_~i~0 18), 244352#(<= main_~i~0 17), 244359#(<= main_~i~0 24), 244358#(<= main_~i~0 23), 244357#(<= main_~i~0 22), 244356#(<= main_~i~0 21), 244363#(<= main_~i~0 28), 244362#(<= main_~i~0 27), 244361#(<= main_~i~0 26), 244360#(<= main_~i~0 25), 244367#(<= main_~i~0 32), 244366#(<= main_~i~0 31), 244365#(<= main_~i~0 30), 244364#(<= main_~i~0 29), 244371#(<= main_~i~0 36), 244370#(<= main_~i~0 35), 244369#(<= main_~i~0 34), 244368#(<= main_~i~0 33), 244375#(<= main_~i~0 40), 244374#(<= main_~i~0 39), 244373#(<= main_~i~0 38), 244372#(<= main_~i~0 37), 244379#(<= main_~i~0 44), 244378#(<= main_~i~0 43), 244377#(<= main_~i~0 42), 244376#(<= main_~i~0 41), 244383#(<= main_~i~0 48), 244382#(<= main_~i~0 47), 244381#(<= main_~i~0 46), 244380#(<= main_~i~0 45), 244387#(<= main_~i~0 52), 244386#(<= main_~i~0 51), 244385#(<= main_~i~0 50), 244384#(<= main_~i~0 49), 244391#(<= main_~i~0 56), 244390#(<= main_~i~0 55), 244389#(<= main_~i~0 54), 244388#(<= main_~i~0 53), 244395#(<= main_~i~0 60), 244394#(<= main_~i~0 59), 244393#(<= main_~i~0 58), 244392#(<= main_~i~0 57), 244399#(<= main_~i~0 64), 244398#(<= main_~i~0 63), 244397#(<= main_~i~0 62), 244396#(<= main_~i~0 61), 244403#(<= main_~i~0 68), 244402#(<= main_~i~0 67), 244401#(<= main_~i~0 66), 244400#(<= main_~i~0 65), 244407#(<= main_~i~0 72), 244406#(<= main_~i~0 71), 244405#(<= main_~i~0 70), 244404#(<= main_~i~0 69), 244411#(<= main_~i~0 76), 244410#(<= main_~i~0 75), 244409#(<= main_~i~0 74), 244408#(<= main_~i~0 73), 244415#(<= main_~i~0 80), 244414#(<= main_~i~0 79), 244413#(<= main_~i~0 78), 244412#(<= main_~i~0 77), 244419#(<= main_~i~0 84), 244418#(<= main_~i~0 83), 244417#(<= main_~i~0 82), 244416#(<= main_~i~0 81), 244423#(<= main_~i~0 88), 244422#(<= main_~i~0 87), 244421#(<= main_~i~0 86), 244420#(<= main_~i~0 85), 244427#(<= main_~i~0 92), 244426#(<= main_~i~0 91), 244425#(<= main_~i~0 90), 244424#(<= main_~i~0 89), 244431#(<= main_~i~0 96), 244430#(<= main_~i~0 95), 244429#(<= main_~i~0 94), 244428#(<= main_~i~0 93), 244435#(<= main_~i~0 100), 244434#(<= main_~i~0 99), 244433#(<= main_~i~0 98), 244432#(<= main_~i~0 97), 244439#(<= main_~i~0 104), 244438#(<= main_~i~0 103), 244437#(<= main_~i~0 102), 244436#(<= main_~i~0 101), 244443#(<= main_~i~0 108), 244442#(<= main_~i~0 107), 244441#(<= main_~i~0 106), 244440#(<= main_~i~0 105), 244447#(<= main_~i~0 112), 244446#(<= main_~i~0 111), 244445#(<= main_~i~0 110), 244444#(<= main_~i~0 109), 244451#(<= main_~i~0 116), 244450#(<= main_~i~0 115), 244449#(<= main_~i~0 114), 244448#(<= main_~i~0 113), 244455#(<= main_~i~0 120), 244454#(<= main_~i~0 119), 244453#(<= main_~i~0 118), 244452#(<= main_~i~0 117), 244457#(and (<= 1 main_~i~0) (<= main_~i~0 121)), 244456#(and (<= 0 main_~i~0) (<= main_~i~0 120))] [2018-04-12 03:03:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 36663 backedges. 0 proven. 36663 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:40,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-04-12 03:03:40,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-04-12 03:03:40,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7508, Invalid=7992, Unknown=0, NotChecked=0, Total=15500 [2018-04-12 03:03:40,312 INFO L87 Difference]: Start difference. First operand 1726 states and 2333 transitions. Second operand 125 states. [2018-04-12 03:03:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:03:50,953 INFO L93 Difference]: Finished difference Result 1866 states and 2480 transitions. [2018-04-12 03:03:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-04-12 03:03:50,954 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 613 [2018-04-12 03:03:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:03:50,955 INFO L225 Difference]: With dead ends: 1866 [2018-04-12 03:03:50,955 INFO L226 Difference]: Without dead ends: 1866 [2018-04-12 03:03:50,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7501 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=22512, Invalid=37758, Unknown=0, NotChecked=0, Total=60270 [2018-04-12 03:03:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2018-04-12 03:03:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1740. [2018-04-12 03:03:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1740 states. [2018-04-12 03:03:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2352 transitions. [2018-04-12 03:03:50,966 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2352 transitions. Word has length 613 [2018-04-12 03:03:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:03:50,966 INFO L459 AbstractCegarLoop]: Abstraction has 1740 states and 2352 transitions. [2018-04-12 03:03:50,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-04-12 03:03:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2352 transitions. [2018-04-12 03:03:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-04-12 03:03:50,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:03:50,969 INFO L355 BasicCegarLoop]: trace histogram [123, 123, 122, 122, 122, 1, 1, 1, 1, 1, 1] [2018-04-12 03:03:50,969 INFO L408 AbstractCegarLoop]: === Iteration 123 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:03:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1691445795, now seen corresponding path program 122 times [2018-04-12 03:03:50,970 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:03:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:03:51,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:03:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 37271 backedges. 0 proven. 37271 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:55,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:03:55,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-04-12 03:03:55,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:03:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:55,658 INFO L182 omatonBuilderFactory]: Interpolants [248323#(<= main_~i~0 15), 248322#(<= main_~i~0 14), 248321#(<= main_~i~0 13), 248320#(<= main_~i~0 12), 248327#(<= main_~i~0 19), 248326#(<= main_~i~0 18), 248325#(<= main_~i~0 17), 248324#(<= main_~i~0 16), 248331#(<= main_~i~0 23), 248330#(<= main_~i~0 22), 248329#(<= main_~i~0 21), 248328#(<= main_~i~0 20), 248335#(<= main_~i~0 27), 248334#(<= main_~i~0 26), 248333#(<= main_~i~0 25), 248332#(<= main_~i~0 24), 248339#(<= main_~i~0 31), 248338#(<= main_~i~0 30), 248337#(<= main_~i~0 29), 248336#(<= main_~i~0 28), 248343#(<= main_~i~0 35), 248342#(<= main_~i~0 34), 248341#(<= main_~i~0 33), 248340#(<= main_~i~0 32), 248347#(<= main_~i~0 39), 248346#(<= main_~i~0 38), 248345#(<= main_~i~0 37), 248344#(<= main_~i~0 36), 248351#(<= main_~i~0 43), 248350#(<= main_~i~0 42), 248349#(<= main_~i~0 41), 248348#(<= main_~i~0 40), 248355#(<= main_~i~0 47), 248354#(<= main_~i~0 46), 248353#(<= main_~i~0 45), 248352#(<= main_~i~0 44), 248359#(<= main_~i~0 51), 248358#(<= main_~i~0 50), 248357#(<= main_~i~0 49), 248356#(<= main_~i~0 48), 248363#(<= main_~i~0 55), 248362#(<= main_~i~0 54), 248361#(<= main_~i~0 53), 248360#(<= main_~i~0 52), 248367#(<= main_~i~0 59), 248366#(<= main_~i~0 58), 248365#(<= main_~i~0 57), 248364#(<= main_~i~0 56), 248371#(<= main_~i~0 63), 248370#(<= main_~i~0 62), 248369#(<= main_~i~0 61), 248368#(<= main_~i~0 60), 248375#(<= main_~i~0 67), 248374#(<= main_~i~0 66), 248373#(<= main_~i~0 65), 248372#(<= main_~i~0 64), 248379#(<= main_~i~0 71), 248378#(<= main_~i~0 70), 248377#(<= main_~i~0 69), 248376#(<= main_~i~0 68), 248383#(<= main_~i~0 75), 248382#(<= main_~i~0 74), 248381#(<= main_~i~0 73), 248380#(<= main_~i~0 72), 248387#(<= main_~i~0 79), 248386#(<= main_~i~0 78), 248385#(<= main_~i~0 77), 248384#(<= main_~i~0 76), 248391#(<= main_~i~0 83), 248390#(<= main_~i~0 82), 248389#(<= main_~i~0 81), 248388#(<= main_~i~0 80), 248395#(<= main_~i~0 87), 248394#(<= main_~i~0 86), 248393#(<= main_~i~0 85), 248392#(<= main_~i~0 84), 248399#(<= main_~i~0 91), 248398#(<= main_~i~0 90), 248397#(<= main_~i~0 89), 248396#(<= main_~i~0 88), 248403#(<= main_~i~0 95), 248402#(<= main_~i~0 94), 248401#(<= main_~i~0 93), 248400#(<= main_~i~0 92), 248407#(<= main_~i~0 99), 248406#(<= main_~i~0 98), 248405#(<= main_~i~0 97), 248404#(<= main_~i~0 96), 248411#(<= main_~i~0 103), 248410#(<= main_~i~0 102), 248409#(<= main_~i~0 101), 248408#(<= main_~i~0 100), 248415#(<= main_~i~0 107), 248414#(<= main_~i~0 106), 248413#(<= main_~i~0 105), 248412#(<= main_~i~0 104), 248419#(<= main_~i~0 111), 248418#(<= main_~i~0 110), 248417#(<= main_~i~0 109), 248416#(<= main_~i~0 108), 248423#(<= main_~i~0 115), 248422#(<= main_~i~0 114), 248421#(<= main_~i~0 113), 248420#(<= main_~i~0 112), 248427#(<= main_~i~0 119), 248426#(<= main_~i~0 118), 248425#(<= main_~i~0 117), 248424#(<= main_~i~0 116), 248431#(and (<= 2 main_~i~0) (<= main_~i~0 122)), 248430#(and (<= 1 main_~i~0) (<= main_~i~0 121)), 248429#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 248428#(<= main_~i~0 120), 248307#false, 248306#true, 248311#(<= main_~i~0 3), 248310#(<= main_~i~0 2), 248309#(<= main_~i~0 1), 248308#(<= main_~i~0 0), 248315#(<= main_~i~0 7), 248314#(<= main_~i~0 6), 248313#(<= main_~i~0 5), 248312#(<= main_~i~0 4), 248319#(<= main_~i~0 11), 248318#(<= main_~i~0 10), 248317#(<= main_~i~0 9), 248316#(<= main_~i~0 8)] [2018-04-12 03:03:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 37271 backedges. 0 proven. 37271 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:03:55,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-04-12 03:03:55,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-04-12 03:03:55,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7510, Invalid=8240, Unknown=0, NotChecked=0, Total=15750 [2018-04-12 03:03:55,661 INFO L87 Difference]: Start difference. First operand 1740 states and 2352 transitions. Second operand 126 states. [2018-04-12 03:04:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:04:06,959 INFO L93 Difference]: Finished difference Result 1881 states and 2500 transitions. [2018-04-12 03:04:06,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-12 03:04:06,959 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 618 [2018-04-12 03:04:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:04:06,961 INFO L225 Difference]: With dead ends: 1881 [2018-04-12 03:04:06,961 INFO L226 Difference]: Without dead ends: 1881 [2018-04-12 03:04:06,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7744 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=22637, Invalid=38619, Unknown=0, NotChecked=0, Total=61256 [2018-04-12 03:04:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2018-04-12 03:04:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1754. [2018-04-12 03:04:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-04-12 03:04:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2371 transitions. [2018-04-12 03:04:06,973 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2371 transitions. Word has length 618 [2018-04-12 03:04:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:04:06,973 INFO L459 AbstractCegarLoop]: Abstraction has 1754 states and 2371 transitions. [2018-04-12 03:04:06,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-04-12 03:04:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2371 transitions. [2018-04-12 03:04:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-04-12 03:04:06,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:04:06,978 INFO L355 BasicCegarLoop]: trace histogram [124, 124, 123, 123, 123, 1, 1, 1, 1, 1, 1] [2018-04-12 03:04:06,978 INFO L408 AbstractCegarLoop]: === Iteration 124 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:04:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -259568842, now seen corresponding path program 123 times [2018-04-12 03:04:06,979 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:04:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:04:07,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:04:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 37884 backedges. 0 proven. 37884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:11,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:04:11,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-04-12 03:04:11,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:04:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:11,785 INFO L182 omatonBuilderFactory]: Interpolants [252419#(<= main_~i~0 106), 252418#(<= main_~i~0 105), 252417#(<= main_~i~0 104), 252416#(<= main_~i~0 103), 252423#(<= main_~i~0 110), 252422#(<= main_~i~0 109), 252421#(<= main_~i~0 108), 252420#(<= main_~i~0 107), 252427#(<= main_~i~0 114), 252426#(<= main_~i~0 113), 252425#(<= main_~i~0 112), 252424#(<= main_~i~0 111), 252431#(<= main_~i~0 118), 252430#(<= main_~i~0 117), 252429#(<= main_~i~0 116), 252428#(<= main_~i~0 115), 252435#(<= main_~i~0 122), 252434#(<= main_~i~0 121), 252433#(<= main_~i~0 120), 252432#(<= main_~i~0 119), 252437#(and (<= 1 main_~i~0) (<= main_~i~0 123)), 252436#(and (<= main_~i~0 122) (<= 0 main_~i~0)), 252311#true, 252315#(<= main_~i~0 2), 252314#(<= main_~i~0 1), 252313#(<= main_~i~0 0), 252312#false, 252319#(<= main_~i~0 6), 252318#(<= main_~i~0 5), 252317#(<= main_~i~0 4), 252316#(<= main_~i~0 3), 252323#(<= main_~i~0 10), 252322#(<= main_~i~0 9), 252321#(<= main_~i~0 8), 252320#(<= main_~i~0 7), 252327#(<= main_~i~0 14), 252326#(<= main_~i~0 13), 252325#(<= main_~i~0 12), 252324#(<= main_~i~0 11), 252331#(<= main_~i~0 18), 252330#(<= main_~i~0 17), 252329#(<= main_~i~0 16), 252328#(<= main_~i~0 15), 252335#(<= main_~i~0 22), 252334#(<= main_~i~0 21), 252333#(<= main_~i~0 20), 252332#(<= main_~i~0 19), 252339#(<= main_~i~0 26), 252338#(<= main_~i~0 25), 252337#(<= main_~i~0 24), 252336#(<= main_~i~0 23), 252343#(<= main_~i~0 30), 252342#(<= main_~i~0 29), 252341#(<= main_~i~0 28), 252340#(<= main_~i~0 27), 252347#(<= main_~i~0 34), 252346#(<= main_~i~0 33), 252345#(<= main_~i~0 32), 252344#(<= main_~i~0 31), 252351#(<= main_~i~0 38), 252350#(<= main_~i~0 37), 252349#(<= main_~i~0 36), 252348#(<= main_~i~0 35), 252355#(<= main_~i~0 42), 252354#(<= main_~i~0 41), 252353#(<= main_~i~0 40), 252352#(<= main_~i~0 39), 252359#(<= main_~i~0 46), 252358#(<= main_~i~0 45), 252357#(<= main_~i~0 44), 252356#(<= main_~i~0 43), 252363#(<= main_~i~0 50), 252362#(<= main_~i~0 49), 252361#(<= main_~i~0 48), 252360#(<= main_~i~0 47), 252367#(<= main_~i~0 54), 252366#(<= main_~i~0 53), 252365#(<= main_~i~0 52), 252364#(<= main_~i~0 51), 252371#(<= main_~i~0 58), 252370#(<= main_~i~0 57), 252369#(<= main_~i~0 56), 252368#(<= main_~i~0 55), 252375#(<= main_~i~0 62), 252374#(<= main_~i~0 61), 252373#(<= main_~i~0 60), 252372#(<= main_~i~0 59), 252379#(<= main_~i~0 66), 252378#(<= main_~i~0 65), 252377#(<= main_~i~0 64), 252376#(<= main_~i~0 63), 252383#(<= main_~i~0 70), 252382#(<= main_~i~0 69), 252381#(<= main_~i~0 68), 252380#(<= main_~i~0 67), 252387#(<= main_~i~0 74), 252386#(<= main_~i~0 73), 252385#(<= main_~i~0 72), 252384#(<= main_~i~0 71), 252391#(<= main_~i~0 78), 252390#(<= main_~i~0 77), 252389#(<= main_~i~0 76), 252388#(<= main_~i~0 75), 252395#(<= main_~i~0 82), 252394#(<= main_~i~0 81), 252393#(<= main_~i~0 80), 252392#(<= main_~i~0 79), 252399#(<= main_~i~0 86), 252398#(<= main_~i~0 85), 252397#(<= main_~i~0 84), 252396#(<= main_~i~0 83), 252403#(<= main_~i~0 90), 252402#(<= main_~i~0 89), 252401#(<= main_~i~0 88), 252400#(<= main_~i~0 87), 252407#(<= main_~i~0 94), 252406#(<= main_~i~0 93), 252405#(<= main_~i~0 92), 252404#(<= main_~i~0 91), 252411#(<= main_~i~0 98), 252410#(<= main_~i~0 97), 252409#(<= main_~i~0 96), 252408#(<= main_~i~0 95), 252415#(<= main_~i~0 102), 252414#(<= main_~i~0 101), 252413#(<= main_~i~0 100), 252412#(<= main_~i~0 99)] [2018-04-12 03:04:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 37884 backedges. 0 proven. 37884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:11,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-04-12 03:04:11,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-04-12 03:04:11,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7755, Invalid=8247, Unknown=0, NotChecked=0, Total=16002 [2018-04-12 03:04:11,787 INFO L87 Difference]: Start difference. First operand 1754 states and 2371 transitions. Second operand 127 states. [2018-04-12 03:04:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:04:22,924 INFO L93 Difference]: Finished difference Result 1896 states and 2520 transitions. [2018-04-12 03:04:22,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-12 03:04:22,965 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 623 [2018-04-12 03:04:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:04:22,967 INFO L225 Difference]: With dead ends: 1896 [2018-04-12 03:04:22,967 INFO L226 Difference]: Without dead ends: 1896 [2018-04-12 03:04:22,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7748 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=23253, Invalid=38997, Unknown=0, NotChecked=0, Total=62250 [2018-04-12 03:04:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2018-04-12 03:04:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1768. [2018-04-12 03:04:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1768 states. [2018-04-12 03:04:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2390 transitions. [2018-04-12 03:04:22,976 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2390 transitions. Word has length 623 [2018-04-12 03:04:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:04:22,976 INFO L459 AbstractCegarLoop]: Abstraction has 1768 states and 2390 transitions. [2018-04-12 03:04:22,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-04-12 03:04:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2390 transitions. [2018-04-12 03:04:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-04-12 03:04:22,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:04:22,979 INFO L355 BasicCegarLoop]: trace histogram [125, 125, 124, 124, 124, 1, 1, 1, 1, 1, 1] [2018-04-12 03:04:22,979 INFO L408 AbstractCegarLoop]: === Iteration 125 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:04:22,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1489566339, now seen corresponding path program 124 times [2018-04-12 03:04:22,980 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:04:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:04:23,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:04:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 38502 backedges. 0 proven. 38502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:27,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:04:27,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-04-12 03:04:27,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:04:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:27,841 INFO L182 omatonBuilderFactory]: Interpolants [256351#(<= main_~i~0 1), 256350#(<= main_~i~0 0), 256349#false, 256348#true, 256355#(<= main_~i~0 5), 256354#(<= main_~i~0 4), 256353#(<= main_~i~0 3), 256352#(<= main_~i~0 2), 256359#(<= main_~i~0 9), 256358#(<= main_~i~0 8), 256357#(<= main_~i~0 7), 256356#(<= main_~i~0 6), 256363#(<= main_~i~0 13), 256362#(<= main_~i~0 12), 256361#(<= main_~i~0 11), 256360#(<= main_~i~0 10), 256367#(<= main_~i~0 17), 256366#(<= main_~i~0 16), 256365#(<= main_~i~0 15), 256364#(<= main_~i~0 14), 256371#(<= main_~i~0 21), 256370#(<= main_~i~0 20), 256369#(<= main_~i~0 19), 256368#(<= main_~i~0 18), 256375#(<= main_~i~0 25), 256374#(<= main_~i~0 24), 256373#(<= main_~i~0 23), 256372#(<= main_~i~0 22), 256379#(<= main_~i~0 29), 256378#(<= main_~i~0 28), 256377#(<= main_~i~0 27), 256376#(<= main_~i~0 26), 256383#(<= main_~i~0 33), 256382#(<= main_~i~0 32), 256381#(<= main_~i~0 31), 256380#(<= main_~i~0 30), 256387#(<= main_~i~0 37), 256386#(<= main_~i~0 36), 256385#(<= main_~i~0 35), 256384#(<= main_~i~0 34), 256391#(<= main_~i~0 41), 256390#(<= main_~i~0 40), 256389#(<= main_~i~0 39), 256388#(<= main_~i~0 38), 256395#(<= main_~i~0 45), 256394#(<= main_~i~0 44), 256393#(<= main_~i~0 43), 256392#(<= main_~i~0 42), 256399#(<= main_~i~0 49), 256398#(<= main_~i~0 48), 256397#(<= main_~i~0 47), 256396#(<= main_~i~0 46), 256403#(<= main_~i~0 53), 256402#(<= main_~i~0 52), 256401#(<= main_~i~0 51), 256400#(<= main_~i~0 50), 256407#(<= main_~i~0 57), 256406#(<= main_~i~0 56), 256405#(<= main_~i~0 55), 256404#(<= main_~i~0 54), 256411#(<= main_~i~0 61), 256410#(<= main_~i~0 60), 256409#(<= main_~i~0 59), 256408#(<= main_~i~0 58), 256415#(<= main_~i~0 65), 256414#(<= main_~i~0 64), 256413#(<= main_~i~0 63), 256412#(<= main_~i~0 62), 256419#(<= main_~i~0 69), 256418#(<= main_~i~0 68), 256417#(<= main_~i~0 67), 256416#(<= main_~i~0 66), 256423#(<= main_~i~0 73), 256422#(<= main_~i~0 72), 256421#(<= main_~i~0 71), 256420#(<= main_~i~0 70), 256427#(<= main_~i~0 77), 256426#(<= main_~i~0 76), 256425#(<= main_~i~0 75), 256424#(<= main_~i~0 74), 256431#(<= main_~i~0 81), 256430#(<= main_~i~0 80), 256429#(<= main_~i~0 79), 256428#(<= main_~i~0 78), 256435#(<= main_~i~0 85), 256434#(<= main_~i~0 84), 256433#(<= main_~i~0 83), 256432#(<= main_~i~0 82), 256439#(<= main_~i~0 89), 256438#(<= main_~i~0 88), 256437#(<= main_~i~0 87), 256436#(<= main_~i~0 86), 256443#(<= main_~i~0 93), 256442#(<= main_~i~0 92), 256441#(<= main_~i~0 91), 256440#(<= main_~i~0 90), 256447#(<= main_~i~0 97), 256446#(<= main_~i~0 96), 256445#(<= main_~i~0 95), 256444#(<= main_~i~0 94), 256451#(<= main_~i~0 101), 256450#(<= main_~i~0 100), 256449#(<= main_~i~0 99), 256448#(<= main_~i~0 98), 256455#(<= main_~i~0 105), 256454#(<= main_~i~0 104), 256453#(<= main_~i~0 103), 256452#(<= main_~i~0 102), 256459#(<= main_~i~0 109), 256458#(<= main_~i~0 108), 256457#(<= main_~i~0 107), 256456#(<= main_~i~0 106), 256463#(<= main_~i~0 113), 256462#(<= main_~i~0 112), 256461#(<= main_~i~0 111), 256460#(<= main_~i~0 110), 256467#(<= main_~i~0 117), 256466#(<= main_~i~0 116), 256465#(<= main_~i~0 115), 256464#(<= main_~i~0 114), 256471#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 256470#(<= main_~i~0 120), 256469#(<= main_~i~0 119), 256468#(<= main_~i~0 118), 256475#(and (<= 4 main_~i~0) (<= main_~i~0 124)), 256474#(and (<= main_~i~0 123) (<= 3 main_~i~0)), 256473#(and (<= 2 main_~i~0) (<= main_~i~0 122)), 256472#(and (<= 1 main_~i~0) (<= main_~i~0 121))] [2018-04-12 03:04:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 38502 backedges. 0 proven. 38502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:27,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-12 03:04:27,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-12 03:04:27,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7514, Invalid=8742, Unknown=0, NotChecked=0, Total=16256 [2018-04-12 03:04:27,843 INFO L87 Difference]: Start difference. First operand 1768 states and 2390 transitions. Second operand 128 states. [2018-04-12 03:04:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:04:39,791 INFO L93 Difference]: Finished difference Result 1911 states and 2540 transitions. [2018-04-12 03:04:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-04-12 03:04:39,791 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 628 [2018-04-12 03:04:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:04:39,793 INFO L225 Difference]: With dead ends: 1911 [2018-04-12 03:04:39,793 INFO L226 Difference]: Without dead ends: 1911 [2018-04-12 03:04:39,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8233 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=22887, Invalid=40365, Unknown=0, NotChecked=0, Total=63252 [2018-04-12 03:04:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2018-04-12 03:04:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1782. [2018-04-12 03:04:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2018-04-12 03:04:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2409 transitions. [2018-04-12 03:04:39,803 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2409 transitions. Word has length 628 [2018-04-12 03:04:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:04:39,804 INFO L459 AbstractCegarLoop]: Abstraction has 1782 states and 2409 transitions. [2018-04-12 03:04:39,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-12 03:04:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2409 transitions. [2018-04-12 03:04:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2018-04-12 03:04:39,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:04:39,806 INFO L355 BasicCegarLoop]: trace histogram [126, 126, 125, 125, 125, 1, 1, 1, 1, 1, 1] [2018-04-12 03:04:39,807 INFO L408 AbstractCegarLoop]: === Iteration 126 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:04:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1535926378, now seen corresponding path program 125 times [2018-04-12 03:04:39,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:04:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:04:39,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:04:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 39125 backedges. 0 proven. 39125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:44,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:04:44,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-04-12 03:04:44,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:04:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:44,770 INFO L182 omatonBuilderFactory]: Interpolants [260419#(<= main_~i~0 0), 260418#false, 260417#true, 260423#(<= main_~i~0 4), 260422#(<= main_~i~0 3), 260421#(<= main_~i~0 2), 260420#(<= main_~i~0 1), 260427#(<= main_~i~0 8), 260426#(<= main_~i~0 7), 260425#(<= main_~i~0 6), 260424#(<= main_~i~0 5), 260431#(<= main_~i~0 12), 260430#(<= main_~i~0 11), 260429#(<= main_~i~0 10), 260428#(<= main_~i~0 9), 260435#(<= main_~i~0 16), 260434#(<= main_~i~0 15), 260433#(<= main_~i~0 14), 260432#(<= main_~i~0 13), 260439#(<= main_~i~0 20), 260438#(<= main_~i~0 19), 260437#(<= main_~i~0 18), 260436#(<= main_~i~0 17), 260443#(<= main_~i~0 24), 260442#(<= main_~i~0 23), 260441#(<= main_~i~0 22), 260440#(<= main_~i~0 21), 260447#(<= main_~i~0 28), 260446#(<= main_~i~0 27), 260445#(<= main_~i~0 26), 260444#(<= main_~i~0 25), 260451#(<= main_~i~0 32), 260450#(<= main_~i~0 31), 260449#(<= main_~i~0 30), 260448#(<= main_~i~0 29), 260455#(<= main_~i~0 36), 260454#(<= main_~i~0 35), 260453#(<= main_~i~0 34), 260452#(<= main_~i~0 33), 260459#(<= main_~i~0 40), 260458#(<= main_~i~0 39), 260457#(<= main_~i~0 38), 260456#(<= main_~i~0 37), 260463#(<= main_~i~0 44), 260462#(<= main_~i~0 43), 260461#(<= main_~i~0 42), 260460#(<= main_~i~0 41), 260467#(<= main_~i~0 48), 260466#(<= main_~i~0 47), 260465#(<= main_~i~0 46), 260464#(<= main_~i~0 45), 260471#(<= main_~i~0 52), 260470#(<= main_~i~0 51), 260469#(<= main_~i~0 50), 260468#(<= main_~i~0 49), 260475#(<= main_~i~0 56), 260474#(<= main_~i~0 55), 260473#(<= main_~i~0 54), 260472#(<= main_~i~0 53), 260479#(<= main_~i~0 60), 260478#(<= main_~i~0 59), 260477#(<= main_~i~0 58), 260476#(<= main_~i~0 57), 260483#(<= main_~i~0 64), 260482#(<= main_~i~0 63), 260481#(<= main_~i~0 62), 260480#(<= main_~i~0 61), 260487#(<= main_~i~0 68), 260486#(<= main_~i~0 67), 260485#(<= main_~i~0 66), 260484#(<= main_~i~0 65), 260491#(<= main_~i~0 72), 260490#(<= main_~i~0 71), 260489#(<= main_~i~0 70), 260488#(<= main_~i~0 69), 260495#(<= main_~i~0 76), 260494#(<= main_~i~0 75), 260493#(<= main_~i~0 74), 260492#(<= main_~i~0 73), 260499#(<= main_~i~0 80), 260498#(<= main_~i~0 79), 260497#(<= main_~i~0 78), 260496#(<= main_~i~0 77), 260503#(<= main_~i~0 84), 260502#(<= main_~i~0 83), 260501#(<= main_~i~0 82), 260500#(<= main_~i~0 81), 260507#(<= main_~i~0 88), 260506#(<= main_~i~0 87), 260505#(<= main_~i~0 86), 260504#(<= main_~i~0 85), 260511#(<= main_~i~0 92), 260510#(<= main_~i~0 91), 260509#(<= main_~i~0 90), 260508#(<= main_~i~0 89), 260515#(<= main_~i~0 96), 260514#(<= main_~i~0 95), 260513#(<= main_~i~0 94), 260512#(<= main_~i~0 93), 260519#(<= main_~i~0 100), 260518#(<= main_~i~0 99), 260517#(<= main_~i~0 98), 260516#(<= main_~i~0 97), 260523#(<= main_~i~0 104), 260522#(<= main_~i~0 103), 260521#(<= main_~i~0 102), 260520#(<= main_~i~0 101), 260527#(<= main_~i~0 108), 260526#(<= main_~i~0 107), 260525#(<= main_~i~0 106), 260524#(<= main_~i~0 105), 260531#(<= main_~i~0 112), 260530#(<= main_~i~0 111), 260529#(<= main_~i~0 110), 260528#(<= main_~i~0 109), 260535#(<= main_~i~0 116), 260534#(<= main_~i~0 115), 260533#(<= main_~i~0 114), 260532#(<= main_~i~0 113), 260539#(<= main_~i~0 120), 260538#(<= main_~i~0 119), 260537#(<= main_~i~0 118), 260536#(<= main_~i~0 117), 260543#(<= main_~i~0 124), 260542#(<= main_~i~0 123), 260541#(<= main_~i~0 122), 260540#(<= main_~i~0 121), 260545#(and (<= main_~i~0 125) (<= 1 main_~i~0)), 260544#(and (<= 0 main_~i~0) (<= main_~i~0 124))] [2018-04-12 03:04:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 39125 backedges. 0 proven. 39125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:04:44,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-12 03:04:44,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-12 03:04:44,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8006, Invalid=8506, Unknown=0, NotChecked=0, Total=16512 [2018-04-12 03:04:44,773 INFO L87 Difference]: Start difference. First operand 1782 states and 2409 transitions. Second operand 129 states. [2018-04-12 03:04:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:04:56,508 INFO L93 Difference]: Finished difference Result 1926 states and 2560 transitions. [2018-04-12 03:04:56,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-12 03:04:56,508 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 633 [2018-04-12 03:04:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:04:56,510 INFO L225 Difference]: With dead ends: 1926 [2018-04-12 03:04:56,510 INFO L226 Difference]: Without dead ends: 1926 [2018-04-12 03:04:56,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7999 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=24006, Invalid=40256, Unknown=0, NotChecked=0, Total=64262 [2018-04-12 03:04:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-04-12 03:04:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1796. [2018-04-12 03:04:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-04-12 03:04:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2428 transitions. [2018-04-12 03:04:56,521 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2428 transitions. Word has length 633 [2018-04-12 03:04:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:04:56,521 INFO L459 AbstractCegarLoop]: Abstraction has 1796 states and 2428 transitions. [2018-04-12 03:04:56,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-12 03:04:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2428 transitions. [2018-04-12 03:04:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2018-04-12 03:04:56,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:04:56,524 INFO L355 BasicCegarLoop]: trace histogram [127, 127, 126, 126, 126, 1, 1, 1, 1, 1, 1] [2018-04-12 03:04:56,524 INFO L408 AbstractCegarLoop]: === Iteration 127 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:04:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2119144163, now seen corresponding path program 126 times [2018-04-12 03:04:56,525 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:04:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:04:56,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 39753 backedges. 0 proven. 39753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:01,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:01,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-04-12 03:05:01,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:01,576 INFO L182 omatonBuilderFactory]: Interpolants [264518#true, 264519#false, 264524#(<= main_~i~0 4), 264525#(<= main_~i~0 5), 264526#(<= main_~i~0 6), 264527#(<= main_~i~0 7), 264520#(<= main_~i~0 0), 264521#(<= main_~i~0 1), 264522#(<= main_~i~0 2), 264523#(<= main_~i~0 3), 264532#(<= main_~i~0 12), 264533#(<= main_~i~0 13), 264534#(<= main_~i~0 14), 264535#(<= main_~i~0 15), 264528#(<= main_~i~0 8), 264529#(<= main_~i~0 9), 264530#(<= main_~i~0 10), 264531#(<= main_~i~0 11), 264540#(<= main_~i~0 20), 264541#(<= main_~i~0 21), 264542#(<= main_~i~0 22), 264543#(<= main_~i~0 23), 264536#(<= main_~i~0 16), 264537#(<= main_~i~0 17), 264538#(<= main_~i~0 18), 264539#(<= main_~i~0 19), 264548#(<= main_~i~0 28), 264549#(<= main_~i~0 29), 264550#(<= main_~i~0 30), 264551#(<= main_~i~0 31), 264544#(<= main_~i~0 24), 264545#(<= main_~i~0 25), 264546#(<= main_~i~0 26), 264547#(<= main_~i~0 27), 264556#(<= main_~i~0 36), 264557#(<= main_~i~0 37), 264558#(<= main_~i~0 38), 264559#(<= main_~i~0 39), 264552#(<= main_~i~0 32), 264553#(<= main_~i~0 33), 264554#(<= main_~i~0 34), 264555#(<= main_~i~0 35), 264564#(<= main_~i~0 44), 264565#(<= main_~i~0 45), 264566#(<= main_~i~0 46), 264567#(<= main_~i~0 47), 264560#(<= main_~i~0 40), 264561#(<= main_~i~0 41), 264562#(<= main_~i~0 42), 264563#(<= main_~i~0 43), 264572#(<= main_~i~0 52), 264573#(<= main_~i~0 53), 264574#(<= main_~i~0 54), 264575#(<= main_~i~0 55), 264568#(<= main_~i~0 48), 264569#(<= main_~i~0 49), 264570#(<= main_~i~0 50), 264571#(<= main_~i~0 51), 264580#(<= main_~i~0 60), 264581#(<= main_~i~0 61), 264582#(<= main_~i~0 62), 264583#(<= main_~i~0 63), 264576#(<= main_~i~0 56), 264577#(<= main_~i~0 57), 264578#(<= main_~i~0 58), 264579#(<= main_~i~0 59), 264588#(<= main_~i~0 68), 264589#(<= main_~i~0 69), 264590#(<= main_~i~0 70), 264591#(<= main_~i~0 71), 264584#(<= main_~i~0 64), 264585#(<= main_~i~0 65), 264586#(<= main_~i~0 66), 264587#(<= main_~i~0 67), 264596#(<= main_~i~0 76), 264597#(<= main_~i~0 77), 264598#(<= main_~i~0 78), 264599#(<= main_~i~0 79), 264592#(<= main_~i~0 72), 264593#(<= main_~i~0 73), 264594#(<= main_~i~0 74), 264595#(<= main_~i~0 75), 264604#(<= main_~i~0 84), 264605#(<= main_~i~0 85), 264606#(<= main_~i~0 86), 264607#(<= main_~i~0 87), 264600#(<= main_~i~0 80), 264601#(<= main_~i~0 81), 264602#(<= main_~i~0 82), 264603#(<= main_~i~0 83), 264612#(<= main_~i~0 92), 264613#(<= main_~i~0 93), 264614#(<= main_~i~0 94), 264615#(<= main_~i~0 95), 264608#(<= main_~i~0 88), 264609#(<= main_~i~0 89), 264610#(<= main_~i~0 90), 264611#(<= main_~i~0 91), 264620#(<= main_~i~0 100), 264621#(<= main_~i~0 101), 264622#(<= main_~i~0 102), 264623#(<= main_~i~0 103), 264616#(<= main_~i~0 96), 264617#(<= main_~i~0 97), 264618#(<= main_~i~0 98), 264619#(<= main_~i~0 99), 264628#(<= main_~i~0 108), 264629#(<= main_~i~0 109), 264630#(<= main_~i~0 110), 264631#(<= main_~i~0 111), 264624#(<= main_~i~0 104), 264625#(<= main_~i~0 105), 264626#(<= main_~i~0 106), 264627#(<= main_~i~0 107), 264636#(<= main_~i~0 116), 264637#(<= main_~i~0 117), 264638#(<= main_~i~0 118), 264639#(<= main_~i~0 119), 264632#(<= main_~i~0 112), 264633#(<= main_~i~0 113), 264634#(<= main_~i~0 114), 264635#(<= main_~i~0 115), 264644#(<= main_~i~0 124), 264645#(and (<= 0 main_~i~0) (<= main_~i~0 124)), 264646#(and (<= main_~i~0 125) (<= 1 main_~i~0)), 264647#(and (<= 2 main_~i~0) (<= main_~i~0 126)), 264640#(<= main_~i~0 120), 264641#(<= main_~i~0 121), 264642#(<= main_~i~0 122), 264643#(<= main_~i~0 123)] [2018-04-12 03:05:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 39753 backedges. 0 proven. 39753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:01,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-12 03:05:01,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-12 03:05:01,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8008, Invalid=8762, Unknown=0, NotChecked=0, Total=16770 [2018-04-12 03:05:01,578 INFO L87 Difference]: Start difference. First operand 1796 states and 2428 transitions. Second operand 130 states. [2018-04-12 03:05:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 03:05:14,912 INFO L93 Difference]: Finished difference Result 1941 states and 2580 transitions. [2018-04-12 03:05:14,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-04-12 03:05:14,912 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 638 [2018-04-12 03:05:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 03:05:14,914 INFO L225 Difference]: With dead ends: 1941 [2018-04-12 03:05:14,914 INFO L226 Difference]: Without dead ends: 1941 [2018-04-12 03:05:14,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8250 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=24135, Invalid=41145, Unknown=0, NotChecked=0, Total=65280 [2018-04-12 03:05:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-04-12 03:05:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1810. [2018-04-12 03:05:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2018-04-12 03:05:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2447 transitions. [2018-04-12 03:05:14,926 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2447 transitions. Word has length 638 [2018-04-12 03:05:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 03:05:14,926 INFO L459 AbstractCegarLoop]: Abstraction has 1810 states and 2447 transitions. [2018-04-12 03:05:14,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-12 03:05:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2447 transitions. [2018-04-12 03:05:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-04-12 03:05:14,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 03:05:14,929 INFO L355 BasicCegarLoop]: trace histogram [128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1] [2018-04-12 03:05:14,929 INFO L408 AbstractCegarLoop]: === Iteration 128 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 03:05:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1103756278, now seen corresponding path program 127 times [2018-04-12 03:05:14,931 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 03:05:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 03:05:15,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 03:05:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 40386 backedges. 0 proven. 40386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:20,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 03:05:20,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-04-12 03:05:20,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 03:05:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:20,303 INFO L182 omatonBuilderFactory]: Interpolants [268652#false, 268653#(<= main_~i~0 0), 268654#(<= main_~i~0 1), 268655#(<= main_~i~0 2), 268651#true, 268660#(<= main_~i~0 7), 268661#(<= main_~i~0 8), 268662#(<= main_~i~0 9), 268663#(<= main_~i~0 10), 268656#(<= main_~i~0 3), 268657#(<= main_~i~0 4), 268658#(<= main_~i~0 5), 268659#(<= main_~i~0 6), 268668#(<= main_~i~0 15), 268669#(<= main_~i~0 16), 268670#(<= main_~i~0 17), 268671#(<= main_~i~0 18), 268664#(<= main_~i~0 11), 268665#(<= main_~i~0 12), 268666#(<= main_~i~0 13), 268667#(<= main_~i~0 14), 268676#(<= main_~i~0 23), 268677#(<= main_~i~0 24), 268678#(<= main_~i~0 25), 268679#(<= main_~i~0 26), 268672#(<= main_~i~0 19), 268673#(<= main_~i~0 20), 268674#(<= main_~i~0 21), 268675#(<= main_~i~0 22), 268684#(<= main_~i~0 31), 268685#(<= main_~i~0 32), 268686#(<= main_~i~0 33), 268687#(<= main_~i~0 34), 268680#(<= main_~i~0 27), 268681#(<= main_~i~0 28), 268682#(<= main_~i~0 29), 268683#(<= main_~i~0 30), 268692#(<= main_~i~0 39), 268693#(<= main_~i~0 40), 268694#(<= main_~i~0 41), 268695#(<= main_~i~0 42), 268688#(<= main_~i~0 35), 268689#(<= main_~i~0 36), 268690#(<= main_~i~0 37), 268691#(<= main_~i~0 38), 268700#(<= main_~i~0 47), 268701#(<= main_~i~0 48), 268702#(<= main_~i~0 49), 268703#(<= main_~i~0 50), 268696#(<= main_~i~0 43), 268697#(<= main_~i~0 44), 268698#(<= main_~i~0 45), 268699#(<= main_~i~0 46), 268708#(<= main_~i~0 55), 268709#(<= main_~i~0 56), 268710#(<= main_~i~0 57), 268711#(<= main_~i~0 58), 268704#(<= main_~i~0 51), 268705#(<= main_~i~0 52), 268706#(<= main_~i~0 53), 268707#(<= main_~i~0 54), 268716#(<= main_~i~0 63), 268717#(<= main_~i~0 64), 268718#(<= main_~i~0 65), 268719#(<= main_~i~0 66), 268712#(<= main_~i~0 59), 268713#(<= main_~i~0 60), 268714#(<= main_~i~0 61), 268715#(<= main_~i~0 62), 268724#(<= main_~i~0 71), 268725#(<= main_~i~0 72), 268726#(<= main_~i~0 73), 268727#(<= main_~i~0 74), 268720#(<= main_~i~0 67), 268721#(<= main_~i~0 68), 268722#(<= main_~i~0 69), 268723#(<= main_~i~0 70), 268732#(<= main_~i~0 79), 268733#(<= main_~i~0 80), 268734#(<= main_~i~0 81), 268735#(<= main_~i~0 82), 268728#(<= main_~i~0 75), 268729#(<= main_~i~0 76), 268730#(<= main_~i~0 77), 268731#(<= main_~i~0 78), 268740#(<= main_~i~0 87), 268741#(<= main_~i~0 88), 268742#(<= main_~i~0 89), 268743#(<= main_~i~0 90), 268736#(<= main_~i~0 83), 268737#(<= main_~i~0 84), 268738#(<= main_~i~0 85), 268739#(<= main_~i~0 86), 268748#(<= main_~i~0 95), 268749#(<= main_~i~0 96), 268750#(<= main_~i~0 97), 268751#(<= main_~i~0 98), 268744#(<= main_~i~0 91), 268745#(<= main_~i~0 92), 268746#(<= main_~i~0 93), 268747#(<= main_~i~0 94), 268756#(<= main_~i~0 103), 268757#(<= main_~i~0 104), 268758#(<= main_~i~0 105), 268759#(<= main_~i~0 106), 268752#(<= main_~i~0 99), 268753#(<= main_~i~0 100), 268754#(<= main_~i~0 101), 268755#(<= main_~i~0 102), 268764#(<= main_~i~0 111), 268765#(<= main_~i~0 112), 268766#(<= main_~i~0 113), 268767#(<= main_~i~0 114), 268760#(<= main_~i~0 107), 268761#(<= main_~i~0 108), 268762#(<= main_~i~0 109), 268763#(<= main_~i~0 110), 268772#(<= main_~i~0 119), 268773#(<= main_~i~0 120), 268774#(<= main_~i~0 121), 268775#(<= main_~i~0 122), 268768#(<= main_~i~0 115), 268769#(<= main_~i~0 116), 268770#(<= main_~i~0 117), 268771#(<= main_~i~0 118), 268780#(and (<= 0 main_~i~0) (<= main_~i~0 126)), 268781#(and (<= 1 main_~i~0) (<= main_~i~0 127)), 268776#(<= main_~i~0 123), 268777#(<= main_~i~0 124), 268778#(<= main_~i~0 125), 268779#(<= main_~i~0 126)] [2018-04-12 03:05:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 40386 backedges. 0 proven. 40386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 03:05:20,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-12 03:05:20,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-12 03:05:20,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8261, Invalid=8769, Unknown=0, NotChecked=0, Total=17030 [2018-04-12 03:05:20,305 INFO L87 Difference]: Start difference. First operand 1810 states and 2447 transitions. Second operand 131 states. Received shutdown request... [2018-04-12 03:05:27,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-12 03:05:27,222 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 03:05:27,225 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 03:05:27,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 03:05:27 BoogieIcfgContainer [2018-04-12 03:05:27,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 03:05:27,225 INFO L168 Benchmark]: Toolchain (without parser) took 770658.50 ms. Allocated memory was 465.6 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 403.1 MB in the beginning and 251.7 MB in the end (delta: 151.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-04-12 03:05:27,226 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 465.6 MB. Free memory is still 425.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 03:05:27,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.83 ms. Allocated memory is still 465.6 MB. Free memory was 403.1 MB in the beginning and 393.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. [2018-04-12 03:05:27,226 INFO L168 Benchmark]: Boogie Preprocessor took 21.42 ms. Allocated memory is still 465.6 MB. Free memory was 393.8 MB in the beginning and 391.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 03:05:27,226 INFO L168 Benchmark]: RCFGBuilder took 246.89 ms. Allocated memory was 465.6 MB in the beginning and 577.2 MB in the end (delta: 111.7 MB). Free memory was 391.1 MB in the beginning and 538.1 MB in the end (delta: -146.9 MB). Peak memory consumption was 37.0 MB. Max. memory is 5.3 GB. [2018-04-12 03:05:27,227 INFO L168 Benchmark]: TraceAbstraction took 770249.93 ms. Allocated memory was 577.2 MB in the beginning and 2.2 GB in the end (delta: 1.6 GB). Free memory was 538.1 MB in the beginning and 251.7 MB in the end (delta: 286.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-04-12 03:05:27,228 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.10 ms. Allocated memory is still 465.6 MB. Free memory is still 425.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 137.83 ms. Allocated memory is still 465.6 MB. Free memory was 403.1 MB in the beginning and 393.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.42 ms. Allocated memory is still 465.6 MB. Free memory was 393.8 MB in the beginning and 391.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 246.89 ms. Allocated memory was 465.6 MB in the beginning and 577.2 MB in the end (delta: 111.7 MB). Free memory was 391.1 MB in the beginning and 538.1 MB in the end (delta: -146.9 MB). Peak memory consumption was 37.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 770249.93 ms. Allocated memory was 577.2 MB in the beginning and 2.2 GB in the end (delta: 1.6 GB). Free memory was 538.1 MB in the beginning and 251.7 MB in the end (delta: 286.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (1810states) and interpolant automaton (currently 90 states, 131 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (1810states) and interpolant automaton (currently 90 states, 131 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (1810states) and interpolant automaton (currently 90 states, 131 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (1810states) and interpolant automaton (currently 90 states, 131 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 4 error locations. TIMEOUT Result, 770.2s OverallTime, 128 OverallIterations, 128 TraceHistogramMax, 550.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21950 SDtfs, 459524 SDslu, 136799 SDs, 0 SdLazy, 528566 SolverSat, 175596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 155.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16467 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363335 ImplicationChecksByTransitivity, 357.0s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1810occurred in iteration=127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/1731264 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 127 MinimizatonAttempts, 8636 StatesRemovedByMinimization, 127 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 206.0s InterpolantComputationTime, 41664 NumberOfCodeBlocks, 41664 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 41536 ConstructedInterpolants, 0 QuantifiedInterpolants, 56147620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 128 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1731264 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/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_03-05-27-232.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_03-05-27-232.csv Completed graceful shutdown