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_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 05:08:01,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 05:08:01,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 05:08:01,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 05:08:01,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 05:08:01,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 05:08:01,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 05:08:01,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 05:08:01,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 05:08:01,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 05:08:01,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 05:08:01,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 05:08:01,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 05:08:01,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 05:08:01,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 05:08:01,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 05:08:01,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 05:08:01,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 05:08:01,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 05:08:01,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 05:08:01,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 05:08:01,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 05:08:01,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 05:08:01,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 05:08:01,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 05:08:01,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 05:08:01,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 05:08:01,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 05:08:01,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 05:08:01,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 05:08:01,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 05:08:01,418 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_NoArray.epf [2018-04-13 05:08:01,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 05:08:01,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 05:08:01,428 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 05:08:01,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 05:08:01,428 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 05:08:01,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 05:08:01,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 05:08:01,429 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 05:08:01,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 05:08:01,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 05:08:01,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 05:08:01,429 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 05:08:01,430 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 05:08:01,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 05:08:01,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 05:08:01,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 05:08:01,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 05:08:01,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 05:08:01,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 05:08:01,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 05:08:01,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 05:08:01,431 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 05:08:01,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 05:08:01,431 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 05:08:01,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 05:08:01,464 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 05:08:01,466 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 05:08:01,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 05:08:01,468 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 05:08:01,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-04-13 05:08:01,811 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG689ed15d1 [2018-04-13 05:08:01,913 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 05:08:01,913 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 05:08:01,914 INFO L168 CDTParser]: Scanning standard_strcpy_original_false-valid-deref.i [2018-04-13 05:08:01,914 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 05:08:01,914 INFO L215 ultiparseSymbolTable]: [2018-04-13 05:08:01,915 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 05:08:01,915 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_original_false-valid-deref.i [2018-04-13 05:08:01,915 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_original_false-valid-deref.i [2018-04-13 05:08:01,915 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 05:08:01,915 INFO L233 ultiparseSymbolTable]: [2018-04-13 05:08:01,933 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG689ed15d1 [2018-04-13 05:08:01,938 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 05:08:01,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 05:08:01,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 05:08:01,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 05:08:01,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 05:08:01,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:08:01" (1/1) ... [2018-04-13 05:08:01,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a631a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:01, skipping insertion in model container [2018-04-13 05:08:01,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:08:01" (1/1) ... [2018-04-13 05:08:01,964 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:08:01,974 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:08:02,102 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:08:02,119 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:08:02,123 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-13 05:08:02,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02 WrapperNode [2018-04-13 05:08:02,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 05:08:02,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 05:08:02,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 05:08:02,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 05:08:02,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (1/1) ... [2018-04-13 05:08:02,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (1/1) ... [2018-04-13 05:08:02,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (1/1) ... [2018-04-13 05:08:02,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (1/1) ... [2018-04-13 05:08:02,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (1/1) ... [2018-04-13 05:08:02,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (1/1) ... [2018-04-13 05:08:02,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (1/1) ... [2018-04-13 05:08:02,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 05:08:02,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 05:08:02,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 05:08:02,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 05:08:02,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (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-13 05:08:02,238 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 05:08:02,239 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 05:08:02,239 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-13 05:08:02,239 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 05:08:02,239 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 05:08:02,239 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-13 05:08:02,239 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 05:08:02,239 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 05:08:02,240 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 05:08:02,380 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 05:08:02,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:08:02 BoogieIcfgContainer [2018-04-13 05:08:02,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 05:08:02,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 05:08:02,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 05:08:02,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 05:08:02,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:08:01" (1/3) ... [2018-04-13 05:08:02,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5126cb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:08:02, skipping insertion in model container [2018-04-13 05:08:02,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:08:02" (2/3) ... [2018-04-13 05:08:02,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5126cb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:08:02, skipping insertion in model container [2018-04-13 05:08:02,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:08:02" (3/3) ... [2018-04-13 05:08:02,385 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-04-13 05:08:02,390 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 05:08:02,395 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-13 05:08:02,418 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 05:08:02,419 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 05:08:02,419 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 05:08:02,419 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 05:08:02,419 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 05:08:02,419 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 05:08:02,419 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 05:08:02,419 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 05:08:02,419 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 05:08:02,420 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 05:08:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-04-13 05:08:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-13 05:08:02,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:02,437 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:02,437 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1734705512, now seen corresponding path program 1 times [2018-04-13 05:08:02,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:02,444 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:02,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:02,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:02,502 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:02,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:08:02,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 05:08:02,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:08:02,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:08:02,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:08:02,541 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-04-13 05:08:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:02,610 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-04-13 05:08:02,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:08:02,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-13 05:08:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:02,619 INFO L225 Difference]: With dead ends: 50 [2018-04-13 05:08:02,619 INFO L226 Difference]: Without dead ends: 41 [2018-04-13 05:08:02,621 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-13 05:08:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-13 05:08:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-04-13 05:08:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-13 05:08:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-04-13 05:08:02,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-04-13 05:08:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:02,649 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-04-13 05:08:02,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:08:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-04-13 05:08:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 05:08:02,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:02,650 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:02,650 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1166772373, now seen corresponding path program 1 times [2018-04-13 05:08:02,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:02,650 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:02,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:02,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:02,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:02,664 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:02,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:02,692 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:02,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:02,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:02,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:02,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-04-13 05:08:02,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:08:02,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:08:02,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:08:02,722 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-04-13 05:08:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:02,828 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-13 05:08:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 05:08:02,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-13 05:08:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:02,830 INFO L225 Difference]: With dead ends: 54 [2018-04-13 05:08:02,830 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 05:08:02,830 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:08:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 05:08:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-04-13 05:08:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 05:08:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-13 05:08:02,836 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-04-13 05:08:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:02,836 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-13 05:08:02,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:08:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-13 05:08:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 05:08:02,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:02,838 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:02,838 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1914964600, now seen corresponding path program 2 times [2018-04-13 05:08:02,839 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:02,839 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:02,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:02,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:02,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:02,846 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:02,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:02,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:08:02,890 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:08:02,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:02,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:02,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:02,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-04-13 05:08:02,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:08:02,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:08:02,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:08:02,911 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-04-13 05:08:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:03,003 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-04-13 05:08:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:08:03,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-13 05:08:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:03,005 INFO L225 Difference]: With dead ends: 67 [2018-04-13 05:08:03,005 INFO L226 Difference]: Without dead ends: 67 [2018-04-13 05:08:03,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:08:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-13 05:08:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-04-13 05:08:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-13 05:08:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-13 05:08:03,009 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-04-13 05:08:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:03,010 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-13 05:08:03,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:08:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-13 05:08:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 05:08:03,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:03,010 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:03,010 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash -510089099, now seen corresponding path program 3 times [2018-04-13 05:08:03,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:03,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:03,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:03,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:03,017 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:03,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:03,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:08:03,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 05:08:03,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:03,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:03,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-13 05:08:03,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 05:08:03,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 05:08:03,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:08:03,071 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-04-13 05:08:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:03,201 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-04-13 05:08:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:08:03,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-13 05:08:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:03,202 INFO L225 Difference]: With dead ends: 80 [2018-04-13 05:08:03,202 INFO L226 Difference]: Without dead ends: 80 [2018-04-13 05:08:03,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-13 05:08:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-13 05:08:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-04-13 05:08:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-13 05:08:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-04-13 05:08:03,209 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-04-13 05:08:03,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:03,209 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-04-13 05:08:03,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 05:08:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-04-13 05:08:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 05:08:03,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:03,210 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:03,210 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash -697843288, now seen corresponding path program 4 times [2018-04-13 05:08:03,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:03,211 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:03,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:03,212 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:03,219 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:03,281 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:03,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:08:03,293 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:08:03,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:03,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:03,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-13 05:08:03,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 05:08:03,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 05:08:03,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:08:03,307 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-04-13 05:08:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:03,478 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-04-13 05:08:03,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 05:08:03,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-13 05:08:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:03,479 INFO L225 Difference]: With dead ends: 93 [2018-04-13 05:08:03,480 INFO L226 Difference]: Without dead ends: 93 [2018-04-13 05:08:03,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:08:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-13 05:08:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-04-13 05:08:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 05:08:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-04-13 05:08:03,486 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-04-13 05:08:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:03,486 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-04-13 05:08:03,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 05:08:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-04-13 05:08:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 05:08:03,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:03,488 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:03,488 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1960349611, now seen corresponding path program 5 times [2018-04-13 05:08:03,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:03,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:03,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:03,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:03,496 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:03,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:03,542 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:08:03,553 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 05:08:03,553 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:03,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:03,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-04-13 05:08:03,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 05:08:03,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 05:08:03,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-04-13 05:08:03,603 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 14 states. [2018-04-13 05:08:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:03,789 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-04-13 05:08:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 05:08:03,789 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-13 05:08:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:03,790 INFO L225 Difference]: With dead ends: 106 [2018-04-13 05:08:03,790 INFO L226 Difference]: Without dead ends: 106 [2018-04-13 05:08:03,790 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:08:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-13 05:08:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-04-13 05:08:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 05:08:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-04-13 05:08:03,795 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-04-13 05:08:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:03,796 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-04-13 05:08:03,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 05:08:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-04-13 05:08:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 05:08:03,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:03,796 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:03,796 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 138077640, now seen corresponding path program 6 times [2018-04-13 05:08:03,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:03,797 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:03,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:03,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:03,805 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:03,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:08:03,876 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 05:08:03,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:03,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:03,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:03,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-13 05:08:03,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 05:08:03,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 05:08:03,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-04-13 05:08:03,907 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 13 states. [2018-04-13 05:08:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:04,063 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-04-13 05:08:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 05:08:04,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-04-13 05:08:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:04,064 INFO L225 Difference]: With dead ends: 119 [2018-04-13 05:08:04,064 INFO L226 Difference]: Without dead ends: 119 [2018-04-13 05:08:04,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:08:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-13 05:08:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-04-13 05:08:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-13 05:08:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-04-13 05:08:04,069 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-04-13 05:08:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:04,069 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-04-13 05:08:04,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 05:08:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-04-13 05:08:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 05:08:04,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:04,070 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:04,070 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash 709222453, now seen corresponding path program 7 times [2018-04-13 05:08:04,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:04,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:04,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:04,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:04,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:04,079 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:04,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:04,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:04,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:04,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:04,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:04,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-13 05:08:04,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:08:04,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:08:04,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:08:04,152 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-04-13 05:08:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:04,323 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-04-13 05:08:04,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 05:08:04,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-13 05:08:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:04,324 INFO L225 Difference]: With dead ends: 132 [2018-04-13 05:08:04,324 INFO L226 Difference]: Without dead ends: 132 [2018-04-13 05:08:04,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:08:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-13 05:08:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-04-13 05:08:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-13 05:08:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-04-13 05:08:04,330 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-04-13 05:08:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:04,330 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-04-13 05:08:04,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:08:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-04-13 05:08:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 05:08:04,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:04,332 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:04,332 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash 336028136, now seen corresponding path program 8 times [2018-04-13 05:08:04,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:04,332 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:04,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:04,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:04,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:04,340 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:04,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:04,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:08:04,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:08:04,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:04,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:04,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:04,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-13 05:08:04,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:08:04,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:08:04,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:08:04,429 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-04-13 05:08:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:04,836 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-04-13 05:08:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 05:08:04,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-13 05:08:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:04,838 INFO L225 Difference]: With dead ends: 145 [2018-04-13 05:08:04,838 INFO L226 Difference]: Without dead ends: 145 [2018-04-13 05:08:04,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:08:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-13 05:08:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-04-13 05:08:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 05:08:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-04-13 05:08:04,847 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-04-13 05:08:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:04,848 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-04-13 05:08:04,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:08:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-04-13 05:08:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 05:08:04,849 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:04,849 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:04,850 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1837234197, now seen corresponding path program 9 times [2018-04-13 05:08:04,850 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:04,850 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:04,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:04,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:04,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:04,857 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:04,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:04,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:04,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:08:04,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 05:08:04,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:04,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:04,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:04,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-13 05:08:04,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 05:08:04,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 05:08:04,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:08:04,981 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 23 states. [2018-04-13 05:08:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:05,386 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-04-13 05:08:05,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:08:05,386 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-13 05:08:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:05,387 INFO L225 Difference]: With dead ends: 158 [2018-04-13 05:08:05,387 INFO L226 Difference]: Without dead ends: 158 [2018-04-13 05:08:05,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:08:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-13 05:08:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-04-13 05:08:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-13 05:08:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-04-13 05:08:05,392 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-04-13 05:08:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:05,393 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-04-13 05:08:05,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 05:08:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-04-13 05:08:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 05:08:05,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:05,394 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:05,394 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash 872363528, now seen corresponding path program 10 times [2018-04-13 05:08:05,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:05,395 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:05,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:05,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:05,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:05,403 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:05,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:05,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:05,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:08:05,491 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:08:05,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:05,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:05,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:05,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-04-13 05:08:05,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 05:08:05,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 05:08:05,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-13 05:08:05,504 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-04-13 05:08:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:05,805 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-04-13 05:08:05,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:08:05,805 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-13 05:08:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:05,805 INFO L225 Difference]: With dead ends: 171 [2018-04-13 05:08:05,806 INFO L226 Difference]: Without dead ends: 171 [2018-04-13 05:08:05,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 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-13 05:08:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-13 05:08:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-04-13 05:08:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 05:08:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-04-13 05:08:05,811 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-04-13 05:08:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:05,811 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-04-13 05:08:05,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 05:08:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-04-13 05:08:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-13 05:08:05,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:05,813 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:05,813 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:05,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1444300811, now seen corresponding path program 11 times [2018-04-13 05:08:05,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:05,813 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:05,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:05,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:05,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:05,821 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:05,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:05,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:05,904 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:08:05,917 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 05:08:05,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:05,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:06,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:06,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-04-13 05:08:06,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 05:08:06,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 05:08:06,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-04-13 05:08:06,043 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 26 states. [2018-04-13 05:08:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:06,812 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-04-13 05:08:06,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 05:08:06,813 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-04-13 05:08:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:06,814 INFO L225 Difference]: With dead ends: 184 [2018-04-13 05:08:06,814 INFO L226 Difference]: Without dead ends: 184 [2018-04-13 05:08:06,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-13 05:08:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-13 05:08:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-04-13 05:08:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-13 05:08:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-04-13 05:08:06,819 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-04-13 05:08:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:06,819 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-04-13 05:08:06,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 05:08:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-04-13 05:08:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-13 05:08:06,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:06,820 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:06,820 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash 198468136, now seen corresponding path program 12 times [2018-04-13 05:08:06,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:06,821 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:06,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:06,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:06,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:06,827 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:06,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:06,915 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:06,916 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:08:06,926 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 05:08:06,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:06,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:07,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:07,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-04-13 05:08:07,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 05:08:07,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 05:08:07,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-13 05:08:07,019 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 29 states. [2018-04-13 05:08:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:07,366 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-04-13 05:08:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 05:08:07,367 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-13 05:08:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:07,367 INFO L225 Difference]: With dead ends: 197 [2018-04-13 05:08:07,367 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 05:08:07,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-13 05:08:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 05:08:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-04-13 05:08:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-13 05:08:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-04-13 05:08:07,372 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-04-13 05:08:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:07,372 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-04-13 05:08:07,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 05:08:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-04-13 05:08:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 05:08:07,373 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:07,373 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:07,374 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1156898859, now seen corresponding path program 13 times [2018-04-13 05:08:07,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:07,374 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:07,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:07,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:07,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:07,381 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:07,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:07,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:07,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:07,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:07,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:07,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-04-13 05:08:07,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 05:08:07,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 05:08:07,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-13 05:08:07,500 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-04-13 05:08:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:07,764 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-04-13 05:08:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 05:08:07,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-13 05:08:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:07,765 INFO L225 Difference]: With dead ends: 210 [2018-04-13 05:08:07,765 INFO L226 Difference]: Without dead ends: 210 [2018-04-13 05:08:07,765 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 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-13 05:08:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-13 05:08:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-04-13 05:08:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-13 05:08:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-04-13 05:08:07,768 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-04-13 05:08:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:07,768 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-04-13 05:08:07,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 05:08:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-04-13 05:08:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-13 05:08:07,769 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:07,769 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:07,769 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -927406520, now seen corresponding path program 14 times [2018-04-13 05:08:07,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:07,769 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:07,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:07,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:07,774 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:07,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:07,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:08:07,872 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:08:07,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:07,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:07,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:07,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-04-13 05:08:07,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 05:08:07,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 05:08:07,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:08:07,882 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-04-13 05:08:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:08,177 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-04-13 05:08:08,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 05:08:08,177 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-13 05:08:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:08,178 INFO L225 Difference]: With dead ends: 223 [2018-04-13 05:08:08,178 INFO L226 Difference]: Without dead ends: 223 [2018-04-13 05:08:08,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 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-13 05:08:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-13 05:08:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-04-13 05:08:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-13 05:08:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-04-13 05:08:08,185 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-04-13 05:08:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:08,185 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-04-13 05:08:08,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 05:08:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-04-13 05:08:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-13 05:08:08,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:08,186 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:08,186 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash -487313483, now seen corresponding path program 15 times [2018-04-13 05:08:08,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:08,187 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:08,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:08,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:08,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:08,195 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:08,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:08,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:08,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:08:08,311 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 05:08:08,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:08,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:08,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:08,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-13 05:08:08,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 05:08:08,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 05:08:08,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 05:08:08,404 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 35 states. [2018-04-13 05:08:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:09,281 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-04-13 05:08:09,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 05:08:09,282 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-04-13 05:08:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:09,282 INFO L225 Difference]: With dead ends: 236 [2018-04-13 05:08:09,283 INFO L226 Difference]: Without dead ends: 236 [2018-04-13 05:08:09,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 05:08:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-13 05:08:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-13 05:08:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 05:08:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-04-13 05:08:09,288 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-04-13 05:08:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:09,289 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-04-13 05:08:09,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 05:08:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-04-13 05:08:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-13 05:08:09,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:09,290 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:09,290 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1096729192, now seen corresponding path program 16 times [2018-04-13 05:08:09,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:09,290 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:09,291 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:09,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:09,291 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:09,297 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:09,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:09,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:08:09,446 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:08:09,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:09,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:09,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:09,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-04-13 05:08:09,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 05:08:09,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 05:08:09,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:08:09,467 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-04-13 05:08:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:10,423 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-04-13 05:08:10,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 05:08:10,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-13 05:08:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:10,424 INFO L225 Difference]: With dead ends: 249 [2018-04-13 05:08:10,424 INFO L226 Difference]: Without dead ends: 249 [2018-04-13 05:08:10,425 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:08:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-13 05:08:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-04-13 05:08:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-13 05:08:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-13 05:08:10,429 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-04-13 05:08:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:10,429 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-13 05:08:10,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 05:08:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-13 05:08:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-13 05:08:10,430 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:10,430 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:10,431 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1439504491, now seen corresponding path program 17 times [2018-04-13 05:08:10,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:10,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:10,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:10,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:10,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:10,438 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:10,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:10,553 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:10,554 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:08:10,563 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 05:08:10,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:10,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:10,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:10,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-04-13 05:08:10,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 05:08:10,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 05:08:10,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 05:08:10,739 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 38 states. [2018-04-13 05:08:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:11,563 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-04-13 05:08:11,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 05:08:11,563 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 92 [2018-04-13 05:08:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:11,564 INFO L225 Difference]: With dead ends: 262 [2018-04-13 05:08:11,564 INFO L226 Difference]: Without dead ends: 262 [2018-04-13 05:08:11,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 05:08:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-13 05:08:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-04-13 05:08:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-13 05:08:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-04-13 05:08:11,567 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-04-13 05:08:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:11,567 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-04-13 05:08:11,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 05:08:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-04-13 05:08:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-13 05:08:11,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:11,568 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:11,568 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 368572040, now seen corresponding path program 18 times [2018-04-13 05:08:11,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:11,568 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:11,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:11,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:11,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:11,573 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:11,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:11,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:11,678 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:08:11,690 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 05:08:11,690 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:11,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:11,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:11,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-13 05:08:11,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 05:08:11,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 05:08:11,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 05:08:11,816 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 41 states. [2018-04-13 05:08:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:13,032 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-04-13 05:08:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 05:08:13,032 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-04-13 05:08:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:13,033 INFO L225 Difference]: With dead ends: 275 [2018-04-13 05:08:13,033 INFO L226 Difference]: Without dead ends: 275 [2018-04-13 05:08:13,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 05:08:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-13 05:08:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-04-13 05:08:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-13 05:08:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-04-13 05:08:13,039 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-04-13 05:08:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:13,039 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-04-13 05:08:13,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 05:08:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-04-13 05:08:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-13 05:08:13,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:13,040 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:13,041 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1076541579, now seen corresponding path program 19 times [2018-04-13 05:08:13,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:13,041 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:13,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:13,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:13,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:13,048 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:13,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:13,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:13,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:13,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:13,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:13,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-04-13 05:08:13,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 05:08:13,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 05:08:13,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:08:13,263 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-04-13 05:08:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:13,778 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-04-13 05:08:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 05:08:13,778 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-13 05:08:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:13,779 INFO L225 Difference]: With dead ends: 288 [2018-04-13 05:08:13,779 INFO L226 Difference]: Without dead ends: 288 [2018-04-13 05:08:13,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 05:08:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-13 05:08:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-04-13 05:08:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-13 05:08:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-04-13 05:08:13,785 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-04-13 05:08:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:13,785 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-04-13 05:08:13,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 05:08:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-04-13 05:08:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-13 05:08:13,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:13,786 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:13,786 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -801733976, now seen corresponding path program 20 times [2018-04-13 05:08:13,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:13,787 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:13,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:13,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:13,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:13,796 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:13,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:13,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:13,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:08:14,004 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:08:14,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:14,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:14,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:14,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-04-13 05:08:14,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 05:08:14,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 05:08:14,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-13 05:08:14,046 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-04-13 05:08:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:14,670 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-04-13 05:08:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 05:08:14,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-13 05:08:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:14,672 INFO L225 Difference]: With dead ends: 301 [2018-04-13 05:08:14,672 INFO L226 Difference]: Without dead ends: 301 [2018-04-13 05:08:14,672 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 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-13 05:08:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-13 05:08:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-04-13 05:08:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-13 05:08:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-04-13 05:08:14,677 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-04-13 05:08:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:14,677 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-04-13 05:08:14,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 05:08:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-04-13 05:08:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-13 05:08:14,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:14,678 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:14,679 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash -647409835, now seen corresponding path program 21 times [2018-04-13 05:08:14,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:14,679 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:14,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:14,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:14,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:14,688 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:14,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:14,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:14,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:08:14,904 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 05:08:14,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:14,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:14,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:14,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-04-13 05:08:14,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 05:08:14,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 05:08:14,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-13 05:08:14,927 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-04-13 05:08:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:15,442 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-04-13 05:08:15,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 05:08:15,451 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-13 05:08:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:15,452 INFO L225 Difference]: With dead ends: 314 [2018-04-13 05:08:15,452 INFO L226 Difference]: Without dead ends: 314 [2018-04-13 05:08:15,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 05:08:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-13 05:08:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-04-13 05:08:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-13 05:08:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-04-13 05:08:15,458 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-04-13 05:08:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:15,459 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-04-13 05:08:15,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 05:08:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-04-13 05:08:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-13 05:08:15,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:15,460 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:15,460 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash 55338696, now seen corresponding path program 22 times [2018-04-13 05:08:15,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:15,460 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:15,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:15,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:15,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:15,469 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:15,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:15,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:08:15,649 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:08:15,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:15,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:15,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:15,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-04-13 05:08:15,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 05:08:15,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 05:08:15,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-13 05:08:15,674 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-04-13 05:08:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:16,259 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-04-13 05:08:16,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 05:08:16,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-13 05:08:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:16,261 INFO L225 Difference]: With dead ends: 327 [2018-04-13 05:08:16,261 INFO L226 Difference]: Without dead ends: 327 [2018-04-13 05:08:16,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 05:08:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-13 05:08:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-04-13 05:08:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-13 05:08:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-04-13 05:08:16,267 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-04-13 05:08:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:16,267 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-04-13 05:08:16,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 05:08:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-04-13 05:08:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-13 05:08:16,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:16,268 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:16,268 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1828913355, now seen corresponding path program 23 times [2018-04-13 05:08:16,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:16,269 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:16,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:16,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:16,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:16,278 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:16,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:16,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:16,477 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:08:16,491 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-13 05:08:16,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:16,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:16,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:16,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2018-04-13 05:08:16,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 05:08:16,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 05:08:16,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 05:08:16,772 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 50 states. [2018-04-13 05:08:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:18,881 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-04-13 05:08:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 05:08:18,881 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 122 [2018-04-13 05:08:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:18,882 INFO L225 Difference]: With dead ends: 340 [2018-04-13 05:08:18,882 INFO L226 Difference]: Without dead ends: 340 [2018-04-13 05:08:18,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 05:08:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-04-13 05:08:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-04-13 05:08:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-13 05:08:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-04-13 05:08:18,887 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-04-13 05:08:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:18,887 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-04-13 05:08:18,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 05:08:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-04-13 05:08:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-13 05:08:18,888 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:18,888 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:18,888 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:18,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1810604776, now seen corresponding path program 24 times [2018-04-13 05:08:18,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:18,889 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:18,889 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:18,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:18,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:18,897 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:19,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:19,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:19,127 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:08:19,140 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-13 05:08:19,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:19,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:19,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:19,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-04-13 05:08:19,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 05:08:19,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 05:08:19,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 05:08:19,341 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 37 states. [2018-04-13 05:08:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:20,225 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-04-13 05:08:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 05:08:20,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-04-13 05:08:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:20,227 INFO L225 Difference]: With dead ends: 353 [2018-04-13 05:08:20,227 INFO L226 Difference]: Without dead ends: 353 [2018-04-13 05:08:20,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 05:08:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-13 05:08:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-04-13 05:08:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-13 05:08:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-04-13 05:08:20,231 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-04-13 05:08:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:20,231 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-04-13 05:08:20,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 05:08:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-04-13 05:08:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-13 05:08:20,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:20,232 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:20,232 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:20,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1327388437, now seen corresponding path program 25 times [2018-04-13 05:08:20,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:20,233 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:20,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:20,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:20,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:20,241 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:20,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:20,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:20,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:20,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:20,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:20,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-04-13 05:08:20,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 05:08:20,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 05:08:20,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-13 05:08:20,453 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-04-13 05:08:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:21,064 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-04-13 05:08:21,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 05:08:21,065 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-13 05:08:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:21,066 INFO L225 Difference]: With dead ends: 366 [2018-04-13 05:08:21,066 INFO L226 Difference]: Without dead ends: 366 [2018-04-13 05:08:21,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 05:08:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-13 05:08:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-04-13 05:08:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-13 05:08:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-04-13 05:08:21,072 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-04-13 05:08:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:21,072 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-04-13 05:08:21,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 05:08:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-04-13 05:08:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-13 05:08:21,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:21,073 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:21,073 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 273037064, now seen corresponding path program 26 times [2018-04-13 05:08:21,074 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:21,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:21,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:21,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:21,081 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:21,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:21,371 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:21,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:08:21,378 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:08:21,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:21,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:21,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:21,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-04-13 05:08:21,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 05:08:21,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 05:08:21,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-13 05:08:21,408 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-04-13 05:08:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:22,123 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-04-13 05:08:22,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 05:08:22,123 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-13 05:08:22,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:22,124 INFO L225 Difference]: With dead ends: 379 [2018-04-13 05:08:22,124 INFO L226 Difference]: Without dead ends: 379 [2018-04-13 05:08:22,125 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 05:08:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-13 05:08:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-04-13 05:08:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-13 05:08:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-04-13 05:08:22,129 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-04-13 05:08:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:22,129 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-04-13 05:08:22,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 05:08:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-04-13 05:08:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-13 05:08:22,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:22,130 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:22,131 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 383473397, now seen corresponding path program 27 times [2018-04-13 05:08:22,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:22,131 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:22,131 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:22,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:22,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:22,139 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:22,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:22,389 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:22,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:08:22,402 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-13 05:08:22,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:22,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:22,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:22,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-04-13 05:08:22,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 05:08:22,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 05:08:22,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-13 05:08:22,432 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-04-13 05:08:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:23,123 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-04-13 05:08:23,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 05:08:23,123 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-13 05:08:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:23,124 INFO L225 Difference]: With dead ends: 392 [2018-04-13 05:08:23,124 INFO L226 Difference]: Without dead ends: 392 [2018-04-13 05:08:23,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 05:08:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-13 05:08:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-04-13 05:08:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-13 05:08:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-04-13 05:08:23,127 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-04-13 05:08:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:23,128 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-04-13 05:08:23,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 05:08:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-04-13 05:08:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-13 05:08:23,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:23,128 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:23,128 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:23,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1611539240, now seen corresponding path program 28 times [2018-04-13 05:08:23,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:23,129 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:23,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:23,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:23,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:23,134 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:23,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:23,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:23,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:08:23,399 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:08:23,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:23,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:23,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:23,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-04-13 05:08:23,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 05:08:23,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 05:08:23,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 05:08:23,692 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 61 states. [2018-04-13 05:08:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:25,738 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-04-13 05:08:25,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 05:08:25,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-04-13 05:08:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:25,740 INFO L225 Difference]: With dead ends: 405 [2018-04-13 05:08:25,740 INFO L226 Difference]: Without dead ends: 405 [2018-04-13 05:08:25,740 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 05:08:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-13 05:08:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-04-13 05:08:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-13 05:08:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-04-13 05:08:25,745 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-04-13 05:08:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:25,745 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-04-13 05:08:25,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 05:08:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-04-13 05:08:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-13 05:08:25,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:25,747 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:25,747 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2042756821, now seen corresponding path program 29 times [2018-04-13 05:08:25,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:25,747 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:25,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:25,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:25,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:25,756 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:25,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:25,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:25,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:08:26,007 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-13 05:08:26,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:26,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:26,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:26,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-04-13 05:08:26,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 05:08:26,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 05:08:26,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 05:08:26,389 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 62 states. [2018-04-13 05:08:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:28,979 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-04-13 05:08:28,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 05:08:28,979 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2018-04-13 05:08:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:28,980 INFO L225 Difference]: With dead ends: 418 [2018-04-13 05:08:28,980 INFO L226 Difference]: Without dead ends: 418 [2018-04-13 05:08:28,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 05:08:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-13 05:08:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-04-13 05:08:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-04-13 05:08:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-04-13 05:08:28,985 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-04-13 05:08:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:28,986 INFO L459 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-04-13 05:08:28,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 05:08:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-04-13 05:08:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-13 05:08:28,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:28,987 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:28,987 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1416980296, now seen corresponding path program 30 times [2018-04-13 05:08:28,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:28,987 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:28,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:28,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:28,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:28,996 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:29,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:29,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:29,388 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:08:29,405 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-13 05:08:29,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:29,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:29,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:29,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-04-13 05:08:29,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 05:08:29,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 05:08:29,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 05:08:29,487 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 37 states. [2018-04-13 05:08:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:30,266 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-04-13 05:08:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 05:08:30,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-04-13 05:08:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:30,267 INFO L225 Difference]: With dead ends: 431 [2018-04-13 05:08:30,267 INFO L226 Difference]: Without dead ends: 431 [2018-04-13 05:08:30,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 05:08:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-13 05:08:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-04-13 05:08:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-13 05:08:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-04-13 05:08:30,272 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-04-13 05:08:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:30,272 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-04-13 05:08:30,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 05:08:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-04-13 05:08:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-13 05:08:30,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:30,273 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:30,273 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1843416757, now seen corresponding path program 31 times [2018-04-13 05:08:30,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:30,274 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:30,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:30,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:30,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:30,283 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:30,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:30,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:30,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:30,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:30,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:30,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-13 05:08:30,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 05:08:30,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 05:08:30,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 05:08:30,646 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-04-13 05:08:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:31,500 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-04-13 05:08:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 05:08:31,501 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-13 05:08:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:31,502 INFO L225 Difference]: With dead ends: 444 [2018-04-13 05:08:31,502 INFO L226 Difference]: Without dead ends: 444 [2018-04-13 05:08:31,502 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 05:08:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-13 05:08:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-04-13 05:08:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-13 05:08:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-04-13 05:08:31,506 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-04-13 05:08:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:31,506 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-04-13 05:08:31,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 05:08:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-04-13 05:08:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-13 05:08:31,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:31,507 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:31,507 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1876032664, now seen corresponding path program 32 times [2018-04-13 05:08:31,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:31,507 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:31,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:31,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:31,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:31,513 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:31,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:31,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:31,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:08:31,893 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:08:31,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:31,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:31,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:31,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-13 05:08:31,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 05:08:31,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 05:08:31,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 05:08:31,943 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-04-13 05:08:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:35,071 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-04-13 05:08:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 05:08:35,072 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-13 05:08:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:35,073 INFO L225 Difference]: With dead ends: 457 [2018-04-13 05:08:35,073 INFO L226 Difference]: Without dead ends: 457 [2018-04-13 05:08:35,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 05:08:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-13 05:08:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-04-13 05:08:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-13 05:08:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-04-13 05:08:35,076 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-04-13 05:08:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:35,077 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-04-13 05:08:35,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 05:08:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-04-13 05:08:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 05:08:35,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:35,077 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:35,077 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 801392277, now seen corresponding path program 33 times [2018-04-13 05:08:35,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:35,078 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:35,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:35,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:35,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:35,083 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:35,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:35,513 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:08:35,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-13 05:08:35,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:35,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:35,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:35,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-13 05:08:35,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 05:08:35,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 05:08:35,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 05:08:35,547 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-04-13 05:08:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:36,386 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-04-13 05:08:36,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 05:08:36,386 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-13 05:08:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:36,387 INFO L225 Difference]: With dead ends: 470 [2018-04-13 05:08:36,387 INFO L226 Difference]: Without dead ends: 470 [2018-04-13 05:08:36,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 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-13 05:08:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-13 05:08:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-04-13 05:08:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-13 05:08:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-04-13 05:08:36,391 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-04-13 05:08:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:36,391 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-04-13 05:08:36,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 05:08:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-04-13 05:08:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-13 05:08:36,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:36,392 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:36,392 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2137651080, now seen corresponding path program 34 times [2018-04-13 05:08:36,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:36,392 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:36,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:36,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:36,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:36,398 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:36,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:36,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:36,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:08:36,700 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:08:36,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:36,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:36,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:36,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-04-13 05:08:36,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 05:08:36,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 05:08:36,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 05:08:36,737 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-04-13 05:08:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:37,650 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-04-13 05:08:37,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 05:08:37,651 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-13 05:08:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:37,652 INFO L225 Difference]: With dead ends: 483 [2018-04-13 05:08:37,652 INFO L226 Difference]: Without dead ends: 483 [2018-04-13 05:08:37,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 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-13 05:08:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-13 05:08:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-04-13 05:08:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-13 05:08:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-04-13 05:08:37,655 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-04-13 05:08:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:37,656 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-04-13 05:08:37,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 05:08:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-04-13 05:08:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-13 05:08:37,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:37,657 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:37,657 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash 578545269, now seen corresponding path program 35 times [2018-04-13 05:08:37,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:37,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:37,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:37,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:37,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:37,667 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:38,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:38,050 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:08:38,062 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-13 05:08:38,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:38,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:38,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:38,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 73 [2018-04-13 05:08:38,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 05:08:38,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 05:08:38,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 05:08:38,592 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 74 states. [2018-04-13 05:08:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:43,663 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-04-13 05:08:43,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 05:08:43,664 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182 [2018-04-13 05:08:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:43,665 INFO L225 Difference]: With dead ends: 496 [2018-04-13 05:08:43,665 INFO L226 Difference]: Without dead ends: 496 [2018-04-13 05:08:43,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 05:08:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-04-13 05:08:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-04-13 05:08:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-13 05:08:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-04-13 05:08:43,668 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-04-13 05:08:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:43,669 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-04-13 05:08:43,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 05:08:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-04-13 05:08:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-13 05:08:43,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:43,670 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:43,670 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2010858408, now seen corresponding path program 36 times [2018-04-13 05:08:43,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:43,670 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:43,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:43,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:43,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:43,680 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:44,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:44,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:44,019 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:08:44,036 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-13 05:08:44,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:44,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:44,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:44,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-04-13 05:08:44,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 05:08:44,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 05:08:44,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 05:08:44,143 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 45 states. [2018-04-13 05:08:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:45,458 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-04-13 05:08:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 05:08:45,459 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-04-13 05:08:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:45,460 INFO L225 Difference]: With dead ends: 509 [2018-04-13 05:08:45,460 INFO L226 Difference]: Without dead ends: 509 [2018-04-13 05:08:45,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 05:08:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-13 05:08:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-04-13 05:08:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-04-13 05:08:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-04-13 05:08:45,464 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-04-13 05:08:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:45,465 INFO L459 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-04-13 05:08:45,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 05:08:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-04-13 05:08:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-13 05:08:45,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:45,466 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:45,466 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1349177771, now seen corresponding path program 37 times [2018-04-13 05:08:45,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:45,466 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:45,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:45,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:45,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:45,476 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:45,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:45,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:45,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:45,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:45,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-04-13 05:08:45,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 05:08:45,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 05:08:45,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 05:08:45,852 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-04-13 05:08:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:46,842 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-04-13 05:08:46,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 05:08:46,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-13 05:08:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:46,843 INFO L225 Difference]: With dead ends: 522 [2018-04-13 05:08:46,843 INFO L226 Difference]: Without dead ends: 522 [2018-04-13 05:08:46,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 05:08:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-04-13 05:08:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-04-13 05:08:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-13 05:08:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-04-13 05:08:46,847 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-04-13 05:08:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:46,847 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-04-13 05:08:46,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 05:08:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-04-13 05:08:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-13 05:08:46,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:46,848 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:46,848 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash -659298360, now seen corresponding path program 38 times [2018-04-13 05:08:46,849 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:46,849 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:46,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:46,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:08:46,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:46,858 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:47,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:47,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:47,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:08:47,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:08:47,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:47,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:47,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:47,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-04-13 05:08:47,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 05:08:47,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 05:08:47,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 05:08:47,322 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-04-13 05:08:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:48,514 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-04-13 05:08:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 05:08:48,514 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-13 05:08:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:48,516 INFO L225 Difference]: With dead ends: 535 [2018-04-13 05:08:48,516 INFO L226 Difference]: Without dead ends: 535 [2018-04-13 05:08:48,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 05:08:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-13 05:08:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-04-13 05:08:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-04-13 05:08:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-04-13 05:08:48,520 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-04-13 05:08:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:48,520 INFO L459 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-04-13 05:08:48,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 05:08:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-04-13 05:08:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-13 05:08:48,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:48,521 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:48,521 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash 656285237, now seen corresponding path program 39 times [2018-04-13 05:08:48,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:48,521 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:48,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:48,527 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:48,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:48,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:08:48,910 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-13 05:08:48,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:48,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:48,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:48,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-04-13 05:08:48,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 05:08:48,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 05:08:48,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 05:08:48,958 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-04-13 05:08:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:50,125 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-04-13 05:08:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 05:08:50,126 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-13 05:08:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:50,127 INFO L225 Difference]: With dead ends: 548 [2018-04-13 05:08:50,127 INFO L226 Difference]: Without dead ends: 548 [2018-04-13 05:08:50,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 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-13 05:08:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-13 05:08:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-04-13 05:08:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-13 05:08:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-04-13 05:08:50,133 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-04-13 05:08:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:50,133 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-04-13 05:08:50,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 05:08:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-04-13 05:08:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-13 05:08:50,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:50,134 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:50,134 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash 715514856, now seen corresponding path program 40 times [2018-04-13 05:08:50,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:50,135 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:50,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:50,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:50,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:50,144 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:50,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:50,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:08:50,543 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:08:50,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:50,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:50,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:50,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-04-13 05:08:50,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 05:08:50,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 05:08:50,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 05:08:50,596 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-04-13 05:08:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:52,371 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-04-13 05:08:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 05:08:52,371 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-13 05:08:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:52,373 INFO L225 Difference]: With dead ends: 561 [2018-04-13 05:08:52,373 INFO L226 Difference]: Without dead ends: 561 [2018-04-13 05:08:52,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 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-13 05:08:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-13 05:08:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-04-13 05:08:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-13 05:08:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-04-13 05:08:52,376 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-04-13 05:08:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:52,377 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-04-13 05:08:52,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 05:08:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-04-13 05:08:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-13 05:08:52,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:52,378 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:52,378 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1616595435, now seen corresponding path program 41 times [2018-04-13 05:08:52,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:52,379 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:52,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:52,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:52,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:52,389 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:52,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:52,839 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:52,839 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:08:52,852 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-13 05:08:52,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:52,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:53,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:53,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2018-04-13 05:08:53,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 05:08:53,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 05:08:53,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 05:08:53,468 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 86 states. [2018-04-13 05:08:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:08:58,774 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-04-13 05:08:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 05:08:58,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 212 [2018-04-13 05:08:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:08:58,776 INFO L225 Difference]: With dead ends: 574 [2018-04-13 05:08:58,776 INFO L226 Difference]: Without dead ends: 574 [2018-04-13 05:08:58,776 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 05:08:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-13 05:08:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-04-13 05:08:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-04-13 05:08:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-04-13 05:08:58,779 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-04-13 05:08:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:08:58,779 INFO L459 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-04-13 05:08:58,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 05:08:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-04-13 05:08:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-13 05:08:58,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:08:58,780 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-13 05:08:58,780 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:08:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1071855624, now seen corresponding path program 42 times [2018-04-13 05:08:58,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:08:58,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:08:58,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:58,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:08:58,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:08:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:08:58,786 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:08:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:59,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:08:59,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:08:59,189 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:08:59,202 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-13 05:08:59,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:08:59,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:08:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:08:59,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:08:59,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-04-13 05:08:59,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 05:08:59,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 05:08:59,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 05:08:59,314 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 49 states. [2018-04-13 05:09:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:00,733 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-04-13 05:09:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 05:09:00,733 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-04-13 05:09:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:00,735 INFO L225 Difference]: With dead ends: 587 [2018-04-13 05:09:00,735 INFO L226 Difference]: Without dead ends: 587 [2018-04-13 05:09:00,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 05:09:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-04-13 05:09:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-04-13 05:09:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-04-13 05:09:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-04-13 05:09:00,739 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-04-13 05:09:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:00,739 INFO L459 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-04-13 05:09:00,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 05:09:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-04-13 05:09:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-13 05:09:00,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:00,740 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:00,740 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:00,740 INFO L82 PathProgramCache]: Analyzing trace with hash -701041163, now seen corresponding path program 43 times [2018-04-13 05:09:00,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:00,740 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:00,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:00,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:00,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:00,746 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:01,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:01,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:01,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:09:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:01,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:01,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:01,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-04-13 05:09:01,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 05:09:01,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 05:09:01,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 05:09:01,261 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-04-13 05:09:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:02,788 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-04-13 05:09:02,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 05:09:02,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-13 05:09:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:02,789 INFO L225 Difference]: With dead ends: 600 [2018-04-13 05:09:02,789 INFO L226 Difference]: Without dead ends: 600 [2018-04-13 05:09:02,790 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 05:09:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-04-13 05:09:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-04-13 05:09:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-13 05:09:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-04-13 05:09:02,794 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-04-13 05:09:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:02,794 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-04-13 05:09:02,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 05:09:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-04-13 05:09:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-13 05:09:02,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:02,795 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:02,795 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1411245096, now seen corresponding path program 44 times [2018-04-13 05:09:02,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:02,795 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:02,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:02,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:09:02,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:02,802 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:03,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:03,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:03,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:09:03,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:09:03,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:03,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:03,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:03,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-04-13 05:09:03,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 05:09:03,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 05:09:03,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 05:09:03,362 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 55 states. [2018-04-13 05:09:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:05,185 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-04-13 05:09:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 05:09:05,185 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-04-13 05:09:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:05,186 INFO L225 Difference]: With dead ends: 613 [2018-04-13 05:09:05,186 INFO L226 Difference]: Without dead ends: 613 [2018-04-13 05:09:05,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 05:09:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-13 05:09:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-04-13 05:09:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-04-13 05:09:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-04-13 05:09:05,190 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-04-13 05:09:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:05,190 INFO L459 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-04-13 05:09:05,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 05:09:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-04-13 05:09:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-13 05:09:05,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:05,191 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:05,191 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash 241360341, now seen corresponding path program 45 times [2018-04-13 05:09:05,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:05,191 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:05,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:05,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:05,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:05,197 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:05,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:05,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:05,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:09:05,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-13 05:09:05,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:05,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:05,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:05,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-04-13 05:09:05,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 05:09:05,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 05:09:05,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 05:09:05,730 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-04-13 05:09:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:07,035 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-04-13 05:09:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 05:09:07,035 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-13 05:09:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:07,036 INFO L225 Difference]: With dead ends: 626 [2018-04-13 05:09:07,036 INFO L226 Difference]: Without dead ends: 626 [2018-04-13 05:09:07,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 05:09:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-13 05:09:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-04-13 05:09:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-04-13 05:09:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-04-13 05:09:07,040 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-04-13 05:09:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:07,040 INFO L459 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-04-13 05:09:07,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 05:09:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-04-13 05:09:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-13 05:09:07,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:07,041 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:07,041 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash 747104328, now seen corresponding path program 46 times [2018-04-13 05:09:07,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:07,041 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:07,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:07,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:07,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:07,047 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:07,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:07,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:07,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:09:07,532 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:09:07,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:07,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:07,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:07,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-04-13 05:09:07,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 05:09:07,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 05:09:07,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 05:09:07,588 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-04-13 05:09:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:09,103 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-04-13 05:09:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 05:09:09,104 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-13 05:09:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:09,105 INFO L225 Difference]: With dead ends: 639 [2018-04-13 05:09:09,105 INFO L226 Difference]: Without dead ends: 639 [2018-04-13 05:09:09,106 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 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-13 05:09:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-04-13 05:09:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-04-13 05:09:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-13 05:09:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-04-13 05:09:09,109 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-04-13 05:09:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:09,109 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-04-13 05:09:09,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 05:09:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-04-13 05:09:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-13 05:09:09,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:09,110 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:09,110 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash -231313995, now seen corresponding path program 47 times [2018-04-13 05:09:09,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:09,111 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:09,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:09,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:09,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:09,117 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:09,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:09,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:09,624 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:09:09,640 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-13 05:09:09,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:09,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:10,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:10,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 97 [2018-04-13 05:09:10,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 05:09:10,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 05:09:10,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 05:09:10,370 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 98 states. [2018-04-13 05:09:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:15,851 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-04-13 05:09:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 05:09:15,852 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 242 [2018-04-13 05:09:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:15,853 INFO L225 Difference]: With dead ends: 652 [2018-04-13 05:09:15,853 INFO L226 Difference]: Without dead ends: 652 [2018-04-13 05:09:15,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 05:09:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-04-13 05:09:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 602. [2018-04-13 05:09:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-13 05:09:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 698 transitions. [2018-04-13 05:09:15,858 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 698 transitions. Word has length 242 [2018-04-13 05:09:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:15,858 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 698 transitions. [2018-04-13 05:09:15,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 05:09:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 698 transitions. [2018-04-13 05:09:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-13 05:09:15,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:15,860 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:15,860 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash 936592488, now seen corresponding path program 48 times [2018-04-13 05:09:15,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:15,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:15,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:15,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:15,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:15,867 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:16,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:16,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:09:16,373 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-13 05:09:16,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:16,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:16,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:16,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-04-13 05:09:16,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 05:09:16,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 05:09:16,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 05:09:16,787 INFO L87 Difference]: Start difference. First operand 602 states and 698 transitions. Second operand 69 states. [2018-04-13 05:09:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:19,772 INFO L93 Difference]: Finished difference Result 665 states and 764 transitions. [2018-04-13 05:09:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 05:09:19,772 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-04-13 05:09:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:19,774 INFO L225 Difference]: With dead ends: 665 [2018-04-13 05:09:19,774 INFO L226 Difference]: Without dead ends: 665 [2018-04-13 05:09:19,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 05:09:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-13 05:09:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 614. [2018-04-13 05:09:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-04-13 05:09:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 712 transitions. [2018-04-13 05:09:19,785 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 712 transitions. Word has length 247 [2018-04-13 05:09:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:19,785 INFO L459 AbstractCegarLoop]: Abstraction has 614 states and 712 transitions. [2018-04-13 05:09:19,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 05:09:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 712 transitions. [2018-04-13 05:09:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-13 05:09:19,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:19,786 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:19,786 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:19,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1916773781, now seen corresponding path program 49 times [2018-04-13 05:09:19,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:19,787 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:19,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:19,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:19,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:19,793 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:20,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:20,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:09:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:20,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:20,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:20,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-04-13 05:09:20,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 05:09:20,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 05:09:20,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 05:09:20,422 INFO L87 Difference]: Start difference. First operand 614 states and 712 transitions. Second operand 53 states. [2018-04-13 05:09:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:22,054 INFO L93 Difference]: Finished difference Result 678 states and 779 transitions. [2018-04-13 05:09:22,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 05:09:22,054 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-13 05:09:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:22,056 INFO L225 Difference]: With dead ends: 678 [2018-04-13 05:09:22,056 INFO L226 Difference]: Without dead ends: 678 [2018-04-13 05:09:22,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 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-13 05:09:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-04-13 05:09:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2018-04-13 05:09:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-04-13 05:09:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2018-04-13 05:09:22,064 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 252 [2018-04-13 05:09:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:22,064 INFO L459 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2018-04-13 05:09:22,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 05:09:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2018-04-13 05:09:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-13 05:09:22,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:22,066 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:22,066 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1372456824, now seen corresponding path program 50 times [2018-04-13 05:09:22,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:22,067 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:22,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:22,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:09:22,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:22,074 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:22,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:22,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:22,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:09:22,653 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:09:22,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:22,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:22,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:22,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-04-13 05:09:22,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 05:09:22,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 05:09:22,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 05:09:22,752 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 58 states. [2018-04-13 05:09:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:24,588 INFO L93 Difference]: Finished difference Result 691 states and 794 transitions. [2018-04-13 05:09:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 05:09:24,589 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-04-13 05:09:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:24,590 INFO L225 Difference]: With dead ends: 691 [2018-04-13 05:09:24,590 INFO L226 Difference]: Without dead ends: 691 [2018-04-13 05:09:24,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 05:09:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-04-13 05:09:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 638. [2018-04-13 05:09:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-13 05:09:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 740 transitions. [2018-04-13 05:09:24,594 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 740 transitions. Word has length 257 [2018-04-13 05:09:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:24,594 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 740 transitions. [2018-04-13 05:09:24,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 05:09:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 740 transitions. [2018-04-13 05:09:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-13 05:09:24,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:24,595 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:24,596 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1517517451, now seen corresponding path program 51 times [2018-04-13 05:09:24,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:24,596 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:24,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:24,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:24,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:24,603 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:25,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:25,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:09:25,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-13 05:09:25,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:25,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:25,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:25,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-04-13 05:09:25,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 05:09:25,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 05:09:25,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 05:09:25,258 INFO L87 Difference]: Start difference. First operand 638 states and 740 transitions. Second operand 55 states. [2018-04-13 05:09:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:26,969 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2018-04-13 05:09:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 05:09:26,969 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-13 05:09:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:26,971 INFO L225 Difference]: With dead ends: 704 [2018-04-13 05:09:26,971 INFO L226 Difference]: Without dead ends: 704 [2018-04-13 05:09:26,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 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-13 05:09:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-04-13 05:09:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 650. [2018-04-13 05:09:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-04-13 05:09:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 754 transitions. [2018-04-13 05:09:26,975 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 754 transitions. Word has length 262 [2018-04-13 05:09:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:26,975 INFO L459 AbstractCegarLoop]: Abstraction has 650 states and 754 transitions. [2018-04-13 05:09:26,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 05:09:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 754 transitions. [2018-04-13 05:09:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-13 05:09:26,976 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:26,976 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:26,976 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1319762776, now seen corresponding path program 52 times [2018-04-13 05:09:26,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:26,976 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:26,976 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:26,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:26,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:26,983 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:27,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:27,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:27,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:09:27,588 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:09:27,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:27,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:28,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:28,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-04-13 05:09:28,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-13 05:09:28,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-13 05:09:28,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 05:09:28,383 INFO L87 Difference]: Start difference. First operand 650 states and 754 transitions. Second operand 109 states. [2018-04-13 05:09:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:34,438 INFO L93 Difference]: Finished difference Result 717 states and 824 transitions. [2018-04-13 05:09:34,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 05:09:34,439 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-04-13 05:09:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:34,440 INFO L225 Difference]: With dead ends: 717 [2018-04-13 05:09:34,440 INFO L226 Difference]: Without dead ends: 717 [2018-04-13 05:09:34,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 05:09:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-04-13 05:09:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 662. [2018-04-13 05:09:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-13 05:09:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 768 transitions. [2018-04-13 05:09:34,444 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 768 transitions. Word has length 267 [2018-04-13 05:09:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:34,444 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 768 transitions. [2018-04-13 05:09:34,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-13 05:09:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 768 transitions. [2018-04-13 05:09:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-13 05:09:34,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:34,445 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:34,445 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1448407723, now seen corresponding path program 53 times [2018-04-13 05:09:34,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:34,446 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:34,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:34,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:34,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:34,452 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:35,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:35,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:35,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:09:35,095 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-13 05:09:35,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:35,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:36,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:36,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 109 [2018-04-13 05:09:36,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-13 05:09:36,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-13 05:09:36,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 05:09:36,010 INFO L87 Difference]: Start difference. First operand 662 states and 768 transitions. Second operand 110 states. [2018-04-13 05:09:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:42,587 INFO L93 Difference]: Finished difference Result 730 states and 839 transitions. [2018-04-13 05:09:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 05:09:42,588 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 272 [2018-04-13 05:09:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:42,589 INFO L225 Difference]: With dead ends: 730 [2018-04-13 05:09:42,589 INFO L226 Difference]: Without dead ends: 730 [2018-04-13 05:09:42,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5619 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 05:09:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-04-13 05:09:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 674. [2018-04-13 05:09:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-04-13 05:09:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 782 transitions. [2018-04-13 05:09:42,594 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 782 transitions. Word has length 272 [2018-04-13 05:09:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:42,594 INFO L459 AbstractCegarLoop]: Abstraction has 674 states and 782 transitions. [2018-04-13 05:09:42,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-13 05:09:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 782 transitions. [2018-04-13 05:09:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-13 05:09:42,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:42,595 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:42,596 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1819371720, now seen corresponding path program 54 times [2018-04-13 05:09:42,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:42,596 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:42,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:42,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:42,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:42,608 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:43,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:43,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:43,243 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:09:43,259 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-13 05:09:43,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:43,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:43,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:43,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-04-13 05:09:43,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 05:09:43,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 05:09:43,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 05:09:43,452 INFO L87 Difference]: Start difference. First operand 674 states and 782 transitions. Second operand 61 states. [2018-04-13 05:09:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:45,329 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-04-13 05:09:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 05:09:45,329 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-04-13 05:09:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:45,331 INFO L225 Difference]: With dead ends: 743 [2018-04-13 05:09:45,331 INFO L226 Difference]: Without dead ends: 743 [2018-04-13 05:09:45,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-04-13 05:09:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-04-13 05:09:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 686. [2018-04-13 05:09:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-13 05:09:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 796 transitions. [2018-04-13 05:09:45,335 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 796 transitions. Word has length 277 [2018-04-13 05:09:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:45,335 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 796 transitions. [2018-04-13 05:09:45,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 05:09:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 796 transitions. [2018-04-13 05:09:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-13 05:09:45,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:45,336 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:45,336 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2102837963, now seen corresponding path program 55 times [2018-04-13 05:09:45,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:45,336 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:45,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:45,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:45,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:45,343 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:46,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:46,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:46,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:09:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:46,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:46,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:46,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-04-13 05:09:46,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 05:09:46,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 05:09:46,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 05:09:46,050 INFO L87 Difference]: Start difference. First operand 686 states and 796 transitions. Second operand 59 states. [2018-04-13 05:09:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:47,798 INFO L93 Difference]: Finished difference Result 756 states and 869 transitions. [2018-04-13 05:09:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 05:09:47,799 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-13 05:09:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:47,800 INFO L225 Difference]: With dead ends: 756 [2018-04-13 05:09:47,800 INFO L226 Difference]: Without dead ends: 756 [2018-04-13 05:09:47,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 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-13 05:09:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-13 05:09:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 698. [2018-04-13 05:09:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-13 05:09:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 810 transitions. [2018-04-13 05:09:47,805 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 810 transitions. Word has length 282 [2018-04-13 05:09:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:47,805 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 810 transitions. [2018-04-13 05:09:47,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 05:09:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 810 transitions. [2018-04-13 05:09:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-13 05:09:47,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:47,806 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:47,806 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash 875963624, now seen corresponding path program 56 times [2018-04-13 05:09:47,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:47,806 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:47,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:47,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:09:47,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:47,813 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:48,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:48,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:48,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:09:48,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:09:48,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:48,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:48,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:48,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-04-13 05:09:48,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-13 05:09:48,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-13 05:09:48,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 05:09:48,545 INFO L87 Difference]: Start difference. First operand 698 states and 810 transitions. Second operand 60 states. [2018-04-13 05:09:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:51,183 INFO L93 Difference]: Finished difference Result 769 states and 884 transitions. [2018-04-13 05:09:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 05:09:51,183 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-13 05:09:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:51,185 INFO L225 Difference]: With dead ends: 769 [2018-04-13 05:09:51,185 INFO L226 Difference]: Without dead ends: 769 [2018-04-13 05:09:51,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 05:09:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-04-13 05:09:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 710. [2018-04-13 05:09:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-04-13 05:09:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 824 transitions. [2018-04-13 05:09:51,189 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 824 transitions. Word has length 287 [2018-04-13 05:09:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:51,190 INFO L459 AbstractCegarLoop]: Abstraction has 710 states and 824 transitions. [2018-04-13 05:09:51,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-13 05:09:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 824 transitions. [2018-04-13 05:09:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-13 05:09:51,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:51,191 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:51,191 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash -82504427, now seen corresponding path program 57 times [2018-04-13 05:09:51,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:51,191 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:51,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:51,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:51,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:51,198 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:51,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:51,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:09:51,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-13 05:09:51,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:51,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:52,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:52,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-04-13 05:09:52,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-13 05:09:52,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-13 05:09:52,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 05:09:52,835 INFO L87 Difference]: Start difference. First operand 710 states and 824 transitions. Second operand 119 states. [2018-04-13 05:09:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:09:58,331 INFO L93 Difference]: Finished difference Result 782 states and 899 transitions. [2018-04-13 05:09:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-13 05:09:58,332 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-04-13 05:09:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:09:58,333 INFO L225 Difference]: With dead ends: 782 [2018-04-13 05:09:58,333 INFO L226 Difference]: Without dead ends: 782 [2018-04-13 05:09:58,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 05:09:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-13 05:09:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 722. [2018-04-13 05:09:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-04-13 05:09:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 838 transitions. [2018-04-13 05:09:58,338 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 838 transitions. Word has length 292 [2018-04-13 05:09:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:09:58,338 INFO L459 AbstractCegarLoop]: Abstraction has 722 states and 838 transitions. [2018-04-13 05:09:58,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-13 05:09:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 838 transitions. [2018-04-13 05:09:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-13 05:09:58,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:09:58,339 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-13 05:09:58,339 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:09:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1495910136, now seen corresponding path program 58 times [2018-04-13 05:09:58,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:09:58,340 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:09:58,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:58,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:09:58,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:09:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:09:58,348 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:09:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:59,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:09:59,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:09:59,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:09:59,102 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:09:59,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:09:59,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:09:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:09:59,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:09:59,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-04-13 05:09:59,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 05:09:59,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 05:09:59,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 05:09:59,234 INFO L87 Difference]: Start difference. First operand 722 states and 838 transitions. Second operand 67 states. [2018-04-13 05:10:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:10:01,783 INFO L93 Difference]: Finished difference Result 795 states and 914 transitions. [2018-04-13 05:10:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 05:10:01,783 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-04-13 05:10:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:10:01,785 INFO L225 Difference]: With dead ends: 795 [2018-04-13 05:10:01,785 INFO L226 Difference]: Without dead ends: 795 [2018-04-13 05:10:01,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5387, Invalid=10113, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 05:10:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-04-13 05:10:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 734. [2018-04-13 05:10:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-04-13 05:10:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2018-04-13 05:10:01,793 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 297 [2018-04-13 05:10:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:10:01,793 INFO L459 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2018-04-13 05:10:01,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 05:10:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2018-04-13 05:10:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-13 05:10:01,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:10:01,795 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-13 05:10:01,795 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:10:01,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2080598795, now seen corresponding path program 59 times [2018-04-13 05:10:01,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:10:01,796 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:10:01,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:01,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:10:01,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:01,806 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:10:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:02,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:10:02,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:10:02,631 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:10:02,650 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-13 05:10:02,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:10:02,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:10:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:03,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:10:03,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 121 [2018-04-13 05:10:03,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-13 05:10:03,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-13 05:10:03,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 05:10:03,726 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand 122 states. [2018-04-13 05:10:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:10:12,458 INFO L93 Difference]: Finished difference Result 808 states and 929 transitions. [2018-04-13 05:10:12,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 05:10:12,458 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 302 [2018-04-13 05:10:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:10:12,460 INFO L225 Difference]: With dead ends: 808 [2018-04-13 05:10:12,460 INFO L226 Difference]: Without dead ends: 808 [2018-04-13 05:10:12,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6963 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 05:10:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-04-13 05:10:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 746. [2018-04-13 05:10:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-04-13 05:10:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 866 transitions. [2018-04-13 05:10:12,465 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 866 transitions. Word has length 302 [2018-04-13 05:10:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:10:12,465 INFO L459 AbstractCegarLoop]: Abstraction has 746 states and 866 transitions. [2018-04-13 05:10:12,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-13 05:10:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 866 transitions. [2018-04-13 05:10:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-13 05:10:12,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:10:12,466 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-13 05:10:12,466 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:10:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash -872176344, now seen corresponding path program 60 times [2018-04-13 05:10:12,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:10:12,466 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:10:12,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:12,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:10:12,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:12,474 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:10:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:13,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:10:13,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:10:13,235 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:10:13,254 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-13 05:10:13,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:10:13,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:10:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:14,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:10:14,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 120 [2018-04-13 05:10:14,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-13 05:10:14,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-13 05:10:14,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3548, Invalid=10972, Unknown=0, NotChecked=0, Total=14520 [2018-04-13 05:10:14,358 INFO L87 Difference]: Start difference. First operand 746 states and 866 transitions. Second operand 121 states. [2018-04-13 05:10:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:10:21,686 INFO L93 Difference]: Finished difference Result 821 states and 944 transitions. [2018-04-13 05:10:21,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 05:10:21,686 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 307 [2018-04-13 05:10:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:10:21,688 INFO L225 Difference]: With dead ends: 821 [2018-04-13 05:10:21,688 INFO L226 Difference]: Without dead ends: 821 [2018-04-13 05:10:21,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10577 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5803, Invalid=25349, Unknown=0, NotChecked=0, Total=31152 [2018-04-13 05:10:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-04-13 05:10:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 758. [2018-04-13 05:10:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-04-13 05:10:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 880 transitions. [2018-04-13 05:10:21,693 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 880 transitions. Word has length 307 [2018-04-13 05:10:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:10:21,693 INFO L459 AbstractCegarLoop]: Abstraction has 758 states and 880 transitions. [2018-04-13 05:10:21,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-13 05:10:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 880 transitions. [2018-04-13 05:10:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-13 05:10:21,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:10:21,694 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-13 05:10:21,694 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:10:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash 351124693, now seen corresponding path program 61 times [2018-04-13 05:10:21,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:10:21,694 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:10:21,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:21,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:10:21,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:21,702 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:10:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:22,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:10:22,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:10:22,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:10:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:22,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:10:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:22,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:10:22,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-04-13 05:10:22,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 05:10:22,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 05:10:22,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 05:10:22,601 INFO L87 Difference]: Start difference. First operand 758 states and 880 transitions. Second operand 65 states. [2018-04-13 05:10:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:10:24,726 INFO L93 Difference]: Finished difference Result 834 states and 959 transitions. [2018-04-13 05:10:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 05:10:24,726 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-13 05:10:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:10:24,728 INFO L225 Difference]: With dead ends: 834 [2018-04-13 05:10:24,728 INFO L226 Difference]: Without dead ends: 834 [2018-04-13 05:10:24,729 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 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-13 05:10:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-04-13 05:10:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 770. [2018-04-13 05:10:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-04-13 05:10:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 894 transitions. [2018-04-13 05:10:24,736 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 894 transitions. Word has length 312 [2018-04-13 05:10:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:10:24,736 INFO L459 AbstractCegarLoop]: Abstraction has 770 states and 894 transitions. [2018-04-13 05:10:24,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 05:10:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 894 transitions. [2018-04-13 05:10:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-13 05:10:24,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:10:24,738 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-13 05:10:24,738 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:10:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash 888170824, now seen corresponding path program 62 times [2018-04-13 05:10:24,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:10:24,738 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:10:24,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:24,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:10:24,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:24,746 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:10:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:25,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:10:25,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:10:25,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:10:25,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:10:25,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:10:25,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:10:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:25,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:10:25,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-13 05:10:25,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 05:10:25,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 05:10:25,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 05:10:25,649 INFO L87 Difference]: Start difference. First operand 770 states and 894 transitions. Second operand 66 states. [2018-04-13 05:10:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:10:27,951 INFO L93 Difference]: Finished difference Result 847 states and 974 transitions. [2018-04-13 05:10:27,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 05:10:27,951 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-13 05:10:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:10:27,953 INFO L225 Difference]: With dead ends: 847 [2018-04-13 05:10:27,953 INFO L226 Difference]: Without dead ends: 847 [2018-04-13 05:10:27,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-13 05:10:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-04-13 05:10:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 782. [2018-04-13 05:10:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-13 05:10:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 908 transitions. [2018-04-13 05:10:27,961 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 908 transitions. Word has length 317 [2018-04-13 05:10:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:10:27,961 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 908 transitions. [2018-04-13 05:10:27,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 05:10:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 908 transitions. [2018-04-13 05:10:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-13 05:10:27,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:10:27,962 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-13 05:10:27,962 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:10:27,962 INFO L82 PathProgramCache]: Analyzing trace with hash 200707253, now seen corresponding path program 63 times [2018-04-13 05:10:27,962 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:10:27,962 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:10:27,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:27,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:10:27,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:27,970 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:10:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:28,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:10:28,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:10:28,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:10:28,845 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-13 05:10:28,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:10:28,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:10:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:29,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:10:29,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-04-13 05:10:29,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-13 05:10:29,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-13 05:10:29,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 05:10:29,879 INFO L87 Difference]: Start difference. First operand 782 states and 908 transitions. Second operand 131 states. [2018-04-13 05:10:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:10:37,359 INFO L93 Difference]: Finished difference Result 860 states and 989 transitions. [2018-04-13 05:10:37,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-13 05:10:37,359 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-04-13 05:10:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:10:37,361 INFO L225 Difference]: With dead ends: 860 [2018-04-13 05:10:37,361 INFO L226 Difference]: Without dead ends: 860 [2018-04-13 05:10:37,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 05:10:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-04-13 05:10:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 794. [2018-04-13 05:10:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-04-13 05:10:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 922 transitions. [2018-04-13 05:10:37,369 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 922 transitions. Word has length 322 [2018-04-13 05:10:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:10:37,370 INFO L459 AbstractCegarLoop]: Abstraction has 794 states and 922 transitions. [2018-04-13 05:10:37,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-13 05:10:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 922 transitions. [2018-04-13 05:10:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-13 05:10:37,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:10:37,372 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-13 05:10:37,372 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:10:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash 474908008, now seen corresponding path program 64 times [2018-04-13 05:10:37,372 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:10:37,372 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:10:37,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:37,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:10:37,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:37,388 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:10:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:38,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:10:38,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:10:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:10:38,708 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:10:38,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:10:38,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:10:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:38,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:10:38,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-04-13 05:10:38,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 05:10:38,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 05:10:38,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 05:10:38,810 INFO L87 Difference]: Start difference. First operand 794 states and 922 transitions. Second operand 67 states. [2018-04-13 05:10:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:10:50,554 INFO L93 Difference]: Finished difference Result 873 states and 1004 transitions. [2018-04-13 05:10:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 05:10:50,554 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-13 05:10:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:10:50,555 INFO L225 Difference]: With dead ends: 873 [2018-04-13 05:10:50,556 INFO L226 Difference]: Without dead ends: 873 [2018-04-13 05:10:50,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 05:10:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-04-13 05:10:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 806. [2018-04-13 05:10:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-04-13 05:10:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 936 transitions. [2018-04-13 05:10:50,561 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 936 transitions. Word has length 327 [2018-04-13 05:10:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:10:50,562 INFO L459 AbstractCegarLoop]: Abstraction has 806 states and 936 transitions. [2018-04-13 05:10:50,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 05:10:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 936 transitions. [2018-04-13 05:10:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-13 05:10:50,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:10:50,563 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-13 05:10:50,563 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:10:50,563 INFO L82 PathProgramCache]: Analyzing trace with hash 228918421, now seen corresponding path program 65 times [2018-04-13 05:10:50,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:10:50,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:10:50,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:50,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:10:50,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:10:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:10:50,571 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:10:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:51,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:10:51,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:10:51,481 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:10:51,502 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-13 05:10:51,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:10:51,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:10:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:10:52,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:10:52,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 133 [2018-04-13 05:10:52,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-13 05:10:52,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-13 05:10:52,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 05:10:52,777 INFO L87 Difference]: Start difference. First operand 806 states and 936 transitions. Second operand 134 states. [2018-04-13 05:11:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:04,907 INFO L93 Difference]: Finished difference Result 886 states and 1019 transitions. [2018-04-13 05:11:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 05:11:04,907 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 332 [2018-04-13 05:11:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:04,908 INFO L225 Difference]: With dead ends: 886 [2018-04-13 05:11:04,909 INFO L226 Difference]: Without dead ends: 886 [2018-04-13 05:11:04,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8451 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 05:11:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-04-13 05:11:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 818. [2018-04-13 05:11:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-04-13 05:11:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 950 transitions. [2018-04-13 05:11:04,913 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 950 transitions. Word has length 332 [2018-04-13 05:11:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:04,913 INFO L459 AbstractCegarLoop]: Abstraction has 818 states and 950 transitions. [2018-04-13 05:11:04,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-13 05:11:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 950 transitions. [2018-04-13 05:11:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-13 05:11:04,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:04,914 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:04,914 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2041579128, now seen corresponding path program 66 times [2018-04-13 05:11:04,915 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:04,915 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:04,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:04,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:11:04,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:04,923 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:05,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:05,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:05,919 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:11:05,939 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-13 05:11:05,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:11:05,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:07,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:07,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68] total 136 [2018-04-13 05:11:07,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-13 05:11:07,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-13 05:11:07,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-04-13 05:11:07,075 INFO L87 Difference]: Start difference. First operand 818 states and 950 transitions. Second operand 137 states. [2018-04-13 05:11:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:17,599 INFO L93 Difference]: Finished difference Result 899 states and 1034 transitions. [2018-04-13 05:11:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-13 05:11:17,600 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 337 [2018-04-13 05:11:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:17,601 INFO L225 Difference]: With dead ends: 899 [2018-04-13 05:11:17,601 INFO L226 Difference]: Without dead ends: 899 [2018-04-13 05:11:17,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8775 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-04-13 05:11:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-13 05:11:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 830. [2018-04-13 05:11:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-13 05:11:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 964 transitions. [2018-04-13 05:11:17,605 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 964 transitions. Word has length 337 [2018-04-13 05:11:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:17,605 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 964 transitions. [2018-04-13 05:11:17,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-04-13 05:11:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 964 transitions. [2018-04-13 05:11:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-13 05:11:17,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:17,606 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:17,606 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:17,607 INFO L82 PathProgramCache]: Analyzing trace with hash -452516747, now seen corresponding path program 67 times [2018-04-13 05:11:17,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:17,607 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:17,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:17,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:11:17,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:17,615 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:18,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:18,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:18,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:11:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:18,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:18,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:18,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-04-13 05:11:18,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 05:11:18,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 05:11:18,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 05:11:18,698 INFO L87 Difference]: Start difference. First operand 830 states and 964 transitions. Second operand 71 states. [2018-04-13 05:11:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:21,271 INFO L93 Difference]: Finished difference Result 912 states and 1049 transitions. [2018-04-13 05:11:21,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 05:11:21,295 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-04-13 05:11:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:21,296 INFO L225 Difference]: With dead ends: 912 [2018-04-13 05:11:21,296 INFO L226 Difference]: Without dead ends: 912 [2018-04-13 05:11:21,296 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-13 05:11:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-04-13 05:11:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 842. [2018-04-13 05:11:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-04-13 05:11:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 978 transitions. [2018-04-13 05:11:21,300 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 978 transitions. Word has length 342 [2018-04-13 05:11:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:21,300 INFO L459 AbstractCegarLoop]: Abstraction has 842 states and 978 transitions. [2018-04-13 05:11:21,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 05:11:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 978 transitions. [2018-04-13 05:11:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-13 05:11:21,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:21,302 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:21,302 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1621542312, now seen corresponding path program 68 times [2018-04-13 05:11:21,302 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:21,302 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:21,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:11:21,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:21,310 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:22,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:22,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:22,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:11:22,323 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:11:22,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:11:22,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:22,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:22,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-04-13 05:11:22,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 05:11:22,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 05:11:22,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 05:11:22,397 INFO L87 Difference]: Start difference. First operand 842 states and 978 transitions. Second operand 72 states. [2018-04-13 05:11:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:25,242 INFO L93 Difference]: Finished difference Result 925 states and 1064 transitions. [2018-04-13 05:11:25,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 05:11:25,243 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-04-13 05:11:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:25,243 INFO L225 Difference]: With dead ends: 925 [2018-04-13 05:11:25,244 INFO L226 Difference]: Without dead ends: 925 [2018-04-13 05:11:25,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 347 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-13 05:11:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-13 05:11:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 854. [2018-04-13 05:11:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-04-13 05:11:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 992 transitions. [2018-04-13 05:11:25,248 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 992 transitions. Word has length 347 [2018-04-13 05:11:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:25,248 INFO L459 AbstractCegarLoop]: Abstraction has 854 states and 992 transitions. [2018-04-13 05:11:25,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 05:11:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 992 transitions. [2018-04-13 05:11:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-13 05:11:25,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:25,249 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:25,249 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:25,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1672146005, now seen corresponding path program 69 times [2018-04-13 05:11:25,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:25,250 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:25,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:25,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:11:25,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:25,258 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:26,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:26,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:26,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:11:26,289 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-13 05:11:26,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:11:26,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:26,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:26,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-04-13 05:11:26,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 05:11:26,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 05:11:26,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 05:11:26,370 INFO L87 Difference]: Start difference. First operand 854 states and 992 transitions. Second operand 73 states. [2018-04-13 05:11:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:29,064 INFO L93 Difference]: Finished difference Result 938 states and 1079 transitions. [2018-04-13 05:11:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 05:11:29,065 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-04-13 05:11:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:29,066 INFO L225 Difference]: With dead ends: 938 [2018-04-13 05:11:29,066 INFO L226 Difference]: Without dead ends: 938 [2018-04-13 05:11:29,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-04-13 05:11:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-04-13 05:11:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 866. [2018-04-13 05:11:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-04-13 05:11:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1006 transitions. [2018-04-13 05:11:29,071 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1006 transitions. Word has length 352 [2018-04-13 05:11:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:29,071 INFO L459 AbstractCegarLoop]: Abstraction has 866 states and 1006 transitions. [2018-04-13 05:11:29,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 05:11:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1006 transitions. [2018-04-13 05:11:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-13 05:11:29,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:29,072 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:29,072 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1568347704, now seen corresponding path program 70 times [2018-04-13 05:11:29,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:29,072 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:29,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:29,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:11:29,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:29,084 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:30,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:30,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:30,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:11:30,153 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:11:30,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:11:30,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:30,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:30,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-04-13 05:11:30,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 05:11:30,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 05:11:30,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 05:11:30,218 INFO L87 Difference]: Start difference. First operand 866 states and 1006 transitions. Second operand 74 states. [2018-04-13 05:11:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:33,095 INFO L93 Difference]: Finished difference Result 951 states and 1094 transitions. [2018-04-13 05:11:33,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 05:11:33,096 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-04-13 05:11:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:33,097 INFO L225 Difference]: With dead ends: 951 [2018-04-13 05:11:33,097 INFO L226 Difference]: Without dead ends: 951 [2018-04-13 05:11:33,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-04-13 05:11:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-04-13 05:11:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 878. [2018-04-13 05:11:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-04-13 05:11:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1020 transitions. [2018-04-13 05:11:33,104 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1020 transitions. Word has length 357 [2018-04-13 05:11:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:33,105 INFO L459 AbstractCegarLoop]: Abstraction has 878 states and 1020 transitions. [2018-04-13 05:11:33,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 05:11:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1020 transitions. [2018-04-13 05:11:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-13 05:11:33,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:33,106 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:33,106 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1100897333, now seen corresponding path program 71 times [2018-04-13 05:11:33,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:33,107 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:33,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:33,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:11:33,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:33,116 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:34,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:34,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:34,259 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:11:34,286 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-13 05:11:34,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:11:34,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:35,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:35,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73] total 145 [2018-04-13 05:11:35,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-04-13 05:11:35,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-04-13 05:11:35,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5401, Invalid=15769, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 05:11:35,854 INFO L87 Difference]: Start difference. First operand 878 states and 1020 transitions. Second operand 146 states. [2018-04-13 05:11:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:49,551 INFO L93 Difference]: Finished difference Result 964 states and 1109 transitions. [2018-04-13 05:11:49,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 05:11:49,551 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 362 [2018-04-13 05:11:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:49,552 INFO L225 Difference]: With dead ends: 964 [2018-04-13 05:11:49,552 INFO L226 Difference]: Without dead ends: 964 [2018-04-13 05:11:49,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10083 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-04-13 05:11:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-04-13 05:11:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 890. [2018-04-13 05:11:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-13 05:11:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1034 transitions. [2018-04-13 05:11:49,558 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1034 transitions. Word has length 362 [2018-04-13 05:11:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:49,559 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 1034 transitions. [2018-04-13 05:11:49,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-04-13 05:11:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1034 transitions. [2018-04-13 05:11:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-13 05:11:49,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:49,561 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:49,561 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1822189032, now seen corresponding path program 72 times [2018-04-13 05:11:49,561 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:49,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:49,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:49,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:11:49,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:49,575 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:50,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:50,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:11:50,731 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-13 05:11:50,731 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:11:50,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:51,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:51,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 84 [2018-04-13 05:11:51,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 05:11:51,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 05:11:51,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=4364, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 05:11:51,056 INFO L87 Difference]: Start difference. First operand 890 states and 1034 transitions. Second operand 85 states. [2018-04-13 05:11:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:54,951 INFO L93 Difference]: Finished difference Result 977 states and 1124 transitions. [2018-04-13 05:11:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 05:11:54,952 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 367 [2018-04-13 05:11:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:54,953 INFO L225 Difference]: With dead ends: 977 [2018-04-13 05:11:54,953 INFO L226 Difference]: Without dead ends: 977 [2018-04-13 05:11:54,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8291, Invalid=16201, Unknown=0, NotChecked=0, Total=24492 [2018-04-13 05:11:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-04-13 05:11:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 902. [2018-04-13 05:11:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-04-13 05:11:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1048 transitions. [2018-04-13 05:11:54,962 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1048 transitions. Word has length 367 [2018-04-13 05:11:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:54,962 INFO L459 AbstractCegarLoop]: Abstraction has 902 states and 1048 transitions. [2018-04-13 05:11:54,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 05:11:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1048 transitions. [2018-04-13 05:11:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-13 05:11:54,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:54,965 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:54,965 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash -43027435, now seen corresponding path program 73 times [2018-04-13 05:11:54,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:54,965 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:54,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:54,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:11:54,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:54,981 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:11:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:56,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:11:56,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:11:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:11:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:56,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:11:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:11:56,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:11:56,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-04-13 05:11:56,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 05:11:56,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 05:11:56,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 05:11:56,241 INFO L87 Difference]: Start difference. First operand 902 states and 1048 transitions. Second operand 77 states. [2018-04-13 05:11:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:11:59,126 INFO L93 Difference]: Finished difference Result 990 states and 1139 transitions. [2018-04-13 05:11:59,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 05:11:59,126 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-04-13 05:11:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:11:59,127 INFO L225 Difference]: With dead ends: 990 [2018-04-13 05:11:59,127 INFO L226 Difference]: Without dead ends: 990 [2018-04-13 05:11:59,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 372 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-13 05:11:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-04-13 05:11:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 914. [2018-04-13 05:11:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-13 05:11:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1062 transitions. [2018-04-13 05:11:59,136 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1062 transitions. Word has length 372 [2018-04-13 05:11:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:11:59,137 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1062 transitions. [2018-04-13 05:11:59,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 05:11:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1062 transitions. [2018-04-13 05:11:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-13 05:11:59,139 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:11:59,139 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-13 05:11:59,139 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:11:59,139 INFO L82 PathProgramCache]: Analyzing trace with hash 689912328, now seen corresponding path program 74 times [2018-04-13 05:11:59,139 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:11:59,140 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:11:59,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:59,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:11:59,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:11:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:11:59,156 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:00,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:00,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:12:00,398 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:12:00,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:00,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:00,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:00,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-04-13 05:12:00,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 05:12:00,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 05:12:00,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 05:12:00,482 INFO L87 Difference]: Start difference. First operand 914 states and 1062 transitions. Second operand 78 states. [2018-04-13 05:12:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:04,042 INFO L93 Difference]: Finished difference Result 1003 states and 1154 transitions. [2018-04-13 05:12:04,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 05:12:04,042 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-04-13 05:12:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:04,043 INFO L225 Difference]: With dead ends: 1003 [2018-04-13 05:12:04,043 INFO L226 Difference]: Without dead ends: 1003 [2018-04-13 05:12:04,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 05:12:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-04-13 05:12:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 926. [2018-04-13 05:12:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-04-13 05:12:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1076 transitions. [2018-04-13 05:12:04,047 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1076 transitions. Word has length 377 [2018-04-13 05:12:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:04,047 INFO L459 AbstractCegarLoop]: Abstraction has 926 states and 1076 transitions. [2018-04-13 05:12:04,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 05:12:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1076 transitions. [2018-04-13 05:12:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-13 05:12:04,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:04,049 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:04,049 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1137953803, now seen corresponding path program 75 times [2018-04-13 05:12:04,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:04,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:04,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:04,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:12:04,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:04,058 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:05,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:05,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:05,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:12:05,309 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-04-13 05:12:05,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:05,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:05,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:05,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-04-13 05:12:05,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-13 05:12:05,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-13 05:12:05,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 05:12:05,384 INFO L87 Difference]: Start difference. First operand 926 states and 1076 transitions. Second operand 79 states. [2018-04-13 05:12:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:08,446 INFO L93 Difference]: Finished difference Result 1016 states and 1169 transitions. [2018-04-13 05:12:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-13 05:12:08,446 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-04-13 05:12:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:08,448 INFO L225 Difference]: With dead ends: 1016 [2018-04-13 05:12:08,448 INFO L226 Difference]: Without dead ends: 1016 [2018-04-13 05:12:08,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 382 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-13 05:12:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-04-13 05:12:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 938. [2018-04-13 05:12:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-13 05:12:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1090 transitions. [2018-04-13 05:12:08,456 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1090 transitions. Word has length 382 [2018-04-13 05:12:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:08,456 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 1090 transitions. [2018-04-13 05:12:08,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-13 05:12:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1090 transitions. [2018-04-13 05:12:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-13 05:12:08,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:08,459 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:08,459 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1413519832, now seen corresponding path program 76 times [2018-04-13 05:12:08,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:08,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:08,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:08,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:12:08,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:08,476 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:09,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:09,799 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:09,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:12:09,812 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:12:09,813 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:09,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:09,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:09,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-04-13 05:12:09,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 05:12:09,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 05:12:09,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 05:12:09,907 INFO L87 Difference]: Start difference. First operand 938 states and 1090 transitions. Second operand 80 states. [2018-04-13 05:12:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:13,514 INFO L93 Difference]: Finished difference Result 1029 states and 1184 transitions. [2018-04-13 05:12:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 05:12:13,515 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-04-13 05:12:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:13,515 INFO L225 Difference]: With dead ends: 1029 [2018-04-13 05:12:13,516 INFO L226 Difference]: Without dead ends: 1029 [2018-04-13 05:12:13,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 05:12:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-04-13 05:12:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 950. [2018-04-13 05:12:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-04-13 05:12:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1104 transitions. [2018-04-13 05:12:13,521 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1104 transitions. Word has length 387 [2018-04-13 05:12:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:13,521 INFO L459 AbstractCegarLoop]: Abstraction has 950 states and 1104 transitions. [2018-04-13 05:12:13,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 05:12:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1104 transitions. [2018-04-13 05:12:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-13 05:12:13,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:13,523 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:13,523 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:13,523 INFO L82 PathProgramCache]: Analyzing trace with hash 694328277, now seen corresponding path program 77 times [2018-04-13 05:12:13,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:13,523 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:13,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:13,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:12:13,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:13,532 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:14,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:14,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:14,826 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:12:14,855 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-04-13 05:12:14,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:14,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:16,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:16,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 157 [2018-04-13 05:12:16,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-04-13 05:12:16,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-04-13 05:12:16,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6319, Invalid=18487, Unknown=0, NotChecked=0, Total=24806 [2018-04-13 05:12:16,643 INFO L87 Difference]: Start difference. First operand 950 states and 1104 transitions. Second operand 158 states. [2018-04-13 05:12:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:34,459 INFO L93 Difference]: Finished difference Result 1042 states and 1199 transitions. [2018-04-13 05:12:34,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 05:12:34,459 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 392 [2018-04-13 05:12:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:34,460 INFO L225 Difference]: With dead ends: 1042 [2018-04-13 05:12:34,460 INFO L226 Difference]: Without dead ends: 1042 [2018-04-13 05:12:34,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11859 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2018-04-13 05:12:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-04-13 05:12:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 962. [2018-04-13 05:12:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-04-13 05:12:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1118 transitions. [2018-04-13 05:12:34,465 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1118 transitions. Word has length 392 [2018-04-13 05:12:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:34,465 INFO L459 AbstractCegarLoop]: Abstraction has 962 states and 1118 transitions. [2018-04-13 05:12:34,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-04-13 05:12:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1118 transitions. [2018-04-13 05:12:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-13 05:12:34,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:34,466 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:34,466 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1370417736, now seen corresponding path program 78 times [2018-04-13 05:12:34,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:34,466 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:34,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:34,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:12:34,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:34,476 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:35,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:35,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:35,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:12:35,831 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-04-13 05:12:35,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:35,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:36,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:36,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 84 [2018-04-13 05:12:36,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 05:12:36,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 05:12:36,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3178, Invalid=3962, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 05:12:36,035 INFO L87 Difference]: Start difference. First operand 962 states and 1118 transitions. Second operand 85 states. [2018-04-13 05:12:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:39,719 INFO L93 Difference]: Finished difference Result 1055 states and 1214 transitions. [2018-04-13 05:12:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-13 05:12:39,719 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 397 [2018-04-13 05:12:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:39,720 INFO L225 Difference]: With dead ends: 1055 [2018-04-13 05:12:39,720 INFO L226 Difference]: Without dead ends: 1055 [2018-04-13 05:12:39,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3394 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=9650, Invalid=16756, Unknown=0, NotChecked=0, Total=26406 [2018-04-13 05:12:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-04-13 05:12:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 974. [2018-04-13 05:12:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-04-13 05:12:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1132 transitions. [2018-04-13 05:12:39,730 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1132 transitions. Word has length 397 [2018-04-13 05:12:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:39,731 INFO L459 AbstractCegarLoop]: Abstraction has 974 states and 1132 transitions. [2018-04-13 05:12:39,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 05:12:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1132 transitions. [2018-04-13 05:12:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-04-13 05:12:39,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:39,733 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:39,733 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1461758901, now seen corresponding path program 79 times [2018-04-13 05:12:39,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:39,734 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:39,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:39,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:12:39,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:39,752 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:41,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:41,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:41,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:12:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:41,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:41,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:41,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-04-13 05:12:41,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 05:12:41,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 05:12:41,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=3561, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 05:12:41,192 INFO L87 Difference]: Start difference. First operand 974 states and 1132 transitions. Second operand 83 states. [2018-04-13 05:12:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:44,756 INFO L93 Difference]: Finished difference Result 1068 states and 1229 transitions. [2018-04-13 05:12:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 05:12:44,756 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 402 [2018-04-13 05:12:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:44,757 INFO L225 Difference]: With dead ends: 1068 [2018-04-13 05:12:44,757 INFO L226 Difference]: Without dead ends: 1068 [2018-04-13 05:12:44,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 402 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-13 05:12:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-04-13 05:12:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 986. [2018-04-13 05:12:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-04-13 05:12:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1146 transitions. [2018-04-13 05:12:44,762 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1146 transitions. Word has length 402 [2018-04-13 05:12:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:44,762 INFO L459 AbstractCegarLoop]: Abstraction has 986 states and 1146 transitions. [2018-04-13 05:12:44,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 05:12:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1146 transitions. [2018-04-13 05:12:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-13 05:12:44,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:44,764 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:44,764 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash 564119144, now seen corresponding path program 80 times [2018-04-13 05:12:44,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:44,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:44,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:44,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:12:44,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:44,773 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:46,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:46,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:46,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:12:46,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:12:46,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:46,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:46,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:46,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-04-13 05:12:46,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 05:12:46,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 05:12:46,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2246, Invalid=4726, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 05:12:46,157 INFO L87 Difference]: Start difference. First operand 986 states and 1146 transitions. Second operand 84 states. [2018-04-13 05:12:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:52,366 INFO L93 Difference]: Finished difference Result 1081 states and 1244 transitions. [2018-04-13 05:12:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 05:12:52,366 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 407 [2018-04-13 05:12:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:52,367 INFO L225 Difference]: With dead ends: 1081 [2018-04-13 05:12:52,367 INFO L226 Difference]: Without dead ends: 1081 [2018-04-13 05:12:52,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 407 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-13 05:12:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2018-04-13 05:12:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 998. [2018-04-13 05:12:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-04-13 05:12:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1160 transitions. [2018-04-13 05:12:52,373 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1160 transitions. Word has length 407 [2018-04-13 05:12:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:52,373 INFO L459 AbstractCegarLoop]: Abstraction has 998 states and 1160 transitions. [2018-04-13 05:12:52,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 05:12:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1160 transitions. [2018-04-13 05:12:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-13 05:12:52,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:52,375 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:52,375 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1644928107, now seen corresponding path program 81 times [2018-04-13 05:12:52,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:52,375 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:52,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:52,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:12:52,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:52,385 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:53,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:53,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:12:53,777 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-04-13 05:12:53,777 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:53,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:53,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:53,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-04-13 05:12:53,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 05:12:53,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 05:12:53,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3408, Invalid=3732, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 05:12:53,871 INFO L87 Difference]: Start difference. First operand 998 states and 1160 transitions. Second operand 85 states. [2018-04-13 05:12:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:12:57,572 INFO L93 Difference]: Finished difference Result 1094 states and 1259 transitions. [2018-04-13 05:12:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 05:12:57,573 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 412 [2018-04-13 05:12:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:12:57,573 INFO L225 Difference]: With dead ends: 1094 [2018-04-13 05:12:57,573 INFO L226 Difference]: Without dead ends: 1094 [2018-04-13 05:12:57,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 412 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-13 05:12:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2018-04-13 05:12:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1010. [2018-04-13 05:12:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2018-04-13 05:12:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1174 transitions. [2018-04-13 05:12:57,578 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1174 transitions. Word has length 412 [2018-04-13 05:12:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:12:57,579 INFO L459 AbstractCegarLoop]: Abstraction has 1010 states and 1174 transitions. [2018-04-13 05:12:57,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 05:12:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1174 transitions. [2018-04-13 05:12:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-13 05:12:57,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:12:57,580 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-04-13 05:12:57,580 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:12:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash -339477880, now seen corresponding path program 82 times [2018-04-13 05:12:57,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:12:57,580 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:12:57,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:57,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:12:57,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:12:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:12:57,590 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:12:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:59,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:12:59,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:12:59,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:12:59,025 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:12:59,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:12:59,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:12:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:12:59,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:12:59,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-04-13 05:12:59,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 05:12:59,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 05:12:59,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3410, Invalid=3900, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 05:12:59,125 INFO L87 Difference]: Start difference. First operand 1010 states and 1174 transitions. Second operand 86 states. [2018-04-13 05:13:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:13:03,302 INFO L93 Difference]: Finished difference Result 1107 states and 1274 transitions. [2018-04-13 05:13:03,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 05:13:03,302 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 417 [2018-04-13 05:13:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:13:03,303 INFO L225 Difference]: With dead ends: 1107 [2018-04-13 05:13:03,303 INFO L226 Difference]: Without dead ends: 1107 [2018-04-13 05:13:03,304 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=10297, Invalid=17759, Unknown=0, NotChecked=0, Total=28056 [2018-04-13 05:13:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-04-13 05:13:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1022. [2018-04-13 05:13:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-04-13 05:13:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1188 transitions. [2018-04-13 05:13:03,308 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1188 transitions. Word has length 417 [2018-04-13 05:13:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:13:03,309 INFO L459 AbstractCegarLoop]: Abstraction has 1022 states and 1188 transitions. [2018-04-13 05:13:03,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 05:13:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1188 transitions. [2018-04-13 05:13:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-04-13 05:13:03,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:13:03,310 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-04-13 05:13:03,310 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:13:03,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2095825781, now seen corresponding path program 83 times [2018-04-13 05:13:03,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:13:03,311 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:13:03,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:03,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:13:03,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:03,321 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:13:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:04,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:13:04,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:13:04,802 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:13:04,839 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-04-13 05:13:04,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:13:04,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:13:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:06,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:13:06,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 85] total 169 [2018-04-13 05:13:06,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-04-13 05:13:06,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-04-13 05:13:06,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7309, Invalid=21421, Unknown=0, NotChecked=0, Total=28730 [2018-04-13 05:13:06,955 INFO L87 Difference]: Start difference. First operand 1022 states and 1188 transitions. Second operand 170 states. [2018-04-13 05:13:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:13:26,106 INFO L93 Difference]: Finished difference Result 1120 states and 1289 transitions. [2018-04-13 05:13:26,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 05:13:26,134 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 422 [2018-04-13 05:13:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:13:26,134 INFO L225 Difference]: With dead ends: 1120 [2018-04-13 05:13:26,135 INFO L226 Difference]: Without dead ends: 1120 [2018-04-13 05:13:26,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13779 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2018-04-13 05:13:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-04-13 05:13:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1034. [2018-04-13 05:13:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-04-13 05:13:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1202 transitions. [2018-04-13 05:13:26,140 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1202 transitions. Word has length 422 [2018-04-13 05:13:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:13:26,140 INFO L459 AbstractCegarLoop]: Abstraction has 1034 states and 1202 transitions. [2018-04-13 05:13:26,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-04-13 05:13:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1202 transitions. [2018-04-13 05:13:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-13 05:13:26,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:13:26,141 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-04-13 05:13:26,141 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:13:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1775077032, now seen corresponding path program 84 times [2018-04-13 05:13:26,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:13:26,142 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:13:26,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:26,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:13:26,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:26,159 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:13:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:27,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:13:27,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:13:27,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:13:27,634 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-04-13 05:13:27,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:13:27,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:13:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:27,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:13:27,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 92 [2018-04-13 05:13:27,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 05:13:27,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 05:13:27,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3688, Invalid=4868, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 05:13:27,870 INFO L87 Difference]: Start difference. First operand 1034 states and 1202 transitions. Second operand 93 states. [2018-04-13 05:13:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:13:32,562 INFO L93 Difference]: Finished difference Result 1133 states and 1304 transitions. [2018-04-13 05:13:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 05:13:32,562 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 427 [2018-04-13 05:13:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:13:32,563 INFO L225 Difference]: With dead ends: 1133 [2018-04-13 05:13:32,563 INFO L226 Difference]: Without dead ends: 1133 [2018-04-13 05:13:32,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4069 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=11157, Invalid=19995, Unknown=0, NotChecked=0, Total=31152 [2018-04-13 05:13:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-04-13 05:13:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1046. [2018-04-13 05:13:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2018-04-13 05:13:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1216 transitions. [2018-04-13 05:13:32,569 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1216 transitions. Word has length 427 [2018-04-13 05:13:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:13:32,569 INFO L459 AbstractCegarLoop]: Abstraction has 1046 states and 1216 transitions. [2018-04-13 05:13:32,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 05:13:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1216 transitions. [2018-04-13 05:13:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-04-13 05:13:32,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:13:32,571 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-04-13 05:13:32,571 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:13:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2039794517, now seen corresponding path program 85 times [2018-04-13 05:13:32,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:13:32,571 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:13:32,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:32,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:13:32,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:32,582 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:13:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:34,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:13:34,121 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:13:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:13:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:34,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:13:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:34,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:13:34,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-04-13 05:13:34,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 05:13:34,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 05:13:34,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3746, Invalid=4086, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 05:13:34,220 INFO L87 Difference]: Start difference. First operand 1046 states and 1216 transitions. Second operand 89 states. [2018-04-13 05:13:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:13:38,294 INFO L93 Difference]: Finished difference Result 1146 states and 1319 transitions. [2018-04-13 05:13:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 05:13:38,471 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 432 [2018-04-13 05:13:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:13:38,472 INFO L225 Difference]: With dead ends: 1146 [2018-04-13 05:13:38,472 INFO L226 Difference]: Without dead ends: 1146 [2018-04-13 05:13:38,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 432 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-13 05:13:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-04-13 05:13:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1058. [2018-04-13 05:13:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-04-13 05:13:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1230 transitions. [2018-04-13 05:13:38,478 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1230 transitions. Word has length 432 [2018-04-13 05:13:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:13:38,478 INFO L459 AbstractCegarLoop]: Abstraction has 1058 states and 1230 transitions. [2018-04-13 05:13:38,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 05:13:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1230 transitions. [2018-04-13 05:13:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-13 05:13:38,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:13:38,480 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-04-13 05:13:38,480 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:13:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1592683208, now seen corresponding path program 86 times [2018-04-13 05:13:38,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:13:38,480 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:13:38,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:38,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:13:38,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:38,491 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:13:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:40,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:13:40,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:13:40,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:13:40,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:13:40,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:13:40,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:13:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:40,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:13:40,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-04-13 05:13:40,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 05:13:40,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 05:13:40,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3748, Invalid=4262, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 05:13:40,133 INFO L87 Difference]: Start difference. First operand 1058 states and 1230 transitions. Second operand 90 states. [2018-04-13 05:13:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:13:44,420 INFO L93 Difference]: Finished difference Result 1159 states and 1334 transitions. [2018-04-13 05:13:44,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 05:13:44,420 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 437 [2018-04-13 05:13:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:13:44,421 INFO L225 Difference]: With dead ends: 1159 [2018-04-13 05:13:44,421 INFO L226 Difference]: Without dead ends: 1159 [2018-04-13 05:13:44,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 437 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-13 05:13:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-04-13 05:13:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1070. [2018-04-13 05:13:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2018-04-13 05:13:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1244 transitions. [2018-04-13 05:13:44,427 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1244 transitions. Word has length 437 [2018-04-13 05:13:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:13:44,427 INFO L459 AbstractCegarLoop]: Abstraction has 1070 states and 1244 transitions. [2018-04-13 05:13:44,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 05:13:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1244 transitions. [2018-04-13 05:13:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-04-13 05:13:44,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:13:44,429 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-04-13 05:13:44,429 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:13:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -165067, now seen corresponding path program 87 times [2018-04-13 05:13:44,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:13:44,429 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:13:44,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:44,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:13:44,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:44,440 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:13:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:46,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:13:46,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:13:46,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:13:46,032 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-04-13 05:13:46,032 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:13:46,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:13:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:46,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:13:46,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-04-13 05:13:46,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 05:13:46,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 05:13:46,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=4269, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 05:13:46,133 INFO L87 Difference]: Start difference. First operand 1070 states and 1244 transitions. Second operand 91 states. [2018-04-13 05:13:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:13:50,330 INFO L93 Difference]: Finished difference Result 1172 states and 1349 transitions. [2018-04-13 05:13:50,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 05:13:50,330 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 442 [2018-04-13 05:13:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:13:50,331 INFO L225 Difference]: With dead ends: 1172 [2018-04-13 05:13:50,331 INFO L226 Difference]: Without dead ends: 1172 [2018-04-13 05:13:50,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 442 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-13 05:13:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-04-13 05:13:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1082. [2018-04-13 05:13:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2018-04-13 05:13:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1258 transitions. [2018-04-13 05:13:50,336 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1258 transitions. Word has length 442 [2018-04-13 05:13:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:13:50,336 INFO L459 AbstractCegarLoop]: Abstraction has 1082 states and 1258 transitions. [2018-04-13 05:13:50,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 05:13:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1258 transitions. [2018-04-13 05:13:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-04-13 05:13:50,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:13:50,338 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-04-13 05:13:50,338 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:13:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1210538264, now seen corresponding path program 88 times [2018-04-13 05:13:50,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:13:50,338 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:13:50,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:50,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:13:50,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:50,348 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:13:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:51,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:13:51,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:13:51,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:13:51,952 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:13:51,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:13:51,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:13:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:52,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:13:52,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-04-13 05:13:52,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 05:13:52,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 05:13:52,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3422, Invalid=4950, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 05:13:52,053 INFO L87 Difference]: Start difference. First operand 1082 states and 1258 transitions. Second operand 92 states. [2018-04-13 05:13:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:13:57,632 INFO L93 Difference]: Finished difference Result 1185 states and 1364 transitions. [2018-04-13 05:13:57,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 05:13:57,632 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 447 [2018-04-13 05:13:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:13:57,634 INFO L225 Difference]: With dead ends: 1185 [2018-04-13 05:13:57,634 INFO L226 Difference]: Without dead ends: 1185 [2018-04-13 05:13:57,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=10807, Invalid=21413, Unknown=0, NotChecked=0, Total=32220 [2018-04-13 05:13:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2018-04-13 05:13:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1094. [2018-04-13 05:13:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-04-13 05:13:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1272 transitions. [2018-04-13 05:13:57,639 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1272 transitions. Word has length 447 [2018-04-13 05:13:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:13:57,640 INFO L459 AbstractCegarLoop]: Abstraction has 1094 states and 1272 transitions. [2018-04-13 05:13:57,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 05:13:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1272 transitions. [2018-04-13 05:13:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-04-13 05:13:57,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:13:57,641 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-04-13 05:13:57,641 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:13:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1119081237, now seen corresponding path program 89 times [2018-04-13 05:13:57,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:13:57,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:13:57,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:57,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:13:57,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:13:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:13:57,652 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:13:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:13:59,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:13:59,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:13:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:13:59,355 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-04-13 05:13:59,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:13:59,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:14:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:01,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:14:01,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 91] total 181 [2018-04-13 05:14:01,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-04-13 05:14:01,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-04-13 05:14:01,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8371, Invalid=24571, Unknown=0, NotChecked=0, Total=32942 [2018-04-13 05:14:01,872 INFO L87 Difference]: Start difference. First operand 1094 states and 1272 transitions. Second operand 182 states. [2018-04-13 05:14:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:14:17,772 INFO L93 Difference]: Finished difference Result 1198 states and 1379 transitions. [2018-04-13 05:14:17,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 05:14:17,772 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 452 [2018-04-13 05:14:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:14:17,773 INFO L225 Difference]: With dead ends: 1198 [2018-04-13 05:14:17,773 INFO L226 Difference]: Without dead ends: 1198 [2018-04-13 05:14:17,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15843 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8463, Invalid=24843, Unknown=0, NotChecked=0, Total=33306 [2018-04-13 05:14:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-04-13 05:14:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1106. [2018-04-13 05:14:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-13 05:14:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1286 transitions. [2018-04-13 05:14:17,779 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1286 transitions. Word has length 452 [2018-04-13 05:14:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:14:17,779 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1286 transitions. [2018-04-13 05:14:17,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-04-13 05:14:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1286 transitions. [2018-04-13 05:14:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-04-13 05:14:17,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:14:17,780 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-04-13 05:14:17,780 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:14:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1430373624, now seen corresponding path program 90 times [2018-04-13 05:14:17,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:14:17,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:14:17,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:17,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:14:17,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:14:17,791 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:14:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:19,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:14:19,516 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:14:19,517 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:14:19,548 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-04-13 05:14:19,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:14:19,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:14:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:19,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:14:19,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 96 [2018-04-13 05:14:19,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-13 05:14:19,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-13 05:14:19,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4204, Invalid=5108, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 05:14:19,728 INFO L87 Difference]: Start difference. First operand 1106 states and 1286 transitions. Second operand 97 states. [2018-04-13 05:14:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:14:24,656 INFO L93 Difference]: Finished difference Result 1211 states and 1394 transitions. [2018-04-13 05:14:24,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 05:14:24,656 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 457 [2018-04-13 05:14:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:14:24,657 INFO L225 Difference]: With dead ends: 1211 [2018-04-13 05:14:24,657 INFO L226 Difference]: Without dead ends: 1211 [2018-04-13 05:14:24,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4456 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=12752, Invalid=22030, Unknown=0, NotChecked=0, Total=34782 [2018-04-13 05:14:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-04-13 05:14:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1118. [2018-04-13 05:14:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-04-13 05:14:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1300 transitions. [2018-04-13 05:14:24,663 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1300 transitions. Word has length 457 [2018-04-13 05:14:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:14:24,663 INFO L459 AbstractCegarLoop]: Abstraction has 1118 states and 1300 transitions. [2018-04-13 05:14:24,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-13 05:14:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1300 transitions. [2018-04-13 05:14:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-04-13 05:14:24,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:14:24,665 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-04-13 05:14:24,665 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:14:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 449172213, now seen corresponding path program 91 times [2018-04-13 05:14:24,665 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:14:24,665 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:14:24,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:24,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:14:24,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:14:24,675 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:14:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:26,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:14:26,430 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:14:26,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:14:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:14:26,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:14:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:26,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:14:26,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-04-13 05:14:26,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 05:14:26,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 05:14:26,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4283, Invalid=4647, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 05:14:26,560 INFO L87 Difference]: Start difference. First operand 1118 states and 1300 transitions. Second operand 95 states. [2018-04-13 05:14:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:14:31,245 INFO L93 Difference]: Finished difference Result 1224 states and 1409 transitions. [2018-04-13 05:14:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 05:14:31,245 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 462 [2018-04-13 05:14:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:14:31,246 INFO L225 Difference]: With dead ends: 1224 [2018-04-13 05:14:31,246 INFO L226 Difference]: Without dead ends: 1224 [2018-04-13 05:14:31,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=12837, Invalid=21573, Unknown=0, NotChecked=0, Total=34410 [2018-04-13 05:14:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2018-04-13 05:14:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1130. [2018-04-13 05:14:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-04-13 05:14:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1314 transitions. [2018-04-13 05:14:31,252 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1314 transitions. Word has length 462 [2018-04-13 05:14:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:14:31,252 INFO L459 AbstractCegarLoop]: Abstraction has 1130 states and 1314 transitions. [2018-04-13 05:14:31,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 05:14:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1314 transitions. [2018-04-13 05:14:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-13 05:14:31,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:14:31,254 INFO L355 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-04-13 05:14:31,254 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:14:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash -682547416, now seen corresponding path program 92 times [2018-04-13 05:14:31,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:14:31,254 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:14:31,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:14:31,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:14:31,265 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:14:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:33,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:14:33,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:14:33,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:14:33,054 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:14:33,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:14:33,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:14:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:33,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:14:33,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 109 [2018-04-13 05:14:33,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-13 05:14:33,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-13 05:14:33,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=7751, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 05:14:33,544 INFO L87 Difference]: Start difference. First operand 1130 states and 1314 transitions. Second operand 110 states. [2018-04-13 05:14:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:14:41,005 INFO L93 Difference]: Finished difference Result 1237 states and 1424 transitions. [2018-04-13 05:14:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 05:14:41,005 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 467 [2018-04-13 05:14:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:14:41,006 INFO L225 Difference]: With dead ends: 1237 [2018-04-13 05:14:41,006 INFO L226 Difference]: Without dead ends: 1237 [2018-04-13 05:14:41,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6129 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=13072, Invalid=27530, Unknown=0, NotChecked=0, Total=40602 [2018-04-13 05:14:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2018-04-13 05:14:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1142. [2018-04-13 05:14:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-04-13 05:14:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1328 transitions. [2018-04-13 05:14:41,012 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1328 transitions. Word has length 467 [2018-04-13 05:14:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:14:41,012 INFO L459 AbstractCegarLoop]: Abstraction has 1142 states and 1328 transitions. [2018-04-13 05:14:41,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-13 05:14:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1328 transitions. [2018-04-13 05:14:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-04-13 05:14:41,014 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:14:41,014 INFO L355 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-04-13 05:14:41,014 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:14:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash -406750507, now seen corresponding path program 93 times [2018-04-13 05:14:41,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:14:41,015 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:14:41,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:41,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:14:41,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:14:41,032 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:14:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:42,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:14:42,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:14:42,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:14:42,886 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-04-13 05:14:42,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:14:42,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:14:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:43,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:14:43,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-04-13 05:14:43,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-13 05:14:43,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-13 05:14:43,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4470, Invalid=4842, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 05:14:43,014 INFO L87 Difference]: Start difference. First operand 1142 states and 1328 transitions. Second operand 97 states. [2018-04-13 05:14:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:14:48,011 INFO L93 Difference]: Finished difference Result 1250 states and 1439 transitions. [2018-04-13 05:14:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 05:14:48,012 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 472 [2018-04-13 05:14:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:14:48,012 INFO L225 Difference]: With dead ends: 1250 [2018-04-13 05:14:48,013 INFO L226 Difference]: Without dead ends: 1250 [2018-04-13 05:14:48,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=13398, Invalid=22512, Unknown=0, NotChecked=0, Total=35910 [2018-04-13 05:14:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-04-13 05:14:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1154. [2018-04-13 05:14:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2018-04-13 05:14:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1342 transitions. [2018-04-13 05:14:48,018 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1342 transitions. Word has length 472 [2018-04-13 05:14:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:14:48,019 INFO L459 AbstractCegarLoop]: Abstraction has 1154 states and 1342 transitions. [2018-04-13 05:14:48,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-13 05:14:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1342 transitions. [2018-04-13 05:14:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-04-13 05:14:48,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:14:48,020 INFO L355 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-04-13 05:14:48,020 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:14:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1724083016, now seen corresponding path program 94 times [2018-04-13 05:14:48,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:14:48,021 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:14:48,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:48,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:14:48,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:14:48,032 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:14:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:49,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:14:49,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:14:49,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:14:49,867 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:14:49,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:14:49,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:14:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:49,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:14:49,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-04-13 05:14:49,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 05:14:49,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 05:14:49,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4472, Invalid=5034, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 05:14:49,992 INFO L87 Difference]: Start difference. First operand 1154 states and 1342 transitions. Second operand 98 states. [2018-04-13 05:14:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:14:55,299 INFO L93 Difference]: Finished difference Result 1263 states and 1454 transitions. [2018-04-13 05:14:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-13 05:14:55,326 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 477 [2018-04-13 05:14:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:14:55,327 INFO L225 Difference]: With dead ends: 1263 [2018-04-13 05:14:55,328 INFO L226 Difference]: Without dead ends: 1263 [2018-04-13 05:14:55,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4650 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=13495, Invalid=23177, Unknown=0, NotChecked=0, Total=36672 [2018-04-13 05:14:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-04-13 05:14:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1166. [2018-04-13 05:14:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-04-13 05:14:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1356 transitions. [2018-04-13 05:14:55,334 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1356 transitions. Word has length 477 [2018-04-13 05:14:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:14:55,335 INFO L459 AbstractCegarLoop]: Abstraction has 1166 states and 1356 transitions. [2018-04-13 05:14:55,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 05:14:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1356 transitions. [2018-04-13 05:14:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-04-13 05:14:55,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:14:55,336 INFO L355 BasicCegarLoop]: trace histogram [96, 95, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-04-13 05:14:55,336 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:14:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1874119349, now seen corresponding path program 95 times [2018-04-13 05:14:55,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:14:55,337 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:14:55,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:55,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:14:55,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:14:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:14:55,348 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:14:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:57,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:14:57,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:14:57,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:14:57,249 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-04-13 05:14:57,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:14:57,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:14:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:14:59,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:14:59,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 97] total 193 [2018-04-13 05:14:59,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-04-13 05:14:59,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-04-13 05:14:59,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9505, Invalid=27937, Unknown=0, NotChecked=0, Total=37442 [2018-04-13 05:14:59,855 INFO L87 Difference]: Start difference. First operand 1166 states and 1356 transitions. Second operand 194 states. [2018-04-13 05:15:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:15:21,558 INFO L93 Difference]: Finished difference Result 1276 states and 1469 transitions. [2018-04-13 05:15:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 05:15:21,558 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 482 [2018-04-13 05:15:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:15:21,559 INFO L225 Difference]: With dead ends: 1276 [2018-04-13 05:15:21,559 INFO L226 Difference]: Without dead ends: 1276 [2018-04-13 05:15:21,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18051 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=9603, Invalid=28227, Unknown=0, NotChecked=0, Total=37830 [2018-04-13 05:15:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-04-13 05:15:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1178. [2018-04-13 05:15:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2018-04-13 05:15:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1370 transitions. [2018-04-13 05:15:21,565 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1370 transitions. Word has length 482 [2018-04-13 05:15:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:15:21,565 INFO L459 AbstractCegarLoop]: Abstraction has 1178 states and 1370 transitions. [2018-04-13 05:15:21,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-04-13 05:15:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1370 transitions. [2018-04-13 05:15:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-04-13 05:15:21,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:15:21,567 INFO L355 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-04-13 05:15:21,567 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:15:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash 734463848, now seen corresponding path program 96 times [2018-04-13 05:15:21,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:15:21,567 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:15:21,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:21,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:15:21,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:15:21,579 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:15:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:23,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:15:23,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:15:23,326 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:15:23,357 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-04-13 05:15:23,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:15:23,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:15:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:24,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:15:24,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 132 [2018-04-13 05:15:24,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-04-13 05:15:24,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-04-13 05:15:24,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5416, Invalid=12140, Unknown=0, NotChecked=0, Total=17556 [2018-04-13 05:15:24,863 INFO L87 Difference]: Start difference. First operand 1178 states and 1370 transitions. Second operand 133 states. [2018-04-13 05:15:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:15:38,180 INFO L93 Difference]: Finished difference Result 1289 states and 1484 transitions. [2018-04-13 05:15:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 05:15:38,180 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 487 [2018-04-13 05:15:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:15:38,181 INFO L225 Difference]: With dead ends: 1289 [2018-04-13 05:15:38,181 INFO L226 Difference]: Without dead ends: 1289 [2018-04-13 05:15:38,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6991 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14615, Invalid=37597, Unknown=0, NotChecked=0, Total=52212 [2018-04-13 05:15:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-04-13 05:15:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1190. [2018-04-13 05:15:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2018-04-13 05:15:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1384 transitions. [2018-04-13 05:15:38,188 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1384 transitions. Word has length 487 [2018-04-13 05:15:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:15:38,188 INFO L459 AbstractCegarLoop]: Abstraction has 1190 states and 1384 transitions. [2018-04-13 05:15:38,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-04-13 05:15:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1384 transitions. [2018-04-13 05:15:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-13 05:15:38,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:15:38,190 INFO L355 BasicCegarLoop]: trace histogram [98, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-04-13 05:15:38,190 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:15:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1087520107, now seen corresponding path program 97 times [2018-04-13 05:15:38,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:15:38,190 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:15:38,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:38,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:15:38,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:15:38,202 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:15:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:40,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:15:40,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:15:40,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:15:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:15:40,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:15:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:40,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:15:40,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-04-13 05:15:40,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 05:15:40,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 05:15:40,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4856, Invalid=5244, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 05:15:40,461 INFO L87 Difference]: Start difference. First operand 1190 states and 1384 transitions. Second operand 101 states. [2018-04-13 05:15:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:15:45,879 INFO L93 Difference]: Finished difference Result 1302 states and 1499 transitions. [2018-04-13 05:15:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 05:15:45,880 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 492 [2018-04-13 05:15:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:15:45,881 INFO L225 Difference]: With dead ends: 1302 [2018-04-13 05:15:45,881 INFO L226 Difference]: Without dead ends: 1302 [2018-04-13 05:15:45,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=14556, Invalid=24450, Unknown=0, NotChecked=0, Total=39006 [2018-04-13 05:15:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-04-13 05:15:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1202. [2018-04-13 05:15:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2018-04-13 05:15:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1398 transitions. [2018-04-13 05:15:45,888 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1398 transitions. Word has length 492 [2018-04-13 05:15:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:15:45,888 INFO L459 AbstractCegarLoop]: Abstraction has 1202 states and 1398 transitions. [2018-04-13 05:15:45,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 05:15:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1398 transitions. [2018-04-13 05:15:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-04-13 05:15:45,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:15:45,890 INFO L355 BasicCegarLoop]: trace histogram [99, 98, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-04-13 05:15:45,890 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:15:45,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1030882424, now seen corresponding path program 98 times [2018-04-13 05:15:45,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:15:45,891 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:15:45,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:45,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:15:45,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:15:45,906 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:15:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:48,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:15:48,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:15:48,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:15:48,018 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:15:48,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:15:48,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:15:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:48,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:15:48,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 106 [2018-04-13 05:15:48,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-13 05:15:48,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-13 05:15:48,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4883, Invalid=6459, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 05:15:48,290 INFO L87 Difference]: Start difference. First operand 1202 states and 1398 transitions. Second operand 107 states. [2018-04-13 05:15:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:15:54,625 INFO L93 Difference]: Finished difference Result 1315 states and 1514 transitions. [2018-04-13 05:15:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-13 05:15:54,625 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 497 [2018-04-13 05:15:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:15:54,626 INFO L225 Difference]: With dead ends: 1315 [2018-04-13 05:15:54,626 INFO L226 Difference]: Without dead ends: 1315 [2018-04-13 05:15:54,627 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5552 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=14967, Invalid=26853, Unknown=0, NotChecked=0, Total=41820 [2018-04-13 05:15:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-04-13 05:15:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1214. [2018-04-13 05:15:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-04-13 05:15:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1412 transitions. [2018-04-13 05:15:54,633 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1412 transitions. Word has length 497 [2018-04-13 05:15:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:15:54,633 INFO L459 AbstractCegarLoop]: Abstraction has 1214 states and 1412 transitions. [2018-04-13 05:15:54,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-13 05:15:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1412 transitions. [2018-04-13 05:15:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-13 05:15:54,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:15:54,635 INFO L355 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-04-13 05:15:54,635 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:15:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash 154821237, now seen corresponding path program 99 times [2018-04-13 05:15:54,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:15:54,635 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:15:54,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:54,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:15:54,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:15:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:15:54,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:15:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:56,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:15:56,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:15:56,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:15:56,815 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-04-13 05:15:56,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:15:56,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:15:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:15:56,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:15:56,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2018-04-13 05:15:56,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-13 05:15:56,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-13 05:15:56,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5055, Invalid=5451, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 05:15:56,996 INFO L87 Difference]: Start difference. First operand 1214 states and 1412 transitions. Second operand 103 states. [2018-04-13 05:16:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:16:02,927 INFO L93 Difference]: Finished difference Result 1328 states and 1529 transitions. [2018-04-13 05:16:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-13 05:16:02,927 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 502 [2018-04-13 05:16:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:16:02,928 INFO L225 Difference]: With dead ends: 1328 [2018-04-13 05:16:02,928 INFO L226 Difference]: Without dead ends: 1328 [2018-04-13 05:16:02,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=15153, Invalid=25449, Unknown=0, NotChecked=0, Total=40602 [2018-04-13 05:16:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-04-13 05:16:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1226. [2018-04-13 05:16:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-04-13 05:16:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1426 transitions. [2018-04-13 05:16:02,935 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1426 transitions. Word has length 502 [2018-04-13 05:16:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:16:02,935 INFO L459 AbstractCegarLoop]: Abstraction has 1226 states and 1426 transitions. [2018-04-13 05:16:02,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-13 05:16:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1426 transitions. [2018-04-13 05:16:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-04-13 05:16:02,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:16:02,937 INFO L355 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-04-13 05:16:02,937 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:16:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1328920664, now seen corresponding path program 100 times [2018-04-13 05:16:02,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:16:02,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:16:02,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:02,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:16:02,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:16:02,950 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:16:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:05,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:16:05,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:16:05,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:16:05,105 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:16:05,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:16:05,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:16:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:05,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:16:05,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-04-13 05:16:05,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-13 05:16:05,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-13 05:16:05,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4862, Invalid=5850, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 05:16:05,227 INFO L87 Difference]: Start difference. First operand 1226 states and 1426 transitions. Second operand 104 states. [2018-04-13 05:16:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:16:11,585 INFO L93 Difference]: Finished difference Result 1341 states and 1544 transitions. [2018-04-13 05:16:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-13 05:16:11,586 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 507 [2018-04-13 05:16:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:16:11,587 INFO L225 Difference]: With dead ends: 1341 [2018-04-13 05:16:11,587 INFO L226 Difference]: Without dead ends: 1341 [2018-04-13 05:16:11,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5437 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=14859, Invalid=26553, Unknown=0, NotChecked=0, Total=41412 [2018-04-13 05:16:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2018-04-13 05:16:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1238. [2018-04-13 05:16:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2018-04-13 05:16:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1440 transitions. [2018-04-13 05:16:11,595 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1440 transitions. Word has length 507 [2018-04-13 05:16:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:16:11,596 INFO L459 AbstractCegarLoop]: Abstraction has 1238 states and 1440 transitions. [2018-04-13 05:16:11,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-13 05:16:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1440 transitions. [2018-04-13 05:16:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-04-13 05:16:11,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:16:11,598 INFO L355 BasicCegarLoop]: trace histogram [102, 101, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-04-13 05:16:11,598 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:16:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2023183787, now seen corresponding path program 101 times [2018-04-13 05:16:11,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:16:11,598 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:16:11,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:11,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:16:11,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:16:11,610 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:16:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:13,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:16:13,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:16:13,805 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:16:13,856 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2018-04-13 05:16:13,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:16:13,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:16:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:16,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:16:16,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 103] total 205 [2018-04-13 05:16:16,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-04-13 05:16:16,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-04-13 05:16:16,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10711, Invalid=31519, Unknown=0, NotChecked=0, Total=42230 [2018-04-13 05:16:16,736 INFO L87 Difference]: Start difference. First operand 1238 states and 1440 transitions. Second operand 206 states. [2018-04-13 05:16:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:16:42,179 INFO L93 Difference]: Finished difference Result 1354 states and 1559 transitions. [2018-04-13 05:16:42,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-13 05:16:42,180 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 512 [2018-04-13 05:16:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:16:42,180 INFO L225 Difference]: With dead ends: 1354 [2018-04-13 05:16:42,180 INFO L226 Difference]: Without dead ends: 1354 [2018-04-13 05:16:42,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20403 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=10815, Invalid=31827, Unknown=0, NotChecked=0, Total=42642 [2018-04-13 05:16:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-04-13 05:16:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1250. [2018-04-13 05:16:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2018-04-13 05:16:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1454 transitions. [2018-04-13 05:16:42,187 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1454 transitions. Word has length 512 [2018-04-13 05:16:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:16:42,187 INFO L459 AbstractCegarLoop]: Abstraction has 1250 states and 1454 transitions. [2018-04-13 05:16:42,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-04-13 05:16:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1454 transitions. [2018-04-13 05:16:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-04-13 05:16:42,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:16:42,189 INFO L355 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-04-13 05:16:42,189 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:16:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2052199480, now seen corresponding path program 102 times [2018-04-13 05:16:42,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:16:42,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:16:42,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:42,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:16:42,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:16:42,201 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:16:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:44,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:16:44,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:16:44,339 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:16:44,374 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2018-04-13 05:16:44,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:16:44,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:16:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:44,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:16:44,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 108 [2018-04-13 05:16:44,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-13 05:16:44,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-13 05:16:44,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5374, Invalid=6398, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 05:16:44,586 INFO L87 Difference]: Start difference. First operand 1250 states and 1454 transitions. Second operand 109 states. [2018-04-13 05:16:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:16:50,799 INFO L93 Difference]: Finished difference Result 1367 states and 1574 transitions. [2018-04-13 05:16:50,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-13 05:16:50,799 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 517 [2018-04-13 05:16:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:16:50,800 INFO L225 Difference]: With dead ends: 1367 [2018-04-13 05:16:50,800 INFO L226 Difference]: Without dead ends: 1367 [2018-04-13 05:16:50,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5662 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=16286, Invalid=28024, Unknown=0, NotChecked=0, Total=44310 [2018-04-13 05:16:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-04-13 05:16:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1262. [2018-04-13 05:16:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2018-04-13 05:16:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1468 transitions. [2018-04-13 05:16:50,811 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1468 transitions. Word has length 517 [2018-04-13 05:16:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:16:50,811 INFO L459 AbstractCegarLoop]: Abstraction has 1262 states and 1468 transitions. [2018-04-13 05:16:50,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-13 05:16:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1468 transitions. [2018-04-13 05:16:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-04-13 05:16:50,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:16:50,814 INFO L355 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-04-13 05:16:50,815 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:16:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1506187829, now seen corresponding path program 103 times [2018-04-13 05:16:50,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:16:50,815 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:16:50,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:50,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:16:50,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:16:50,828 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:16:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:53,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:16:53,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:16:53,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:16:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:16:53,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:16:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:16:53,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:16:53,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2018-04-13 05:16:53,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-13 05:16:53,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-13 05:16:53,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5465, Invalid=5877, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 05:16:53,181 INFO L87 Difference]: Start difference. First operand 1262 states and 1468 transitions. Second operand 107 states. [2018-04-13 05:16:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:16:59,201 INFO L93 Difference]: Finished difference Result 1380 states and 1589 transitions. [2018-04-13 05:16:59,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-13 05:16:59,201 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 522 [2018-04-13 05:16:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:16:59,202 INFO L225 Difference]: With dead ends: 1380 [2018-04-13 05:16:59,202 INFO L226 Difference]: Without dead ends: 1380 [2018-04-13 05:16:59,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 522 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-13 05:16:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-04-13 05:16:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1274. [2018-04-13 05:16:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2018-04-13 05:16:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1482 transitions. [2018-04-13 05:16:59,211 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1482 transitions. Word has length 522 [2018-04-13 05:16:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:16:59,212 INFO L459 AbstractCegarLoop]: Abstraction has 1274 states and 1482 transitions. [2018-04-13 05:16:59,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-13 05:16:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1482 transitions. [2018-04-13 05:16:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-04-13 05:16:59,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:16:59,214 INFO L355 BasicCegarLoop]: trace histogram [105, 104, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-04-13 05:16:59,214 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:16:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash -102045720, now seen corresponding path program 104 times [2018-04-13 05:16:59,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:16:59,215 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:16:59,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:59,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:16:59,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:16:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:16:59,227 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:17:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:01,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:17:01,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:17:01,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:17:01,401 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:17:01,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:17:01,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:17:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:01,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:17:01,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-04-13 05:17:01,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-13 05:17:01,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-13 05:17:01,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4870, Invalid=6686, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 05:17:01,547 INFO L87 Difference]: Start difference. First operand 1274 states and 1482 transitions. Second operand 108 states. [2018-04-13 05:17:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:17:09,468 INFO L93 Difference]: Finished difference Result 1393 states and 1604 transitions. [2018-04-13 05:17:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-13 05:17:09,468 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 527 [2018-04-13 05:17:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:17:09,469 INFO L225 Difference]: With dead ends: 1393 [2018-04-13 05:17:09,469 INFO L226 Difference]: Without dead ends: 1393 [2018-04-13 05:17:09,471 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6235 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=15263, Invalid=29469, Unknown=0, NotChecked=0, Total=44732 [2018-04-13 05:17:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-04-13 05:17:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1286. [2018-04-13 05:17:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2018-04-13 05:17:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1496 transitions. [2018-04-13 05:17:09,476 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1496 transitions. Word has length 527 [2018-04-13 05:17:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:17:09,476 INFO L459 AbstractCegarLoop]: Abstraction has 1286 states and 1496 transitions. [2018-04-13 05:17:09,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-13 05:17:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1496 transitions. [2018-04-13 05:17:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-04-13 05:17:09,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:17:09,493 INFO L355 BasicCegarLoop]: trace histogram [106, 105, 105, 105, 105, 1, 1, 1, 1, 1, 1] [2018-04-13 05:17:09,493 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:17:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1726099989, now seen corresponding path program 105 times [2018-04-13 05:17:09,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:17:09,494 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:17:09,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:17:09,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:17:09,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:17:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:17:09,506 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:17:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 27510 backedges. 0 proven. 27510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:11,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:17:11,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:17:11,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:17:11,860 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2018-04-13 05:17:11,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:17:11,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:17:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 27510 backedges. 0 proven. 27510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:14,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:17:14,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 107] total 214 [2018-04-13 05:17:14,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-04-13 05:17:14,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-04-13 05:17:14,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11663, Invalid=34347, Unknown=0, NotChecked=0, Total=46010 [2018-04-13 05:17:14,533 INFO L87 Difference]: Start difference. First operand 1286 states and 1496 transitions. Second operand 215 states. [2018-04-13 05:17:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:17:33,335 INFO L93 Difference]: Finished difference Result 1406 states and 1619 transitions. [2018-04-13 05:17:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-13 05:17:33,335 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 532 [2018-04-13 05:17:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:17:33,336 INFO L225 Difference]: With dead ends: 1406 [2018-04-13 05:17:33,336 INFO L226 Difference]: Without dead ends: 1406 [2018-04-13 05:17:33,337 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22259 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=11663, Invalid=34347, Unknown=0, NotChecked=0, Total=46010 [2018-04-13 05:17:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2018-04-13 05:17:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1298. [2018-04-13 05:17:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2018-04-13 05:17:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1510 transitions. [2018-04-13 05:17:33,344 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1510 transitions. Word has length 532 [2018-04-13 05:17:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:17:33,344 INFO L459 AbstractCegarLoop]: Abstraction has 1298 states and 1510 transitions. [2018-04-13 05:17:33,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-04-13 05:17:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1510 transitions. [2018-04-13 05:17:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-04-13 05:17:33,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:17:33,347 INFO L355 BasicCegarLoop]: trace histogram [107, 106, 106, 106, 106, 1, 1, 1, 1, 1, 1] [2018-04-13 05:17:33,347 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:17:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash 263404552, now seen corresponding path program 106 times [2018-04-13 05:17:33,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:17:33,347 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:17:33,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:17:33,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:17:33,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:17:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:17:33,377 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:17:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 28037 backedges. 0 proven. 28037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:35,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:17:35,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:17:35,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:17:35,664 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:17:35,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:17:35,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:17:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28037 backedges. 0 proven. 28037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:35,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:17:35,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 112 [2018-04-13 05:17:35,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-13 05:17:35,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-13 05:17:35,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=6860, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 05:17:35,909 INFO L87 Difference]: Start difference. First operand 1298 states and 1510 transitions. Second operand 113 states. [2018-04-13 05:17:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:17:43,068 INFO L93 Difference]: Finished difference Result 1419 states and 1634 transitions. [2018-04-13 05:17:43,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-04-13 05:17:43,068 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 537 [2018-04-13 05:17:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:17:43,069 INFO L225 Difference]: With dead ends: 1419 [2018-04-13 05:17:43,069 INFO L226 Difference]: Without dead ends: 1419 [2018-04-13 05:17:43,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6096 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=17560, Invalid=30182, Unknown=0, NotChecked=0, Total=47742 [2018-04-13 05:17:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-04-13 05:17:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1310. [2018-04-13 05:17:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2018-04-13 05:17:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1524 transitions. [2018-04-13 05:17:43,077 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1524 transitions. Word has length 537 [2018-04-13 05:17:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:17:43,077 INFO L459 AbstractCegarLoop]: Abstraction has 1310 states and 1524 transitions. [2018-04-13 05:17:43,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-13 05:17:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1524 transitions. [2018-04-13 05:17:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-04-13 05:17:43,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:17:43,079 INFO L355 BasicCegarLoop]: trace histogram [108, 107, 107, 107, 107, 1, 1, 1, 1, 1, 1] [2018-04-13 05:17:43,079 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:17:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1003057653, now seen corresponding path program 107 times [2018-04-13 05:17:43,079 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:17:43,079 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:17:43,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:17:43,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:17:43,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:17:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:17:43,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:17:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 28569 backedges. 0 proven. 28569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:45,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:17:45,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:17:45,429 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:17:45,485 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2018-04-13 05:17:45,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:17:45,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:17:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 28569 backedges. 0 proven. 28569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:17:48,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:17:48,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 109] total 217 [2018-04-13 05:17:48,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-04-13 05:17:48,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-04-13 05:17:48,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11989, Invalid=35317, Unknown=0, NotChecked=0, Total=47306 [2018-04-13 05:17:48,680 INFO L87 Difference]: Start difference. First operand 1310 states and 1524 transitions. Second operand 218 states. [2018-04-13 05:18:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:18:21,858 INFO L93 Difference]: Finished difference Result 1432 states and 1649 transitions. [2018-04-13 05:18:21,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-13 05:18:21,859 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 542 [2018-04-13 05:18:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:18:21,859 INFO L225 Difference]: With dead ends: 1432 [2018-04-13 05:18:21,860 INFO L226 Difference]: Without dead ends: 1432 [2018-04-13 05:18:21,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22899 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=12099, Invalid=35643, Unknown=0, NotChecked=0, Total=47742 [2018-04-13 05:18:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2018-04-13 05:18:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1322. [2018-04-13 05:18:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-04-13 05:18:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1538 transitions. [2018-04-13 05:18:21,866 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1538 transitions. Word has length 542 [2018-04-13 05:18:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:18:21,866 INFO L459 AbstractCegarLoop]: Abstraction has 1322 states and 1538 transitions. [2018-04-13 05:18:21,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-04-13 05:18:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1538 transitions. [2018-04-13 05:18:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-04-13 05:18:21,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:18:21,868 INFO L355 BasicCegarLoop]: trace histogram [109, 108, 108, 108, 108, 1, 1, 1, 1, 1, 1] [2018-04-13 05:18:21,868 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:18:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash 850978856, now seen corresponding path program 108 times [2018-04-13 05:18:21,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:18:21,868 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:18:21,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:18:21,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:18:21,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:18:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:18:21,880 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:18:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29106 backedges. 0 proven. 29106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:18:24,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:18:24,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:18:24,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 05:18:24,263 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2018-04-13 05:18:24,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:18:24,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:18:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29106 backedges. 0 proven. 29106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:18:27,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:18:27,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 110] total 220 [2018-04-13 05:18:27,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-04-13 05:18:27,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-04-13 05:18:27,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11990, Invalid=36630, Unknown=0, NotChecked=0, Total=48620 [2018-04-13 05:18:27,225 INFO L87 Difference]: Start difference. First operand 1322 states and 1538 transitions. Second operand 221 states. [2018-04-13 05:18:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:18:57,293 INFO L93 Difference]: Finished difference Result 1445 states and 1664 transitions. [2018-04-13 05:18:57,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-13 05:18:57,293 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 547 [2018-04-13 05:18:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:18:57,294 INFO L225 Difference]: With dead ends: 1445 [2018-04-13 05:18:57,294 INFO L226 Difference]: Without dead ends: 1445 [2018-04-13 05:18:57,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23210 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=11990, Invalid=36630, Unknown=0, NotChecked=0, Total=48620 [2018-04-13 05:18:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-04-13 05:18:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1334. [2018-04-13 05:18:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2018-04-13 05:18:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1552 transitions. [2018-04-13 05:18:57,300 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1552 transitions. Word has length 547 [2018-04-13 05:18:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:18:57,301 INFO L459 AbstractCegarLoop]: Abstraction has 1334 states and 1552 transitions. [2018-04-13 05:18:57,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-04-13 05:18:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1552 transitions. [2018-04-13 05:18:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-04-13 05:18:57,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:18:57,303 INFO L355 BasicCegarLoop]: trace histogram [110, 109, 109, 109, 109, 1, 1, 1, 1, 1, 1] [2018-04-13 05:18:57,303 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:18:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash -334865963, now seen corresponding path program 109 times [2018-04-13 05:18:57,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:18:57,303 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:18:57,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:18:57,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:18:57,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:18:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:18:57,316 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:18:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 29648 backedges. 0 proven. 29648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:18:59,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:18:59,881 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:18:59,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:18:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:18:59,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:19:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29648 backedges. 0 proven. 29648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:19:00,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:19:00,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2018-04-13 05:19:00,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-13 05:19:00,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-13 05:19:00,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6110, Invalid=6546, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 05:19:00,041 INFO L87 Difference]: Start difference. First operand 1334 states and 1552 transitions. Second operand 113 states. [2018-04-13 05:19:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:19:07,506 INFO L93 Difference]: Finished difference Result 1458 states and 1679 transitions. [2018-04-13 05:19:07,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-13 05:19:07,506 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 552 [2018-04-13 05:19:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:19:07,507 INFO L225 Difference]: With dead ends: 1458 [2018-04-13 05:19:07,507 INFO L226 Difference]: Without dead ends: 1458 [2018-04-13 05:19:07,509 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=18318, Invalid=30744, Unknown=0, NotChecked=0, Total=49062 [2018-04-13 05:19:07,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-04-13 05:19:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1346. [2018-04-13 05:19:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-04-13 05:19:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1566 transitions. [2018-04-13 05:19:07,516 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1566 transitions. Word has length 552 [2018-04-13 05:19:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:19:07,516 INFO L459 AbstractCegarLoop]: Abstraction has 1346 states and 1566 transitions. [2018-04-13 05:19:07,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-13 05:19:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1566 transitions. [2018-04-13 05:19:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-04-13 05:19:07,518 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:19:07,518 INFO L355 BasicCegarLoop]: trace histogram [111, 110, 110, 110, 110, 1, 1, 1, 1, 1, 1] [2018-04-13 05:19:07,518 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:19:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1479404616, now seen corresponding path program 110 times [2018-04-13 05:19:07,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:19:07,518 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:19:07,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:19:07,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:19:07,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:19:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:19:07,532 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:19:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30195 backedges. 0 proven. 30195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:19:10,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:19:10,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:19:10,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:19:10,112 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:19:10,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:19:10,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:19:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 30195 backedges. 0 proven. 30195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:19:10,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:19:10,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-04-13 05:19:10,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-13 05:19:10,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-13 05:19:10,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6112, Invalid=6770, Unknown=0, NotChecked=0, Total=12882 [2018-04-13 05:19:10,369 INFO L87 Difference]: Start difference. First operand 1346 states and 1566 transitions. Second operand 114 states. [2018-04-13 05:19:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:19:18,404 INFO L93 Difference]: Finished difference Result 1471 states and 1694 transitions. [2018-04-13 05:19:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-13 05:19:18,404 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 557 [2018-04-13 05:19:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:19:18,405 INFO L225 Difference]: With dead ends: 1471 [2018-04-13 05:19:18,405 INFO L226 Difference]: Without dead ends: 1471 [2018-04-13 05:19:18,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6322 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=18431, Invalid=31521, Unknown=0, NotChecked=0, Total=49952 [2018-04-13 05:19:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2018-04-13 05:19:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1358. [2018-04-13 05:19:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-04-13 05:19:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1580 transitions. [2018-04-13 05:19:18,411 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1580 transitions. Word has length 557 [2018-04-13 05:19:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:19:18,411 INFO L459 AbstractCegarLoop]: Abstraction has 1358 states and 1580 transitions. [2018-04-13 05:19:18,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-13 05:19:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1580 transitions. [2018-04-13 05:19:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-04-13 05:19:18,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:19:18,413 INFO L355 BasicCegarLoop]: trace histogram [112, 111, 111, 111, 111, 1, 1, 1, 1, 1, 1] [2018-04-13 05:19:18,413 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:19:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash -239933003, now seen corresponding path program 111 times [2018-04-13 05:19:18,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:19:18,413 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:19:18,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:19:18,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:19:18,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:19:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:19:18,426 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:19:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30747 backedges. 0 proven. 30747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:19:20,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:19:20,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:19:20,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 05:19:20,990 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2018-04-13 05:19:20,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:19:21,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:19:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30747 backedges. 0 proven. 30747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:19:23,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:19:23,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 113] total 226 [2018-04-13 05:19:23,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 227 states [2018-04-13 05:19:23,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 227 interpolants. [2018-04-13 05:19:23,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12995, Invalid=38307, Unknown=0, NotChecked=0, Total=51302 [2018-04-13 05:19:23,979 INFO L87 Difference]: Start difference. First operand 1358 states and 1580 transitions. Second operand 227 states. [2018-04-13 05:19:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:19:55,690 INFO L93 Difference]: Finished difference Result 1484 states and 1709 transitions. [2018-04-13 05:19:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-13 05:19:55,691 INFO L78 Accepts]: Start accepts. Automaton has 227 states. Word has length 562 [2018-04-13 05:19:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:19:55,692 INFO L225 Difference]: With dead ends: 1484 [2018-04-13 05:19:55,692 INFO L226 Difference]: Without dead ends: 1484 [2018-04-13 05:19:55,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24863 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=12995, Invalid=38307, Unknown=0, NotChecked=0, Total=51302 [2018-04-13 05:19:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-04-13 05:19:55,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1370. [2018-04-13 05:19:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-04-13 05:19:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1594 transitions. [2018-04-13 05:19:55,698 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1594 transitions. Word has length 562 [2018-04-13 05:19:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:19:55,699 INFO L459 AbstractCegarLoop]: Abstraction has 1370 states and 1594 transitions. [2018-04-13 05:19:55,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 227 states. [2018-04-13 05:19:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1594 transitions. [2018-04-13 05:19:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-04-13 05:19:55,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:19:55,700 INFO L355 BasicCegarLoop]: trace histogram [113, 112, 112, 112, 112, 1, 1, 1, 1, 1, 1] [2018-04-13 05:19:55,700 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:19:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash 516180072, now seen corresponding path program 112 times [2018-04-13 05:19:55,701 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:19:55,701 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:19:55,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:19:55,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:19:55,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:19:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:19:55,714 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:19:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 31304 backedges. 0 proven. 31304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:19:58,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:19:58,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:19:58,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 05:19:58,125 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 05:19:58,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:19:58,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:19:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 31304 backedges. 0 proven. 31304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:19:59,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:19:59,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 132 [2018-04-13 05:19:59,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-04-13 05:19:59,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-04-13 05:19:59,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6648, Invalid=10908, Unknown=0, NotChecked=0, Total=17556 [2018-04-13 05:19:59,060 INFO L87 Difference]: Start difference. First operand 1370 states and 1594 transitions. Second operand 133 states. [2018-04-13 05:20:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:20:11,617 INFO L93 Difference]: Finished difference Result 1497 states and 1724 transitions. [2018-04-13 05:20:11,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-13 05:20:11,617 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 567 [2018-04-13 05:20:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:20:11,618 INFO L225 Difference]: With dead ends: 1497 [2018-04-13 05:20:11,618 INFO L226 Difference]: Without dead ends: 1497 [2018-04-13 05:20:11,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8135 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19631, Invalid=40149, Unknown=0, NotChecked=0, Total=59780 [2018-04-13 05:20:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-04-13 05:20:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1382. [2018-04-13 05:20:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-04-13 05:20:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1608 transitions. [2018-04-13 05:20:11,625 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1608 transitions. Word has length 567 [2018-04-13 05:20:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:20:11,626 INFO L459 AbstractCegarLoop]: Abstraction has 1382 states and 1608 transitions. [2018-04-13 05:20:11,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-04-13 05:20:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1608 transitions. [2018-04-13 05:20:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-04-13 05:20:11,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:20:11,628 INFO L355 BasicCegarLoop]: trace histogram [114, 113, 113, 113, 113, 1, 1, 1, 1, 1, 1] [2018-04-13 05:20:11,628 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 05:20:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash 223420821, now seen corresponding path program 113 times [2018-04-13 05:20:11,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:20:11,628 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:20:11,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:11,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:20:11,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:20:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:20:11,641 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:20:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 31866 backedges. 0 proven. 31866 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:14,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:20:14,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:20:14,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 05:20:14,390 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2018-04-13 05:20:14,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:20:14,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:20:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 31866 backedges. 0 proven. 31866 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:20:17,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:20:17,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 115] total 229 [2018-04-13 05:20:17,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-04-13 05:20:17,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-04-13 05:20:17,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13339, Invalid=39331, Unknown=0, NotChecked=0, Total=52670 [2018-04-13 05:20:17,973 INFO L87 Difference]: Start difference. First operand 1382 states and 1608 transitions. Second operand 230 states. Received shutdown request... [2018-04-13 05:20:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 05:20:29,855 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 05:20:29,859 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 05:20:29,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:20:29 BoogieIcfgContainer [2018-04-13 05:20:29,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 05:20:29,860 INFO L168 Benchmark]: Toolchain (without parser) took 747921.75 ms. Allocated memory was 404.8 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 345.5 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 661.4 MB. Max. memory is 5.3 GB. [2018-04-13 05:20:29,861 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.8 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 05:20:29,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.02 ms. Allocated memory is still 404.8 MB. Free memory was 345.5 MB in the beginning and 336.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. [2018-04-13 05:20:29,861 INFO L168 Benchmark]: Boogie Preprocessor took 34.50 ms. Allocated memory is still 404.8 MB. Free memory was 336.0 MB in the beginning and 334.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 05:20:29,861 INFO L168 Benchmark]: RCFGBuilder took 215.70 ms. Allocated memory was 404.8 MB in the beginning and 612.9 MB in the end (delta: 208.1 MB). Free memory was 334.7 MB in the beginning and 580.6 MB in the end (delta: -245.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-13 05:20:29,861 INFO L168 Benchmark]: TraceAbstraction took 747478.40 ms. Allocated memory was 612.9 MB in the beginning and 2.7 GB in the end (delta: 2.0 GB). Free memory was 580.6 MB in the beginning and 1.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 688.4 MB. Max. memory is 5.3 GB. [2018-04-13 05:20:29,862 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.14 ms. Allocated memory is still 404.8 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 190.02 ms. Allocated memory is still 404.8 MB. Free memory was 345.5 MB in the beginning and 336.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.50 ms. Allocated memory is still 404.8 MB. Free memory was 336.0 MB in the beginning and 334.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 215.70 ms. Allocated memory was 404.8 MB in the beginning and 612.9 MB in the end (delta: 208.1 MB). Free memory was 334.7 MB in the beginning and 580.6 MB in the end (delta: -245.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 747478.40 ms. Allocated memory was 612.9 MB in the beginning and 2.7 GB in the end (delta: 2.0 GB). Free memory was 580.6 MB in the beginning and 1.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 688.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (1382states) and interpolant automaton (currently 76 states, 230 states before enhancement), while ReachableStatesComputation was computing reachable states (465 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (1382states) and interpolant automaton (currently 76 states, 230 states before enhancement), while ReachableStatesComputation was computing reachable states (465 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (1382states) and interpolant automaton (currently 76 states, 230 states before enhancement), while ReachableStatesComputation was computing reachable states (465 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (1382states) and interpolant automaton (currently 76 states, 230 states before enhancement), while ReachableStatesComputation was computing reachable states (465 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (1382states) and interpolant automaton (currently 76 states, 230 states before enhancement), while ReachableStatesComputation was computing reachable states (465 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (1382states) and interpolant automaton (currently 76 states, 230 states before enhancement), while ReachableStatesComputation was computing reachable states (465 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 747.4s OverallTime, 114 OverallIterations, 114 TraceHistogramMax, 585.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17110 SDtfs, 265804 SDslu, 408533 SDs, 0 SdLazy, 1696640 SolverSat, 102165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 330.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44222 GetRequests, 31002 SyntacticMatches, 7 SemanticMatches, 13213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478361 ImplicationChecksByTransitivity, 266.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred in iteration=113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 113 MinimizatonAttempts, 6667 StatesRemovedByMinimization, 113 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 152.0s InterpolantComputationTime, 65999 NumberOfCodeBlocks, 65999 NumberOfCodeBlocksAsserted, 3495 NumberOfCheckSat, 65772 ConstructedInterpolants, 0 QuantifiedInterpolants, 88220926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 72433 ConjunctsInSsa, 8897 ConjunctsInUnsatCore, 227 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2430404 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_05-20-29-867.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_05-20-29-867.csv Completed graceful shutdown