java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_24_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:48:38,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:48:38,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:48:38,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:48:38,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:48:38,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:48:38,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:48:38,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:48:38,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:48:38,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:48:38,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:48:38,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:48:38,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:48:38,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:48:38,251 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:48:38,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:48:38,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:48:38,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:48:38,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:48:38,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:48:38,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:48:38,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:48:38,260 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:48:38,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:48:38,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:48:38,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:48:38,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:48:38,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:48:38,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:48:38,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:48:38,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:48:38,264 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-10 15:48:38,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:48:38,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:48:38,284 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:48:38,284 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:48:38,285 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:48:38,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:48:38,285 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:48:38,285 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:48:38,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:48:38,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:48:38,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:48:38,286 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:48:38,286 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:48:38,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:48:38,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:48:38,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:48:38,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:48:38,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:48:38,287 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:48:38,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:48:38,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:48:38,288 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 15:48:38,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 15:48:38,288 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 15:48:38,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:48:38,329 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:48:38,333 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:48:38,334 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:48:38,334 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:48:38,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_false-valid-deref.i [2018-04-10 15:48:38,712 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfd04a7ec5 [2018-04-10 15:48:38,796 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:48:38,796 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:48:38,797 INFO L168 CDTParser]: Scanning sanfoundry_24_false-valid-deref.i [2018-04-10 15:48:38,798 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:48:38,798 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:48:38,798 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:48:38,799 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsanfoundry____false_valid_deref_i__printOdd ('printOdd') in sanfoundry_24_false-valid-deref.i [2018-04-10 15:48:38,799 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sanfoundry_24_false-valid-deref.i [2018-04-10 15:48:38,799 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsanfoundry____false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in sanfoundry_24_false-valid-deref.i [2018-04-10 15:48:38,799 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsanfoundry____false_valid_deref_i__printEven ('printEven') in sanfoundry_24_false-valid-deref.i [2018-04-10 15:48:38,799 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:48:38,799 INFO L233 ultiparseSymbolTable]: [2018-04-10 15:48:38,811 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfd04a7ec5 [2018-04-10 15:48:38,814 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:48:38,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:48:38,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:48:38,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:48:38,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:48:38,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:38,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7025eb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38, skipping insertion in model container [2018-04-10 15:48:38,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:38,840 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:48:38,852 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:48:38,960 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:48:38,973 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:48:38,976 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 8 non ball SCCs. Number of states in SCCs 8. [2018-04-10 15:48:38,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38 WrapperNode [2018-04-10 15:48:38,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:48:38,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:48:38,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:48:38,983 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:48:38,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:38,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:38,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:38,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:38,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:39,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:39,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... [2018-04-10 15:48:39,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:48:39,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:48:39,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:48:39,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:48:39,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:48:39,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:48:39,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:48:39,039 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsanfoundry____false_valid_deref_i____VERIFIER_assert [2018-04-10 15:48:39,039 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printEven [2018-04-10 15:48:39,039 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printOdd [2018-04-10 15:48:39,039 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsanfoundry____false_valid_deref_i____VERIFIER_assert [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printEven [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsanfoundry____false_valid_deref_i__printOdd [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:48:39,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:48:39,255 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:48:39,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:48:39 BoogieIcfgContainer [2018-04-10 15:48:39,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:48:39,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:48:39,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:48:39,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:48:39,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:48:38" (1/3) ... [2018-04-10 15:48:39,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcfd2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:48:39, skipping insertion in model container [2018-04-10 15:48:39,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:38" (2/3) ... [2018-04-10 15:48:39,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcfd2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:48:39, skipping insertion in model container [2018-04-10 15:48:39,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:48:39" (3/3) ... [2018-04-10 15:48:39,260 INFO L107 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i [2018-04-10 15:48:39,266 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:48:39,270 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-04-10 15:48:39,296 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:48:39,297 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:48:39,297 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:48:39,297 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 15:48:39,297 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 15:48:39,298 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:48:39,298 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:48:39,298 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:48:39,298 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:48:39,299 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:48:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-04-10 15:48:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 15:48:39,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:39,317 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:39,317 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 529392829, now seen corresponding path program 1 times [2018-04-10 15:48:39,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:39,324 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:39,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:39,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:39,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:39,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:39,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:48:39,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:48:39,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:48:39,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:48:39,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:48:39,449 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-04-10 15:48:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:39,555 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-04-10 15:48:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:48:39,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-04-10 15:48:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:39,563 INFO L225 Difference]: With dead ends: 60 [2018-04-10 15:48:39,563 INFO L226 Difference]: Without dead ends: 51 [2018-04-10 15:48:39,564 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-10 15:48:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-10 15:48:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-04-10 15:48:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-10 15:48:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-04-10 15:48:39,596 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2018-04-10 15:48:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:39,596 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-04-10 15:48:39,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:48:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-04-10 15:48:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-10 15:48:39,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:39,598 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:39,598 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash -406435754, now seen corresponding path program 1 times [2018-04-10 15:48:39,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:39,598 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:39,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:39,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:39,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:39,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:39,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:39,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:39,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:39,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:39,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:39,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-04-10 15:48:39,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:48:39,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:48:39,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:48:39,690 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-04-10 15:48:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:39,765 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-04-10 15:48:39,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:48:39,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-10 15:48:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:39,766 INFO L225 Difference]: With dead ends: 66 [2018-04-10 15:48:39,766 INFO L226 Difference]: Without dead ends: 66 [2018-04-10 15:48:39,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-10 15:48:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-10 15:48:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-04-10 15:48:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-10 15:48:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-04-10 15:48:39,775 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 13 [2018-04-10 15:48:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:39,775 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-04-10 15:48:39,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:48:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-04-10 15:48:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 15:48:39,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:39,777 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:39,778 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:39,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2003385437, now seen corresponding path program 2 times [2018-04-10 15:48:39,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:39,778 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:39,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:39,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:39,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:39,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:39,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:39,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:39,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:39,858 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:39,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:39,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:39,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:39,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-04-10 15:48:39,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:48:39,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:48:39,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:48:39,868 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 5 states. [2018-04-10 15:48:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,046 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-04-10 15:48:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:48:40,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 15:48:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:40,048 INFO L225 Difference]: With dead ends: 81 [2018-04-10 15:48:40,048 INFO L226 Difference]: Without dead ends: 81 [2018-04-10 15:48:40,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-10 15:48:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-10 15:48:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-04-10 15:48:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-10 15:48:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-04-10 15:48:40,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2018-04-10 15:48:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:40,057 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-04-10 15:48:40,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:48:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-04-10 15:48:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 15:48:40,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,059 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,059 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -948915018, now seen corresponding path program 3 times [2018-04-10 15:48:40,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,059 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:40,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:40,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:40,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:40,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 15:48:40,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:40,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:40,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-04-10 15:48:40,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:48:40,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:48:40,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:48:40,184 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 11 states. [2018-04-10 15:48:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,320 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-04-10 15:48:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:48:40,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-04-10 15:48:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:40,322 INFO L225 Difference]: With dead ends: 96 [2018-04-10 15:48:40,322 INFO L226 Difference]: Without dead ends: 96 [2018-04-10 15:48:40,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:48:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-10 15:48:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-04-10 15:48:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-10 15:48:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-04-10 15:48:40,329 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 23 [2018-04-10 15:48:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:40,330 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2018-04-10 15:48:40,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:48:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2018-04-10 15:48:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 15:48:40,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,331 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,331 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1053586435, now seen corresponding path program 4 times [2018-04-10 15:48:40,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,332 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:40,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:40,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:40,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:40,422 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:40,422 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:40,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:40,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-04-10 15:48:40,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:48:40,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:48:40,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:48:40,484 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 13 states. [2018-04-10 15:48:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,813 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2018-04-10 15:48:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:48:40,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-10 15:48:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:40,816 INFO L225 Difference]: With dead ends: 111 [2018-04-10 15:48:40,816 INFO L226 Difference]: Without dead ends: 111 [2018-04-10 15:48:40,816 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:48:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-10 15:48:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2018-04-10 15:48:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-10 15:48:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2018-04-10 15:48:40,823 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 28 [2018-04-10 15:48:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:40,823 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2018-04-10 15:48:40,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:48:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2018-04-10 15:48:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 15:48:40,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,824 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,824 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -339269354, now seen corresponding path program 5 times [2018-04-10 15:48:40,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,825 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:40,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:40,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:40,887 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:40,909 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-10 15:48:40,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:40,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:40,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-04-10 15:48:40,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 15:48:40,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 15:48:40,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:48:40,982 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 15 states. [2018-04-10 15:48:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:41,299 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-04-10 15:48:41,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:48:41,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-04-10 15:48:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,300 INFO L225 Difference]: With dead ends: 126 [2018-04-10 15:48:41,301 INFO L226 Difference]: Without dead ends: 126 [2018-04-10 15:48:41,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:48:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-10 15:48:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-04-10 15:48:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-10 15:48:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2018-04-10 15:48:41,309 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 33 [2018-04-10 15:48:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,309 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2018-04-10 15:48:41,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 15:48:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2018-04-10 15:48:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-10 15:48:41,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,311 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,311 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2023150493, now seen corresponding path program 6 times [2018-04-10 15:48:41,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,311 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:41,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:41,385 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-10 15:48:41,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:41,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-10 15:48:41,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:48:41,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:48:41,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:48:41,413 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 13 states. [2018-04-10 15:48:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:41,614 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-04-10 15:48:41,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:48:41,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-04-10 15:48:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,615 INFO L225 Difference]: With dead ends: 141 [2018-04-10 15:48:41,616 INFO L226 Difference]: Without dead ends: 141 [2018-04-10 15:48:41,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 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-10 15:48:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-10 15:48:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-04-10 15:48:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 15:48:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2018-04-10 15:48:41,622 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 38 [2018-04-10 15:48:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,623 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2018-04-10 15:48:41,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:48:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2018-04-10 15:48:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 15:48:41,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,624 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,624 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1822448266, now seen corresponding path program 7 times [2018-04-10 15:48:41,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,625 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:41,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-10 15:48:41,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:48:41,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:48:41,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:48:41,752 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand 11 states. [2018-04-10 15:48:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:42,027 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2018-04-10 15:48:42,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:48:42,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-04-10 15:48:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:42,029 INFO L225 Difference]: With dead ends: 156 [2018-04-10 15:48:42,029 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 15:48:42,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:48:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 15:48:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-04-10 15:48:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-10 15:48:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2018-04-10 15:48:42,036 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 43 [2018-04-10 15:48:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:42,036 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2018-04-10 15:48:42,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:48:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2018-04-10 15:48:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-10 15:48:42,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:42,037 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:42,038 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash 213717821, now seen corresponding path program 8 times [2018-04-10 15:48:42,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:42,038 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:42,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:42,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:42,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:42,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:42,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:42,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:42,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:42,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:42,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-10 15:48:42,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:48:42,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:48:42,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:48:42,174 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand 11 states. [2018-04-10 15:48:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:42,800 INFO L93 Difference]: Finished difference Result 171 states and 220 transitions. [2018-04-10 15:48:42,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:48:42,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-04-10 15:48:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:42,801 INFO L225 Difference]: With dead ends: 171 [2018-04-10 15:48:42,801 INFO L226 Difference]: Without dead ends: 171 [2018-04-10 15:48:42,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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-10 15:48:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-10 15:48:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-04-10 15:48:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 15:48:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2018-04-10 15:48:42,808 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 48 [2018-04-10 15:48:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:42,808 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2018-04-10 15:48:42,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:48:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2018-04-10 15:48:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 15:48:42,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:42,810 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:42,810 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 961554902, now seen corresponding path program 9 times [2018-04-10 15:48:42,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:42,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:42,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:42,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:42,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:42,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:42,974 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-10 15:48:42,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:42,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:42,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-04-10 15:48:42,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:48:42,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:48:42,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:48:42,992 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand 13 states. [2018-04-10 15:48:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:43,228 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-04-10 15:48:43,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:48:43,228 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-04-10 15:48:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:43,229 INFO L225 Difference]: With dead ends: 186 [2018-04-10 15:48:43,229 INFO L226 Difference]: Without dead ends: 186 [2018-04-10 15:48:43,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:48:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-10 15:48:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-04-10 15:48:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-10 15:48:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2018-04-10 15:48:43,236 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 53 [2018-04-10 15:48:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:43,236 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2018-04-10 15:48:43,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:48:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2018-04-10 15:48:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 15:48:43,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:43,238 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:43,238 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2142221603, now seen corresponding path program 10 times [2018-04-10 15:48:43,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:43,238 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:43,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:43,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:43,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:43,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:43,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:43,356 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:43,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:43,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:43,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:43,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-04-10 15:48:43,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:48:43,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:48:43,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:48:43,394 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand 17 states. [2018-04-10 15:48:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:43,686 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2018-04-10 15:48:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:48:43,686 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-04-10 15:48:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:43,687 INFO L225 Difference]: With dead ends: 201 [2018-04-10 15:48:43,687 INFO L226 Difference]: Without dead ends: 201 [2018-04-10 15:48:43,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:48:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-10 15:48:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2018-04-10 15:48:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-10 15:48:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-04-10 15:48:43,691 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 58 [2018-04-10 15:48:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:43,691 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-04-10 15:48:43,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:48:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-04-10 15:48:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 15:48:43,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:43,692 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:43,692 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -181488074, now seen corresponding path program 11 times [2018-04-10 15:48:43,692 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:43,693 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:43,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:43,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:43,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:43,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:43,799 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:43,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:43,821 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-10 15:48:43,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:43,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:43,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:43,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-04-10 15:48:43,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 15:48:43,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 15:48:43,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:48:43,953 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 27 states. [2018-04-10 15:48:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:45,233 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2018-04-10 15:48:45,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:48:45,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-04-10 15:48:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:45,234 INFO L225 Difference]: With dead ends: 216 [2018-04-10 15:48:45,234 INFO L226 Difference]: Without dead ends: 216 [2018-04-10 15:48:45,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:48:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-10 15:48:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2018-04-10 15:48:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-10 15:48:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2018-04-10 15:48:45,241 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 63 [2018-04-10 15:48:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:45,241 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2018-04-10 15:48:45,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 15:48:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-04-10 15:48:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 15:48:45,242 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:45,242 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:45,242 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:45,243 INFO L82 PathProgramCache]: Analyzing trace with hash 159021693, now seen corresponding path program 12 times [2018-04-10 15:48:45,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:45,243 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:45,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:45,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:45,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:45,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:45,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:45,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:45,375 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:45,405 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-10 15:48:45,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:45,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:45,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:45,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-04-10 15:48:45,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:48:45,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:48:45,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:48:45,538 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand 29 states. [2018-04-10 15:48:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:46,300 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2018-04-10 15:48:46,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 15:48:46,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-04-10 15:48:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:46,301 INFO L225 Difference]: With dead ends: 231 [2018-04-10 15:48:46,301 INFO L226 Difference]: Without dead ends: 231 [2018-04-10 15:48:46,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 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-10 15:48:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-10 15:48:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-04-10 15:48:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-10 15:48:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2018-04-10 15:48:46,306 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 68 [2018-04-10 15:48:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:46,307 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2018-04-10 15:48:46,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:48:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2018-04-10 15:48:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 15:48:46,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:46,308 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:46,308 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash -619623786, now seen corresponding path program 13 times [2018-04-10 15:48:46,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:46,309 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:46,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:46,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:46,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:46,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:46,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:46,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:46,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:46,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:46,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:46,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-04-10 15:48:46,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:48:46,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:48:46,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:48:46,458 INFO L87 Difference]: Start difference. First operand 214 states and 281 transitions. Second operand 17 states. [2018-04-10 15:48:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:46,949 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2018-04-10 15:48:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:48:46,949 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-04-10 15:48:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:46,951 INFO L225 Difference]: With dead ends: 246 [2018-04-10 15:48:46,951 INFO L226 Difference]: Without dead ends: 246 [2018-04-10 15:48:46,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:48:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-10 15:48:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2018-04-10 15:48:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-10 15:48:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2018-04-10 15:48:46,958 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 73 [2018-04-10 15:48:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:46,958 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2018-04-10 15:48:46,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:48:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-04-10 15:48:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-10 15:48:46,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:46,961 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:46,961 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1310350819, now seen corresponding path program 14 times [2018-04-10 15:48:46,962 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:46,962 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:46,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:46,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:46,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:46,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:47,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:47,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:47,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:47,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:47,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:47,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:47,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:47,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-04-10 15:48:47,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 15:48:47,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 15:48:47,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:48:47,202 INFO L87 Difference]: Start difference. First operand 228 states and 300 transitions. Second operand 22 states. [2018-04-10 15:48:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:47,807 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2018-04-10 15:48:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 15:48:47,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2018-04-10 15:48:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:47,808 INFO L225 Difference]: With dead ends: 261 [2018-04-10 15:48:47,809 INFO L226 Difference]: Without dead ends: 261 [2018-04-10 15:48:47,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=872, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 15:48:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-10 15:48:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-04-10 15:48:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 15:48:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-04-10 15:48:47,814 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 78 [2018-04-10 15:48:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:47,814 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-04-10 15:48:47,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 15:48:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-04-10 15:48:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-10 15:48:47,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:47,816 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:47,816 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:47,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1536026358, now seen corresponding path program 15 times [2018-04-10 15:48:47,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:47,816 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:47,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:47,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:47,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:47,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:47,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:47,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:47,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:48,024 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-10 15:48:48,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:48,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:48,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:48,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-10 15:48:48,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:48:48,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:48:48,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:48:48,211 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 35 states. [2018-04-10 15:48:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:49,603 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2018-04-10 15:48:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:48:49,604 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 83 [2018-04-10 15:48:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:49,604 INFO L225 Difference]: With dead ends: 276 [2018-04-10 15:48:49,605 INFO L226 Difference]: Without dead ends: 276 [2018-04-10 15:48:49,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:48:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-10 15:48:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2018-04-10 15:48:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-10 15:48:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2018-04-10 15:48:49,610 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 83 [2018-04-10 15:48:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:49,610 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2018-04-10 15:48:49,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:48:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2018-04-10 15:48:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 15:48:49,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:49,611 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:49,611 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash -155467331, now seen corresponding path program 16 times [2018-04-10 15:48:49,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:49,612 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:49,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:49,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:49,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:49,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:49,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:49,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:49,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:49,895 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:49,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:49,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:50,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:50,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-04-10 15:48:50,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:48:50,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:48:50,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:48:50,249 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand 37 states. [2018-04-10 15:48:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:51,336 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2018-04-10 15:48:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 15:48:51,336 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2018-04-10 15:48:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:51,337 INFO L225 Difference]: With dead ends: 291 [2018-04-10 15:48:51,337 INFO L226 Difference]: Without dead ends: 291 [2018-04-10 15:48:51,338 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:48:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-10 15:48:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2018-04-10 15:48:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-10 15:48:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-04-10 15:48:51,343 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 88 [2018-04-10 15:48:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:51,344 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-04-10 15:48:51,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:48:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-04-10 15:48:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-10 15:48:51,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:51,345 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:51,345 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1548055722, now seen corresponding path program 17 times [2018-04-10 15:48:51,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:51,346 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:51,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:51,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:51,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:51,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:51,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:51,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:51,522 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:51,551 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-10 15:48:51,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:51,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:51,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:51,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-04-10 15:48:51,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 15:48:51,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 15:48:51,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:48:51,742 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 39 states. [2018-04-10 15:48:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:53,576 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2018-04-10 15:48:53,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 15:48:53,576 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 93 [2018-04-10 15:48:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:53,577 INFO L225 Difference]: With dead ends: 306 [2018-04-10 15:48:53,577 INFO L226 Difference]: Without dead ends: 306 [2018-04-10 15:48:53,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:48:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-10 15:48:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2018-04-10 15:48:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-10 15:48:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 376 transitions. [2018-04-10 15:48:53,584 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 376 transitions. Word has length 93 [2018-04-10 15:48:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:53,584 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 376 transitions. [2018-04-10 15:48:53,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 15:48:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 376 transitions. [2018-04-10 15:48:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-04-10 15:48:53,586 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:53,586 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:53,586 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1755765085, now seen corresponding path program 18 times [2018-04-10 15:48:53,586 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:53,586 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:53,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:53,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:53,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:53,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:53,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:53,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:53,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:53,770 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-10 15:48:53,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:53,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:54,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:54,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-10 15:48:54,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:48:54,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:48:54,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:48:54,005 INFO L87 Difference]: Start difference. First operand 284 states and 376 transitions. Second operand 41 states. [2018-04-10 15:48:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:55,502 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2018-04-10 15:48:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:48:55,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 98 [2018-04-10 15:48:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:55,509 INFO L225 Difference]: With dead ends: 321 [2018-04-10 15:48:55,509 INFO L226 Difference]: Without dead ends: 321 [2018-04-10 15:48:55,510 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:48:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-10 15:48:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-04-10 15:48:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-10 15:48:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2018-04-10 15:48:55,515 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 98 [2018-04-10 15:48:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:55,516 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2018-04-10 15:48:55,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:48:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2018-04-10 15:48:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-10 15:48:55,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:55,517 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:55,517 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:55,518 INFO L82 PathProgramCache]: Analyzing trace with hash -47368266, now seen corresponding path program 19 times [2018-04-10 15:48:55,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:55,518 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:55,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:55,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:55,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:55,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:55,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:55,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:55,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:55,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:55,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:55,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-04-10 15:48:55,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:48:55,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:48:55,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:48:55,770 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 23 states. [2018-04-10 15:48:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:56,423 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2018-04-10 15:48:56,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:48:56,423 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-04-10 15:48:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:56,425 INFO L225 Difference]: With dead ends: 336 [2018-04-10 15:48:56,425 INFO L226 Difference]: Without dead ends: 336 [2018-04-10 15:48:56,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:48:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-10 15:48:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 312. [2018-04-10 15:48:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-04-10 15:48:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2018-04-10 15:48:56,431 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 103 [2018-04-10 15:48:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:56,432 INFO L459 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2018-04-10 15:48:56,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:48:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2018-04-10 15:48:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-10 15:48:56,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:56,433 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:56,433 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1271982333, now seen corresponding path program 20 times [2018-04-10 15:48:56,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:56,434 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:56,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:56,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:56,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:56,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:56,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:56,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:56,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:56,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:56,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:56,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:56,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:56,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 28 [2018-04-10 15:48:56,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:48:56,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:48:56,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:48:56,808 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand 29 states. [2018-04-10 15:48:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:57,568 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2018-04-10 15:48:57,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:48:57,568 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2018-04-10 15:48:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:57,569 INFO L225 Difference]: With dead ends: 351 [2018-04-10 15:48:57,569 INFO L226 Difference]: Without dead ends: 351 [2018-04-10 15:48:57,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=757, Invalid=1595, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:48:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-10 15:48:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 326. [2018-04-10 15:48:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-10 15:48:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-04-10 15:48:57,574 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 108 [2018-04-10 15:48:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:57,575 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-04-10 15:48:57,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:48:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-04-10 15:48:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-04-10 15:48:57,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:57,577 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:57,577 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash 771484694, now seen corresponding path program 21 times [2018-04-10 15:48:57,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:57,577 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:57,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:57,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:57,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:57,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:57,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:57,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:57,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:57,794 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-10 15:48:57,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:57,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:58,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:58,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-04-10 15:48:58,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 15:48:58,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 15:48:58,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:48:58,007 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 47 states. [2018-04-10 15:49:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:00,140 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2018-04-10 15:49:00,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 15:49:00,141 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 113 [2018-04-10 15:49:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:00,142 INFO L225 Difference]: With dead ends: 366 [2018-04-10 15:49:00,142 INFO L226 Difference]: Without dead ends: 366 [2018-04-10 15:49:00,142 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:49:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-10 15:49:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-04-10 15:49:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-10 15:49:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 452 transitions. [2018-04-10 15:49:00,146 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 452 transitions. Word has length 113 [2018-04-10 15:49:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:00,146 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 452 transitions. [2018-04-10 15:49:00,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 15:49:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 452 transitions. [2018-04-10 15:49:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-04-10 15:49:00,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:00,148 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:00,148 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 937685149, now seen corresponding path program 22 times [2018-04-10 15:49:00,148 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:00,148 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:00,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:00,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:00,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:00,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:00,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:00,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:00,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:49:00,365 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:49:00,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:00,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:00,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:00,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 28 [2018-04-10 15:49:00,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:49:00,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:49:00,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=518, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:49:00,440 INFO L87 Difference]: Start difference. First operand 340 states and 452 transitions. Second operand 29 states. [2018-04-10 15:49:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:01,266 INFO L93 Difference]: Finished difference Result 381 states and 500 transitions. [2018-04-10 15:49:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:49:01,266 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-04-10 15:49:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:01,267 INFO L225 Difference]: With dead ends: 381 [2018-04-10 15:49:01,267 INFO L226 Difference]: Without dead ends: 381 [2018-04-10 15:49:01,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=886, Invalid=1664, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:49:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-10 15:49:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2018-04-10 15:49:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-10 15:49:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-04-10 15:49:01,274 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 118 [2018-04-10 15:49:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:01,274 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-04-10 15:49:01,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:49:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-04-10 15:49:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-04-10 15:49:01,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:01,275 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:01,276 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash -658724746, now seen corresponding path program 23 times [2018-04-10 15:49:01,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:01,276 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:01,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:01,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:01,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:01,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:01,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:01,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:01,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:49:01,559 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-10 15:49:01,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:01,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:01,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:01,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-04-10 15:49:01,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 15:49:01,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 15:49:01,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:49:01,854 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 51 states. [2018-04-10 15:49:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:04,692 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2018-04-10 15:49:04,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 15:49:04,693 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 123 [2018-04-10 15:49:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:04,694 INFO L225 Difference]: With dead ends: 396 [2018-04-10 15:49:04,694 INFO L226 Difference]: Without dead ends: 396 [2018-04-10 15:49:04,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:49:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-10 15:49:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2018-04-10 15:49:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-10 15:49:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2018-04-10 15:49:04,700 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 123 [2018-04-10 15:49:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:04,701 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2018-04-10 15:49:04,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 15:49:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2018-04-10 15:49:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-04-10 15:49:04,702 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:04,702 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:04,702 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1207308227, now seen corresponding path program 24 times [2018-04-10 15:49:04,702 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:04,703 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:04,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:04,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:04,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:04,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:04,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:04,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:04,973 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:49:04,996 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-10 15:49:04,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:04,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:05,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:05,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-04-10 15:49:05,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:49:05,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:49:05,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:49:05,445 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand 53 states. [2018-04-10 15:49:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:08,007 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2018-04-10 15:49:08,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:49:08,007 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 128 [2018-04-10 15:49:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:08,008 INFO L225 Difference]: With dead ends: 411 [2018-04-10 15:49:08,008 INFO L226 Difference]: Without dead ends: 411 [2018-04-10 15:49:08,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:49:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-10 15:49:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 382. [2018-04-10 15:49:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-04-10 15:49:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2018-04-10 15:49:08,012 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 128 [2018-04-10 15:49:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:08,013 INFO L459 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2018-04-10 15:49:08,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:49:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2018-04-10 15:49:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-04-10 15:49:08,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:08,014 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:08,014 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -595235626, now seen corresponding path program 25 times [2018-04-10 15:49:08,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:08,014 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:08,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:08,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:08,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:08,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:08,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:08,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:08,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:08,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:08,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:08,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-04-10 15:49:08,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:49:08,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:49:08,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:49:08,325 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand 29 states. [2018-04-10 15:49:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:09,110 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2018-04-10 15:49:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:49:09,110 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-04-10 15:49:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:09,111 INFO L225 Difference]: With dead ends: 426 [2018-04-10 15:49:09,111 INFO L226 Difference]: Without dead ends: 426 [2018-04-10 15:49:09,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 15:49:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-04-10 15:49:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2018-04-10 15:49:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-04-10 15:49:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 528 transitions. [2018-04-10 15:49:09,116 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 528 transitions. Word has length 133 [2018-04-10 15:49:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:09,116 INFO L459 AbstractCegarLoop]: Abstraction has 396 states and 528 transitions. [2018-04-10 15:49:09,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:49:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 528 transitions. [2018-04-10 15:49:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-04-10 15:49:09,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:09,117 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:09,117 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:09,117 INFO L82 PathProgramCache]: Analyzing trace with hash -353572899, now seen corresponding path program 26 times [2018-04-10 15:49:09,117 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:09,117 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:09,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:09,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:09,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:09,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:09,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:09,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:09,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:09,369 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:09,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:09,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:09,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:09,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 34 [2018-04-10 15:49:09,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:49:09,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:49:09,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:49:09,450 INFO L87 Difference]: Start difference. First operand 396 states and 528 transitions. Second operand 35 states. [2018-04-10 15:49:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:10,527 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2018-04-10 15:49:10,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 15:49:10,527 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2018-04-10 15:49:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:10,529 INFO L225 Difference]: With dead ends: 441 [2018-04-10 15:49:10,529 INFO L226 Difference]: Without dead ends: 441 [2018-04-10 15:49:10,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1179, Invalid=2481, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:49:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-04-10 15:49:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2018-04-10 15:49:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-10 15:49:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2018-04-10 15:49:10,533 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 138 [2018-04-10 15:49:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:10,533 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2018-04-10 15:49:10,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:49:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2018-04-10 15:49:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-04-10 15:49:10,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:10,534 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:10,534 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1259587274, now seen corresponding path program 27 times [2018-04-10 15:49:10,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:10,534 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:10,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:10,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:10,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:10,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:10,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:10,783 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:49:10,810 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-10 15:49:10,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:10,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:11,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:11,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-04-10 15:49:11,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 15:49:11,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 15:49:11,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:49:11,132 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand 59 states. [2018-04-10 15:49:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:14,803 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2018-04-10 15:49:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:49:14,803 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 143 [2018-04-10 15:49:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:14,804 INFO L225 Difference]: With dead ends: 456 [2018-04-10 15:49:14,804 INFO L226 Difference]: Without dead ends: 456 [2018-04-10 15:49:14,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:49:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-10 15:49:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 424. [2018-04-10 15:49:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-10 15:49:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2018-04-10 15:49:14,808 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 143 [2018-04-10 15:49:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:14,808 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2018-04-10 15:49:14,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 15:49:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2018-04-10 15:49:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-04-10 15:49:14,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:14,809 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:14,809 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash 582408061, now seen corresponding path program 28 times [2018-04-10 15:49:14,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:14,809 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:14,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:14,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:14,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:14,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:15,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:15,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:15,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:49:15,167 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:49:15,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:15,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:15,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:15,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 36 [2018-04-10 15:49:15,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:49:15,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:49:15,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:49:15,303 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 37 states. [2018-04-10 15:49:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:16,267 INFO L93 Difference]: Finished difference Result 471 states and 620 transitions. [2018-04-10 15:49:16,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 15:49:16,267 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-04-10 15:49:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:16,269 INFO L225 Difference]: With dead ends: 471 [2018-04-10 15:49:16,269 INFO L226 Difference]: Without dead ends: 471 [2018-04-10 15:49:16,269 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1385, Invalid=2775, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:49:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-10 15:49:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 438. [2018-04-10 15:49:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-10 15:49:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-04-10 15:49:16,273 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 148 [2018-04-10 15:49:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:16,273 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-04-10 15:49:16,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:49:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-04-10 15:49:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-04-10 15:49:16,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:16,274 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:16,274 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash -637071978, now seen corresponding path program 29 times [2018-04-10 15:49:16,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:16,274 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:16,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:16,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:16,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:16,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:16,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:16,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:49:16,655 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-10 15:49:16,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:16,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:17,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:17,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-04-10 15:49:17,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 15:49:17,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 15:49:17,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 15:49:17,020 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 63 states. [2018-04-10 15:49:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:22,036 INFO L93 Difference]: Finished difference Result 486 states and 640 transitions. [2018-04-10 15:49:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 15:49:22,036 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 153 [2018-04-10 15:49:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:22,038 INFO L225 Difference]: With dead ends: 486 [2018-04-10 15:49:22,038 INFO L226 Difference]: Without dead ends: 486 [2018-04-10 15:49:22,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 15:49:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-04-10 15:49:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2018-04-10 15:49:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-10 15:49:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 604 transitions. [2018-04-10 15:49:22,042 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 604 transitions. Word has length 153 [2018-04-10 15:49:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:22,042 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 604 transitions. [2018-04-10 15:49:22,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 15:49:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 604 transitions. [2018-04-10 15:49:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-10 15:49:22,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:22,043 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:22,043 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:22,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2062434531, now seen corresponding path program 30 times [2018-04-10 15:49:22,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:22,043 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:22,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:22,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:22,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:22,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:22,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:22,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:22,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:49:22,367 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-10 15:49:22,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:22,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:22,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:22,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 64 [2018-04-10 15:49:22,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 15:49:22,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 15:49:22,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=3104, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:49:22,738 INFO L87 Difference]: Start difference. First operand 452 states and 604 transitions. Second operand 65 states. [2018-04-10 15:49:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:25,612 INFO L93 Difference]: Finished difference Result 501 states and 660 transitions. [2018-04-10 15:49:25,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 15:49:25,612 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 158 [2018-04-10 15:49:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:25,613 INFO L225 Difference]: With dead ends: 501 [2018-04-10 15:49:25,613 INFO L226 Difference]: Without dead ends: 501 [2018-04-10 15:49:25,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1056, Invalid=3104, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:49:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-04-10 15:49:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 466. [2018-04-10 15:49:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-04-10 15:49:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2018-04-10 15:49:25,617 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 158 [2018-04-10 15:49:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:25,618 INFO L459 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2018-04-10 15:49:25,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 15:49:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2018-04-10 15:49:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-04-10 15:49:25,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:25,619 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:25,619 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 543943158, now seen corresponding path program 31 times [2018-04-10 15:49:25,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:25,619 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:25,619 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:25,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:25,619 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:25,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:25,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:25,925 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:25,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:25,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:25,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:25,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-10 15:49:25,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:49:25,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:49:25,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:49:25,982 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand 35 states. [2018-04-10 15:49:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:26,891 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2018-04-10 15:49:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 15:49:26,892 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-04-10 15:49:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:26,893 INFO L225 Difference]: With dead ends: 516 [2018-04-10 15:49:26,893 INFO L226 Difference]: Without dead ends: 516 [2018-04-10 15:49:26,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:49:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-04-10 15:49:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 480. [2018-04-10 15:49:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-04-10 15:49:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 642 transitions. [2018-04-10 15:49:26,897 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 642 transitions. Word has length 163 [2018-04-10 15:49:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:26,897 INFO L459 AbstractCegarLoop]: Abstraction has 480 states and 642 transitions. [2018-04-10 15:49:26,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:49:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 642 transitions. [2018-04-10 15:49:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-04-10 15:49:26,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:26,898 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:26,898 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1423466819, now seen corresponding path program 32 times [2018-04-10 15:49:26,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:26,898 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:26,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:26,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:26,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:26,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:27,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:27,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:27,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:27,374 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:27,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:27,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:27,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:27,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-10 15:49:27,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:49:27,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:49:27,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:49:27,406 INFO L87 Difference]: Start difference. First operand 480 states and 642 transitions. Second operand 35 states. [2018-04-10 15:49:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:31,911 INFO L93 Difference]: Finished difference Result 531 states and 700 transitions. [2018-04-10 15:49:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:49:31,912 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-04-10 15:49:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:31,913 INFO L225 Difference]: With dead ends: 531 [2018-04-10 15:49:31,913 INFO L226 Difference]: Without dead ends: 531 [2018-04-10 15:49:31,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 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-10 15:49:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-04-10 15:49:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 494. [2018-04-10 15:49:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-04-10 15:49:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 661 transitions. [2018-04-10 15:49:31,916 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 661 transitions. Word has length 168 [2018-04-10 15:49:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:31,917 INFO L459 AbstractCegarLoop]: Abstraction has 494 states and 661 transitions. [2018-04-10 15:49:31,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:49:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 661 transitions. [2018-04-10 15:49:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-04-10 15:49:31,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:31,918 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:31,918 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 422628950, now seen corresponding path program 33 times [2018-04-10 15:49:31,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:31,918 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:31,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:31,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:31,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:31,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:32,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:32,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:32,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:49:32,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-10 15:49:32,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:32,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:32,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:32,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 70 [2018-04-10 15:49:32,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 15:49:32,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 15:49:32,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 15:49:32,784 INFO L87 Difference]: Start difference. First operand 494 states and 661 transitions. Second operand 71 states. [2018-04-10 15:49:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:37,401 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2018-04-10 15:49:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 15:49:37,402 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 173 [2018-04-10 15:49:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:37,403 INFO L225 Difference]: With dead ends: 546 [2018-04-10 15:49:37,403 INFO L226 Difference]: Without dead ends: 546 [2018-04-10 15:49:37,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 15:49:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-04-10 15:49:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 508. [2018-04-10 15:49:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-04-10 15:49:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2018-04-10 15:49:37,408 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 173 [2018-04-10 15:49:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:37,408 INFO L459 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2018-04-10 15:49:37,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 15:49:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2018-04-10 15:49:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-10 15:49:37,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:37,410 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:37,410 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1101166173, now seen corresponding path program 34 times [2018-04-10 15:49:37,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:37,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:37,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:37,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:37,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:37,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:37,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:37,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:37,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:49:37,814 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:49:37,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:37,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:37,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:37,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 40 [2018-04-10 15:49:37,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:49:37,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:49:37,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=992, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:49:37,876 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand 41 states. [2018-04-10 15:49:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:39,185 INFO L93 Difference]: Finished difference Result 561 states and 740 transitions. [2018-04-10 15:49:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 15:49:39,185 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-04-10 15:49:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:39,187 INFO L225 Difference]: With dead ends: 561 [2018-04-10 15:49:39,187 INFO L226 Difference]: Without dead ends: 561 [2018-04-10 15:49:39,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1972, Invalid=3578, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:49:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-10 15:49:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 522. [2018-04-10 15:49:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-04-10 15:49:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2018-04-10 15:49:39,193 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 178 [2018-04-10 15:49:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:39,193 INFO L459 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2018-04-10 15:49:39,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:49:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2018-04-10 15:49:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-04-10 15:49:39,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:39,194 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:39,194 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1911274166, now seen corresponding path program 35 times [2018-04-10 15:49:39,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:39,194 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:39,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:39,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:39,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:39,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:39,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:39,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:39,636 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:49:39,699 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-10 15:49:39,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:39,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:40,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:40,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-04-10 15:49:40,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-10 15:49:40,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-10 15:49:40,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:49:40,225 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand 75 states. [2018-04-10 15:49:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:47,022 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2018-04-10 15:49:47,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 15:49:47,022 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 183 [2018-04-10 15:49:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:47,023 INFO L225 Difference]: With dead ends: 576 [2018-04-10 15:49:47,023 INFO L226 Difference]: Without dead ends: 576 [2018-04-10 15:49:47,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:49:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-04-10 15:49:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 536. [2018-04-10 15:49:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-04-10 15:49:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2018-04-10 15:49:47,027 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 183 [2018-04-10 15:49:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:47,027 INFO L459 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2018-04-10 15:49:47,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-10 15:49:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2018-04-10 15:49:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-10 15:49:47,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:47,028 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:47,028 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:47,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1465104899, now seen corresponding path program 36 times [2018-04-10 15:49:47,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:47,029 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:47,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:47,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:47,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:47,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:47,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:47,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:47,458 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:49:47,509 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-10 15:49:47,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:47,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:47,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:47,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 76 [2018-04-10 15:49:47,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-10 15:49:47,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-10 15:49:47,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 15:49:47,948 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand 77 states. [2018-04-10 15:49:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:52,640 INFO L93 Difference]: Finished difference Result 591 states and 780 transitions. [2018-04-10 15:49:52,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 15:49:52,640 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 188 [2018-04-10 15:49:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:52,641 INFO L225 Difference]: With dead ends: 591 [2018-04-10 15:49:52,641 INFO L226 Difference]: Without dead ends: 591 [2018-04-10 15:49:52,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 15:49:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-04-10 15:49:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 550. [2018-04-10 15:49:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-04-10 15:49:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 737 transitions. [2018-04-10 15:49:52,646 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 737 transitions. Word has length 188 [2018-04-10 15:49:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:52,646 INFO L459 AbstractCegarLoop]: Abstraction has 550 states and 737 transitions. [2018-04-10 15:49:52,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-10 15:49:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 737 transitions. [2018-04-10 15:49:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-04-10 15:49:52,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:52,647 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:52,647 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1420996374, now seen corresponding path program 37 times [2018-04-10 15:49:52,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:52,647 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:52,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:52,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:52,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:52,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:53,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:53,148 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:53,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:53,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:53,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:53,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-04-10 15:49:53,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:49:53,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:49:53,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:49:53,190 INFO L87 Difference]: Start difference. First operand 550 states and 737 transitions. Second operand 41 states. [2018-04-10 15:49:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:54,345 INFO L93 Difference]: Finished difference Result 606 states and 800 transitions. [2018-04-10 15:49:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 15:49:54,345 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-04-10 15:49:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:54,346 INFO L225 Difference]: With dead ends: 606 [2018-04-10 15:49:54,346 INFO L226 Difference]: Without dead ends: 606 [2018-04-10 15:49:54,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 15:49:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-04-10 15:49:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 564. [2018-04-10 15:49:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-04-10 15:49:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2018-04-10 15:49:54,351 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 193 [2018-04-10 15:49:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:54,351 INFO L459 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2018-04-10 15:49:54,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:49:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2018-04-10 15:49:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-04-10 15:49:54,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:54,352 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:54,352 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1813049955, now seen corresponding path program 38 times [2018-04-10 15:49:54,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:54,352 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:54,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:54,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:54,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:54,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:54,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:54,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:54,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:54,830 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:54,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:54,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:55,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:55,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 80 [2018-04-10 15:49:55,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-10 15:49:55,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-10 15:49:55,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1640, Invalid=4840, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:49:55,297 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand 81 states. [2018-04-10 15:50:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:02,254 INFO L93 Difference]: Finished difference Result 621 states and 820 transitions. [2018-04-10 15:50:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 15:50:02,254 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 198 [2018-04-10 15:50:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:02,255 INFO L225 Difference]: With dead ends: 621 [2018-04-10 15:50:02,256 INFO L226 Difference]: Without dead ends: 621 [2018-04-10 15:50:02,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2923 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1640, Invalid=4840, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:50:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-04-10 15:50:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 578. [2018-04-10 15:50:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-04-10 15:50:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 775 transitions. [2018-04-10 15:50:02,260 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 775 transitions. Word has length 198 [2018-04-10 15:50:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:02,260 INFO L459 AbstractCegarLoop]: Abstraction has 578 states and 775 transitions. [2018-04-10 15:50:02,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-10 15:50:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 775 transitions. [2018-04-10 15:50:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-04-10 15:50:02,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:02,261 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:02,261 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:02,261 INFO L82 PathProgramCache]: Analyzing trace with hash -937710730, now seen corresponding path program 39 times [2018-04-10 15:50:02,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:02,261 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:02,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:02,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:02,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:02,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:02,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:02,886 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:50:02,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-10 15:50:02,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:02,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:03,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:03,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 82 [2018-04-10 15:50:03,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-10 15:50:03,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-10 15:50:03,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 15:50:03,410 INFO L87 Difference]: Start difference. First operand 578 states and 775 transitions. Second operand 83 states. [2018-04-10 15:50:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:09,244 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2018-04-10 15:50:09,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 15:50:09,244 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 203 [2018-04-10 15:50:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:09,245 INFO L225 Difference]: With dead ends: 636 [2018-04-10 15:50:09,245 INFO L226 Difference]: Without dead ends: 636 [2018-04-10 15:50:09,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 15:50:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-04-10 15:50:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 592. [2018-04-10 15:50:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-04-10 15:50:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 794 transitions. [2018-04-10 15:50:09,252 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 794 transitions. Word has length 203 [2018-04-10 15:50:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:09,253 INFO L459 AbstractCegarLoop]: Abstraction has 592 states and 794 transitions. [2018-04-10 15:50:09,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-10 15:50:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 794 transitions. [2018-04-10 15:50:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-04-10 15:50:09,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:09,254 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:09,254 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1433088707, now seen corresponding path program 40 times [2018-04-10 15:50:09,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:09,255 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:09,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:09,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:09,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:09,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:09,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:09,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:09,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:50:09,944 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:50:09,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:09,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:10,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:10,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 52 [2018-04-10 15:50:10,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:50:10,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:50:10,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:50:10,193 INFO L87 Difference]: Start difference. First operand 592 states and 794 transitions. Second operand 53 states. [2018-04-10 15:50:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:12,332 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2018-04-10 15:50:12,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 15:50:12,332 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2018-04-10 15:50:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:12,333 INFO L225 Difference]: With dead ends: 651 [2018-04-10 15:50:12,333 INFO L226 Difference]: Without dead ends: 651 [2018-04-10 15:50:12,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2707, Invalid=5849, Unknown=0, NotChecked=0, Total=8556 [2018-04-10 15:50:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-04-10 15:50:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 606. [2018-04-10 15:50:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-04-10 15:50:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 813 transitions. [2018-04-10 15:50:12,339 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 813 transitions. Word has length 208 [2018-04-10 15:50:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:12,340 INFO L459 AbstractCegarLoop]: Abstraction has 606 states and 813 transitions. [2018-04-10 15:50:12,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:50:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 813 transitions. [2018-04-10 15:50:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-04-10 15:50:12,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:12,341 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:12,341 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:12,341 INFO L82 PathProgramCache]: Analyzing trace with hash 255635414, now seen corresponding path program 41 times [2018-04-10 15:50:12,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:12,341 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:12,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:12,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:12,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:12,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:12,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:12,850 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:12,850 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:50:12,907 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-10 15:50:12,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:12,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:13,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:13,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2018-04-10 15:50:13,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-10 15:50:13,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-10 15:50:13,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 15:50:13,554 INFO L87 Difference]: Start difference. First operand 606 states and 813 transitions. Second operand 87 states. [2018-04-10 15:50:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:20,369 INFO L93 Difference]: Finished difference Result 666 states and 880 transitions. [2018-04-10 15:50:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 15:50:20,369 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 213 [2018-04-10 15:50:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:20,370 INFO L225 Difference]: With dead ends: 666 [2018-04-10 15:50:20,370 INFO L226 Difference]: Without dead ends: 666 [2018-04-10 15:50:20,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3443 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 15:50:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-04-10 15:50:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 620. [2018-04-10 15:50:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-04-10 15:50:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 832 transitions. [2018-04-10 15:50:20,375 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 832 transitions. Word has length 213 [2018-04-10 15:50:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:20,375 INFO L459 AbstractCegarLoop]: Abstraction has 620 states and 832 transitions. [2018-04-10 15:50:20,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-10 15:50:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 832 transitions. [2018-04-10 15:50:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-04-10 15:50:20,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:20,376 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:20,376 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash 658998493, now seen corresponding path program 42 times [2018-04-10 15:50:20,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:20,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:20,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:20,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:20,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:20,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:20,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:20,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:20,898 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:50:20,988 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-10 15:50:20,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:20,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:21,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:21,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44] total 88 [2018-04-10 15:50:21,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-10 15:50:21,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-10 15:50:21,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=5852, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 15:50:21,571 INFO L87 Difference]: Start difference. First operand 620 states and 832 transitions. Second operand 89 states. [2018-04-10 15:50:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:29,527 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2018-04-10 15:50:29,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 15:50:29,528 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 218 [2018-04-10 15:50:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:29,529 INFO L225 Difference]: With dead ends: 681 [2018-04-10 15:50:29,529 INFO L226 Difference]: Without dead ends: 681 [2018-04-10 15:50:29,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1980, Invalid=5852, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 15:50:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-04-10 15:50:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 634. [2018-04-10 15:50:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-04-10 15:50:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 851 transitions. [2018-04-10 15:50:29,534 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 851 transitions. Word has length 218 [2018-04-10 15:50:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:29,534 INFO L459 AbstractCegarLoop]: Abstraction has 634 states and 851 transitions. [2018-04-10 15:50:29,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-10 15:50:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 851 transitions. [2018-04-10 15:50:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-04-10 15:50:29,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:29,535 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:29,535 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash 162249782, now seen corresponding path program 43 times [2018-04-10 15:50:29,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:29,535 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:29,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:29,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:29,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:29,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:30,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:30,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:30,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:50:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:30,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:30,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:30,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-04-10 15:50:30,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 15:50:30,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 15:50:30,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:50:30,168 INFO L87 Difference]: Start difference. First operand 634 states and 851 transitions. Second operand 47 states. [2018-04-10 15:50:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:31,733 INFO L93 Difference]: Finished difference Result 696 states and 920 transitions. [2018-04-10 15:50:31,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 15:50:31,733 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-04-10 15:50:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:31,735 INFO L225 Difference]: With dead ends: 696 [2018-04-10 15:50:31,735 INFO L226 Difference]: Without dead ends: 696 [2018-04-10 15:50:31,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 15:50:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-04-10 15:50:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 648. [2018-04-10 15:50:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-04-10 15:50:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 870 transitions. [2018-04-10 15:50:31,739 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 870 transitions. Word has length 223 [2018-04-10 15:50:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:31,740 INFO L459 AbstractCegarLoop]: Abstraction has 648 states and 870 transitions. [2018-04-10 15:50:31,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 15:50:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 870 transitions. [2018-04-10 15:50:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-04-10 15:50:31,741 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:31,741 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:31,741 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2016490621, now seen corresponding path program 44 times [2018-04-10 15:50:31,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:31,741 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:31,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:50:31,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:31,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:32,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:32,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:32,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:50:32,327 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:50:32,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:32,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:32,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:32,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-04-10 15:50:32,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 15:50:32,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 15:50:32,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:50:32,522 INFO L87 Difference]: Start difference. First operand 648 states and 870 transitions. Second operand 55 states. [2018-04-10 15:50:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:34,758 INFO L93 Difference]: Finished difference Result 711 states and 940 transitions. [2018-04-10 15:50:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 15:50:34,758 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 228 [2018-04-10 15:50:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:34,759 INFO L225 Difference]: With dead ends: 711 [2018-04-10 15:50:34,760 INFO L226 Difference]: Without dead ends: 711 [2018-04-10 15:50:34,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 221 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-10 15:50:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-04-10 15:50:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 662. [2018-04-10 15:50:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-10 15:50:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 889 transitions. [2018-04-10 15:50:34,765 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 889 transitions. Word has length 228 [2018-04-10 15:50:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:34,766 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 889 transitions. [2018-04-10 15:50:34,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 15:50:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 889 transitions. [2018-04-10 15:50:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-04-10 15:50:34,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:34,768 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:34,768 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1820405610, now seen corresponding path program 45 times [2018-04-10 15:50:34,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:34,768 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:34,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:34,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:34,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:34,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:35,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:35,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:35,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:50:35,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-10 15:50:35,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:35,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:36,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:36,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 94 [2018-04-10 15:50:36,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-10 15:50:36,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-10 15:50:36,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 15:50:36,260 INFO L87 Difference]: Start difference. First operand 662 states and 889 transitions. Second operand 95 states. [2018-04-10 15:50:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:45,364 INFO L93 Difference]: Finished difference Result 726 states and 960 transitions. [2018-04-10 15:50:45,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 15:50:45,365 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 233 [2018-04-10 15:50:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:45,367 INFO L225 Difference]: With dead ends: 726 [2018-04-10 15:50:45,367 INFO L226 Difference]: Without dead ends: 726 [2018-04-10 15:50:45,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 15:50:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-04-10 15:50:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 676. [2018-04-10 15:50:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-04-10 15:50:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 908 transitions. [2018-04-10 15:50:45,375 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 908 transitions. Word has length 233 [2018-04-10 15:50:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:45,375 INFO L459 AbstractCegarLoop]: Abstraction has 676 states and 908 transitions. [2018-04-10 15:50:45,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-10 15:50:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 908 transitions. [2018-04-10 15:50:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-10 15:50:45,377 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:45,377 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:45,377 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash -553919459, now seen corresponding path program 46 times [2018-04-10 15:50:45,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:45,378 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:45,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:45,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:45,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:45,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:46,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:46,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:46,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:50:46,053 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:50:46,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:46,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:46,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:46,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 52 [2018-04-10 15:50:46,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:50:46,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:50:46,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1146, Invalid=1610, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:50:46,181 INFO L87 Difference]: Start difference. First operand 676 states and 908 transitions. Second operand 53 states. [2018-04-10 15:50:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:48,164 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2018-04-10 15:50:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 15:50:48,164 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 238 [2018-04-10 15:50:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:48,165 INFO L225 Difference]: With dead ends: 741 [2018-04-10 15:50:48,165 INFO L226 Difference]: Without dead ends: 741 [2018-04-10 15:50:48,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3490, Invalid=6212, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:50:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-04-10 15:50:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 690. [2018-04-10 15:50:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-04-10 15:50:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 927 transitions. [2018-04-10 15:50:48,171 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 927 transitions. Word has length 238 [2018-04-10 15:50:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:48,171 INFO L459 AbstractCegarLoop]: Abstraction has 690 states and 927 transitions. [2018-04-10 15:50:48,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:50:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 927 transitions. [2018-04-10 15:50:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-04-10 15:50:48,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:48,172 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:48,172 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -448008970, now seen corresponding path program 47 times [2018-04-10 15:50:48,172 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:48,172 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:48,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:48,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:48,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:48,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:48,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:48,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:48,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:50:48,915 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-10 15:50:48,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:48,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:49,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:49,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2018-04-10 15:50:49,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-10 15:50:49,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-10 15:50:49,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:50:49,858 INFO L87 Difference]: Start difference. First operand 690 states and 927 transitions. Second operand 99 states. [2018-04-10 15:51:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:03,060 INFO L93 Difference]: Finished difference Result 756 states and 1000 transitions. [2018-04-10 15:51:03,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 15:51:03,060 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 243 [2018-04-10 15:51:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:03,062 INFO L225 Difference]: With dead ends: 756 [2018-04-10 15:51:03,062 INFO L226 Difference]: Without dead ends: 756 [2018-04-10 15:51:03,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4511 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:51:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-10 15:51:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 704. [2018-04-10 15:51:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-04-10 15:51:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 946 transitions. [2018-04-10 15:51:03,067 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 946 transitions. Word has length 243 [2018-04-10 15:51:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:03,067 INFO L459 AbstractCegarLoop]: Abstraction has 704 states and 946 transitions. [2018-04-10 15:51:03,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-10 15:51:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 946 transitions. [2018-04-10 15:51:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-04-10 15:51:03,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:03,068 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:03,068 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash 282164157, now seen corresponding path program 48 times [2018-04-10 15:51:03,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:03,068 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:03,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:03,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:03,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:03,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:03,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:03,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:03,711 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:51:03,803 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-10 15:51:03,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:03,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:04,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:04,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50] total 100 [2018-04-10 15:51:04,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-10 15:51:04,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-10 15:51:04,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1850, Invalid=8250, Unknown=0, NotChecked=0, Total=10100 [2018-04-10 15:51:04,764 INFO L87 Difference]: Start difference. First operand 704 states and 946 transitions. Second operand 101 states. [2018-04-10 15:51:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:15,741 INFO L93 Difference]: Finished difference Result 771 states and 1020 transitions. [2018-04-10 15:51:15,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 15:51:15,766 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 248 [2018-04-10 15:51:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:15,768 INFO L225 Difference]: With dead ends: 771 [2018-04-10 15:51:15,768 INFO L226 Difference]: Without dead ends: 771 [2018-04-10 15:51:15,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1850, Invalid=8250, Unknown=0, NotChecked=0, Total=10100 [2018-04-10 15:51:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-04-10 15:51:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 718. [2018-04-10 15:51:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-04-10 15:51:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 965 transitions. [2018-04-10 15:51:15,774 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 965 transitions. Word has length 248 [2018-04-10 15:51:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:15,774 INFO L459 AbstractCegarLoop]: Abstraction has 718 states and 965 transitions. [2018-04-10 15:51:15,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-10 15:51:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 965 transitions. [2018-04-10 15:51:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-04-10 15:51:15,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:15,775 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:15,775 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -198635178, now seen corresponding path program 49 times [2018-04-10 15:51:15,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:15,776 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:15,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:15,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:15,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:15,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:16,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:16,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:16,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:16,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:16,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:16,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-04-10 15:51:16,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:51:16,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:51:16,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:51:16,556 INFO L87 Difference]: Start difference. First operand 718 states and 965 transitions. Second operand 53 states. [2018-04-10 15:51:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:18,571 INFO L93 Difference]: Finished difference Result 786 states and 1040 transitions. [2018-04-10 15:51:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 15:51:18,571 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-04-10 15:51:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:18,573 INFO L225 Difference]: With dead ends: 786 [2018-04-10 15:51:18,573 INFO L226 Difference]: Without dead ends: 786 [2018-04-10 15:51:18,573 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 253 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-10 15:51:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-04-10 15:51:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 732. [2018-04-10 15:51:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-04-10 15:51:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 984 transitions. [2018-04-10 15:51:18,580 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 984 transitions. Word has length 253 [2018-04-10 15:51:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:18,580 INFO L459 AbstractCegarLoop]: Abstraction has 732 states and 984 transitions. [2018-04-10 15:51:18,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:51:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 984 transitions. [2018-04-10 15:51:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-04-10 15:51:18,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:18,582 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:18,582 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:18,583 INFO L82 PathProgramCache]: Analyzing trace with hash -698608803, now seen corresponding path program 50 times [2018-04-10 15:51:18,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:18,583 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:18,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:18,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:18,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:18,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:19,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:19,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:19,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:51:19,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:51:19,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:19,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:19,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:19,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-04-10 15:51:19,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 15:51:19,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 15:51:19,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:51:19,487 INFO L87 Difference]: Start difference. First operand 732 states and 984 transitions. Second operand 58 states. [2018-04-10 15:51:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:21,963 INFO L93 Difference]: Finished difference Result 801 states and 1060 transitions. [2018-04-10 15:51:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 15:51:21,963 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 258 [2018-04-10 15:51:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:21,964 INFO L225 Difference]: With dead ends: 801 [2018-04-10 15:51:21,964 INFO L226 Difference]: Without dead ends: 801 [2018-04-10 15:51:21,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-04-10 15:51:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-04-10 15:51:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 746. [2018-04-10 15:51:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-04-10 15:51:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1003 transitions. [2018-04-10 15:51:21,970 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1003 transitions. Word has length 258 [2018-04-10 15:51:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:21,971 INFO L459 AbstractCegarLoop]: Abstraction has 746 states and 1003 transitions. [2018-04-10 15:51:21,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 15:51:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1003 transitions. [2018-04-10 15:51:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-04-10 15:51:21,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:21,973 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:21,973 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash -777241162, now seen corresponding path program 51 times [2018-04-10 15:51:21,973 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:21,973 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:21,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:21,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:21,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:21,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:22,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:22,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:22,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:51:22,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-10 15:51:22,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:22,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:23,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:23,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 106 [2018-04-10 15:51:23,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-10 15:51:23,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-10 15:51:23,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-04-10 15:51:23,520 INFO L87 Difference]: Start difference. First operand 746 states and 1003 transitions. Second operand 107 states. Received shutdown request... [2018-04-10 15:51:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 15:51:28,977 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 15:51:28,980 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 15:51:28,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:51:28 BoogieIcfgContainer [2018-04-10 15:51:28,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 15:51:28,981 INFO L168 Benchmark]: Toolchain (without parser) took 170166.63 ms. Allocated memory was 389.0 MB in the beginning and 1.1 GB in the end (delta: 662.7 MB). Free memory was 328.8 MB in the beginning and 423.2 MB in the end (delta: -94.4 MB). Peak memory consumption was 568.3 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:28,982 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 389.0 MB. Free memory is still 347.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:51:28,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.99 ms. Allocated memory is still 389.0 MB. Free memory was 328.8 MB in the beginning and 319.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:28,982 INFO L168 Benchmark]: Boogie Preprocessor took 20.80 ms. Allocated memory is still 389.0 MB. Free memory was 319.0 MB in the beginning and 316.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:28,982 INFO L168 Benchmark]: RCFGBuilder took 251.51 ms. Allocated memory was 389.0 MB in the beginning and 583.5 MB in the end (delta: 194.5 MB). Free memory was 316.3 MB in the beginning and 545.4 MB in the end (delta: -229.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:28,982 INFO L168 Benchmark]: TraceAbstraction took 169724.53 ms. Allocated memory was 583.5 MB in the beginning and 1.1 GB in the end (delta: 468.2 MB). Free memory was 543.7 MB in the beginning and 423.2 MB in the end (delta: 120.5 MB). Peak memory consumption was 588.7 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:28,983 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.17 ms. Allocated memory is still 389.0 MB. Free memory is still 347.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.99 ms. Allocated memory is still 389.0 MB. Free memory was 328.8 MB in the beginning and 319.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.80 ms. Allocated memory is still 389.0 MB. Free memory was 319.0 MB in the beginning and 316.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.51 ms. Allocated memory was 389.0 MB in the beginning and 583.5 MB in the end (delta: 194.5 MB). Free memory was 316.3 MB in the beginning and 545.4 MB in the end (delta: -229.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 169724.53 ms. Allocated memory was 583.5 MB in the beginning and 1.1 GB in the end (delta: 468.2 MB). Free memory was 543.7 MB in the beginning and 423.2 MB in the end (delta: 120.5 MB). Peak memory consumption was 588.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 40 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (569 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 40 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (569 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 40 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (569 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 40 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (569 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 4 error locations. TIMEOUT Result, 169.6s OverallTime, 52 OverallIterations, 52 TraceHistogramMax, 138.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7999 SDtfs, 53012 SDslu, 161002 SDs, 0 SdLazy, 518053 SolverSat, 18151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 102.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9035 GetRequests, 6243 SyntacticMatches, 4 SemanticMatches, 2788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61312 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=746occurred in iteration=51, 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.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 1530 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 14084 NumberOfCodeBlocks, 14084 NumberOfCodeBlocksAsserted, 787 NumberOfCheckSat, 13981 ConstructedInterpolants, 0 QuantifiedInterpolants, 8717797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10251 ConjunctsInSsa, 2247 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 0/228956 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-51-28-987.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_15-51-28-987.csv Completed graceful shutdown