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/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:48:39,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:48:39,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:48:39,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:48:39,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:48:39,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:48:39,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:48:39,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:48:39,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:48:39,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:48:39,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:48:39,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:48:39,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:48:39,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:48:39,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:48:39,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:48:39,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:48:39,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:48:39,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:48:39,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:48:39,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:48:39,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:48:39,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:48:39,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:48:39,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:48:39,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:48:39,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:48:39,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:48:39,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:48:39,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:48:39,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:48:39,366 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:39,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:48:39,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:48:39,384 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:48:39,384 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:48:39,384 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:48:39,384 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:48:39,384 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:48:39,384 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:48:39,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:48:39,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:48:39,386 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:48:39,386 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:48:39,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:48:39,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:48:39,386 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 15:48:39,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 15:48:39,386 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 15:48:39,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:48:39,425 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:48:39,428 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:48:39,429 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:48:39,430 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:48:39,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-04-10 15:48:39,460 ERROR L339 mateJobChangeAdapter]: Error during toolchain job processing: java.io.FileNotFoundException: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/.metadata/.plugins/org.eclipse.core.resources/.projects/FLAGfd04a7ec5/.markers.snap (No such file or directory) at java.io.FileOutputStream.open0(Native Method) at java.io.FileOutputStream.open(FileOutputStream.java:270) at java.io.FileOutputStream.(FileOutputStream.java:213) at java.io.FileOutputStream.(FileOutputStream.java:133) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:45) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:41) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1769) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1853) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1222) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1163) at org.eclipse.core.internal.resources.DelayedSnapshotJob.run(DelayedSnapshotJob.java:52) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-10 15:48:39,768 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfdb95b319 [2018-04-10 15:48:39,865 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:48:39,865 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:48:39,865 INFO L168 CDTParser]: Scanning standard_strcpy_false-valid-deref_ground.i [2018-04-10 15:48:39,866 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:48:39,866 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:48:39,866 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:48:39,866 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_false-valid-deref_ground.i [2018-04-10 15:48:39,866 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_false-valid-deref_ground.i [2018-04-10 15:48:39,866 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:48:39,867 INFO L233 ultiparseSymbolTable]: [2018-04-10 15:48:39,880 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfdb95b319 [2018-04-10 15:48:39,883 ERROR L339 mateJobChangeAdapter]: Error during toolchain job processing: java.io.FileNotFoundException: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/.metadata/.plugins/org.eclipse.core.resources/.projects/FLAGfd04a7ec5/.markers.snap (No such file or directory) at java.io.FileOutputStream.open0(Native Method) at java.io.FileOutputStream.open(FileOutputStream.java:270) at java.io.FileOutputStream.(FileOutputStream.java:213) at java.io.FileOutputStream.(FileOutputStream.java:133) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:45) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:41) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1769) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1853) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1222) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1163) at org.eclipse.core.internal.resources.DelayedSnapshotJob.run(DelayedSnapshotJob.java:52) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-10 15:48:39,884 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:48:39,885 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:48:39,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:48:39,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:48:39,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:48:39,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:48:39" (1/1) ... [2018-04-10 15:48:39,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bd79d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:39, skipping insertion in model container [2018-04-10 15:48:39,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:48:39" (1/1) ... [2018-04-10 15:48:39,905 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:48:39,914 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:48:40,013 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:48:40,027 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:48:40,030 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-10 15:48:40,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:40 WrapperNode [2018-04-10 15:48:40,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:48:40,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:48:40,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:48:40,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:48:40,045 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:40" (1/1) ... [2018-04-10 15:48:40,045 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:40" (1/1) ... [2018-04-10 15:48:40,049 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:40" (1/1) ... [2018-04-10 15:48:40,050 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:40" (1/1) ... [2018-04-10 15:48:40,050 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:40" (1/1) ... [2018-04-10 15:48:40,055 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:40" (1/1) ... [2018-04-10 15:48:40,056 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:40" (1/1) ... [2018-04-10 15:48:40,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:48:40,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:48:40,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:48:40,057 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:48:40,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:40" (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:40,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:48:40,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:48:40,113 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-10 15:48:40,114 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:48:40,114 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:48:40,114 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-10 15:48:40,114 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:48:40,114 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:48:40,114 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:48:40,273 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:48:40,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:48:40 BoogieIcfgContainer [2018-04-10 15:48:40,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:48:40,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:48:40,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:48:40,276 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:48:40,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:48:39" (1/3) ... [2018-04-10 15:48:40,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b4fa91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:48:40, skipping insertion in model container [2018-04-10 15:48:40,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:48:40" (2/3) ... [2018-04-10 15:48:40,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b4fa91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:48:40, skipping insertion in model container [2018-04-10 15:48:40,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:48:40" (3/3) ... [2018-04-10 15:48:40,279 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-04-10 15:48:40,285 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:48:40,290 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-04-10 15:48:40,317 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:48:40,317 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:48:40,317 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:48:40,317 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 15:48:40,317 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 15:48:40,318 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:48:40,318 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:48:40,318 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:48:40,318 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:48:40,319 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:48:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-04-10 15:48:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 15:48:40,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,339 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,340 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash -42208474, now seen corresponding path program 1 times [2018-04-10 15:48:40,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,346 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:40,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,403 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,450 INFO 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:40,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:48:40,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:48:40,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:48:40,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:48:40,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:48:40,468 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-04-10 15:48:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,512 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-10 15:48:40,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:48:40,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 15:48:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:40,519 INFO L225 Difference]: With dead ends: 49 [2018-04-10 15:48:40,519 INFO L226 Difference]: Without dead ends: 40 [2018-04-10 15:48:40,521 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:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-10 15:48:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-04-10 15:48:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-10 15:48:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-04-10 15:48:40,548 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-04-10 15:48:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:40,549 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-04-10 15:48:40,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:48:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-04-10 15:48:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 15:48:40,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,549 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,549 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash 619915766, now seen corresponding path program 1 times [2018-04-10 15:48:40,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,550 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:40,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,561 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,593 INFO 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:40,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:48:40,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:48:40,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:48:40,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:48:40,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:48:40,596 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-04-10 15:48:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,629 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-04-10 15:48:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:48:40,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 15:48:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:40,630 INFO L225 Difference]: With dead ends: 34 [2018-04-10 15:48:40,630 INFO L226 Difference]: Without dead ends: 31 [2018-04-10 15:48:40,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:48:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-10 15:48:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-10 15:48:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-10 15:48:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-10 15:48:40,635 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 12 [2018-04-10 15:48:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:40,635 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-10 15:48:40,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:48:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-10 15:48:40,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 15:48:40,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,636 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,636 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,636 INFO L82 PathProgramCache]: Analyzing trace with hash 621575575, now seen corresponding path program 1 times [2018-04-10 15:48:40,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,637 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:40,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,643 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,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:40,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:40,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:40,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-04-10 15:48:40,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:48:40,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:48:40,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:48:40,716 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 4 states. [2018-04-10 15:48:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,757 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-04-10 15:48:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:48:40,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 15:48:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:40,758 INFO L225 Difference]: With dead ends: 45 [2018-04-10 15:48:40,758 INFO L226 Difference]: Without dead ends: 45 [2018-04-10 15:48:40,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:48:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-10 15:48:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-04-10 15:48:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-10 15:48:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-10 15:48:40,763 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-04-10 15:48:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:40,763 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-10 15:48:40,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:48:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-10 15:48:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 15:48:40,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,764 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,765 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1962704421, now seen corresponding path program 1 times [2018-04-10 15:48:40,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,765 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:40,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,771 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,817 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:40,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:40,817 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:40,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 15:48:40,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:48:40,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2018-04-10 15:48:40,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:48:40,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:48:40,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:48:40,830 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 6 states. [2018-04-10 15:48:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,884 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-04-10 15:48:40,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:48:40,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-10 15:48:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:40,885 INFO L225 Difference]: With dead ends: 57 [2018-04-10 15:48:40,885 INFO L226 Difference]: Without dead ends: 57 [2018-04-10 15:48:40,886 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:48:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-10 15:48:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2018-04-10 15:48:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-10 15:48:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-04-10 15:48:40,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-04-10 15:48:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:40,891 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-04-10 15:48:40,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:48:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-04-10 15:48:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 15:48:40,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:40,892 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:40,892 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1964364230, now seen corresponding path program 2 times [2018-04-10 15:48:40,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:40,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:40,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:40,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:40,899 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,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:40,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:40,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:40,937 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:40,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:40,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:40,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:40,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-04-10 15:48:40,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:48:40,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:48:40,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:48:40,962 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 5 states. [2018-04-10 15:48:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:40,998 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-10 15:48:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:48:40,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 15:48:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,000 INFO L225 Difference]: With dead ends: 71 [2018-04-10 15:48:41,000 INFO L226 Difference]: Without dead ends: 71 [2018-04-10 15:48:41,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:48:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-10 15:48:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-04-10 15:48:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-10 15:48:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-04-10 15:48:41,007 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-04-10 15:48:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,007 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-04-10 15:48:41,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:48:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-04-10 15:48:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 15:48:41,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,008 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,008 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1777648375, now seen corresponding path program 3 times [2018-04-10 15:48:41,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,009 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:41,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:41,062 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 15:48:41,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:41,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-10 15:48:41,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:48:41,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:48:41,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:48:41,073 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-04-10 15:48:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:41,138 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-04-10 15:48:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:48:41,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-10 15:48:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,139 INFO L225 Difference]: With dead ends: 89 [2018-04-10 15:48:41,139 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 15:48:41,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:48:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 15:48:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-04-10 15:48:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 15:48:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-10 15:48:41,142 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-04-10 15:48:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,144 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-10 15:48:41,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:48:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-10 15:48:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 15:48:41,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,145 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,145 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,146 INFO L82 PathProgramCache]: Analyzing trace with hash -788155134, now seen corresponding path program 1 times [2018-04-10 15:48:41,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,146 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:41,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,157 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,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-04-10 15:48:41,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:48:41,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:48:41,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:48:41,228 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2018-04-10 15:48:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:41,274 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-10 15:48:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:48:41,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-04-10 15:48:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,275 INFO L225 Difference]: With dead ends: 59 [2018-04-10 15:48:41,275 INFO L226 Difference]: Without dead ends: 50 [2018-04-10 15:48:41,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:48:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-10 15:48:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-10 15:48:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 15:48:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-04-10 15:48:41,278 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-04-10 15:48:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,278 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-04-10 15:48:41,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:48:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-04-10 15:48:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 15:48:41,278 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,278 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,279 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1667360870, now seen corresponding path program 4 times [2018-04-10 15:48:41,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,279 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:41,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:41,343 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:41,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:41,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-10 15:48:41,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:48:41,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:48:41,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:48:41,356 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-04-10 15:48:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:41,450 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-04-10 15:48:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:48:41,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-10 15:48:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,451 INFO L225 Difference]: With dead ends: 94 [2018-04-10 15:48:41,451 INFO L226 Difference]: Without dead ends: 94 [2018-04-10 15:48:41,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:48:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-10 15:48:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-04-10 15:48:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-10 15:48:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-04-10 15:48:41,456 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-04-10 15:48:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,456 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-04-10 15:48:41,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:48:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-04-10 15:48:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:48:41,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,457 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,457 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1804493581, now seen corresponding path program 2 times [2018-04-10 15:48:41,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,458 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:41,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,465 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,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:48:41,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:41,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:41,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:41,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 15:48:41,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-10 15:48:41,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:48:41,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:48:41,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:48:41,513 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-04-10 15:48:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:41,554 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-10 15:48:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:48:41,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-10 15:48:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,555 INFO L225 Difference]: With dead ends: 55 [2018-04-10 15:48:41,555 INFO L226 Difference]: Without dead ends: 38 [2018-04-10 15:48:41,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:48:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-10 15:48:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-04-10 15:48:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-10 15:48:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-04-10 15:48:41,558 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-04-10 15:48:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,558 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-04-10 15:48:41,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:48:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-04-10 15:48:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:48:41,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,559 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,559 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash 651022423, now seen corresponding path program 5 times [2018-04-10 15:48:41,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:41,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,568 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,625 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,626 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:41,636 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-10 15:48:41,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:41,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-04-10 15:48:41,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 15:48:41,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 15:48:41,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:48:41,700 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-04-10 15:48:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:41,808 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-04-10 15:48:41,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:48:41,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-10 15:48:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:41,809 INFO L225 Difference]: With dead ends: 43 [2018-04-10 15:48:41,809 INFO L226 Difference]: Without dead ends: 43 [2018-04-10 15:48:41,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:48:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-10 15:48:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-10 15:48:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-10 15:48:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-04-10 15:48:41,812 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-04-10 15:48:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:41,813 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-04-10 15:48:41,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 15:48:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-04-10 15:48:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 15:48:41,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:41,814 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:41,814 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1728432378, now seen corresponding path program 6 times [2018-04-10 15:48:41,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:41,814 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:41,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:41,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:41,823 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,889 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:41,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:41,890 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:41,900 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-10 15:48:41,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:41,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:41,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:41,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-10 15:48:41,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:48:41,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:48:41,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:48:41,937 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-04-10 15:48:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:42,030 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-04-10 15:48:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:48:42,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-04-10 15:48:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:42,031 INFO L225 Difference]: With dead ends: 48 [2018-04-10 15:48:42,031 INFO L226 Difference]: Without dead ends: 48 [2018-04-10 15:48:42,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:48:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-10 15:48:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-10 15:48:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-10 15:48:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-04-10 15:48:42,033 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-04-10 15:48:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:42,033 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-04-10 15:48:42,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:48:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-04-10 15:48:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 15:48:42,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:42,034 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:42,034 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash -616716873, now seen corresponding path program 7 times [2018-04-10 15:48:42,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:42,034 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:42,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:42,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:42,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:42,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:42,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:42,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:42,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-10 15:48:42,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:48:42,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:48:42,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:48:42,115 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-04-10 15:48:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:42,190 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-10 15:48:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:48:42,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-10 15:48:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:42,191 INFO L225 Difference]: With dead ends: 53 [2018-04-10 15:48:42,191 INFO L226 Difference]: Without dead ends: 53 [2018-04-10 15:48:42,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:48:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-10 15:48:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-10 15:48:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-10 15:48:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-04-10 15:48:42,193 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-04-10 15:48:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:42,194 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-04-10 15:48:42,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:48:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-04-10 15:48:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 15:48:42,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:42,195 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:42,195 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1845018022, now seen corresponding path program 8 times [2018-04-10 15:48:42,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:42,196 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:42,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:42,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:42,204 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,287 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:42,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:42,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:42,295 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:42,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:42,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:42,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-10 15:48:42,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:48:42,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:48:42,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:48:42,314 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-04-10 15:48:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:42,423 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-04-10 15:48:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:48:42,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-10 15:48:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:42,423 INFO L225 Difference]: With dead ends: 58 [2018-04-10 15:48:42,424 INFO L226 Difference]: Without dead ends: 58 [2018-04-10 15:48:42,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:48:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-10 15:48:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-10 15:48:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-10 15:48:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-04-10 15:48:42,426 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-04-10 15:48:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:42,427 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-04-10 15:48:42,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:48:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-04-10 15:48:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 15:48:42,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:42,428 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:42,428 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 795493143, now seen corresponding path program 9 times [2018-04-10 15:48:42,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:42,428 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:42,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:42,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:42,436 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,527 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:42,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:42,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:42,537 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-10 15:48:42,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:42,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:42,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-10 15:48:42,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:48:42,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:48:42,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:48:42,617 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 23 states. [2018-04-10 15:48:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:42,849 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-04-10 15:48:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:48:42,850 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-10 15:48:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:42,850 INFO L225 Difference]: With dead ends: 63 [2018-04-10 15:48:42,850 INFO L226 Difference]: Without dead ends: 63 [2018-04-10 15:48:42,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:48:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-04-10 15:48:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-04-10 15:48:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-10 15:48:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-04-10 15:48:42,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-04-10 15:48:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:42,853 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-04-10 15:48:42,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:48:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-04-10 15:48:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 15:48:42,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:42,855 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:42,855 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1643609158, now seen corresponding path program 10 times [2018-04-10 15:48:42,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:42,855 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:42,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:42,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:42,862 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,935 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:42,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:42,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:42,943 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:42,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:42,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:42,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:42,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-04-10 15:48:42,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 15:48:42,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 15:48:42,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:48:42,957 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-04-10 15:48:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:43,153 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-04-10 15:48:43,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:48:43,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-10 15:48:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:43,154 INFO L225 Difference]: With dead ends: 68 [2018-04-10 15:48:43,154 INFO L226 Difference]: Without dead ends: 68 [2018-04-10 15:48:43,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:48:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-10 15:48:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-10 15:48:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-10 15:48:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-04-10 15:48:43,157 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-04-10 15:48:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:43,158 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-04-10 15:48:43,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 15:48:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-04-10 15:48:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 15:48:43,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:43,159 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:43,159 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1408870519, now seen corresponding path program 11 times [2018-04-10 15:48:43,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:43,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:43,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:43,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:43,166 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,273 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:43,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:43,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:43,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:43,292 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-10 15:48:43,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:43,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:43,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:43,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-04-10 15:48:43,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:48:43,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:48:43,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:48:43,418 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-04-10 15:48:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:43,783 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-04-10 15:48:43,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:48:43,783 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-04-10 15:48:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:43,784 INFO L225 Difference]: With dead ends: 73 [2018-04-10 15:48:43,784 INFO L226 Difference]: Without dead ends: 73 [2018-04-10 15:48:43,785 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 15:48:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-10 15:48:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-10 15:48:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-10 15:48:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-04-10 15:48:43,787 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-04-10 15:48:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:43,788 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-04-10 15:48:43,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:48:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-04-10 15:48:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 15:48:43,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:43,789 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:43,789 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1139772698, now seen corresponding path program 12 times [2018-04-10 15:48:43,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:43,789 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:43,790 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:43,790 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:43,805 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,944 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:43,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:43,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:43,945 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:43,955 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-10 15:48:43,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:43,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:44,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:44,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-04-10 15:48:44,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:48:44,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:48:44,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:48:44,072 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 29 states. [2018-04-10 15:48:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:44,319 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-04-10 15:48:44,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 15:48:44,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-10 15:48:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:44,320 INFO L225 Difference]: With dead ends: 78 [2018-04-10 15:48:44,320 INFO L226 Difference]: Without dead ends: 78 [2018-04-10 15:48:44,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:48:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-10 15:48:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-10 15:48:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-10 15:48:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-04-10 15:48:44,322 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-04-10 15:48:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:44,322 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-04-10 15:48:44,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:48:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-04-10 15:48:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 15:48:44,322 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:44,323 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:44,323 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1645336023, now seen corresponding path program 13 times [2018-04-10 15:48:44,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:44,323 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:44,323 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:44,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:44,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:44,330 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:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:44,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:44,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:44,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:44,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:44,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:44,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-04-10 15:48:44,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:48:44,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:48:44,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:48:44,494 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-04-10 15:48:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:44,682 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-04-10 15:48:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:48:44,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-10 15:48:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:44,683 INFO L225 Difference]: With dead ends: 83 [2018-04-10 15:48:44,683 INFO L226 Difference]: Without dead ends: 83 [2018-04-10 15:48:44,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 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:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-10 15:48:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-10 15:48:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-10 15:48:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-04-10 15:48:44,685 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-04-10 15:48:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:44,685 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-04-10 15:48:44,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:48:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-04-10 15:48:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 15:48:44,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:44,685 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:44,685 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 719167878, now seen corresponding path program 14 times [2018-04-10 15:48:44,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:44,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:44,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:44,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:44,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:44,692 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:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:44,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:44,790 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:44,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:44,803 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:44,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:44,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:44,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:44,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-04-10 15:48:44,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:48:44,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:48:44,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:48:44,820 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-04-10 15:48:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:45,025 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-04-10 15:48:45,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 15:48:45,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-10 15:48:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:45,026 INFO L225 Difference]: With dead ends: 88 [2018-04-10 15:48:45,026 INFO L226 Difference]: Without dead ends: 88 [2018-04-10 15:48:45,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:48:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-10 15:48:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-10 15:48:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-10 15:48:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-04-10 15:48:45,028 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-04-10 15:48:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:45,028 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-04-10 15:48:45,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:48:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-04-10 15:48:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 15:48:45,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:45,028 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:45,028 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1151808713, now seen corresponding path program 15 times [2018-04-10 15:48:45,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:45,029 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:45,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:45,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:45,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:45,036 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,190 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:45,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:45,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:45,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:45,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-10 15:48:45,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:45,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:45,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:45,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-10 15:48:45,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:48:45,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:48:45,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:48:45,303 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 35 states. [2018-04-10 15:48:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:45,640 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-04-10 15:48:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:48:45,640 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-04-10 15:48:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:45,641 INFO L225 Difference]: With dead ends: 93 [2018-04-10 15:48:45,641 INFO L226 Difference]: Without dead ends: 93 [2018-04-10 15:48:45,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 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:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-10 15:48:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-04-10 15:48:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-10 15:48:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-04-10 15:48:45,643 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-04-10 15:48:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:45,643 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-04-10 15:48:45,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:48:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-04-10 15:48:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 15:48:45,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:45,643 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:45,644 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1685653542, now seen corresponding path program 16 times [2018-04-10 15:48:45,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:45,644 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:45,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:45,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:45,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:45,649 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,816 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:45,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:45,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:45,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:45,823 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:45,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:45,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:45,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:45,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-04-10 15:48:45,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:48:45,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:48:45,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:48:45,841 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-04-10 15:48:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:46,215 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-04-10 15:48:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 15:48:46,215 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-10 15:48:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:46,216 INFO L225 Difference]: With dead ends: 98 [2018-04-10 15:48:46,216 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 15:48:46,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:48:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 15:48:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-04-10 15:48:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-10 15:48:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-04-10 15:48:46,218 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-04-10 15:48:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:46,219 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-04-10 15:48:46,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:48:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-04-10 15:48:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-10 15:48:46,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:46,220 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:46,220 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1777633431, now seen corresponding path program 17 times [2018-04-10 15:48:46,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:46,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:46,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:46,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:46,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:46,228 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,347 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:46,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:46,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:46,348 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:46,359 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-10 15:48:46,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:46,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:46,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:46,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-04-10 15:48:46,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:48:46,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:48:46,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:48:46,525 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 37 states. [2018-04-10 15:48:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:47,102 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-04-10 15:48:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 15:48:47,104 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 92 [2018-04-10 15:48:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:47,104 INFO L225 Difference]: With dead ends: 103 [2018-04-10 15:48:47,104 INFO L226 Difference]: Without dead ends: 103 [2018-04-10 15:48:47,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 15:48:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-10 15:48:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-10 15:48:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-10 15:48:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-04-10 15:48:47,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-04-10 15:48:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:47,107 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-04-10 15:48:47,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:48:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-04-10 15:48:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-10 15:48:47,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:47,109 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:47,109 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash -964909370, now seen corresponding path program 18 times [2018-04-10 15:48:47,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:47,109 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:47,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:47,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:47,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:47,117 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,339 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:47,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:47,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:47,340 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:47,354 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-10 15:48:47,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:47,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:47,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:47,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-10 15:48:47,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:48:47,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:48:47,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:48:47,582 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 41 states. [2018-04-10 15:48:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:47,970 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-04-10 15:48:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:48:47,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-04-10 15:48:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:47,971 INFO L225 Difference]: With dead ends: 108 [2018-04-10 15:48:47,971 INFO L226 Difference]: Without dead ends: 108 [2018-04-10 15:48:47,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 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:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-10 15:48:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-10 15:48:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-10 15:48:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-04-10 15:48:47,973 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-04-10 15:48:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:47,973 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-04-10 15:48:47,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:48:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-04-10 15:48:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-10 15:48:47,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:47,974 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:47,974 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2138370569, now seen corresponding path program 19 times [2018-04-10 15:48:47,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:47,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:47,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:47,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:47,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:47,980 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:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:48,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:48,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:48,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:48,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:48,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:48,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-04-10 15:48:48,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:48:48,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:48:48,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:48:48,154 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-04-10 15:48:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:48,458 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-04-10 15:48:48,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:48:48,459 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-10 15:48:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:48,459 INFO L225 Difference]: With dead ends: 113 [2018-04-10 15:48:48,459 INFO L226 Difference]: Without dead ends: 113 [2018-04-10 15:48:48,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 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:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-10 15:48:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-04-10 15:48:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-10 15:48:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-04-10 15:48:48,462 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-04-10 15:48:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:48,463 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-04-10 15:48:48,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:48:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-04-10 15:48:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-10 15:48:48,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:48,463 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:48,463 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash -167608986, now seen corresponding path program 20 times [2018-04-10 15:48:48,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:48,464 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:48,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:48,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:48,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:48,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:48,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:48,693 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:48,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:48,701 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:48,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:48,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:48,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:48,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-04-10 15:48:48,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 15:48:48,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 15:48:48,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:48:48,724 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-04-10 15:48:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:49,018 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-04-10 15:48:49,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:48:49,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-10 15:48:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:49,019 INFO L225 Difference]: With dead ends: 118 [2018-04-10 15:48:49,019 INFO L226 Difference]: Without dead ends: 118 [2018-04-10 15:48:49,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:48:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-10 15:48:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-04-10 15:48:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 15:48:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-04-10 15:48:49,021 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-04-10 15:48:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:49,021 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-04-10 15:48:49,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 15:48:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-04-10 15:48:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-10 15:48:49,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:49,022 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:49,022 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2051169111, now seen corresponding path program 21 times [2018-04-10 15:48:49,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:49,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:49,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:49,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:49,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:49,027 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,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:49,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:49,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:49,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:49,287 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-10 15:48:49,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:49,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:49,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:49,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-04-10 15:48:49,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:48:49,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:48:49,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:48:49,308 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-04-10 15:48:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:49,616 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-04-10 15:48:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 15:48:49,616 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-10 15:48:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:49,617 INFO L225 Difference]: With dead ends: 123 [2018-04-10 15:48:49,617 INFO L226 Difference]: Without dead ends: 123 [2018-04-10 15:48:49,617 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:48:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-10 15:48:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-10 15:48:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 15:48:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-04-10 15:48:49,619 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-04-10 15:48:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:49,619 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-04-10 15:48:49,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:48:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-04-10 15:48:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-10 15:48:49,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:49,620 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:49,620 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2141490182, now seen corresponding path program 22 times [2018-04-10 15:48:49,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:49,620 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:49,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:49,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:49,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:49,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:48:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:49,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:49,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:49,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:49,819 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:49,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:49,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:49,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:49,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-04-10 15:48:49,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:48:49,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:48:49,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:48:49,844 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-04-10 15:48:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:50,235 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-04-10 15:48:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:48:50,235 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-10 15:48:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:50,236 INFO L225 Difference]: With dead ends: 128 [2018-04-10 15:48:50,236 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 15:48:50,236 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 15:48:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 15:48:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-10 15:48:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 15:48:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-04-10 15:48:50,238 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-04-10 15:48:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:50,238 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-04-10 15:48:50,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:48:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-04-10 15:48:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-10 15:48:50,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:50,238 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:50,239 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1698664265, now seen corresponding path program 23 times [2018-04-10 15:48:50,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:50,239 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:50,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:50,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:50,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:50,245 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:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:50,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:50,453 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:50,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:50,463 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-10 15:48:50,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:50,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:50,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:50,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-04-10 15:48:50,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:48:50,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:48:50,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=1729, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:48:50,720 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2018-04-10 15:48:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:51,578 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-04-10 15:48:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 15:48:51,579 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 122 [2018-04-10 15:48:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:51,579 INFO L225 Difference]: With dead ends: 133 [2018-04-10 15:48:51,579 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 15:48:51,580 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1033, Invalid=4079, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:48:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 15:48:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-04-10 15:48:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 15:48:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-04-10 15:48:51,582 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-04-10 15:48:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:51,582 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-04-10 15:48:51,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:48:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-04-10 15:48:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-10 15:48:51,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:51,583 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:51,583 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2004669094, now seen corresponding path program 24 times [2018-04-10 15:48:51,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:51,583 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:51,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:51,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:51,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:51,591 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,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:51,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:51,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:51,811 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-10 15:48:51,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:51,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:52,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:52,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-04-10 15:48:52,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:48:52,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:48:52,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:48:52,010 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 37 states. [2018-04-10 15:48:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:52,598 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-04-10 15:48:52,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:48:52,598 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-04-10 15:48:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:52,599 INFO L225 Difference]: With dead ends: 138 [2018-04-10 15:48:52,599 INFO L226 Difference]: Without dead ends: 138 [2018-04-10 15:48:52,600 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:48:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-10 15:48:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-04-10 15:48:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-10 15:48:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-04-10 15:48:52,602 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-04-10 15:48:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:52,603 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-04-10 15:48:52,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:48:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-04-10 15:48:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-10 15:48:52,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:52,604 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:52,604 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460887, now seen corresponding path program 25 times [2018-04-10 15:48:52,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:52,604 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:52,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:52,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:52,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:52,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:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:52,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:52,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:52,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:52,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:52,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-04-10 15:48:52,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:48:52,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:48:52,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:48:52,854 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-04-10 15:48:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:53,189 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-04-10 15:48:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:48:53,189 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-10 15:48:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:53,190 INFO L225 Difference]: With dead ends: 143 [2018-04-10 15:48:53,190 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 15:48:53,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 15:48:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 15:48:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-04-10 15:48:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-10 15:48:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-04-10 15:48:53,193 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-04-10 15:48:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:53,193 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-04-10 15:48:53,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:48:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-04-10 15:48:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 15:48:53,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:53,194 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:53,194 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:53,195 INFO L82 PathProgramCache]: Analyzing trace with hash 421876038, now seen corresponding path program 26 times [2018-04-10 15:48:53,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:53,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:53,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:53,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:53,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:53,201 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,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:53,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:53,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:53,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:48:53,501 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:48:53,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:53,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:53,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:53,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-04-10 15:48:53,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:48:53,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:48:53,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:48:53,529 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-04-10 15:48:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:53,919 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-04-10 15:48:53,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 15:48:53,919 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-10 15:48:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:53,920 INFO L225 Difference]: With dead ends: 148 [2018-04-10 15:48:53,920 INFO L226 Difference]: Without dead ends: 148 [2018-04-10 15:48:53,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 15:48:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-10 15:48:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-04-10 15:48:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-10 15:48:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-04-10 15:48:53,922 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-04-10 15:48:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:53,923 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-04-10 15:48:53,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 15:48:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-04-10 15:48:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-10 15:48:53,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:53,923 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:53,923 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1993804937, now seen corresponding path program 27 times [2018-04-10 15:48:53,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:53,924 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:53,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:53,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:53,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:53,929 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:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:54,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:54,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:54,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:48:54,246 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-10 15:48:54,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:54,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:54,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:54,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-04-10 15:48:54,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 15:48:54,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 15:48:54,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-10 15:48:54,274 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-04-10 15:48:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:54,668 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-04-10 15:48:54,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:48:54,668 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-10 15:48:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:54,668 INFO L225 Difference]: With dead ends: 153 [2018-04-10 15:48:54,668 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 15:48:54,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:48:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 15:48:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-10 15:48:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 15:48:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-04-10 15:48:54,671 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-04-10 15:48:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:54,671 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-04-10 15:48:54,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 15:48:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-04-10 15:48:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-10 15:48:54,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:54,672 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:54,672 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1740113894, now seen corresponding path program 28 times [2018-04-10 15:48:54,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:54,672 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:54,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:54,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:54,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:54,678 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:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:54,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:54,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:54,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:48:54,944 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:48:54,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:54,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:55,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:55,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-04-10 15:48:55,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 15:48:55,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 15:48:55,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:48:55,264 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 61 states. [2018-04-10 15:48:56,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:56,046 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-04-10 15:48:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 15:48:56,046 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-04-10 15:48:56,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:56,047 INFO L225 Difference]: With dead ends: 158 [2018-04-10 15:48:56,047 INFO L226 Difference]: Without dead ends: 158 [2018-04-10 15:48:56,048 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:48:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-10 15:48:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-04-10 15:48:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 15:48:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-04-10 15:48:56,051 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-04-10 15:48:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:56,051 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-04-10 15:48:56,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 15:48:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-04-10 15:48:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-10 15:48:56,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:56,052 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:56,052 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 685727959, now seen corresponding path program 29 times [2018-04-10 15:48:56,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:56,053 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:56,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:56,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:56,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:56,062 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,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:56,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:56,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:56,403 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:48:56,420 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-10 15:48:56,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:56,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:56,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:56,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-04-10 15:48:56,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 15:48:56,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 15:48:56,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=2701, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:48:56,748 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 61 states. [2018-04-10 15:48:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:58,110 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-04-10 15:48:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 15:48:58,110 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2018-04-10 15:48:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:58,111 INFO L225 Difference]: With dead ends: 163 [2018-04-10 15:48:58,111 INFO L226 Difference]: Without dead ends: 163 [2018-04-10 15:48:58,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2681 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1564, Invalid=6446, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 15:48:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-10 15:48:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-10 15:48:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-10 15:48:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-04-10 15:48:58,114 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-04-10 15:48:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:58,115 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-04-10 15:48:58,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 15:48:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-04-10 15:48:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-10 15:48:58,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:58,116 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:58,116 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash -842074490, now seen corresponding path program 30 times [2018-04-10 15:48:58,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:58,116 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:58,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:58,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:58,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:58,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:48:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:58,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:58,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:58,504 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:48:58,522 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-10 15:48:58,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:48:58,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:58,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:58,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-04-10 15:48:58,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:48:58,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:48:58,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:48:58,582 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 37 states. [2018-04-10 15:48:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:48:59,114 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-04-10 15:48:59,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 15:48:59,115 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-04-10 15:48:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:48:59,115 INFO L225 Difference]: With dead ends: 168 [2018-04-10 15:48:59,115 INFO L226 Difference]: Without dead ends: 168 [2018-04-10 15:48:59,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:48:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-10 15:48:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-10 15:48:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 15:48:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-04-10 15:48:59,119 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-04-10 15:48:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:48:59,119 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-04-10 15:48:59,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:48:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-04-10 15:48:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-10 15:48:59,120 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:48:59,120 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-10 15:48:59,120 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:48:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1391760951, now seen corresponding path program 31 times [2018-04-10 15:48:59,120 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:48:59,120 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:48:59,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:59,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:48:59,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:48:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:59,130 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:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:59,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:48:59,433 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:48:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:48:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:48:59,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:48:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:48:59,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:48:59,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-10 15:48:59,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:48:59,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:48:59,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:48:59,474 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-04-10 15:49:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:00,004 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-04-10 15:49:00,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 15:49:00,005 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-10 15:49:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:00,006 INFO L225 Difference]: With dead ends: 173 [2018-04-10 15:49:00,006 INFO L226 Difference]: Without dead ends: 173 [2018-04-10 15:49:00,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:49:00,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-10 15:49:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-04-10 15:49:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-10 15:49:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-04-10 15:49:00,009 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-04-10 15:49:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:00,009 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-04-10 15:49:00,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:49:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-04-10 15:49:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-10 15:49:00,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:00,010 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:00,010 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1115415258, now seen corresponding path program 32 times [2018-04-10 15:49:00,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:00,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:00,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:00,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:00,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:00,020 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,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:00,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:00,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:00,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:00,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:00,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:00,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:00,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:00,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-10 15:49:00,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:49:00,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:49:00,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:49:00,549 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-04-10 15:49:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:01,665 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-04-10 15:49:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:49:01,665 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-10 15:49:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:01,666 INFO L225 Difference]: With dead ends: 178 [2018-04-10 15:49:01,666 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 15:49:01,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:49:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 15:49:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-04-10 15:49:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-10 15:49:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-04-10 15:49:01,669 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-04-10 15:49:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:01,670 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-04-10 15:49:01,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:49:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-04-10 15:49:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 15:49:01,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:01,671 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:01,671 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash -712076393, now seen corresponding path program 33 times [2018-04-10 15:49:01,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:01,671 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:01,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:01,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:01,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:01,681 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:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:02,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:02,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:02,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:49:02,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-10 15:49:02,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:02,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:02,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:02,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-10 15:49:02,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:49:02,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:49:02,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:49:02,301 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-04-10 15:49:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:02,915 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-04-10 15:49:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 15:49:02,915 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-10 15:49:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:02,916 INFO L225 Difference]: With dead ends: 183 [2018-04-10 15:49:02,916 INFO L226 Difference]: Without dead ends: 183 [2018-04-10 15:49:02,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 15:49:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-10 15:49:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-10 15:49:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-10 15:49:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-04-10 15:49:02,918 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-04-10 15:49:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:02,918 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-04-10 15:49:02,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:49:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-04-10 15:49:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-10 15:49:02,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:02,918 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:02,918 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1349614534, now seen corresponding path program 34 times [2018-04-10 15:49:02,919 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:02,919 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:02,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:02,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:02,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:02,925 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:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:03,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:03,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:49:03,356 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:49:03,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:03,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:03,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:03,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-04-10 15:49:03,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 15:49:03,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 15:49:03,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:49:03,394 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-04-10 15:49:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:04,056 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-04-10 15:49:04,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 15:49:04,056 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-10 15:49:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:04,057 INFO L225 Difference]: With dead ends: 188 [2018-04-10 15:49:04,057 INFO L226 Difference]: Without dead ends: 188 [2018-04-10 15:49:04,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:49:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-10 15:49:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-04-10 15:49:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-10 15:49:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-04-10 15:49:04,058 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-04-10 15:49:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:04,059 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-04-10 15:49:04,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 15:49:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-04-10 15:49:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-10 15:49:04,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:04,059 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:04,059 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2024580873, now seen corresponding path program 35 times [2018-04-10 15:49:04,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:04,059 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:04,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:04,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:04,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:04,066 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,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:04,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:04,471 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:49:04,489 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-10 15:49:04,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:04,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:05,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:05,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 72 [2018-04-10 15:49:05,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-10 15:49:05,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-10 15:49:05,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1367, Invalid=3889, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 15:49:05,040 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 73 states. [2018-04-10 15:49:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:07,007 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-04-10 15:49:07,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 15:49:07,007 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 182 [2018-04-10 15:49:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:07,008 INFO L225 Difference]: With dead ends: 193 [2018-04-10 15:49:07,008 INFO L226 Difference]: Without dead ends: 193 [2018-04-10 15:49:07,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2203, Invalid=9353, Unknown=0, NotChecked=0, Total=11556 [2018-04-10 15:49:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-10 15:49:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-04-10 15:49:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 15:49:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-04-10 15:49:07,010 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-04-10 15:49:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:07,011 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-04-10 15:49:07,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-10 15:49:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-04-10 15:49:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-10 15:49:07,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:07,011 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:07,011 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash -407825818, now seen corresponding path program 36 times [2018-04-10 15:49:07,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:07,012 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:07,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:07,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:07,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:07,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:07,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:07,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:07,416 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:49:07,427 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-10 15:49:07,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:07,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:07,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:07,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-04-10 15:49:07,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 15:49:07,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 15:49:07,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 15:49:07,545 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 45 states. [2018-04-10 15:49:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:08,301 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-04-10 15:49:08,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 15:49:08,301 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-04-10 15:49:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:08,302 INFO L225 Difference]: With dead ends: 198 [2018-04-10 15:49:08,302 INFO L226 Difference]: Without dead ends: 198 [2018-04-10 15:49:08,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:49:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-10 15:49:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-04-10 15:49:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-10 15:49:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-04-10 15:49:08,304 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-04-10 15:49:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:08,304 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-04-10 15:49:08,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 15:49:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-04-10 15:49:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-10 15:49:08,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:08,305 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:08,305 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1486297513, now seen corresponding path program 37 times [2018-04-10 15:49:08,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:08,305 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:08,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:08,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:08,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:08,311 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,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:08,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:08,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:08,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:08,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:08,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:08,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-04-10 15:49:08,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:49:08,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:49:08,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:49:08,782 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-04-10 15:49:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:09,381 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-04-10 15:49:09,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 15:49:09,381 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-10 15:49:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:09,382 INFO L225 Difference]: With dead ends: 203 [2018-04-10 15:49:09,382 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 15:49:09,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 15:49:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 15:49:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-04-10 15:49:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-10 15:49:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-04-10 15:49:09,384 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-04-10 15:49:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:09,384 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-04-10 15:49:09,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:49:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-04-10 15:49:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-10 15:49:09,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:09,385 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:09,385 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:09,385 INFO L82 PathProgramCache]: Analyzing trace with hash -874716922, now seen corresponding path program 38 times [2018-04-10 15:49:09,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:09,385 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:09,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:09,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:09,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:09,391 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,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:09,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:09,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:09,884 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:09,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:09,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:09,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:09,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-04-10 15:49:09,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 15:49:09,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 15:49:09,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:49:09,911 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-04-10 15:49:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:10,558 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-04-10 15:49:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 15:49:10,558 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-10 15:49:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:10,559 INFO L225 Difference]: With dead ends: 208 [2018-04-10 15:49:10,559 INFO L226 Difference]: Without dead ends: 208 [2018-04-10 15:49:10,559 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 15:49:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-10 15:49:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-04-10 15:49:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-10 15:49:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-04-10 15:49:10,561 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-04-10 15:49:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:10,562 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-04-10 15:49:10,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 15:49:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-04-10 15:49:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-10 15:49:10,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:10,562 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:10,562 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093175, now seen corresponding path program 39 times [2018-04-10 15:49:10,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:10,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:10,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:10,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:10,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:10,569 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:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:11,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:11,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:11,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:49:11,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-10 15:49:11,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:11,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:11,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:11,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-04-10 15:49:11,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 15:49:11,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 15:49:11,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:49:11,175 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-04-10 15:49:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:11,821 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-04-10 15:49:11,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 15:49:11,821 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-10 15:49:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:11,821 INFO L225 Difference]: With dead ends: 213 [2018-04-10 15:49:11,822 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 15:49:11,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 15:49:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 15:49:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-04-10 15:49:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 15:49:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-04-10 15:49:11,823 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-04-10 15:49:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:11,824 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-04-10 15:49:11,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 15:49:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-04-10 15:49:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-10 15:49:11,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:11,824 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:11,824 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash -854661210, now seen corresponding path program 40 times [2018-04-10 15:49:11,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:11,825 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:11,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:11,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:11,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:11,832 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:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:12,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:12,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:12,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:49:12,303 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:49:12,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:12,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:12,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:12,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-04-10 15:49:12,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 15:49:12,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 15:49:12,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:49:12,333 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-04-10 15:49:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:13,475 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-04-10 15:49:13,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 15:49:13,475 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-10 15:49:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:13,476 INFO L225 Difference]: With dead ends: 218 [2018-04-10 15:49:13,476 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 15:49:13,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-04-10 15:49:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 15:49:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-04-10 15:49:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-10 15:49:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-04-10 15:49:13,478 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-04-10 15:49:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:13,478 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-04-10 15:49:13,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 15:49:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-04-10 15:49:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-10 15:49:13,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:13,478 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:13,479 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:13,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2040420631, now seen corresponding path program 41 times [2018-04-10 15:49:13,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:13,479 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:13,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:13,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:13,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:13,485 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:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:13,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:13,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:49:13,986 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-10 15:49:13,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:13,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:14,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:14,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-04-10 15:49:14,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-10 15:49:14,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-10 15:49:14,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1847, Invalid=5293, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 15:49:14,558 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 85 states. [2018-04-10 15:49:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:17,327 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-04-10 15:49:17,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 15:49:17,327 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 212 [2018-04-10 15:49:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:17,328 INFO L225 Difference]: With dead ends: 223 [2018-04-10 15:49:17,328 INFO L226 Difference]: Without dead ends: 223 [2018-04-10 15:49:17,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5507 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2950, Invalid=12800, Unknown=0, NotChecked=0, Total=15750 [2018-04-10 15:49:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-10 15:49:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-04-10 15:49:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-10 15:49:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-04-10 15:49:17,331 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-04-10 15:49:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:17,331 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-04-10 15:49:17,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-10 15:49:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-04-10 15:49:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-10 15:49:17,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:17,332 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:17,332 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash -488561082, now seen corresponding path program 42 times [2018-04-10 15:49:17,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:17,333 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:17,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:17,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:17,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:17,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:49:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:17,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:17,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:17,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:49:17,868 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-10 15:49:17,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:17,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:17,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:17,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-04-10 15:49:17,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:49:17,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:49:17,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:49:17,961 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 49 states. [2018-04-10 15:49:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:18,698 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-04-10 15:49:18,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 15:49:18,698 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-04-10 15:49:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:18,699 INFO L225 Difference]: With dead ends: 228 [2018-04-10 15:49:18,699 INFO L226 Difference]: Without dead ends: 228 [2018-04-10 15:49:18,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-04-10 15:49:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-10 15:49:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-04-10 15:49:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-10 15:49:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-04-10 15:49:18,702 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-04-10 15:49:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:18,702 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-04-10 15:49:18,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:49:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-04-10 15:49:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-10 15:49:18,702 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:18,702 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:18,702 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 344604279, now seen corresponding path program 43 times [2018-04-10 15:49:18,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:18,703 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:18,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:18,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:18,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:18,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:19,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:19,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:19,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:19,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:19,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-04-10 15:49:19,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 15:49:19,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 15:49:19,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:49:19,322 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-04-10 15:49:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:20,045 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-04-10 15:49:20,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 15:49:20,046 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-10 15:49:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:20,046 INFO L225 Difference]: With dead ends: 233 [2018-04-10 15:49:20,047 INFO L226 Difference]: Without dead ends: 233 [2018-04-10 15:49:20,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 15:49:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-10 15:49:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-04-10 15:49:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-10 15:49:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-04-10 15:49:20,049 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-04-10 15:49:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:20,049 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-04-10 15:49:20,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 15:49:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-04-10 15:49:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-10 15:49:20,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:20,050 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:20,050 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -865231642, now seen corresponding path program 44 times [2018-04-10 15:49:20,050 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:20,050 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:20,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:20,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:20,057 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:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:20,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:20,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:20,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:20,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:20,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:20,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:20,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:20,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-04-10 15:49:20,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 15:49:20,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 15:49:20,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:49:20,752 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 55 states. [2018-04-10 15:49:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:21,829 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-04-10 15:49:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 15:49:21,829 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-04-10 15:49:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:21,830 INFO L225 Difference]: With dead ends: 238 [2018-04-10 15:49:21,830 INFO L226 Difference]: Without dead ends: 238 [2018-04-10 15:49:21,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:49:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-10 15:49:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-04-10 15:49:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-10 15:49:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-04-10 15:49:21,832 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-04-10 15:49:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:21,833 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-04-10 15:49:21,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 15:49:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-04-10 15:49:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 15:49:21,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:21,834 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:21,834 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1352733737, now seen corresponding path program 45 times [2018-04-10 15:49:21,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:21,835 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:21,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:21,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:21,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:21,846 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,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:22,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:22,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:22,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:49:22,455 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-10 15:49:22,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:22,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:22,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:22,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-04-10 15:49:22,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:49:22,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:49:22,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:49:22,491 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-04-10 15:49:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:23,265 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-04-10 15:49:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 15:49:23,265 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-10 15:49:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:23,266 INFO L225 Difference]: With dead ends: 243 [2018-04-10 15:49:23,266 INFO L226 Difference]: Without dead ends: 243 [2018-04-10 15:49:23,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-10 15:49:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-10 15:49:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-04-10 15:49:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 15:49:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-04-10 15:49:23,268 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-04-10 15:49:23,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:23,268 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-04-10 15:49:23,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:49:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-04-10 15:49:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-10 15:49:23,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:23,269 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:23,269 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1337046138, now seen corresponding path program 46 times [2018-04-10 15:49:23,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:23,270 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:23,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:23,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:23,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:23,276 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:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:23,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:23,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:49:23,886 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:49:23,887 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:23,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:23,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:23,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-04-10 15:49:23,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 15:49:23,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 15:49:23,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:49:23,942 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-04-10 15:49:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:24,897 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-04-10 15:49:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 15:49:24,897 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-10 15:49:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:24,898 INFO L225 Difference]: With dead ends: 248 [2018-04-10 15:49:24,898 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 15:49:24,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-04-10 15:49:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 15:49:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-04-10 15:49:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 15:49:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-04-10 15:49:24,900 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-04-10 15:49:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:24,901 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-04-10 15:49:24,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 15:49:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-04-10 15:49:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-10 15:49:24,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:24,902 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:24,902 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash 868376887, now seen corresponding path program 47 times [2018-04-10 15:49:24,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:24,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:24,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:24,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:24,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:24,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:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:25,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:25,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:49:25,547 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-10 15:49:25,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:25,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:26,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:26,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 96 [2018-04-10 15:49:26,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-10 15:49:26,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-10 15:49:26,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2399, Invalid=6913, Unknown=0, NotChecked=0, Total=9312 [2018-04-10 15:49:26,292 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 97 states. [2018-04-10 15:49:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:29,841 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-04-10 15:49:29,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 15:49:29,841 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 242 [2018-04-10 15:49:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:29,842 INFO L225 Difference]: With dead ends: 253 [2018-04-10 15:49:29,842 INFO L226 Difference]: Without dead ends: 253 [2018-04-10 15:49:29,843 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7298 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3805, Invalid=16787, Unknown=0, NotChecked=0, Total=20592 [2018-04-10 15:49:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-10 15:49:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-04-10 15:49:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-10 15:49:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-04-10 15:49:29,846 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-04-10 15:49:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:29,846 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-04-10 15:49:29,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-10 15:49:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-04-10 15:49:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-10 15:49:29,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:29,847 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:29,847 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1130548698, now seen corresponding path program 48 times [2018-04-10 15:49:29,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:29,848 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:29,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:29,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:29,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:29,860 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:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:30,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:30,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:30,474 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:49:30,489 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-10 15:49:30,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:30,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:30,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:30,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-04-10 15:49:30,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 15:49:30,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 15:49:30,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 15:49:30,924 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 69 states. [2018-04-10 15:49:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:32,881 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-04-10 15:49:32,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 15:49:32,881 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-04-10 15:49:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:32,882 INFO L225 Difference]: With dead ends: 258 [2018-04-10 15:49:32,882 INFO L226 Difference]: Without dead ends: 258 [2018-04-10 15:49:32,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-04-10 15:49:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-10 15:49:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-04-10 15:49:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-10 15:49:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-04-10 15:49:32,884 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-04-10 15:49:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:32,884 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-04-10 15:49:32,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 15:49:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-04-10 15:49:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-10 15:49:32,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:32,885 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:32,885 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash 869965463, now seen corresponding path program 49 times [2018-04-10 15:49:32,886 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:32,886 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:32,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:32,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:32,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:32,893 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:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:33,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:33,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:33,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:33,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:33,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:33,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-04-10 15:49:33,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:49:33,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:49:33,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:49:33,625 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-04-10 15:49:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:34,518 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-04-10 15:49:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 15:49:34,518 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-10 15:49:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:34,519 INFO L225 Difference]: With dead ends: 263 [2018-04-10 15:49:34,519 INFO L226 Difference]: Without dead ends: 263 [2018-04-10 15:49:34,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-04-10 15:49:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-10 15:49:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-10 15:49:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 15:49:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-04-10 15:49:34,521 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-04-10 15:49:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:34,521 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-04-10 15:49:34,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:49:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-04-10 15:49:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-10 15:49:34,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:34,523 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:34,523 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -957067066, now seen corresponding path program 50 times [2018-04-10 15:49:34,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:34,523 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:34,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:34,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:34,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:34,536 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:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:35,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:35,291 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:35,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:35,300 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:35,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:35,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:35,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:35,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-04-10 15:49:35,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 15:49:35,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 15:49:35,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:49:35,421 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 58 states. [2018-04-10 15:49:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:36,475 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-04-10 15:49:36,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 15:49:36,475 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-04-10 15:49:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:36,475 INFO L225 Difference]: With dead ends: 268 [2018-04-10 15:49:36,475 INFO L226 Difference]: Without dead ends: 268 [2018-04-10 15:49:36,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-04-10 15:49:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-10 15:49:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-10 15:49:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-10 15:49:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-04-10 15:49:36,477 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-04-10 15:49:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:36,478 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-04-10 15:49:36,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 15:49:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-04-10 15:49:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-10 15:49:36,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:36,478 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:36,479 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1246602231, now seen corresponding path program 51 times [2018-04-10 15:49:36,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:36,479 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:36,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:36,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:36,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:36,486 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,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:37,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:37,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:37,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:49:37,255 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-10 15:49:37,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:37,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:37,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:37,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-04-10 15:49:37,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 15:49:37,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 15:49:37,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:49:37,295 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-04-10 15:49:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:38,348 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-04-10 15:49:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 15:49:38,348 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-10 15:49:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:38,349 INFO L225 Difference]: With dead ends: 273 [2018-04-10 15:49:38,349 INFO L226 Difference]: Without dead ends: 273 [2018-04-10 15:49:38,349 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-10 15:49:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-10 15:49:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-04-10 15:49:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-10 15:49:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-04-10 15:49:38,351 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-04-10 15:49:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:38,352 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-04-10 15:49:38,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 15:49:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-04-10 15:49:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-10 15:49:38,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:38,353 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:38,353 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -328358042, now seen corresponding path program 52 times [2018-04-10 15:49:38,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:38,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:38,353 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:38,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:38,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:38,361 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,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:39,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:39,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:39,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:49:39,146 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:49:39,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:39,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:39,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:39,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-04-10 15:49:39,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-10 15:49:39,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-10 15:49:39,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-10 15:49:39,980 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 109 states. [2018-04-10 15:49:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:42,869 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-04-10 15:49:42,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 15:49:42,870 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-04-10 15:49:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:42,870 INFO L225 Difference]: With dead ends: 278 [2018-04-10 15:49:42,870 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 15:49:42,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-10 15:49:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 15:49:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-04-10 15:49:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-10 15:49:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-04-10 15:49:42,873 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-04-10 15:49:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:42,873 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-04-10 15:49:42,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-10 15:49:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-04-10 15:49:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-10 15:49:42,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:42,874 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:42,874 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2051109207, now seen corresponding path program 53 times [2018-04-10 15:49:42,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:42,875 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:42,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:42,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:42,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:42,887 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:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:43,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:43,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:49:43,703 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-10 15:49:43,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:43,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:44,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:44,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-04-10 15:49:44,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-10 15:49:44,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-10 15:49:44,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3023, Invalid=8749, Unknown=0, NotChecked=0, Total=11772 [2018-04-10 15:49:44,618 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 109 states. [2018-04-10 15:49:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:48,445 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-04-10 15:49:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 15:49:48,445 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 272 [2018-04-10 15:49:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:48,446 INFO L225 Difference]: With dead ends: 283 [2018-04-10 15:49:48,446 INFO L226 Difference]: Without dead ends: 283 [2018-04-10 15:49:48,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9341 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4768, Invalid=21314, Unknown=0, NotChecked=0, Total=26082 [2018-04-10 15:49:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-10 15:49:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-04-10 15:49:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-10 15:49:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-04-10 15:49:48,449 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-04-10 15:49:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:48,449 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-04-10 15:49:48,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-10 15:49:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-04-10 15:49:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-10 15:49:48,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:48,450 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:48,450 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash 832779782, now seen corresponding path program 54 times [2018-04-10 15:49:48,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:48,450 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:48,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:48,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:48,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:48,458 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:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:49,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:49,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:49,297 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:49:49,321 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-10 15:49:49,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:49,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:49,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:49,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-04-10 15:49:49,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 15:49:49,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 15:49:49,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:49:49,442 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 61 states. [2018-04-10 15:49:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:50,579 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-04-10 15:49:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 15:49:50,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-04-10 15:49:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:50,580 INFO L225 Difference]: With dead ends: 288 [2018-04-10 15:49:50,580 INFO L226 Difference]: Without dead ends: 288 [2018-04-10 15:49:50,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-04-10 15:49:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-10 15:49:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-04-10 15:49:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-10 15:49:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-04-10 15:49:50,583 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-04-10 15:49:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:50,583 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-04-10 15:49:50,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 15:49:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-04-10 15:49:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-10 15:49:50,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:50,584 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:50,584 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1889794377, now seen corresponding path program 55 times [2018-04-10 15:49:50,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:50,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:50,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:50,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:50,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:50,592 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:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:51,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:51,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:51,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:51,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:51,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-04-10 15:49:51,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 15:49:51,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 15:49:51,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:49:51,501 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-04-10 15:49:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:52,562 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-04-10 15:49:52,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 15:49:52,562 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-10 15:49:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:52,563 INFO L225 Difference]: With dead ends: 293 [2018-04-10 15:49:52,563 INFO L226 Difference]: Without dead ends: 293 [2018-04-10 15:49:52,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-10 15:49:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-10 15:49:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-04-10 15:49:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-10 15:49:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-04-10 15:49:52,567 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-04-10 15:49:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:52,567 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-04-10 15:49:52,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 15:49:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-04-10 15:49:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-10 15:49:52,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:52,568 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:52,569 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash 581893286, now seen corresponding path program 56 times [2018-04-10 15:49:52,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:52,569 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:52,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:52,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:49:52,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:52,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:53,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:53,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:53,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:49:53,476 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:49:53,476 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:53,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:53,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:53,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-04-10 15:49:53,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 15:49:53,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 15:49:53,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 15:49:53,525 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-04-10 15:49:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:49:55,273 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-04-10 15:49:55,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 15:49:55,273 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-10 15:49:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:49:55,274 INFO L225 Difference]: With dead ends: 298 [2018-04-10 15:49:55,274 INFO L226 Difference]: Without dead ends: 298 [2018-04-10 15:49:55,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-10 15:49:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-10 15:49:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-04-10 15:49:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-10 15:49:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-04-10 15:49:55,277 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-04-10 15:49:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:49:55,277 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-04-10 15:49:55,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 15:49:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-04-10 15:49:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-10 15:49:55,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:49:55,278 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-10 15:49:55,278 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:49:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2109957143, now seen corresponding path program 57 times [2018-04-10 15:49:55,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:49:55,278 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:49:55,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:55,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:49:55,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:49:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:49:55,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:49:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:56,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:49:56,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:49:56,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:49:56,214 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-10 15:49:56,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:49:56,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:49:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:49:57,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:49:57,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-04-10 15:49:57,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-10 15:49:57,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-10 15:49:57,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-04-10 15:49:57,080 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 119 states. [2018-04-10 15:50:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:00,163 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-04-10 15:50:00,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 15:50:00,164 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-04-10 15:50:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:00,164 INFO L225 Difference]: With dead ends: 303 [2018-04-10 15:50:00,164 INFO L226 Difference]: Without dead ends: 303 [2018-04-10 15:50:00,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-04-10 15:50:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-10 15:50:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-04-10 15:50:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-10 15:50:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-04-10 15:50:00,167 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-04-10 15:50:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:00,167 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-04-10 15:50:00,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-10 15:50:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-04-10 15:50:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-10 15:50:00,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:00,168 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:00,168 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1932196678, now seen corresponding path program 58 times [2018-04-10 15:50:00,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:00,168 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:00,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:00,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:00,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:00,176 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:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:01,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:01,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:01,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:50:01,124 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:50:01,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:01,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:01,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:01,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-04-10 15:50:01,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 15:50:01,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 15:50:01,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:50:01,278 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 67 states. [2018-04-10 15:50:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:03,044 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-04-10 15:50:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 15:50:03,044 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-04-10 15:50:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:03,045 INFO L225 Difference]: With dead ends: 308 [2018-04-10 15:50:03,045 INFO L226 Difference]: Without dead ends: 308 [2018-04-10 15:50:03,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5387, Invalid=10113, Unknown=0, NotChecked=0, Total=15500 [2018-04-10 15:50:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-10 15:50:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-04-10 15:50:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-04-10 15:50:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-04-10 15:50:03,047 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 297 [2018-04-10 15:50:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:03,048 INFO L459 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-04-10 15:50:03,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 15:50:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-04-10 15:50:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-10 15:50:03,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:03,049 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:03,049 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1038251657, now seen corresponding path program 59 times [2018-04-10 15:50:03,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:03,050 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:03,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:03,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:03,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:03,058 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:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:04,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:04,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:04,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:50:04,074 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-10 15:50:04,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:04,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:05,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:05,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 120 [2018-04-10 15:50:05,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-10 15:50:05,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-10 15:50:05,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3719, Invalid=10801, Unknown=0, NotChecked=0, Total=14520 [2018-04-10 15:50:05,182 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 121 states. [2018-04-10 15:50:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:09,825 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-04-10 15:50:09,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 15:50:09,825 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 302 [2018-04-10 15:50:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:09,826 INFO L225 Difference]: With dead ends: 313 [2018-04-10 15:50:09,826 INFO L226 Difference]: Without dead ends: 313 [2018-04-10 15:50:09,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11636 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5839, Invalid=26381, Unknown=0, NotChecked=0, Total=32220 [2018-04-10 15:50:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-10 15:50:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-04-10 15:50:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-10 15:50:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-04-10 15:50:09,829 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-04-10 15:50:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:09,829 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-04-10 15:50:09,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-10 15:50:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-04-10 15:50:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-10 15:50:09,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:09,830 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:09,830 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:09,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1640943130, now seen corresponding path program 60 times [2018-04-10 15:50:09,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:09,830 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:09,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:09,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:09,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:09,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:50:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:10,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:10,890 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:50:10,914 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-10 15:50:10,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:10,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:11,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:11,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 117 [2018-04-10 15:50:11,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-10 15:50:11,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-10 15:50:11,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3359, Invalid=10447, Unknown=0, NotChecked=0, Total=13806 [2018-04-10 15:50:11,982 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 118 states. [2018-04-10 15:50:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:15,832 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-04-10 15:50:15,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 15:50:15,832 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 307 [2018-04-10 15:50:15,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:15,833 INFO L225 Difference]: With dead ends: 318 [2018-04-10 15:50:15,833 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 15:50:15,834 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10275 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5808, Invalid=25698, Unknown=0, NotChecked=0, Total=31506 [2018-04-10 15:50:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 15:50:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-04-10 15:50:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-10 15:50:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-04-10 15:50:15,836 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 307 [2018-04-10 15:50:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:15,836 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-04-10 15:50:15,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-10 15:50:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-04-10 15:50:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-10 15:50:15,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:15,837 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:15,837 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:15,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1047497001, now seen corresponding path program 61 times [2018-04-10 15:50:15,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:15,837 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:15,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:15,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:15,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:15,845 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:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:16,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:16,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:16,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:50:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:16,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:16,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:16,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-04-10 15:50:16,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 15:50:16,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 15:50:16,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:50:16,964 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 65 states. [2018-04-10 15:50:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:18,212 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-04-10 15:50:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 15:50:18,212 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-10 15:50:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:18,213 INFO L225 Difference]: With dead ends: 323 [2018-04-10 15:50:18,213 INFO L226 Difference]: Without dead ends: 323 [2018-04-10 15:50:18,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-10 15:50:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-10 15:50:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-04-10 15:50:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-10 15:50:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-04-10 15:50:18,215 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-04-10 15:50:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:18,216 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-04-10 15:50:18,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 15:50:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-04-10 15:50:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-10 15:50:18,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:18,217 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:18,217 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2040815482, now seen corresponding path program 62 times [2018-04-10 15:50:18,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:18,217 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:18,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:18,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:50:18,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:18,231 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:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:19,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:19,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:19,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:50:19,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:50:19,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:19,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:19,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:19,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-10 15:50:19,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 15:50:19,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 15:50:19,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:50:19,443 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 66 states. [2018-04-10 15:50:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:20,872 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-04-10 15:50:20,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 15:50:20,873 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-10 15:50:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:20,873 INFO L225 Difference]: With dead ends: 328 [2018-04-10 15:50:20,873 INFO L226 Difference]: Without dead ends: 328 [2018-04-10 15:50:20,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-10 15:50:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-04-10 15:50:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-04-10 15:50:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-10 15:50:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-04-10 15:50:20,876 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 317 [2018-04-10 15:50:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:20,876 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-04-10 15:50:20,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 15:50:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-04-10 15:50:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-10 15:50:20,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:20,877 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:20,877 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 700591159, now seen corresponding path program 63 times [2018-04-10 15:50:20,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:20,877 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:20,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:20,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:20,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:20,887 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:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:22,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:22,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:22,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:50:22,033 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-10 15:50:22,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:22,038 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:23,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:23,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-04-10 15:50:23,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-10 15:50:23,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-10 15:50:23,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 15:50:23,067 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 131 states. [2018-04-10 15:50:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:26,260 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-04-10 15:50:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 15:50:26,261 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-04-10 15:50:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:26,261 INFO L225 Difference]: With dead ends: 333 [2018-04-10 15:50:26,261 INFO L226 Difference]: Without dead ends: 333 [2018-04-10 15:50:26,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 15:50:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-10 15:50:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-04-10 15:50:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-10 15:50:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-04-10 15:50:26,264 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-04-10 15:50:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:26,264 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-04-10 15:50:26,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-10 15:50:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-04-10 15:50:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-10 15:50:26,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:26,265 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:26,265 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash 365184806, now seen corresponding path program 64 times [2018-04-10 15:50:26,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:26,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:26,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:26,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:26,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:26,274 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:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:27,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:27,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:27,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:50:27,783 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:50:27,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:27,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:27,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:27,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-04-10 15:50:27,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 15:50:27,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 15:50:27,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:50:27,876 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 67 states. [2018-04-10 15:50:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:31,961 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-04-10 15:50:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 15:50:31,962 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-10 15:50:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:31,962 INFO L225 Difference]: With dead ends: 338 [2018-04-10 15:50:31,962 INFO L226 Difference]: Without dead ends: 338 [2018-04-10 15:50:31,963 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:50:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-10 15:50:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-04-10 15:50:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-10 15:50:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-04-10 15:50:31,964 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 327 [2018-04-10 15:50:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:31,965 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-04-10 15:50:31,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 15:50:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-04-10 15:50:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-10 15:50:31,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:31,965 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:31,966 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1356376471, now seen corresponding path program 65 times [2018-04-10 15:50:31,966 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:31,966 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:31,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:31,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:31,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:31,974 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:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:33,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:33,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:33,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:50:33,223 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-10 15:50:33,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:33,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:34,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:34,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-04-10 15:50:34,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-04-10 15:50:34,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-04-10 15:50:34,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4487, Invalid=13069, Unknown=0, NotChecked=0, Total=17556 [2018-04-10 15:50:34,466 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 133 states. [2018-04-10 15:50:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:40,741 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-04-10 15:50:40,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 15:50:40,741 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 332 [2018-04-10 15:50:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:40,742 INFO L225 Difference]: With dead ends: 343 [2018-04-10 15:50:40,742 INFO L226 Difference]: Without dead ends: 343 [2018-04-10 15:50:40,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14183 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7018, Invalid=31988, Unknown=0, NotChecked=0, Total=39006 [2018-04-10 15:50:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-10 15:50:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-04-10 15:50:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-10 15:50:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-04-10 15:50:40,745 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-04-10 15:50:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:40,745 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-04-10 15:50:40,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-04-10 15:50:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-04-10 15:50:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-10 15:50:40,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:40,746 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:40,746 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash -570087994, now seen corresponding path program 66 times [2018-04-10 15:50:40,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:40,747 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:40,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:40,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:40,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:40,756 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:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:41,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:41,994 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:41,994 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:50:42,014 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-10 15:50:42,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:42,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:43,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:43,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68] total 136 [2018-04-10 15:50:43,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-10 15:50:43,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-10 15:50:43,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-04-10 15:50:43,176 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 137 states. [2018-04-10 15:50:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:46,909 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-04-10 15:50:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-10 15:50:46,910 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 337 [2018-04-10 15:50:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:46,910 INFO L225 Difference]: With dead ends: 348 [2018-04-10 15:50:46,910 INFO L226 Difference]: Without dead ends: 348 [2018-04-10 15:50:46,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8775 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-04-10 15:50:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-10 15:50:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-04-10 15:50:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-10 15:50:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-04-10 15:50:46,913 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 337 [2018-04-10 15:50:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:46,913 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-04-10 15:50:46,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-04-10 15:50:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-04-10 15:50:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-10 15:50:46,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:46,914 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:46,914 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1787171081, now seen corresponding path program 67 times [2018-04-10 15:50:46,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:46,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:46,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:46,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:46,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:46,923 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,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:48,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:48,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:48,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:50:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:48,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:48,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:48,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-04-10 15:50:48,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 15:50:48,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 15:50:48,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 15:50:48,289 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 71 states. [2018-04-10 15:50:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:49,822 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-04-10 15:50:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-10 15:50:49,822 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-04-10 15:50:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:49,823 INFO L225 Difference]: With dead ends: 353 [2018-04-10 15:50:49,823 INFO L226 Difference]: Without dead ends: 353 [2018-04-10 15:50:49,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-10 15:50:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-10 15:50:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-04-10 15:50:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-10 15:50:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-04-10 15:50:49,826 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-04-10 15:50:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:49,826 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-04-10 15:50:49,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 15:50:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-04-10 15:50:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-10 15:50:49,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:49,827 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:49,827 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1204274074, now seen corresponding path program 68 times [2018-04-10 15:50:49,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:49,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:49,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:49,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:50:49,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:49,837 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:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:51,158 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:51,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:51,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:50:51,168 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:50:51,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:51,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:51,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:51,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-04-10 15:50:51,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 15:50:51,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 15:50:51,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:50:51,250 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 72 states. [2018-04-10 15:50:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:53,109 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-04-10 15:50:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 15:50:53,109 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-04-10 15:50:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:53,110 INFO L225 Difference]: With dead ends: 358 [2018-04-10 15:50:53,110 INFO L226 Difference]: Without dead ends: 358 [2018-04-10 15:50:53,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-04-10 15:50:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-10 15:50:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-04-10 15:50:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-04-10 15:50:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-04-10 15:50:53,112 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 347 [2018-04-10 15:50:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:53,112 INFO L459 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-04-10 15:50:53,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 15:50:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-04-10 15:50:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-10 15:50:53,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:53,113 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:53,113 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1093927849, now seen corresponding path program 69 times [2018-04-10 15:50:53,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:53,114 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:53,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:53,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:53,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:53,125 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:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:54,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:54,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:54,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:50:54,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-10 15:50:54,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:54,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:54,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:54,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-04-10 15:50:54,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-10 15:50:54,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-10 15:50:54,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 15:50:54,594 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 73 states. [2018-04-10 15:50:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:56,171 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-04-10 15:50:56,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-10 15:50:56,171 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-04-10 15:50:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:56,172 INFO L225 Difference]: With dead ends: 363 [2018-04-10 15:50:56,172 INFO L226 Difference]: Without dead ends: 363 [2018-04-10 15:50:56,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-04-10 15:50:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-10 15:50:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-04-10 15:50:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-10 15:50:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-04-10 15:50:56,175 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-04-10 15:50:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:56,175 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-04-10 15:50:56,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-10 15:50:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-04-10 15:50:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-10 15:50:56,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:56,176 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:56,176 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1693944582, now seen corresponding path program 70 times [2018-04-10 15:50:56,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:56,176 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:56,177 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:56,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:56,177 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:56,191 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:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:57,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:50:57,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:50:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:50:57,623 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:50:57,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:50:57,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:50:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:50:57,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:50:57,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-04-10 15:50:57,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 15:50:57,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 15:50:57,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 15:50:57,707 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 74 states. [2018-04-10 15:50:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:50:59,418 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-04-10 15:50:59,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-10 15:50:59,418 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-04-10 15:50:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:50:59,419 INFO L225 Difference]: With dead ends: 368 [2018-04-10 15:50:59,419 INFO L226 Difference]: Without dead ends: 368 [2018-04-10 15:50:59,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-04-10 15:50:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-10 15:50:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-04-10 15:50:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-10 15:50:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-04-10 15:50:59,422 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 357 [2018-04-10 15:50:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:50:59,422 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-04-10 15:50:59,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 15:50:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-04-10 15:50:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-10 15:50:59,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:50:59,423 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-10 15:50:59,423 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:50:59,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1551159735, now seen corresponding path program 71 times [2018-04-10 15:50:59,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:50:59,423 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:50:59,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:59,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:50:59,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:50:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:50:59,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:00,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:00,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:00,965 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:51:00,999 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-10 15:51:00,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:01,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:02,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:02,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73] total 144 [2018-04-10 15:51:02,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-04-10 15:51:02,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-04-10 15:51:02,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5327, Invalid=15553, Unknown=0, NotChecked=0, Total=20880 [2018-04-10 15:51:02,796 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 145 states. [2018-04-10 15:51:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:08,386 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-04-10 15:51:08,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-10 15:51:08,387 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 362 [2018-04-10 15:51:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:08,388 INFO L225 Difference]: With dead ends: 373 [2018-04-10 15:51:08,388 INFO L226 Difference]: Without dead ends: 373 [2018-04-10 15:51:08,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16982 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=8305, Invalid=38135, Unknown=0, NotChecked=0, Total=46440 [2018-04-10 15:51:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-10 15:51:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-04-10 15:51:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-10 15:51:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-04-10 15:51:08,391 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-04-10 15:51:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:08,391 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-04-10 15:51:08,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-04-10 15:51:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-04-10 15:51:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-10 15:51:08,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:08,393 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:08,393 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 744296870, now seen corresponding path program 72 times [2018-04-10 15:51:08,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:08,393 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:08,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:08,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:08,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:08,402 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:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:09,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:09,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:51:09,889 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-10 15:51:09,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:09,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:10,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:10,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 84 [2018-04-10 15:51:10,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-10 15:51:10,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-10 15:51:10,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=4364, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 15:51:10,225 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 85 states. [2018-04-10 15:51:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:12,838 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-04-10 15:51:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-10 15:51:12,838 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 367 [2018-04-10 15:51:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:12,839 INFO L225 Difference]: With dead ends: 378 [2018-04-10 15:51:12,839 INFO L226 Difference]: Without dead ends: 378 [2018-04-10 15:51:12,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8291, Invalid=16201, Unknown=0, NotChecked=0, Total=24492 [2018-04-10 15:51:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-10 15:51:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-04-10 15:51:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-10 15:51:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-04-10 15:51:12,842 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 367 [2018-04-10 15:51:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:12,843 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-04-10 15:51:12,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-10 15:51:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-04-10 15:51:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-10 15:51:12,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:12,844 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:12,844 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:12,844 INFO L82 PathProgramCache]: Analyzing trace with hash 647655191, now seen corresponding path program 73 times [2018-04-10 15:51:12,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:12,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:12,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:12,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:12,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:12,854 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:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:14,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:14,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:14,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:14,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:14,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:14,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-04-10 15:51:14,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-10 15:51:14,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-10 15:51:14,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 15:51:14,431 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 77 states. [2018-04-10 15:51:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:16,121 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-04-10 15:51:16,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-10 15:51:16,122 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-04-10 15:51:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:16,123 INFO L225 Difference]: With dead ends: 383 [2018-04-10 15:51:16,123 INFO L226 Difference]: Without dead ends: 383 [2018-04-10 15:51:16,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-04-10 15:51:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-10 15:51:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-04-10 15:51:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-10 15:51:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-04-10 15:51:16,126 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-04-10 15:51:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:16,126 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-04-10 15:51:16,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-10 15:51:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-04-10 15:51:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-10 15:51:16,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:16,127 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:16,127 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2114113606, now seen corresponding path program 74 times [2018-04-10 15:51:16,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:16,127 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:16,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:16,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:16,137 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:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:17,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:17,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:17,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:51:17,721 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:51:17,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:17,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:17,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:17,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-04-10 15:51:17,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 15:51:17,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 15:51:17,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 15:51:17,792 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 78 states. [2018-04-10 15:51:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:19,752 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-04-10 15:51:19,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 15:51:19,752 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-04-10 15:51:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:19,753 INFO L225 Difference]: With dead ends: 388 [2018-04-10 15:51:19,753 INFO L226 Difference]: Without dead ends: 388 [2018-04-10 15:51:19,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-10 15:51:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-10 15:51:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-04-10 15:51:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-10 15:51:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-04-10 15:51:19,756 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 377 [2018-04-10 15:51:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:19,756 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-04-10 15:51:19,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 15:51:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-04-10 15:51:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-10 15:51:19,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:19,757 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:19,758 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1575146615, now seen corresponding path program 75 times [2018-04-10 15:51:19,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:19,758 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:19,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:19,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:19,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:19,768 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:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:21,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:21,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:21,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:51:21,454 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-04-10 15:51:21,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:21,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:21,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:21,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-04-10 15:51:21,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-10 15:51:21,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-10 15:51:21,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 15:51:21,540 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 79 states. [2018-04-10 15:51:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:23,298 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-04-10 15:51:23,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-10 15:51:23,298 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-04-10 15:51:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:23,299 INFO L225 Difference]: With dead ends: 393 [2018-04-10 15:51:23,299 INFO L226 Difference]: Without dead ends: 393 [2018-04-10 15:51:23,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-04-10 15:51:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-10 15:51:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-04-10 15:51:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-10 15:51:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-04-10 15:51:23,302 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-04-10 15:51:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:23,302 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-04-10 15:51:23,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-10 15:51:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-04-10 15:51:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-10 15:51:23,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:23,304 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:23,304 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1862088986, now seen corresponding path program 76 times [2018-04-10 15:51:23,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:23,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:23,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:23,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:23,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:23,314 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:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:24,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:24,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:24,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:51:25,008 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:51:25,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:25,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:25,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:25,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-04-10 15:51:25,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-10 15:51:25,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-10 15:51:25,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 15:51:25,105 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 80 states. [2018-04-10 15:51:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:27,373 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-04-10 15:51:27,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-10 15:51:27,373 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-04-10 15:51:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:27,374 INFO L225 Difference]: With dead ends: 398 [2018-04-10 15:51:27,374 INFO L226 Difference]: Without dead ends: 398 [2018-04-10 15:51:27,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-10 15:51:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-04-10 15:51:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-04-10 15:51:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-10 15:51:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-04-10 15:51:27,376 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 387 [2018-04-10 15:51:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:27,376 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-04-10 15:51:27,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-10 15:51:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-04-10 15:51:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-10 15:51:27,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:27,378 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:27,378 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash 729022935, now seen corresponding path program 77 times [2018-04-10 15:51:27,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:27,378 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:27,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:27,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:27,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:27,388 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:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:29,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:29,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:29,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:51:29,125 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-04-10 15:51:29,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:29,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:31,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:31,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 156 [2018-04-10 15:51:31,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-04-10 15:51:31,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-04-10 15:51:31,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6239, Invalid=18253, Unknown=0, NotChecked=0, Total=24492 [2018-04-10 15:51:31,016 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 157 states. [2018-04-10 15:51:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:37,484 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-04-10 15:51:37,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-10 15:51:37,484 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 392 [2018-04-10 15:51:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:37,485 INFO L225 Difference]: With dead ends: 403 [2018-04-10 15:51:37,485 INFO L226 Difference]: Without dead ends: 403 [2018-04-10 15:51:37,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20033 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=9700, Invalid=44822, Unknown=0, NotChecked=0, Total=54522 [2018-04-10 15:51:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-10 15:51:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-04-10 15:51:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-10 15:51:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-04-10 15:51:37,489 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-04-10 15:51:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:37,489 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-04-10 15:51:37,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-04-10 15:51:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-04-10 15:51:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-10 15:51:37,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:37,490 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:37,490 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash 66516358, now seen corresponding path program 78 times [2018-04-10 15:51:37,490 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:37,490 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:37,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:37,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:37,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:37,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-10 15:51:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:39,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:39,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:39,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:51:39,299 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-04-10 15:51:39,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-10 15:51:39,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:51:39,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-10 15:51:39,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-10 15:51:39,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-10 15:51:39,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3088, Invalid=3554, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 15:51:39,303 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 82 states. [2018-04-10 15:51:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 15:51:39,303 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 15:51:39,308 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 15:51:39,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:51:39 BoogieIcfgContainer [2018-04-10 15:51:39,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 15:51:39,309 INFO L168 Benchmark]: Toolchain (without parser) took 179424.69 ms. Allocated memory was 394.8 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 335.1 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 401.6 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:39,310 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 394.8 MB. Free memory is still 355.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:51:39,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.34 ms. Allocated memory is still 394.8 MB. Free memory was 335.1 MB in the beginning and 325.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:39,310 INFO L168 Benchmark]: Boogie Preprocessor took 20.57 ms. Allocated memory is still 394.8 MB. Free memory was 325.7 MB in the beginning and 324.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:39,310 INFO L168 Benchmark]: RCFGBuilder took 216.40 ms. Allocated memory was 394.8 MB in the beginning and 594.0 MB in the end (delta: 199.2 MB). Free memory was 324.3 MB in the beginning and 560.1 MB in the end (delta: -235.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:39,311 INFO L168 Benchmark]: TraceAbstraction took 179034.33 ms. Allocated memory was 594.0 MB in the beginning and 1.9 GB in the end (delta: 1.3 GB). Free memory was 560.1 MB in the beginning and 1.4 GB in the end (delta: -881.7 MB). Peak memory consumption was 427.4 MB. Max. memory is 5.3 GB. [2018-04-10 15:51:39,312 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 394.8 MB. Free memory is still 355.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.34 ms. Allocated memory is still 394.8 MB. Free memory was 335.1 MB in the beginning and 325.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.57 ms. Allocated memory is still 394.8 MB. Free memory was 325.7 MB in the beginning and 324.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 216.40 ms. Allocated memory was 394.8 MB in the beginning and 594.0 MB in the end (delta: 199.2 MB). Free memory was 324.3 MB in the beginning and 560.1 MB in the end (delta: -235.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 179034.33 ms. Allocated memory was 594.0 MB in the beginning and 1.9 GB in the end (delta: 1.3 GB). Free memory was 560.1 MB in the beginning and 1.4 GB in the end (delta: -881.7 MB). Peak memory consumption was 427.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 2 states, 82 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 2 states, 82 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 2 states, 82 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 2 states, 82 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 2 states, 82 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 178.9s OverallTime, 83 OverallIterations, 79 TraceHistogramMax, 107.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2029 SDtfs, 20572 SDslu, 66499 SDs, 0 SdLazy, 240506 SolverSat, 3293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21433 GetRequests, 14652 SyntacticMatches, 9 SemanticMatches, 6772 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195219 ImplicationChecksByTransitivity, 99.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=82, 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.1s AutomataMinimizationTime, 82 MinimizatonAttempts, 139 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 66.9s InterpolantComputationTime, 32073 NumberOfCodeBlocks, 32073 NumberOfCodeBlocksAsserted, 1777 NumberOfCheckSat, 31513 ConstructedInterpolants, 0 QuantifiedInterpolants, 30008661 SizeOfPredicates, 3 NumberOfNonLiveVariables, 34255 ConjunctsInSsa, 4371 ConjunctsInUnsatCore, 163 InterpolantComputations, 3 PerfectInterpolantSequences, 33/787989 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-51-39-317.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_15-51-39-317.csv Completed graceful shutdown